WVU SEM = B.TECH END SEMESTER 2 ‘Course Code: TTITNS, | Course Tittes Data Warehouse anal Data Mini MUNATION, NOV-DEE2022 ae . Time: 3 Hows: Sh Max. Marks: 40 oh vatlon (ICany), may be suitably assumed & mentioned in a. * s+ Attempt all the five questions, Missing data! infor | Not [the answer. Questions Marks} CO QL [Attempt any fo parts of the following: 1g Pats warhousing is the only viable means W terolve the information crisis and to provide} 2. 5 - f, 4 7 trategis information, List four masons to support this assertion, and explain them, ot What iss Data Warchouse? Highlight and discuss the Tour key chamclerstis oF w Date a | co Warehouse. te = the major building Blocks Component of a Data Warchouse with w wellbcled 4 cot Ee ‘ Q = any DWo parts of the following: 22 Fisbortely discuss the concepts of the following schemas In Data Washoe modellin 3 | oO ‘aking suitable examples with well-abeled diagram for each one): @ — Stowlake schema. @ Galaxy schema ' @+2) ppose thar & dara warehouse for Gross sales Consists of the Tour dimensions: date, spectator] —g cos Pocation and movie, and the two measures, count and charge, where charge is the fare that tor pays whea watching a movie on a given date. Spectators may be students, adults o: ery iors, with each category/status having its own chairge tate. i @ = Drewa star schema diagram for the data warehouse, () Starting with the base cuboid [date, spectator, location, movie), what specifi OLAP operations should be performed in order to list the total charge paid b student spectators at PVR_Vegas in the year 2021? ‘uppose 8 company would like to design & data warehouse to facilitate the analysis oF mo icles in an online analytical processing manner, The-company registers huge amounts tuto movement data in the format of (Auto_ID, location, specd, time). Each Auto, 1D represent vehicle essociated with information, such as vehicle. category, driver_category, ec. ane each) (2 +2) location may be associated with a street in a city. Assure that u street map is available for the} ity. o ; ; @ Design such a data warchouse to facilitate effective online anatytial processing i multidimensional space, Gi) The movement data may contain noise, Disenss how you would develop « method} to automatically discover data records that were likely erroneously registered in th * data repository. 4 cos CANAAADA DOM hhh dh LMMAB[as Prenton no poet lin jouse usage. Inform motivation behind 0) ween these tree fain G[pes oF dala wi [ivhat are the differences between these 1 apes oF daa co4! | Pere ce! mc i 3b fo the multidimensional data model (taking. suitable example with diagram). (Rollup (i) Drilldown Gi) Slice for (is) Dice for 4 | cos ays 2”) | Jo fovea Tniroduotion to NoSQU databases. {Pi ans ae pplcahies oF CoueRDD and co3" Q4 [Attempt any two parts of the followin fongoDB, [Explain how dacision tree mduetion algorithm works. Elucidate the concept of its key factors/ [Entropy and Information Gain. How are they used to build decision trees? 4 | cos 4b @) Explain Classification and Prediction in Data Mining, . {8) Differentiate between eager learners and lazy learners. Give examples for both of them. 4 co2, +2) | C%* der the following dataset for a classification task. Using Nearest Neighbor (KNN} 4e rons bean with Euclidean Distance as the distance metric, predict the class label Fruit.Taste fot sample Strawberry with k=1, 3 and 5. Write down your calculations clearly. [ Fruit ‘Sweetness ‘Sourness Fruit Taste Sour ‘Sour Sour ‘Sweet Sweet ‘Sweet = Grapefruit Orange Cherry [- Banana [Grapes [Strawberry vafoofo}on}usl ss) | walt}! alo} ca] | Q5 [attempt any two parts ofthe following Sa What is Cluster Analysis? Describe the different types Of Clustering methodsitechniques with] amples. 5b | or the following transactional dataset, find the frequent itemsets and generate strony ssociation rules using Apriort algorithm. Consider the thresholds as min. support = 40% and] in. confidence = 70%. Calculate the confidence of cach rule and identify all the strong| tsociation rules, | TD Items bought I (Bread, Butter, Milicy 2 (Bread, Buttery [ 3 {Beer, Cookies, Diapers) | 4 ~ (Milk, Diapers, Bread, Butier) 3 (Beer, Diapers} ‘onstruction of FP-tree for the transac 4 | cos nal dataset given above in (b) part of Question 5. a FP-wree is better than Apriori Algorithm? Using FP-Growth algorithm, demonstrateTotal no. of Pages: o5-———— Course Code- Course Title- ‘al no. of P; ‘ages: OF etait LE Rett. FIFTH SEMESTER B. TECH (ITATNS) END-SEMESTER ITITC141N ITC 14 Theory of Computation Time- 3 Hours Note: ~ Attempt all que assumed & mentioned i in the answer. EXAMINATION, November-December-2022 Max. Marks- 50 stions, Missing data/ information (if any), maybe suitably No. Question : __| Attempt any two parts of the following : ol | Design finite automata for the language 5 | CO2} ——— L={@)'1) | >=1, j>=1). | 1b | Minimize the following DFA. 3 [cor | \ Bad x 4 Ie [Design a moore machine which counts the occurrence of[ 5 | CO2) substring aab in the input string. 2. | Attempt any two parts of the following: 2a_| Discuss the Chomsky Hierarchy of Languages by taking suitable |" 5 | CO3 example for each classification. 2b | What is pumping lemma? Show that L= {a"[/n>=1} isnot] 5 | COS regular. e | Construct a regular grammar which can generate the set of all| 5 | CO4 strings starting with a letter (A to Z) followed by a string of letters or digits (0 to 9). 3. | Attempt any two parts of the following: 3a | Write CFG which generates strings having equal number of a's [S| COS and b’s. Construct the parse tree for the generated grammer. 3b | A context-free grammar G has the following productions: 3 | CO3S080] ISI[A ay A 2B3 B- 2B3|3 Covert it to corresponding Chomsky normal form. 3c | Convert following grammer into GNF: 5 | cor S— XA|BB B+b/SB Xb, Aa ee 4._| Attempt any two parts of the following: | qa Deas ee accept the language of nested ee 5) Cor) parentheses where number of opening parenthesis and closing arenthesis is greater than zero. 4b For the PDA, w design the corresponding CFG G : 5) C05) M = ({qo, a1}s {01}, {Zo, K}, 8, qo, Zo, @) with the transition function defined as follows: a. 8(qo.1, Zo) |-( do.KK Zo) b. 5 (qo,0, K) --C a1, K) ©. 8 (qo, A, Zo) |--C go, A) d. 6 (qi, 0, K) (a1, A) . 5 (qo, |, K) |--( qo, KK) f. 8 (qi, 0, ZO) |--( go, ZO) s 4c | Convert the grammer into PDA : 5 | Cod S—aSa | bSb | 5__| Attempt any two parts of the following: 5a | What is Turing Machine? Explain the differences between| 5 | CO4 Turing machine and Linear bound Automata with examples. 5b | Design Turing Machine for L = {a" 6" "| n>=1 }. C02 | Se | Explain the difference between: C05 a) Recursive vs Recursive Enumerable. b) Deterministic vs Non Deterministic TM. ht EOE EVRVEVee‘Total No of Pages: 2 Roll No. ‘S) FIFTH SEMESTER ATION, DECEMBER.2922 Course Code: ITITCIS/INITCIS Course Tile: Number Theory and Cryptography Max. Marks: 49 Note: Attempt All the questions. Missing Satalinformation if any may be suitably ‘assumed & mentioned in the answer. “QNe] Questions [Marks | COs Ql | Attempt any two parts of he followings — 1 is [Using the extended Euclidean algorithm, Gnd The greatest] 4 | COI common divisor of the following pairs and the value of s end t i) 24 and 320 cee il) 400 and 60 i Ib | What is Euler's Totient fimetion? Find O(i1) and 600), 4 | COT Te | Dette = commnuative ‘oup with an example Also Gio oa 4 “| Cor Srzzple of a group which is not e commutative group. 2 | Attempt any two pars of tke following: { 22 | Determine bow many of the following integers pass the Fermat|- @ | COl | primality test: 100. 130, 200 end 271. Use base 2. 22 | With the help of Chinese Remcinder theatem, solve he following | 4 | COr jons: mod 4 mod 3 x24 mod 5 2c | Compute the Jacobi orate is 4 5¢7 with showing each | 4 | COT property that you used. IS \iaza5) | Attempt any two paris of the following: 3a |Stoep tee matrix with the key “ENCRYPT”. Enorypt| 4 | CO2 and Decrypt this message: “HAPPY INDEPENDENCE DAY TO ALL”, i 3b | Use the Vignere Cipher to Encrypt the message “Nothing S| 4 | COD Impossible in this world” with Keyword “PLEASURE”. 3c | Draw the schematic of the Enigma Machine. State the procedure | of Encryption end Decryption. 4 | Attempt any two parts ofthe Fellowing: 4a_| What is the Shannon's idea of Product Cipher? Differentiate| 4 | CO2 ae‘between S-Box and D-Dox, Compare three variations of D- Boxes andits invertibility also. a Explain DES function, Perform the cryptanalysis of DES and 2- LDES. 4c in Blowfish encryption algorithm, how many subkeys are used? Draw the neat diagram’ of Blowfish algorithm. Explain the process of key generation in it. 5 Attempt any two parts of the following: Sa Using the Rabin cryptosystem with p= 47 and q= 13: i) Encrypt plaintext P = 23 to find the ciphertext. ii) Use the Chinese remainder theorem to find four possible plaintexts. Given the super increasing tuple b= (7, 11, 23, 43, 87, 173, 337), r= 43, and modulus n= 1001, Encrypt and Decrypt the letter “j” using the Knapsack cryptosystem. Use [7 6 4 1 3 2 5] as the permutation table. se Whet is the significance of digital signature? Differentiate between digital signature and conventional signature.Q.No. la data/ information if an V SEMESTER B.Tech. END-SEMESTER EXAMINATION, November 2022 | Course Code- ITITCI6/INITCI6 Course fitle- Artificial Intelligence Time- 3 Hrs Question(Attempt any {wo parts of every question) Max. Marks(M)- 40 parts of every question. Missing maybe suitably assumed & mentioned in the answer. co _| given program? How can Artificial Intelligence improve the complexity of any How can we solve the game of Tie-Tac-Toe u tree in Artificial Intelligence? f - i ising Search space | Cor coz Generate suitable rules to; solve the problem. Problem statement is given and cannibals issionaries-Cannibal in the missionaries problem,‘ three missionaries and three cannibals must cross a river-using a boat which can carry at most two people, under the constraint that, for both banks, if there are missionaries present on the bank, they cannot be outnumbered by cannibals (if they were, the cannibals would eat the missionaries). The boat cannot cross the Hver by itself with no people on board. dl C02 2a Find the shortest path from A to G in the given graph using A® algorithm: Stace h(n) Ss 8 s + A B c 2 Dd 6 SG ° 4M COs 2b 2c ill Climbi ithm is a local search ou Say that Hill Climbing algori : treedy approach? Explaia the disadvantages of using this algorithm, _ ; Find the solution for the given crypt-arithmetic problem using Constraint Satisfaction algorithm: MATH. +MYTH HARD: 4M CO2 3a How can semantic nets and frames be used for Knowledge 4M co3| representation in Artificial ial Intelligence? : 3b | Express the following statements using Propositional logic with “4M | O03 their suitable truth tables: i, ‘Itis raining today; and street is wet, ii, Ritika is a doctor or an Engincer, iii, If itis raining, then the strect is wet. 4 eee iv. _1€T.am breathing, then Lam alive. 3e | Given the following set of statements: 4M COs i. Jobn likes all kind of food. i. Apple and vegetable are food iii, Anything anyone cats and nof killed is food. iv. Anil eats peamuts and still alive Vv. Harry cats everything that Anil eats, | Use resolution theorem to prove John likes peanuts, ||” 4a] What is Fuzzy Logic? List some applications where itcan be am | Cos used. || a0 For the given graph, find the minsmax vac every node: aM C05 | a ‘Use the same graph as in 4b to find the alpha-beta values after applying alpha-beta pruning in that graph. What if an Agent in Artificial Intelligence? Explain the working ofan agent with a suitable example. |] _ 56 | Differentiate bétween the following: ~ aM i. , Sipervised and Unsupervised Leaming ~ : "Simple Reflex and Model based refiex agent. [| “3e J Waite Short notes on the following: - : aM i i. Natural Language Processing ~ ! ii: Goal based agent. :d = pet END SEMESTER tex anana ee eect Course Code ~ ITITCITINETCH7 NATION, DeceMiee, 272 Course Title - MOBILE COMPUTING ‘Time- 3 Hours Note: ~ Attempt all questions, [ineheanswer, ° UUON Mls datatntormation ci Mees. Mates: Us 0. Any), may be suitably aevemed ke mentioned [xe | —____—_ vation ———— CoE Q1_| Attempt any 2 parts of mi ——— odd ja] Compare 4G and 56 techno why? ‘ology in detail, Di [1b | Derive Expression for Maximum — Aloh: di laximum Throughput in case of Pure Alea a, a medium access technique used in motile comput fae he ‘Explain the IEE! Te | Explain the IEEE 802.11 standard architomure, ees Q2_| Attempt any 2 parts of the following = = = Explain the 2a ‘plain the purpose of HLR and VLR in-call routing and roam Fleas 2b ee krwn Protocol designed for infrastructure based 7 Hi work satisfactorily in infrastructure less environment.” Justify the staverans. 4 oF Ze] Explain all the interfaces of GSM system, @3_| Attempt any 2 parts of the following 3a | What are various Traffic and Logical Channels used in Case of GSM? tom 3b | What are the Data services offered by UMTS? Explain various applications oF UMTS. 4 (co Je] Write short note on — (a) IMEI, (b) IMSI. eos: Qf | Attempt any 2 parts of the following 4a [Explain LTE Architecture with all its eomponents in detail. [ae oT esaribe the Cellar Systems in detail Explain the role of ealslar sysiem in Be computing. u Je] Explain through a suitable example the Billing and Charging in GPRS system. ig cas lowins S| Altempt any 2 paris 0 ne ore anialion. Differentiate Between MOBI Sa] Explain TCP protocols for mo! « loos TCP, Snooping TCP and ITCP- an and Hidden Terminal Problem are resolved =i 3b | Describe how Exposed Node Prete rae using MAC Management Te 7 —a jagram. 4 | oo Se | Draw GSM Time Hierarchy Die SR el atlallleleraslal