405 ECEICSE 4th Semester Diploma Engineering Examination, 2019 ‘Subject : Data Communication and Computer Networking Full Marks : 80 Subject Code : ECE-405 ‘Time : 3 Hours Pass Marks : 26 ‘Answer in your own words, Answer five questions in which Question No. 1 is compulsory and answer any four from the rest questions. All questions carry equal marks. 1. Choose the correct answer: 2816 (i) HOST mode! dialogue control and token management are responsibilities of (a) session layer (6) transport layer (c) physical layer (2) network layer (ii) Network components are connceted to the satne cable inthe topology. (@) mesh () bus (©) star (@ ring (iii) Frequeney Division Multiple Access (FDM) assigns. channels to users (@) individual, individual (b) many, individual (6) individual, many (@ many, many iv) The packet of information atthe application layer is called (a) Packet () Message (©) Segment (@) Frame (6) Multiplexing is used in (a) Packet Switching () Circuit Switching (©) Data Switehing (@ Allof these (vi) Application layer protocol defines (a) types of messages exchanged (b) message formar . syntax and semantics, (©) rales for when and how processes send and respond to messages. (@) Allof the above 12695 Please Turn Over405 a (vii) Two board categories of congestion control are (a) open-loop and open-loop. (b) open-control and closed-control. (©) active-control and passive-control. (4) None of these ‘The packet sent by a node to the source to inform it of congestion i called (a) Explicit {b) Discard (©) Choke (a) Backpressure 2. Explain the OSI model for networking in brief. How does it differ from TCP/IP model. 3. (a) Explain Digital to Analog conversion techniques. (b) What is Multiplexing? Explain different types of Multipleving. 4, What is meant by topology? Explain the topologies ofthe network. 5. Explain the two approaches of packet switching techniques. 6. Explain error detection and error correction techniques briefly Explain the two approaches of packet switching techniques. 8. Write short notes on arty nve ofthe following (a) Modem (b) Guided Media (6) Distance Vector Routing () FDMA403 ECEICSE 4th Semester Diploma Engineering Examination, 2019 Subject Computer Hardware & Peripheral Full Marks : 80 Subject Code : ECE-403 Time : 3 Hours Pass Marks ‘Answer in your own words, Answer five questions in which question No. | is Compulsory and answer any four from rest question. All questions carry equal marks. 1, (i) From what location are the first computer instruction available on boot-up? (a) ROM BIOS (b) CPU (6) boot in (4) CONFIG. Sys. Gi) Which of the following is not a magnetic storage medium (a) Floppy Disk (b) Hard Disk (©) Digital Versatile Disk (4) Cassettes and Cartridge (iii) Which device in micro processor stores the data to be processed? (@) ROM (®) RAM (c) Registers (@ ALU (Gv) Which of the following is not peripheral hardware device in a computer system? (a) Keyboard (©) Opdcal Drive (©) HDD (8) Primer (6) Which are the processor based on RISC? ay SPARC (b) 80386 (©) MC68030 (s) Mc6s020 (i) Which ofthe following coordinates various operations using timing signal? (a) Control unit (b) Memory unit (6) Inpu-Ourput writ (@ ALU (i) The bus used to connect the monitor to the CPU is : (a) PCI bus (b) SCSI bus (b) Memory bus (@) RAM bus (silty A hard disk is divided into hacks which are further subdivided into (a) clusters (b) sectors (©) vectors (2) beads 12693 Please Turn Over403 3: 4 (2) (a) What are different Role of Operating System. Explain it. (b) Write notes on virtual memory and paging. (a) Explain the various addresing modes. (b) Write notes on: (i) Overflow detection (i) Status flag (a) What do you understand by DMA Discuss its importance. (b) Explain the structure of computer system with diagram, (c) Differentiate between the RISC & CISC. (a) Discuss Hymn's classification in bref. (b) Explain bus architecture, Write notes on any two: (a) Divi algorithm (b) Vector and Array processor (©) Magnetic memori (d) Centralized and distributed architecture Explain operation of two peripheral clips.403 CSE 4th Semester Diploma Engineering Examination, 2019 Subject : Operating System Full Marks : 80 Subject Code : CSE-403 Pass Marks : 26 Time : 3 Hours Answer in your own words. Answer five questions in which Question No. | is compulsory and answer any four from rest questions. Alll questions carry equal marks. 1G) FCFS is non-preemptive scheduling algorithm. (True/False) (ii) Which of the following is not shared by the threads of the same process? (a) Stack (b) Address space (©) FDT (a) Message queue (iii) For time shared system scheduling techniques are used, (a SIF (b) Round Robin (©) FCFS (@) Elevator (iv) Semaphore operations are atomic. (True/False) (v) Where does the swap space reside? (a) RAM (b) ROM (©) Disk (4) On chip cache wi) is a program segment where shared resources are accessed. (vii) Virtual memory is implemented by using _ techniques. (viiiy Which page replacement policy sometimes leads to more page faults when size of memory is, increased? (a) Optimal (b) LRV (c) FIFO (d) None of these 2. (a) Explain the different functions of operating system. (by What (©) Explain the layered structure of operating system, system call? (4) List the features of windows 7 OS (e) Write Booting steps. 44244442=16 12698 Please Turn Over403 @ 3. (a) What is process? Describe different states of process, (b) Explain different classical IPC problems. 4. (a) Explain different process scheduling techniques. (b) What is deadloe 2 Mention the necessary conditions which results in deadlock, 5. (a) Explain YO mechanism. (b) Describe directory structure. (©) Explain different page replacement algorithms. 6. Write short notes on (a) Spooting (b) Ms-DOs (©) Swapping (2) Segmentation of memory (2+6)48=16 44448216 4xd=16404 4th Semester Diploma Engineering Examination, 2019 = Subject : Data Base Management System Full Marks : 80 Subject Code : CSE 404 Time : 3 Hours Pass Marks : 26 Answer in your own words. Answer five questions in which Question No. | is compulsory and ‘answer any four from the rest questions. All questions carry equal Marks. 1. (i) There is always a decomposition into BCNF that is lossless and dependency preserving. CrueFalse) Gi) Any relation with two attributes is in BNF, (True/False) (iii) relation in which every key has only one attribute is in 2 NF. (True/False) (iv) Every relation in 3 NF is also in BCNF. (True/False) (s) Which normal form is considered adequate for normal relational database design?” (a) 2NF (b) SNF (c) 4NF (d) 3NF (0) Which level of locking provides the highest degree of concurrency in relational database? (a) Page (b) Table (c) Row (d) All of these (vii) model is used for database des (a) Data Flow (b) Flow Chart (¢) E-Rmodel_—_(d) None of these (viii) Let R = (A. B. C, DE, F) be a relation scheme with the following dependencies C > F,E— A, EC + D,A > B, which of the following is key for R? (@) cD (b) EC () AE @ Ac (a) What is data model” List the types of data model used (b) List any 6 applications of DBMS (c) List the disadvantage of file processing system, (4) Explain the role of DBA. (244) 34344=16 3. (a) What is E-R diagram? Draw the E-R diagran/E-R model for Hospital Management System, (b) Describe the different keys in relational model, (2+6)+8=16 4. (a) Write Codd’s relational database rules. (b) Explain entity integrity and referential integrity. (c) Explain various Data Definition Commands in details with syntax and example, 6+(2+2)+6=16 12699 Please Turn Over404 @) 5. (a) Define functional dependencies. Explain First, Second and Third Normal Form with relevant table. (b) What is transaction? Explain the ACID properties, 10+(2+4)=16 6. Write short notes on any neo of the following: 8x2=16 (a) Time stamp ordering protocol (b) Cursors and triggers (6) Transaction control language (a) Distributed database402 CSE 4th Semester Diploma Engineering Examination, 2019 ta Structure and Algorithm Full Marks : 80 Subject Subject Code : CSE-402 Time : 3 Hours Pass Marks : 26 ‘Answer in your own words. Ansier five questions in which Question No. 1 is Compulsory and answer any four from rest questions. All questions carry equal mark (a) Heap allocation is required for languages that support (recursion (ii) dynamic data structure (iii) dynamic scope rules (iv) None of the above (b) In worst case, the number of comparisons needed to search single linked list of length m for a given element is (i logan a ii) logan #1 iv) n (c) The result of evaluating the postfix expression 10 5 + 60 6/* 8-is (i 284 Gi) 213, ii) 142 (i) 71 (4) The maximum number of binary trees that can be formed with three unlabelled node is @ i) 5 ii) 4 (iv) 3 ion to the postfix form (e) Which of the following is essential for converting an infix expres efficiently? (Am operator stack (Gi) An operand stack ii) (i and Gi) both iv) parse tree (0) In STACK. insertion and deletion of data done at same end. True/False (i) Linked list is not suitable for ( Insertion sort Gi) Binary search (iii) Rablin sort (iv) Polynomical manipulation (j) Trees are linear data structure. True/False 12697 Please Turn Over402 @ Following are the sorting algorithms which can be performed on the set of data. Which ase stored in single linked list? (a) Bubble sort (b) Insertion sort (©) Quick sort (A) Merge sort Write the code for the above mentioned sorting methods using linked list data structure. Also obtain the comparative study of the above sorting methods. 1244216 Explain the different operations on single linked list with pseudolody. 16 (a) Describe Circular queues and De-queues. Sp) Explain the different applications of stacks. (©) Write a program for finding the factorial of n by using recursion, (@) Explain the representation of queue using linked list. bh ee (a) What is Hash Tables? Describe some hash function which are applied in various applications. 248210 ‘of linked list representation of binary tree. 6 (b) Write the advantage and disadvanta (a) A binary tree is ven with the sequential storag representation, Write the progranvalgorithm. to copy the binary tree into linked storage representation, 8 (b) Apply DFS and BFS to complete graph of four vertices. List the vertices in the order they would be visited. 8