Roll No,_____— Indian Institute of Information Technology Surat B.Tech-I Semester: Il Computer Science and Engineering id Sem Examination Data Structure and Algorithm (CS 201) Marks: 30 Date: 08 May 2023 “Time: 02:00 PM to 03:30 PM Instruct 1. Attempt all questions 2. Make necessary assumptions wherever required. QL, Answer the following oA Write the function for the following (stack using array) : (6) i) PfeateStack( ) _iyfusHo Byer [b]// Suppose STACK is allocated N= 6 memory cells and initially STACK is empty or TOP=0. (2] Find output of following program: Setar= 2 and B Call PUSH(STACK. A) Call PUSH(STACK.4) Call PUSH(STACK,B+2) Repeat while Top!= 0: Call(POP.ITEM) Write ITEM [End of Loop] e f Exit a saoge [57 Bvatuate the following Postfix Expression (trace symbol/item one by one): 2 6234+-382/492834 SP Q2 Answer the following: frit the following functions for the doubly linked 2 i) Insertion after a particular node ii) deletion of a node from end [b)Avrite following functions for the queue using array: B) i) isFullQueueQ) ii) enqueueQ i)dequeue()a ni at m= ay — 5 =a = 80,9 by beter: ren Petformeg MSCS ord ue 1: PU the em = oF rm 0 %0 05 in th * order into § popes leer 9 %0 a5 ‘hetorer ino MH. pop lemeny from §, "dequeue an MEN from @ \. poy Nn eleme, from §. Wi dequeue ana) et from Vil dequeue an ir 0 and push ty Fame element ino § Il, Repest opera VU shee time POP an element PP an element from The top clement org after executing the above operations Cele S Die Advantages and di Be of th fain ry » Crestor Linked ee ar Doubly Linked ip einer following: D Gonsisct binary sear, 9. 1a MS Flowing aa tag Poy Dand, 4 £0.25, 75, 22,40, 60, a) 15, Delete the node 75, i) Insert the node 63, INORDRR: EICFIBGDKHLA WA " o* 4 ng tre, 8]————— Indian Institute of Information Technology, Surat B.Tech. 1 (CSE & ECE), Semester — I] Computer Architecture & Organisation (CS 203) Mid Semester Exam — May, 2023, Date: 10/05/2023 \ Time: 10:00AM = 11:30AM Marks: 30 Instruc i > Aempt all questions. > Follow all the guidelines given by institute exam-seetion while attempling the exam. No. ; a i Marks a Discuss in bricf about various number representation types and the advantages of Signed 2s} 3 Complement representation over others, Bee ce seiae ea min) |A pos is overflow rule in signed number addition, 1 = (3 min) 4% Stars with 9 full adder which realized by 2 hall addeys, explain he Uilonces the design and| 5 2 performances of4 bit ripple adderanda bi carry Took ahead adder using full adders as blacks. (U5 min) $s) psi the help of either algorithm or low chart discuss in detail the division of signed numbers. | 5 Iso, divide -7 with +3, eee ean (5 min) Ag Discuss the algorithm of Booth's Multiplier and also do the mullipicalion oF Too wa OTT a using it, (12 nin) range the following circuits in deseending order as per the thelr camy"out delays Ip BI Bie Took cheat aoe eae ‘4-4 Bit carry. loo cascade of 3-4 Bit carry. look ahead 2 adders, and, cascade of 4- 4 bit (6 min) Fipple adders with inchusion of their corresponding delay values. t = prow m execution on a microprocessor= 7 Draw a block-diagram of a microprocessor based system with bus ‘architecture. : rogram for ‘adding n numbers ng a loop? utilising indirect | 4 i - Draw a flowchart to explain your logic. + Adentity the RISC style addressing mode wed ie each of foll i 2 le € lowing four instructions: a Store R2, CAO Subtract R2, R2, #1 Load R2, 4(R3) Add R2,R2 R3 ©) Explain very bri Ie use of and ENI I =e ) Expl i ® Pity © of ORIGIN and END assembler directive in an assembly language program, 1 ion orn pe ouene picture given for stack of word tn ae : m uy 8 following piewr r ofword in the memory’, Draw the picture afige ecution of a ‘push from Rj & “pop into RY’ operations- {Consider initial yatue of Rj yout roll no") ° anne : Stack, = # re 6 a) 7 2 Hea eeeae ey ea = 1 Camnt = 2 7 : Stach ~>————— 5 luorrosy aD }~ Best : Le A sock of words inthe memory {PrepMid Semester Examii m B.Tech. | (ECE/CSE) Electronic Devices an Date: o9/05/2023 : Maximum Marks: 30 ination May-2023 ): Semester — Question Description Discuss the distribution forward bias and revers Marks Of minority. bias condi farrier concentration in pen junction diode in tion with proper diagrams” What do you understand wit discuss vario th breakdown diodes? Pict its V-l characteristics and us breakdown mechanisms. ren? on te et lntion with a uniform accopor doping concentration of 10°7 cm? on the p-side and @ uniform donor Concentration of 1916 cm on the n- PE side. No ono | von tat, Pied tothe dade: Calc icons ‘Width of the depletion layer, Gj iven that: 1.5 x19 1.6x19"C set mae Discuss the construction Of Bipolar Junction Transistors (BuTs). Explain operation of the npn-type BUT. “Best Wishes***Enrolment No: eute Of inter... a POD cry Explain the Conter-tapp, Various parameters associated with Rectifi ed full-wave rectifier circus oy i istis it figuration, 10 & §/] Draw the Cireuit and Input & Ouput Characteristics of Common Emitter Config [Pefine Bias Stabilization and Stability fuctors. Derive the expressions of S(Ico) for fixed bias - ee eeu aethe current my “ing amplifier for values of V,= 1.5, 2 1=10KQ. yi torr an inverting amplifies having a gain of “10”, and an input resistance of Nook, find | Ne Value of Ry and Ro (feedback resistance). [ov the superposition principle to find the Output voltage ofthe cireuit given below: Sun nia i ba fe 3 a 2h)Maian 1 Roll No, hed Sate OF Informa " Technology Suny “hl Semester tp Computer Science ang n sre puter Sei ngineer een "Sem Grama Structure an ne Mstructions: Dates 10s Atte MDE al id Al; rithm (cs 201) July 2023 Ti 2 Make Nee 9:30AM to 12:39 pay Qu Qy 10 you by Minimum Spanning Tree (MST)? What are the [6] “Sorithms to fin Msp? Write the pseudocode ‘o find Mgr, (& eight of a spanning ‘tee Tin this graph inthe tree 7) (A BR 15 —e-———» Find the number of minim Weight spanning trees ofthe graph D 2) @) Explain Warshai ith Wi advantages ith pseudocode. Aso, mention it’s (5) and disadvantages, (bY Apply the Fox Warshall algorithm for constructing shortest path, Show the [2 atrix D(® that results in each iteration, Braph with 4 vertices, where the weight of=_ edge HH is given by the entry IV, in the matrix Wy, O28 § 205 8 Soo = 5B 6 x 9 Find the ta reest ome po eslegee salve of, for which at least one shortest path between some Pair of vertices will e ain The e088 yith Wetgtey— BI @ Write Pseudocode for BelKan-F a Also, mention i’s advantages, [6] disadyantages and time complexity> — Ye Consider the following smirected Sraph with edge weights as shown: a) Bellman-Ford Algorithm is implemented on the given graph with source Find the Shortest distance from source swe What do you mean by single source sho Jest path? 61 it Single source shor. Ksta's “Algorithm, Also, THEMTon Ie oe Mages, disadvantaQes—am—time 4) (4) Suppose we run Dijkstra’s single source shortest-path algorithm on the following Sdge weighted directed graph with vertex Pas the source. In what order do the Fouts Set included into the set of vertices for which the shortest path distances are finalized? A The adjacency matrix of a directed graph is given below: (4) =[8lelale[Tetni eee. [elo lelotelets/etets ela[ololafoletetets a|ololololatererets ola lofolotstetets rlola[otelefatstets s[ofolotolotefotets nfefolrotots[atofofs| ifo[a}otefofetstets The valid topological sorts are: tore avr (a) (h,cae,d,ig,b) 2,4,8,(03,b) f.c,d,a,b,) ® CXetanib) X (€) (heii— Justify your answer, [3#3=6) Q2 UY What do you mean by Mashing in Data Structure? Expl 6] $ssglution techniques, a) ie Pseudocode for Rabin-Karp algorithm, Q ing working module Karp matcher encounter in the text =26. BY (atte following funetions fort cireular queue using array: 1) isFullQueue () Satmenso Jifdequeus () A Mri following functions for tyeDoubly Linked Lise “(heron (Beletion 0 Q @) Answer the following wy Discuss Threaded binary tee with an example, (b Conyert the following expression into the prefix expression, Bbxcte-Llgtsktxy® BF Discuss the stricture or ence wae its proper tas Du aa eases wi oe ee te (Any 3) Discuss the Insertion Sort algorith D— Sort the following elements ver 46 67 1, how many spurious bits dod the [3] 141592653589793, wher looldng for Pattern (6) [4] (8) uy im With its time analysis, 1g Bubble sort: 12 34 25eeey Discuss selection sor algorithm with its time analysis, i) Create a BST for the following keys: 43 17, 8,9 56,75 70\95. Delete key 75 from constructed BST ini, rae Answer the following ( Any 2) 3) Apply heap sort tothe given array: (4, 1,3,2, 16,9, 10, 14, 8,7) Yi) Create-a B-tree of onder 4 for following keys: 10, 20, 40 ,50, 60, 70, 30, 35, 5, 1 ii) Delete 70 from the generated B tree, x Construct an AVL tree by inserting the following clement rer, 10) in the given 63, 9, 19, 27, 18, 108, 99, 81 ey‘xam — July, 2023 & Organization (Cs 293) 12:30PM aed the processor register PC Ir? What is their use ina 2 c) A computer must have instructions cay able of performii i . o . _ Menton those four types of De Petes of operations, operations. , Sy Udentify the addressing mode used in each of following fourifettucti ig four ifsftuctions: Load R2, KBD_DATA. Move ITEM, (SP)+ Add RER2, #2 Store R2, 0(RO) ‘ ©) Explain the terms Byte-Addressability and Word-Alignment very briefly, 2 rite appropriat *iuctions for: i) PUSH operation ii) POP operation, for the C language statement A = *B Sto accomplish R9 = RO 4 96 © a RISC style program for ‘adding n numbers using a loop” utilising indirect f idressing in the program. The it ir A Parameters to the subroutine must Write appropriate comments along with the program to b) Suppose that four ASCII characters are contained in the 32-bit register R9.Insome 9 {ask, we wish to determine if the lefimost character is A. I it is then a eondinened —~ branch to FOUNDA is to be made, Write a sequence of instruct task. Write appropriate comments along with the program to explain your losic. Uys the initial content of R= OxSAASASSA and ‘C’ flag = 1, Find & mention 2 content of R9 and ‘C’ as the following instructions are executed in sequence, Cc LShifUTR9,-R9-#1--R9 = 0x &C= ASHiftR R9, R9, #2; R9=0x. &C= ISC and CISC are two different styles of instruction sets. Mention all the points by 5 which the two styles are characterized. ol ©) Write a RISC style program for accomplishing the task of reading a line of characters & typed on a keyboard, storing the characters in the main memory, and displaying them on a display device. Use interrupts with the keyboard and polling with the display device. Write appropriate comments along with the program to explain your logic. 3 (i) What are the reasons behind usage of Signed over others. Also, design_a 4 bit-signed-ny €omplement representation er adder circuit with overflow indicator. oA Disvuss the algorithm of Booth’s Multiplier and also do thet 5 +13 with -6 using? =e i \tion-techniqué Bit-Pair Recoding, ‘iiy Discuss the concept of fast,multiplication. yea pce a Multipliers and perform the.maltiplication-of 39 vitr=6using te ; 5A... Ve Discuss the Procedure o} ‘— division of 8 wi Ton- restoring 1 y ed number division y 18 Non rest f ¢ Wr, gitesloring method, Perform ith +3 using non sestoring method. What is the perf method over restoring wee . formance benefits of nethods SY 8 terms wrto IEEE floatin Point representations? bi aT Sigitcand il, Exponent field, and Sign field ortance of Bias sing mportance of guard bits 10 Fagram, explain a 5- stage Pipeline organization in detail R d discuss the various hazards in Pipelining? Also, discuss the €ach type of hazards JH Deine the terms (i) Speed Up Gi) Throughput (iiiy Efficiency parameters for the execution of 108 instructions using non pi ipeline. As: ipeline and 6 stage © required for each stage is 15 microsec ag, KL What is bus and discuss a simple bus Structure and also discu: it? ss functioning of the VO remedies to avoid and also calculate the 6 2, Discuss about the various sequence of actions required for fetch and execution of the 7 Yyfoliowing type of instructions Ab @ Arithmetictype (b) Branching Instructions (c) Subroutine instruction 8 Discuss the conceptual view of DA’ ‘TAPATH and Instruction Fetch Sections of a basic Processing unit along with in detail 8 explanation of connections between the stages, see ALL THE BEST+***Indian Institute of Information Technology, Surat End Semester Examination-2023 B.Tech. (ECE & CSE) (2nd Sem) : Course Code & Name: AS204: Discrete Mathematics Date and Time : 13/07/2023 (02:00-05:00 PM) Max Marks: 100 Time Allowed: 3:00 Hrs. Reg. No. « Instructions: » All notations have their usual meanings. 4 ‘ SECTION-A Answer all of the following questions. (8 x 5] = 40 Marks. éline tree. Show that an undirected raph is a tee if and only if, there is an unique simple path FH wetween every pair of vertices? Z ey ria the greatest lower bound and the least upper bound of the sets (3, 9,12} and {1,2,4,5, 10}, the poset (Z*,|), where |” denotes the relation of divisibility. if they exist, Ves is lattice? Determine whether the posets represented by each of the Hasse diagrams are lattice or not, fe fine complemented lattice. Show that in a distributive lattice (L, Y) if an element a € L has & gomplement, then it is unig Ee Bn Hemant SF ts fine equivalence relation. Let H be a subgroup of G. Let the relation ~, be defined on @ by: : @~1 bif and only © Then show that ~z, is an equivalence relation on G, oben. 5. Prove that Kemel of a group homomorphism is a normal subgroup of G. ce . fg OR ‘ow that addition and multiplication mod n are well defined operations, 6. Define disjunctive normal form (DNF). Further find the DNF of the following expression. AO 4 gar) that the premises “A student in this class has not read the book,” and “Everyone in this class ssed the first exam” imply the conclusion “Someone who passed the first exam has not read the ‘book." 1g 8. Define rule of inference. What is wrong with this “proof?” 1 Please turn over... |"Theorem:" If n? is positive, then n is postive stfy through the viewpoint of mathematical ogi, SECTION-B Angier all of the following questions. (10 x 6] = 60 Marks. yop Braph. Consider the following undirected, weighted graph: culate the single-source shortest paths.from A to every other vertex, inally, indicate the lowest-cost path from node A to node F. fet G be a graph with n vertices (n> 1). Then prove thatthe following statements are equivalent: (i) Gis connected and has no cycled. it) Gis connected and has n-1 edges. TA R be an equivalence relation on a set A. Then prove that the following statements are Hent. (8) ab (i) [a] = [, (ii) lol ye] 4 8. 12, Define coset with suitable example, Further state and prove the Lagrange theorem. 13, Defien permutation group. Prove that permutation group Sy is isomorphic to the group Ds of symmetries of an equilateral triangle, Jo any three rules of inference. Show that the conclusion W2(P(z) > -Q(2)) follows from the femises 3a(P(z) A Q(a)) + Vy(R(y) - S(u)), and 3y (R(y) A-S(y)). *Best wishesIndian Institute of Information Technology, Surat Mid Semester Examination-2023 B.Tech. (ECE & CSE) (2nd Sem) Course Code &: Name: AS204: Discrete Mathematics Se Date and Time : 11/05/2023 (10:00 AM-11:30 AM) o inutes Reg. No. UE P2CS ES i saarks: 30 Time Allowed: 90 Instructions: « All notations have their usual meanings. SECTION-A Answer all of the following questions. [2 x 5] = 10 Marks. 1 Amer tah Of degree 2, 4 vertices of degree 3 and 3 vertices of degree 4, Hi “Tea nodes does F have? = 2 She that every simple graph with at least two vertices contains at last two vertices of the same Sree. Does the result continue to hold if ‘simple’ is replaced by ‘loopless'? 7 al » Present the postfix expression ab-+edveJ/——as asa binary tree and write algo the corresponding infix and prefix forms. 1A (line graph isomorphism. Check whether the given pair of graphs are isomorphic or not explain (step by step), 5. Show that the complement of a simple disconnected graph must be connected, SECTION-B Answer all of the following questions, [4 x 5] = 20 Marks. ine shortest path problem. Find the shortest path from source (consider 0 vertex os source) to All nodes using Dijkstra's algorithm. Explain step by step. JER algorithm to find a minimum spanning tree for the weighted graph shown in Figure. explain step by step. 1 Please turn over...6 8. Prove that a tree with n vertices has n ~ 1 edges. e 3 fiamiltonian path, Find a Hamiltonian path or Hamiltonian circuit, if it exists in each of ' ¢ three graphs. If it does not exist, explain why? a, & sort G 10. Let A = R° — {(0,0,0)}. That is A is a 3D space, except for the origin. Define a relation ~ on A such that is a positive real number X such that (2: y,2) = A(P- 4.7). (2,y.2) ~ (p.Gs7)s if and only if there Show that the relation ~ is an equivalance relation. Best wishes+