‘be treated as malpractice. = $0, 4, 4248 ‘onthe remaining blank pages 8, appeal to evaluator a or equations wri 2, Any revealing of identical ny 5 portant Note: 1. On completing your answers, compulsorily draw diagonal cross USN | ‘all | | falas} 18MCAIS Time: 3 hrs. Note: Answer FIVE full questions, choosing ONE full question from each module. Module. a. (10010.1011)2= Ono iii) (2598)10= iv) (LO1011101.101 11) (ie ¥)B78)0= Or (0 Marks) bb. What are logic gaf@)2Give the symbolic nojatiofs and truth tables in the most commonly used logic gates? (10 Marks) : oR a. simptigg? pa, y, 2) = D(0, 4, 5, 7,8, 9413, 15). (10 Marks) b. Express\théBoolean function F = A B‘C using SOP. (10 Marks) Module-2 of full adder. 10 BGS Sonate First Semester MCA Degree Examination, Jan/Feb. 2021 Computer Organization Max. Marks:100 Explain with a neat cireuit and truth table b. Explain with a circuit diagram parallel adder. % OR a. Simply Few, x, ¥.2) = 213, 7, 11, 15) +40, 25). (10 Marks) b perforn the multiplication of M = 01001, and N = 01111 using Bit-pair Decoding method. . (io Marks) a ¥ ‘Modute-3 ¢ ‘a. Explain with & neat diagram finetional units. 7 (lo Marks) b. Explain’ ra neat basic operational concepts. (10 Marks) aS” ¢ OR (io Marks) a. Explain with suitable extfypte any 4 addressing modes. b. ain suitable example of basic ae & ~V ‘Module-4 a. Explain with a cireuit diagram interrupt hard-ware. b. Explain with diagram Daisy chain. OR ‘a. Explain with a neat diagra listributed BUS. b. Explain with timing of a nous BUS, Module-5 Re indifferent types of ROM. ‘ fa IK x 1 memory chip. ‘What is ROM? Explai s £. Explain with a neatdiagram organization © OR Explain with a neat diagram direct mapping oi fb os Jation look a side buffer (TLB). pa neat diagram trans!ealed 26 malpractice 5 lines on the remaining blank compulsorily draw diagonal cross 5 z i = appeal 1 evaluator a ng Your answers, 8 of identificat mp reveal 2. Any “portant Note : 1. On cor GBES Sonshle 20MCAIL isn | Sul n./Feb. 2021 emester MCA Degree Examination Data Structures with Algorithms Max. Marks: 100 Time: 3 hrs. Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 1a What are data structures? Explain the ications of data structures, (06 Marks) b. Define STACK. Write a C program to implement stack operations using arrays (by passing parameters). (08 Marks) ¢. Write a C program to conyert tnfix to postfix expression, (06 Marks) oR 2 a. Convert the following infix expression into postfix using application stack, A+ (B*C — (D/R*P)*G)*H (10 Marks) b. Implement a program in C for evaluating & postfix expression, (10 Marks) Médule-2 3 a. What is retursion? Write a program to implement tower of Hanoi problem using recursion and trate the output for 3 disks. (10 Marks) b. What is queue? Write algorithms for the primitive operations performed on queue. (10 Marks) > OR 4 a. Give the disadvantages'of'an ordinary queve and how it is solved/in a circular queue? Write C program to implement circular queue. (10 Marks) b. What are priority queue? Write a program to simulate the working of priority queue. 1 (10 Marks) Module-3. static versus dynamic memory allocation. How dynamic memory allocation is 5 a. Diffe dor (10 Marks) b. Write © program to implement following operations on singly linked list Insert a node at the endof the list Remove a nodeat ehd of list. (10 Marks) $ > ox (10 Marks) 6 a. What are the/limitations of array over linked lists? implementation of stack with suitable diagram. Also write algorithms to b. Explain push and pop ‘operation using singly linked lists (10 Marks) implement ke> m Module-4 fundamentals of algorithmic problem solving. (10 Marks) ° 7 a. Explain various steps in b. List out import em types in the study of algorithms. Explain any two of them. (10 Marks) € 1of2 &fe p Text = [Hello, How ¢ Pate tg = Ho] 10 a Write an algorithm for Write DFS graph travels a Q10 (b)). ‘ Fie 100) ween Oo (10 Marks)ie BGS Sensis pee Ll TET First Semester MCA Degree amifation, , Operating System With Uni. 20MC a1 /Feb. 2024 Max. Marks: 100 shoes ONE full question from each module. What are the various services o| rating system? Explaighbriéfly. (10 Marks) la b. Define process. Explain the at fe process model with a nea diagram, (10 Marks) OR 2 a. Calculate the verge @ jak time, turn around tinfefor (i) SJF (ii) Priority scheduling and Gii) Round Robin th the following set of processes. Process Ps Burst time 5 Priorit 3: 1 Ba 4 5 ? (15 Marks) b. Defin stugm call. Classify the paf system calls. (05 Marks) ~“ “SModute-2 plain how TLB jow TLB improtes the performance. of.demand paging 3 a. What is demand paging? with neat diagram. ay L (10 Marks) b. Consider following p: nce string : Pepe eee: 23 }, 2, 1, 2, 0, 1, 7, How many page faulf' would occur in 1 (i) FIFO G#Optimal page replacement (iii) LRU. — are 3 frames. we fae (10 Marks) Qor nt 4 a Consider, itscrmrane : A Alleestee ‘Available Aarne BCD c ; Brae 01 0° er Oe 3 ot PE" *0 NS P13 Af 2 ahs Pi 0 6 y a 6 iy Py 008 Answer the ing ae blenker' s algorithm, (i) Whata8'the’content of the mattix need? (07 Marks) Pfarrives for (0, 4, 2, 0) can the request be granted pols immediately? (08 Marks) b. What is deadlock? Wh: ie necessary conditions for a deadlock to occur? _(0S Marks) f Module-3 5 a. Differentiate with soft link. (10 Marks) b. Explain the in detail with example: @ chmod (ils mkdir (iv) chgrp (04 Marks) (06 Marks) c. Discuss the different modes of Vi editor. « len50, will be treated as malpractice 1g blank pages. ee ee ee TUGe OH TS qeamaTtin ator and for equations written eg, 42+8 ion, appeal to evalu 2. Any revealing of identitic: GHGS Sones USN | EER | 20MCAI3 First Semester MCA Degree Examination, Jan./Feb. 2021 Computer Networks Time: 3 hrs. Max. Marks: 100 10 Note: Answer any FIV Modute-1 a. Discuss about requirements of Computer Networks, b. Explain Network Architecture with respect to layering and protocols OR a. Describe OSI 7-layers model with neat diagram. b. Discuss the following:{(i) Bandwidth and latency ¢ (ii) Delay X bandwidth Module-2 a. Explain thesfollowing encoding techniques: (i) NRZ (ii) NRZ 1 (ili) Manchester encoding (iv) 4B/SB b. Discuss clotk-based framing with respect to SONET. OR * full questions, choosing ONE full question from each module. (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) a. Calculate CRC for the following data 10011010 and divisor 1101 and discuss the same at sender's and receiver's end: b. Discuss the following: (@ Stop and Wait algorithm (ii) Sliditg window algorithm Modute-3 Define virtual citeuit switching, Explain the same with necessary diagrams. Discuss the following: (i) Source Routing (ii) IPV4 Packet header ve 4 a OR a. What is'Host Configuration? ‘Explain the same with respect to DHCP. b._Disetss Distance-Vector-Roiiting algorithm witha suitable graph. Ae if Module-4 a. YHow TCP managés'byte stream? Explain, b. Discuss about Adaptive Retransmission with respect to reliable byte stream On” OR a. How rem is used tin resource allocation? Explain b. Explain the congestion-ayoidance mechanisms used in TCP cy & Modute-5 : #. Discuss about prineiplés of Ciphers in terms of symmetric-key Ciphers. b. What is key pre-digibution? Discuss the same with respect to public keys. OR ¢ Pere reel applications with respect to Electronic Mail. Discuss about Domain Name System (DNS) in detail. oe (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks)868 Senatlg f a T usN | | el | | | ] 20MCA14 First Semester MCA Degree Examination, Jan./Feb. 2021 Mathematical Foundation for Gomputer Applications Time: 3 hrs. Max. Marks: 100 Note: 1. Answer FIVE full questions, chod¥ing ONE full question from each module. 2. Use of Statistical table is permitied. dule-1 a. Define a set, empty s lelon set with example for edleh (04 Marks) (04 Marks) b. Define union and intersi /0 sets with example ¢. Find the eigen values and eigehjvectors of the matrix. ie 1-2 oy 10 0 g (12 Marks) lo TO as 9” ae re is ie earn of a set? Find the cardinality of the sets A and B where , 6, 7, 8, 9, 9} and BS {a, €, i, 0, u} (04 Marks) Avaalgt 232 students have taketta course in Java, 879/in C and 114 have taken a course in C+ Further 103 have taken @Strses in both Java-arid C, 23 have taken courses in both Java and C++ and 14 have taken courses in botif'C’and C+. If 2092-students have taken of Java, C go how many students have taken.d_course in all the three (08 Marks) AUB (06 Marks) atleast one subjects. For any three sets A, 2. © prove that i) ARUBA AB i)/AAB oi . (02 Marks) State and age 1n hole principle. « { . = 2 What is a Proposition? Let p and Sethe propositions “ “swimming in the new jersy seashore n near the sea‘ shore”. Express each of the following is allowed and sharks have ‘ propositions as afi'English sentence. (06 Marks) co ip ii) ~p> iii)poq b. Write the contra positiv®, ffie converse and.the inverse of the conditional statement “If the (06 Marks) team wins, then ip i$ raining”. proposition “e @ A (ON A(t & p)] is logically equivalent (08 Marks) }ow that the c tol(p> aa Tee 2 vy OR Show that the following, eae is valid. If Today is Tuesday, I have a test in Mathematics mics professor is sick, I will not have a test in Economics. (or) Economics. If my Today is Tuesday ai Economics professor is sick. Therefore I have a test in Mathematics. (08 Marks) b. Give the proof of the following statement, “If n is an odd integer, then n’ is odd using direct and indirect pré thod”. (07 Marks) What is the ue of Vx(x? > = x), i) Ifthe 2 jin consists of all real numbers. ii) Ifthe domain consists of all integers. (0S Marks) A e ° lof3(08 Marks) (08 Marks) en eae . Draw the Hasse di 11, 2, 3, 4, 6, 8 12) te P(X <4), P(X > iii) Find the minimum valueof K so that P(X = . The probability that a ufactured by a. fhe probability th ‘pens are manufacture two will be defective _ iti) None will be d 4 a oO For the rotate eroty fnetion eigenal. Explaid the following with their syntax dD ifelse ii) else-if ladder ii) for Statement iv) do..while statement (10 Marks) 3 a Defi (0 Marks) b. Write a C program to read details,of 1O-students and to print the marks of the student if his name is given as input using structures. (10 Marks) OR 4 a. Write’aC program to pass Structure variable as fanction argument. (10 Marks) b. Explain structures withif structure with programming example. (10 Marks) Module-3 Aas OY What is pointer? Give advantages and disadvantages of pointers in C 5 (10 Marks) : ‘able? Write a program to show a call-by-reference Bb. ee you declare a pointer vati pl Re ne OR a it factorial of a number. (10 Marks) What recursive program to find the I 1 i en ae za two pha i and to find the sum by using passing arrays to Write a C program to rea: ees functions. 1 of 210 20MCA19 Modute-4 Carry out the conversion as follows: i) (69.250 =) ii) CMOLTIDs = Ox ii) (SA3Cha = Che (10 Marks) WY) (135.43 = ie Carry out the following operations: }) 5250-321 using 10°s complement 1) 20-1000 using 9's complement in) 11010-1101 using 2's complement (40 Marks) iv) 11010-10000 using 1's completnent OR Convert the follow ing: » GDw= ) (0.6875)h0 e tm) (10110001101011)> tv) (B65F), ro ine binary Si, lain three basic operations of binary logic with their truth tables. ry logic. Exp! Ss P (10 Marks) (10 Marks) ¥) (306.D), Defi lodule-5 With a neat diagram, explain the basic functional unit ofa computer. (08 Marks) Explain big-endian and little-endian assignments (08 Marks) Explain the basic instruction types. (04 Marks) OR various condition code flags. (10 Marks) y (10 Marks) What are condition codes? Explain Explain any five addressing modes, Kaa