You are on page 1of 10
4 cst 4th Semester Diploma Engineering Examination, 2019 ~ Subject : Data Structure and Algorithm @® Full Marks : 80 Subject Code : CSE-402 0080000 Time : 3 Hours eiceetee Pass Marks : 26 | “Answer in your own words Answer five questions in which Question No. | is Compulsory and answer any four from rest questions. All questions carry equal marks. 1, (a) Heap allocation is required for languages that support AT recuision (Gi) dynamic data structure (ii) dynamic scope rules (iv) None of the above (b) In worst case, the number of comparisons needed to search single linked list of length mn for a given element is A) logan wy Git) logy +1 wn (©) “The result of evaluating the postfix expression 10 5 + 60 6/* 8-is, ( 288 Gi) 213 ity 142 wn (4) The maximum number of binary trees that can be formed with three unlabelled node is Jt ae 1) An operator stack Gi) An operand stack Aili) (9) and Gi) both (iv) parse uee (®) In STACK, insertion and deletion of data done at same end. Janie/False (i) Linked list is not suitable for (i) Insertion sort Gi) Binary search i) Rablin sort _S®) Polynomical manipulation (i) Trees are linear data structure. True/Eatse Please Turn Over > ‘ 402 @) go” Nilowts are the sorting algorithms which can be Performed on the set of data. Which are stored in single linked list? (@) Bubble sort () Insertion sort (© Quick sort (@) 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 j 3. Explain the different operations on single linked list with pseudolody. ® 16 4 ibe Circular queues and De-queues. - “ 0008006Q _-Y Explain the different applications of stacks. @polytechnicwalle 6 (©) Write a program for finding the factorial of n by recursion. ~ (@) Explain the representation of queue using linked list. 4 5] Wat is Hash Tables? Describe some hash function which are applied in various applicatio 248210 _ Sortie advantage and disadvantage of linked list representation of binary tree. 6 6 (a) A binary tree is given with the sequential storage re resentation. Write the program/algorithm to copy the binary tree into linked storage represent tation, 8 (b) Apply DFS and BFS to complete graph of four vertices. List the vertices in the ‘order they would be visited. 8 ® 90089080 @polytechnicwalle ms w 403 6 Vy 1 a ECEICSE 4th Semester Diploma Engineering Examination, 2019 Subject :Computer Hardware & Peripheral @® Full Marks : 80 Subject Code : ECE-403 : : 9o0a09e0 Time : 3 Hours @polytechnicwalle Pass Marks : 26 ‘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. i Gg ‘what location are the first computer instruction available on boot-up? (@) ROM BIOS (b) CPU {GY boot in (@) CONFIG. Sys. i)/ Which of the following is not a magnetic storage medium (a) Floppy Disk (b) Hard Disk \Migital Versatile Disk (A) Cassettes and Cartridge (iii Which device in micro processor stores the data to be processed? we ROM RAM (©) Registers _ @) ALU (y) ich of the following is not a peripheral hardware device in a computer system? (@) Keyboard = (b) Optical Drive (© HDD Printer (v// Which are the processor based on RISC? @® (a) SPARC 9780386 90080900 (©) MC68030 (a) Mc68020 SS Which of the following coordinates various opecetions using timing signal? (a) Control unit (b) Memory unit 4607 Tnput-Output unit (@ ALU oh ‘The bus used to connect the monitor to the CPU is Or Scst bus (a) PCI bus (b) Memory bus (@) RAM bus ( A hard disk is divided into hacks which are further subdivided into (a) clusters sectors (©) vectors (@) heads 12693 Please Turn Over a a ©. as es) ayy 2. (@) What are different Role of Operating System, Explain it, (b) Write notes on virtual memory and paging. a 3 QAExplain the various addresing modes. (©) Write notes cn: @® @ Overfiow detection @Aians ag Fact pertain at do you understand by DMA? Discuss its importance. 0) Explain the strvcture of computer system with diagram, ( ferent between ihe RISC & CISG. mY tbe” a Ags Discuss Hymn’s clsieaon i in brief (a) Divide algorithm 6 vA (b) Vector and Array processor ao ‘Magnetic memories / s (@) Centralized and distributed architecture Explain operation of two peripheral clips. 4 vo 403 CSE 4th Semester Diploma Engineering Examination, 2019 Subject : Operating System @ Full Marks : 80 Subject Code : CSE-403 epeyisemnewal nicws 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 rest questions. All questions carry equal marks. 1. (i) FCFSisnon-preempive scheduling algorithm. (Trve/False) ‘Which ofthe following is not shared by the threads of the same process? Ih Stack (b) Address space (c) FDOT (d) Message queve (ii) Fortime shared system scheduling techniques are used. (®) SF WF Round Robin (o) FCFS (@) Elevator @® (iv) Semaphore operations are atomic. (True/Faise) 00080000 (w) Where does the swap space reside? @polytechnicwalle (a) RAM () ROM Disk (4) On chip cache wi) (vii) Viral memory is implemented by using _ techniques. (viii) Which page replacement policy sometimes leads to more page faults when size of memory is isa program segment where shared resources are accessed. increased? (a) Optimal py irv (c) FIFO LAX’ None of these 2. (a) Explain the different functions of operating system. (b) What is system call? (c) Explain the layered structure of operating system, (@) List the features of windows 7 OS. (e) Write Booting steps. HIHH42=16 12698 Please Turn Over 6 hy 403 @ - ‘ a (2) Syn is process? Describe diffessanstatcs ok process . aa_— (b) Explain different classical IPC problems. 4. (97 Explain different process scheduling techniques, alt (/ What is deadlock? Mention the necessary conditions which S. (g)/Explain VO mechanism. > (b) Describe directory structure. (c) Explain different page replacement algorithms. results in deadlock. 6. Write short notes on: @poly jicwalle wn (24648216 10+6=16 44448216 4xd=16 a ECEICSE 4th Semester Diploma Engineering Examination, 2019 Subject :Computer Hardware & Peripheral FauMarks 80 Subject Code : ECE-403 ® Time: 3 Hours 29922000, Pass Marks 26 Fawn words. Answer in your OW" No, 1 is Compulsory and Answer five questions in which question No. | I ‘answer any four from rest question. All questions carry equal marks 5 cup? 1 From what location are the fit compoterinstrctionavaable on BOOe- WP (@) ROM BIOS ) cru 6 ba (@ CONFIG. Sys. (ii) Which ofthe following is not a magnetic storage medium (a) Floppy Disk (0) Hard Disk G Digasi Veroate Dix (@) Cassettes and Cartridge (ii) Which device in micro processor stores the data to be processed? (a) ROM (b) RAM mama @ aw Giv) Which ofthe following is nota retipheral hardware device in a computer system? (a) Keyboard (b) Optical Drive (© HDD (8) Printer (¥) Which are the processor based on RISC? @® (@) SPARC () 80386 e00a0eea (©) MC68030 Cyn |. Os (vi). Which ofthe following coordinates various operations using timing signal? (a) Controt unit (b) Memory unit (©) Input Output unit (@ AL (vii) The bus used to connect the monitor to the CPU is. : (2) PCI bus (6) SCSI bus (b) Memory bus (@ RAM bus (viii) hard disk is divided into hacks which are further subdivided into (2) clusters (o weeties (©) vectors (@ beads 12693 Please Turn Over ———____ Scanned by CamScanner aT (2) @) Wi e difte = "ie ne different Role of Operating System, Explain it. THe Notes on virtual memory and paging. (a) Explain the various addresing modes. (b) Write notes on: (i) Overflow detection 0008006Q : @polytechnicwalle (ii) Status flag (a) What do you understand by DMA? Disct (b) Explain the structure of computer system With diagram, (c) Differentiate between the RISC & CISC. (a) Discuss Hymn's classification in brief. (b) Explain bus architecture. Write notes on any two: ® (a) Divide algorithm @polytechnicwalle (b) Vector and Array processor fc) Magnetic memories (d) Centralized and distributed architecture Explain operation of two peripheral clips. ~~ 40s

You might also like