| [Total No. of Pages: 01] ; :02] Seat No: [ HR ior [Total No. of Ques G oni College of Engineering and Management, Pune. (An Autonomous Institution) S.Y.B. Tech. (‘Term - III) CAE-I Winter - 2023 (2020 Pattern) Discrete Mathematics & Graph Theory [UBSL 205] [Time: 1 Hour] [Max. Marks- 15] Instructions to the candidates: 1) All questions compulsory. 2 Neat diagrams must be drawit wherever necessary. 3) Figures to the right indicate full marks. Q Sub Question Mac CO BL No. Que. Marks BI p) Let A= (1,2,3,4,8), B = (1,4,6,9) and R = ((x,y) |y is divisible by x) 4 COI BL from A to B. Represent relation by _ i) a set of ordered pairs ii) arrow diagram iii) digraph iv) relation matrix OR —b) Let R be the relation on the set A = {a,b,c,d). Find transitive closureof 4 CO/ Rusing Warshall’s Algorithm where & = (a,b), (b,4), (d,a), (c,4),(b.¢)} 2 Using Mathematical induction show that 4 COl BL3 . +t = > (for natural nu ot ett. tach = Gi (lor natural number n> 1), OR SF bet fagsh be the function from N to N, where N is set of natural 4 COl BL4 0 if nis even numbers so that f(n) = n+ 1, g(n) = 2m and h(n) = fC ae a Determinei)feg ii)gef ili)geh ivyhog 22 ie Using Fermat’s theorem, find remainder when 7#%? is divided by 11. 4 CO2 BL3 oR 4) 1G be the set of all non-zero real numbers and + be a binary operation 4 C02 Blt" defined as a + b = 2. Show that (G,*) is an abelian group. a group or not. Where, 3. C02 BL? gp Let Zg = (1,2,3,4). Check whether (23, Xs) Xs is multiplication modulo 5. oR d) Let (Q.+) isan algebraic system. For any a,b € Q, binary operation « 3 BL2 defined as a+ b = a + b— ab . Determine whether (Q,*) is semigroup , monoid and group.J (Total No.of Pages: 09) [Total No. of Questions: 02] mts GAL, Raisont College of Engineering, and M (An Autonomous Institution) S.Y.B. Tech, CS Cherm «11 1 Winter = 2023 (2020 Pattern) Diserete Mathematies & Graph theory [UBSL. 205] [Mtan, Marks- 15] [Vime: | Howe! Instructions to the ‘All questions compulsarys Neat diagram must be drawn wherever necessary. sundidates 2° 3) Figures to the right indicate full marks. @. Sub Question Max CO Hh Ne Que. Marks Oy) Check wheather (54%) iam inteyral domain or nol 4 co MA on 4 COD Bhs aul relation R be the divisibility on 4b) Let Aisthe set ofall positive divisors of 70 A. Draw Hasse diagram and show that it forms a latte, 3 Cor BLD 2 Show that $= (0,2,4) is subring of Ze, te» Xo) on Kind the complement of each element ofthe following lattice and check 3 cor wL2 find the shortest path froma tozinthe following ¢ C03 LF e Dijkstra’s algorithm Q2 a) oR 1) Draw the graphs Complete graph with 4 vertices (Ka) 4 CO} BLE ae een lor eraph —iiyComiplete bipartite graph KG ix) Pseudo graph Give the sepvise construction find the minima spanning te oF te 4 C03 BLE following graph G using Prim’s algorithm or Give the stepwise construction to find minimum spanning tree OF The 4 cos BL3 Kruskal’s algorithin[otal No. ot Questions: 4) Seat No. {Total No, of Pages: -O1] GU Ratsont College of Enghivertig and Management, Pane (An Antonioni tustitaion affiliated to SPPU) SY (Computer Engineering) CATA Winter-202. 2020 Pattern) Data Saruetures and Algoritiims (UCOL201) {Phner t Mowey [Max. Marks-15] Instructions to the candidates: 8 ctivwer any d questions, + Neat dlagramy must he drawn wherever necessary. + Bigures to the right indicate full marks. co LM Discuss Array with examples, State the difference between an COL 12 (s] aartay and @ Tinked fist? or Mustite all asymptotic notations with suitable graphs. cor 12 [5] 2 Sort the given input array using Selection Sort. ca 13 [5] Input Arvay=(66,98,34,413,85,87.23,14,98.23 } or Implement C code for Insertion and bubble sort, cot 13 [5] 3 Suppose an unsorted Linked list is in memory Write a procedure C02 3 [5] SEARCH(INFO,LINK,STARTJTEM,LOC) whieh 1) Finds the location LOC of item in the list or sets LOC=-NULL for an unsuccessful search, b) When the search is successful interchange ITEM with the ‘element from front of it, oR Consider LIST be a linked list in memory. Write a procedure © CO2_—L3__ [5] which a) Finds the number NUM of non-zero elements in LIST. bb) Adds a given value K to each element in LIST,[Pot No. of Questo Instructions (0 the candidate I O35 Seat No: 32, GU Raisoni College of E mye andl Maan (AH Autonomous Institution alfiliated to SPPL SY (Computer Engineeriny) CABAL Winter-202 4 2020 Patt Data Struct Answer any 3 questions, Neat diagrams must be drawn wherever uecesse Figures to the right indicate full marks, Discuss doubly linked list. Explain insertion in doubly linked list. oR Implement PUSH and POP function for stack using array with StacklsFull and StackIsEmpty condition. - Design the algorithm for insertion and deletion in Queue. oR Explain Tower of Hanoi problem and design the recursive solution to solve this problem for n=3. Suppose the following sequence list the nodes of a binary tree T in preorder and inorder respectively: Draw the diagram of the tree. , Preorder: G, B,Q. A, C, K.P, P, D, E, Ry H ALG, PLE, D, H.R Inorder: Q. BLK. C. or Consider each of the following postfix expressions: PISS Gas be + 27, 4,526 55 - P2:3,1, Evaluate these expressions. [otal No. of mt, P > sand ‘Mjovithms (UCOL, 201) [Max co cor col co3 cos cos co3 Mar L3 13 (1 wes: -O1][Total No. of Questions: -03] [Total No. of Pages: -02] GU Raisoni College of Ei i (An Autonomous Institution affiliated to SPPU) Y (Computer Engineering) CAE-IIT Winter-2023(2020 Pattern) Data Structures and Algorithms (UCOL201) ii Hour] [Max. Marks-15] Instructions t0 the candidates: © Answer any 3 questions, © Neat diagrams must be drawn wherever necessary. © Figures to the right indicate full marks. co LM oa ee the various representation of graph with example in CO4 12 [5] etal. oR Differentiate between Depth First Search and Breadth First CO4 12 [5] search traversal technique with suitable example. a Explain Breadth First Search (BFS) algorithm and traverse CO4 L3__ [5] the following graph using Breadth First Search (BFS).Consider 40 as the starting vertex. OR fad the Minimum Spanning Tree for the given graph using CO3 3 [5] Prim’s algorithm.c D E A Te 2 2 7 7 A 7 5 A 4. 4. 3 ame e (7S _ Bifferentiate between linear and non-linear data structures. cor 12 [5] OR 12 (5) Differentiate open addressing and closed addressing col removing technique with example.[Teeal No. of Questions: -03] Seat No: [Total No. of Pages: -O1} 1 Raisoni College of Engincering and Management, Pane (An Autonomous Institution affiliated to SPPUY SY (Comput CAE-I Winter-2023 (2020 Patter) Formal Language Automata (UCOL203] [Time: 1 Hour] [Max. Marks-15] Instructions to the candidates: © Answer any 3 questions . 6 Neat diagrams must be dravcn wherever Necessary. «Figures to the right indicate full marks. Q coL M No. < 2) Explain finite automata and type with example 1 £2 [5] or |p) Finda dfa that accepts all the stings on {0.1}, 2 2 [5] ‘except those containing the substring 001. (aT Difference dewween DFA and NFA. Wriethe 1 £2 51 notations of DFA and Explain it or _®) Give dia's for the languages 2 1s [5] (a) L=tab wwe tab}"}. (b) L=tab*a®-n>2.m>3}. a) State pumping lemma for regular languages 2 12 [5] pe) G a 5) Convert the following nfa into an equivalent dfaRULE (An Aw [Time: — 1 Hour] (ed to Savitrib B.Tech (CSE) (Term - HD) Formal Languages & Automata UCOL203 CAE-II (Winter 2020 Pattern) Management,Pune. ile, Pune University) | Max. Marks-15] to the candidates: ‘ions compulsory. Figures to the right indicate full marks. Assume suitable dal Sub Question a b) 9 » 7) » if necessary. Describe in detail Chomsky hierarchy of languages oR Write down the context free grammar for the language L = { ab" [n>=1} : Let G be the grammar SaB|bA A—vajaS[bAA B—b[bS|aBB. For the string “aaabbabbba”, Find (a) Left Most Derivation (b) Right Most Derivation oR Is the grammar E-E+E | id is ambiguous? Justify. Find the PDA equivalent to the given CFG with the following productions 1. $A, ABC, B—rba, Cvac 2, SraSblA, A—bSalS|e oR APDA is more powerful than a finite automaton. Justify this statement. Marks 15] [5] 15] 15] 15] co co2z co2 co2z co2 co3Total No. of Questions: —-] seano: | $0 [Total No. of Pages: —] [Time: Hour] Instructions t0 the © 2 Neat diagrams candidates: 1, All questions compulsor G11 Raisoni College of Engineering and Management, Pune (An Autonomous Institution affiliated to SPPU) SLY. B. Tech (Computer Engineering) Term-111) ‘CAE-3 Summer 120 Pattern) . Formal Language & Automata (UCOL203) [Max. Marks-15] must be drawn wherever necessary. Figures to the right indicate full marks. 3 AL Assume suitab 5 ¢ data, if necessary. Other Instructions, if any. Que sub One aA a i) » D) Construct a DFA for the language over {0, 1}* such that it contains “000” as a substring, OR Give regular expressions for the following L1=set of all strings of 0 and I ending in 00 L2set of all strings of 0 and | beginning with 0 and ending with 1 Describe a multitape Turing machine? Explain in one move. What are the actions take place in TM? OR Explain highlight the implications of halting problems Design Turing machine which accepts a language having equal occurrences of a’s and b's. OR Design Turing machine which accepts a palindrome of a binary language. co cor cor cos cos cos cos ui Li Li M a 151 (51[Total No. of Questions: 3], Seat No: [Votl No. of Pages: 1 GU Raison Inst & Technology, Pune (An Autonomous Institution affiliated 10 SPPC) Second Year B.Tech (Term-lll) CAE-1 Winter-2023 1 (UITL201) [Max. Marks-15] (ime: Hour} Instructions to the candidates: 1. All questions compulsory. 2. Neat diagrams must be drawn wherever necessary. 3. Figures to the right indicate full marks. 4, Assume suitable data, if necessary. Que Sub co L Mm Que 1 a Distinguish between the following terms: col 12 [5] a) Data abstraction and data encapsulation 'b) Object and classes oR 3). Elaborate the term constructor. list some of the special properties of CO! 13 [5] constructor function and write a sample program using constructor. 2 # Define a class to represent bank account which includes following data CO2 13. {51 members and functions (Data members: name of depositor, account number, type of account, balance amount in bank) (Member functions: to assign initial value, to deposit amount in account, to display the name and balance), oR 8) Discuss polymorphism in CPP and what are the methods to achieve it with CO2 12. [5] an example. 3 a) Explain the concept of operator overloading in CPP with an example. coz 13 [5] or coz 12 [5] 4) Discuss about this pointer in CPP with a sample program.[Total No. of Questions: 3] Seat No: [rotal No. of Pages: H GH Raisoni College of E ing & Management, (An Autonomous Insti iated to SPPU) Second Year B. Tech (Term-IIl) CAE-It Winter-2023 Object Oriented Programming (UITL201) 15] [Time: 1Hour] [Max, Marks- Instructions to the candidates: 1. All questions compulsory 2. Neat diagrams must be drawn wherever necessary. 3. Figures 10 the right indicate full marks. 4. Assume suitable data, if necessary. Que Sub cooL M Que 1 @ What are the different forms of inheritance? Give syntax foreach withan C032 [5] example of any one inheritance. OR b) Consider a class network of the following figure. The class master derives co3. 43 [5] information from both account and admin classes which in turn derives information from the class person. Define ali the four classes and write a program to create, update and display the information contained in master objects. er'son lame Account [dmin Pay perience _ Person Name Code Experience Pay P.T.0-o » 9 ” Make displayarea() as virtual function and redefine this function in both dl Using three classes design a program that will accept dimensions of triangle and rectangle and display area or Write a program for multilevel inheritance for bank transaction. Write a C++ program to illustrate dynamic allocation and deallocation of memory using new and delete keywords. oR Elaborate the term Constant member functions in CPP with syntax: and example. ssee004ALL THE BEST**#**** cos co3 co4 cos 13 13 13 L3 (5) (5) ) [5][Total Instructions to the 1 - 3 4 Que Sub Que om ” a) me: Howe] Neat diagrams must be drawn wherever necess Figures to the right indi assume suitable data, if necessary Seat No: No. of Questions: GAL Raisoni College of Engineering & Management, Pune (Au Autonomous Institution affitiated fo SPPU) Second Year B. Tech (Term-11D) CAE-IIL Winter-2023 Object Oriented Programming (UITL201) uidates? Ul questions compulsory. ate full marks. Write a program in c++ to overload the function volume fo calculate volume of cube, cylinder and cuboid. : OR Write a program in CPP to ask for temperature in Fahrenheit and display it in Celsius. Discuss the term templates in CPP with its types & syntax. OR What is the funetion template in C++, write a suitable program t0 use function template. Write a class template for addition of two integer values. OR Discuss Exception handling in CPP with an example, sesso ALL THE BEST#****#* co cos cos cos cos cos cos [Total No. of Pages: 1] (Max. Marks-15] 5 oSeat No. GH Raisoni Institute of Engincering and Management, Pune. (An Autonomous Institution Affiliated to SPPU) S. Y. B. Tech (Computer Engineering) -1 Winter ~ 2023 (2020 Pattern) Computer Architecture and Organization - UCOL202 me: | Hour [Max. Marks: 15] Instructions to candidate: 1. Solve Q.1 or Q.2 and Q.3 or Q.4 2. Figure to the right indicate full marks. Q. 1. a) Explain basic function block of a computer. [4] col L2 b) What are the different addressing modes are used in [4] col LI Instruction set architecture? Explain any two by giving an example. oR Q2. a) Compare the CISC and RISC Instruction set [4] Col L4 architecture. b) Explain instruction execution cycle. [4} Col 12 Q3 ay Solve the following for fixed point arithmetic. [4] coz 13 ia i 1449 ii, 18-7 iii, 13x11 iv. 213/58 b) What is Sub-Word parallism? (3] Coz LI OR _ Q4 a) Explain Carry Look Ahead adder. (4) Coz L2 b) | What is IEEE standard for single precision format? 3] CO2 LIQ2 Q3 Q4 Seat No. _ GH Raisoni Institute of Engineering and Management, Pune. (An Autonomous Institution Affiliated to SPPU) S. Y. B. Tech (Computer Engineering) CAE-Il Winter — 2023 (2020 Pattern) Computer Architecture and Organization - UCOL202 Time: | Hour [Max. Maths: 15] Instructions to candidate: 1. Solve Q.1 or Q.2 and Q3 or Q.4 2. Figure to the right indicate full marks. a) Explain Parallel Bus Architecture used in Computer [3] CO3 L2 Architecture. b) Illustrate the memory hierarchy pyramid by considering cost, [4] Co3 12 speed, and storage capacity of memory. OR a) Find the number of bits required for Cache indexing (or Page [3] €O3 L4 Number or Line Number) and Tag bits for the following: A direct mapped Cache of size 4KB with block size (or Page Size or Frame Size) of 32Byies. The CPU generates 16-bit address. b) Apply the LIFO page replacement algorithm for following requested [4] CO3 L6 Pages to be loaded in page frame of size 4 and calculate the Hit ratio and ratio. Requested Pages: 7, 0, 1, 2, 0,3, 0, 4, 2, 3, 0,3, 2, 1, 2,0, 1,7,0,1 a) List the different types of hazards in Instruction Pipelining and [4] Coa 11 explain any one in detail. b) Explain Arithmetic Pipelining with the help of flow chart. [4] Cod Lt OR a) Consider a pipeline having 4 phases with duration 50, 70, 100 [4] Coa Ls and 75 ns. Given latch delay is 10 ns. Calculate- 1. Pipeline cycle time 2. Non-pipeline execution time 3. Speed up ratio 4. Pipeline time for 1000 tasks b) Explain the basic concept of Pipelining with help of diagram. {4} coa LtSeat No.____— No. of Pages: 01 institute of Engineering and Management, Pune. (An Autonomous Institution A fiiiated to SPPU) S. Y. B. Tech (Computer Engineering) CAE-II] Winter — 2023 (2020 Pattern) -cture and Organization - UCOL202 . GHRai - Computer Are Time: 1 Hour [Max. Marks: 15] Instructions to candidate: 1. All Questions are compulsory. 2. Figure to the right indicate full marks. Que. Sub Questions No. Q. 1. a) What are the logical instructions used in microprocess? Explain any cor Li 5) two of them. OR b) Explain Booth algorithm for Multiplication with the help of suitable coi 12 {5} example. _2 Briefly explain hardwired implementation of a control unit. cos 12 [4] _8) Show the micro-operations and control signals for the micro- cos LI [6] processor for the following instructions: 1. Load Accumulator 2. Store Accumulator 3. Add to Accumulator oR {Design the block Diagram for 8-bit Central Processing Unit for cos L3 [6] following specifications: B-bit ALU 16 8-bit Register Bank 8-bit Instruction Register 8-bit Flag Register 16-bit Stack Pointer Register 16-bit Program Counter 16-bit Address bus PN AWaALNe 8-bit Data bus