M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141

Transcription

1 Time : 10 Minutes M.Marks : 10 M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141 Section A (Objective Type Questions) Roll No. Enrollment No. Invigilator s Signature Attempt all questions. Each question carries 1 mark. Use the symbol ( ) in the box for marking the correct answer. Q.No. 1. Choose the correct answer- 1. Let A be an adjacent matrix of a graph G. The ij th entry in the matrix A k, gives- a) The number of paths of length k from vertex Vi to vertex Vj b) Shortest path of K edges from vertex Vi to vertex Vj c) Length of a Eulerian path from vertex Vi to vertex Vj d) Length of a Hamiltonian cycle from vertex Vi to vertex Vj 2. The operating system of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called a) Concatenation b) Garbage collection c) Collision d) Dynamic Memory allocation 3. B-Trees are generally- a) Very deep & narrow b) Very wide & shallow c) Very deep & very wide d) Cannot say 4. If a node having two children is deleted from a binary tree, it is replaced by its- a) In-order predecessor b) In-order successor c) Pre-order predecessor d) None of these 1

2 5. The post fix form of the expression (A+B)* (C*D-E) * F/G is- a) AB + CD * E - FG / * * b) AB + CD * E - F * * G/ c) AB + CD * E - * F * G/ d) AB + CDE * - * F * G/ 6. A full binary tree with 2nt / nodes contain- a) n leaf nodes b) n non-leaf nodes c) n-1, non-leaf nodes d) n-1 leaf nodes 7. A linear list of element in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a a) Stack b) Tree c) Queue d) Linked list 8. A full binary tree with n-leaves contains- a) n nodes b) Log2 n nodes c) 2 n-1 nodes d) 2 n nodes 9. A sort which relatively passes through a list to exchange the first element with any element less than its and then repeats with a new first element called- a) Insertion sort b) Selection sort c) Quick sort d) Heap sort 10. The design technique of quick sort exploit algorithm called- a) Greedy b) Divide & Conquer c) Back tracking d) Dynamic programming

3 Time : 2 Hrs. 50 Mts. M.Marks : 60 M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141 Section B (Short Answer Type Questions) Roll No. Attempt all questions. Each question carries 4 marks. Q.No.2. Explain an efficient way of storing sparse matrix in memory. Define data structure. How linear and non-linear data structure is differentiated? Q.No.3. Give a set of input representing the nodes of a binary tree. Write a program for printing entered string in reverse direction/order. Q.No.4. Explain AVL Trees; Give perfect example of it. Draw a B-Tree of order 3 for the following sequence of keys 2, 4, 9, 8, 7, 6, 3, 1, 5, 10. Q.No.5. What do you mean by ADTS graph and Digraph? Write short note on Greedy Method. Q.No.6. Differentiate the best & worst care of complexity of quick sort. Explain Divide & conquer method of representing any graph. Section C (Long Answer Type Questions) 3

4 Attempt all questions. Each question carries 8 marks. Q.No.7. How do you find the complexity of an algorithm? What is the relation between the time & space complexities of an algorithm? Define pointer. Write a program and also algorithm in C/C++ for multiplication of two matrices. Q.No.8. Define the term array. How are two dimentional array represented in memory? What is a Binary search tree? Make a BST for the following sequence of numbers 45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48. Traverse the tree in pre-order, In order & post order. Q.No.9. What is a height balanced tree? Explain how the height is balanced after addition/deletion of nodes in it. What are tournament trees? Explain by suitable example. Q.No.10. What do you understand by Game trees. Explain it by using perfect example. What are the application and properties of graph? Explain search method of graph. Q.No.11. What do you mean by Dynamic programming? Explain backtracking with the help of an example. Explain the method to calculate the address of an element in an array. A 25x4 matrix array DATA is stored in memory in 'row-major order'. If base address is 200 and w=4, words per memory cell. Calculate the address of DATA [12, 3]

5 Time : 10 Minutes M.Marks : 10 M.Sc. (CS) Second Semester Examination (Year 2016) Operating System Subject Code: MSC-202 Paper Code: TMT-142 Roll No. Enrollment No. Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1 mark. Use the symbol ( ) in the box for marking the correct answer. Q.No.1. Choose the correct answer- 2. Which of the following is not a multitasking Operating System- c) Windows b) Linux c) Windows NT d) DOS 3. In which of the Operating System response time is very cruciala) Network b) Real time c) Batch d) Linux 3. File type can be represented bya) File Name b) File Extension c) File Identifier d) None of these 4. Each has its own Index block. a) Partition b) Address c) File d) All of these 5. The aim of process scheduling is/are: a) Row average waiting time b) Predictability 5

6 c) All Job should get opportunity to run d) All of these 6. The Operating System keeps the information of file in a table calleda) File Folder Table b) File Index Table c) File Allocation Table d) Directory Index Table 7. Bring a page in to the memory when it is needed calleda) Demand Paging b) Demand Memory c) Page fault d) Page Segmentation 8. A virtual memory isa) Extremely Large Main Memory b) Extremely Large Secondary Memory c) Illusion of Extremely Large Memory d) A Memory used in Super Computer 9. To replace the page that has not been used for longest period of time called. a) Optimal Page Replacement b) FIFO Page Replacement c) LRU Page replacement d) None of these 10. Spooling can be used witha) Printer b) Software c) Hardware d) None of these

7 M.Sc. (CS) Second Semester Examination (Year 2016) Operating System Subject Code: MSC-202 Paper Code: TMT-142 Time : 2 Hrs. 50 Mts. M. Marks: 60 Roll No. Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No.2. Write name of any four Operating Systems and compare their features. What is System Call? Write various types of System Calls and explain each in brief. Q.No.3. Write name of various file operations and explain each in brief. Define all the file attributes and file access permissions. Q.No.4. What do you mean by process state? Explain the following states in brief. (i) New (ii) Ready (iii) Waiting (iv) Executing (v) Blocked (vi) Suspended (vii) Terminated. What is process synchronization? Q.No.5. What is virtual memory? Write its concepts. How it is different from other memories. Define the following terms of memory management in brief. (i) Segmentation (ii) Paging (iii) Frame (iv) Swapping Q.No.6. What is Spooling? Write its significance. Explain Block multiplexing. Section C (Long Answer Type Questions) 7

8 Attempt all questions. Each question carries 8 marks. Q.No.7. Differentiate the following and explain each (i) Multiprogramming and Multiprocessing (ii) Throughput and Turnaround time. Define Hierarchical and Extended machine view. Q.No.8. Write a detailed note on file allocation methods. What is layered file System? Write it advantages. Q.No.9. Define preemptive and non-preemptive scheduling. Find average waiting time using Round Robin Scheduling and create Gantt chart. Process Burst Time Write the Basic Interrupt mechanism? Also maskable and non-maskable interrupt in brief. P1 24 P2 3 P3 3 explain Q.No.10. Explain any two page replacement algorithms taking suitable example. Describe the basic concepts of Demand Paging. Q.No.11. Write and explain various virtual devices. Write a short note on device management?

9 M.Sc. (CS) Second Semester Examination (Year 2016) Computer Networks With Windows NT Subject Code: MSC-203 Paper Code: TMT-143 Roll No. Enrollment No. Time : 10 Minutes M.Marks : 10 Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1 mark. Use the symbol ( ) in the box for marking the correct answer. Q. No. 1. Choose the correct answer- 4. PCM is an example of conversion. d) digital to digital b) digital to analog c) analog to analog d) analog to digital 5. In transmission bits are transmitted over a single wire one at a time. a) asynchronous serial b) Synchronous serial c) Parallel d) Both (a) and (b) 6. Which topology requires a central controller or hub? a) Mesh b) star c) Bus d) sing 7. Communication b/w a computer and a keyboard involves transmission. a) simplex b) half duplex c) full duplex d) automatic 5. An unauthorized user is a network issue. a) Performance b) Reliability c) Security d) All of these 6. Which multiplexing technique transmits digital signals? a) FDM b) TDM c) WDM d) None of these 7. The layer lies between the network layer and the application layer. a) Physical layer b) Data link layer 9

10 c) Transport layer d) None of these 8. As the data packet moves from the lower to the upper layers, headers are. a) Added b) Removed (Subtracted) c) Rearranged d) Modified 9. The physical layer is concerned with the transmission of over the physical medium. a) Programs b) Dialogues c) Protocols d) Bits 10. A bridge can a) Filter a frame b) Forward a frame c) Extend a LAN d) All of these

11 M.Sc. (CS) Second Semester Examination (Year 2016) Computer Networks With Windows NT Subject Code: MSC-203 Paper Code: TMT-143 Roll No. Time : 2 Hrs.50 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No. 2. What do you mean by Networking? Explain LAN and WAN. What is Modem? Explain its role in conversion of Analog to Digital signals. Q.No. 3. What do you mean by IEEE standards? Describe ALOHA and SLOTTED ALLOHA. Q.No. 4. Describe ATM Network. What is the importance of cryptography in security? Q.No. 5. Explain Transposition cipher used in data encryption. What is Base band ISDN and Broadband ISDN? Q.No. 6. Write various features of Windows NT. Write the difference between Windows NT work station and server. Section C (Long Answer Type Questions) Attempt all questions. Each question carries 8 marks. 11

12 Q.No. 7. Write the difference between the following a) Analog & Digital Signals b) Asynchronous and Synchronous Transmission What do you mean by Topology? Explain various topologies. Q.No. 8. Describe CSMA and CSMA/CD. Explain various transmission media. Q.No. 9. Describe traffic shaping and congestion control. Why routing algorithms are used? Explain shortest path routing algorithm. Q.No. 10. Describe PBX Network. Explain source routing bridge and transport bridge. Q.No. 11. Describe windows Kernel and its subsystem. Describe system level restrictions in Windows NT

13 M.Sc.(CS) Second Semester Examination (Year 2016) Programming in Java Subject Code: MSC-204 Paper Code: TMT-144 Roll No. Enrollment No. Time : 10 Minutes M.Marks : 10 Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1 mark. Use the symbol ( ) in the box for marking the correct answer. Q. No. 1. Choose the correct answer- 1. Java source code is compilet into- a) Exe b) Obj c) Source code d) Byte code 2. Which of the following is used to interpret and execute Java applet classes hosted by HTML? a) appletshow b) appletwatcher c) applet viewer d) applet screen 3. Which of the following is not a keyword in Java? a) abstract b) finalize c) boolean d) assert 4. Which of the following converts human readable file into plateform independent code file in Java? a) JVM b) Compiler c) JRE d) Applet 5. JVM stands for- a) Java Virtual Mechanism b) Java Virtual Memory c) Java Virtual Machine d) Java Virtual Management 6. Bytecode is given as input. 13

14 a) JRE b) JVM c) Linker d) Assembler 7. Which of the following is not a primitive data type? a) byte b) enum c) int d) short 8. When does Exceptions in Java arises in code sequence? a) Run Time b) Compilation Time c) Can occur Any Time d) None of these 9. Which of these clause will be executed even if no exceptions are found? a) throws b) throw c) finally d) catch 10. Which of these keywords is used to refer to member of base class from a sub class? a) upper b) super c) this d) None

15 M.Sc. (CS) Second Semester Examination (Year 2016) Programming in Java Subject Code: MSC-204 Paper Code: TMT-144 Roll No. Time : 2 Hrs.50 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No. 2. Write down advantages of java language. Write a program to insert an applet in a web page. Q.No. 3. Explain use of command line argument with example. What is inheritance? Explain its types? Q.No. 4. Explain about try-catch functionality in Exception Handling Explain abstract classes and abstract methods. Q.No. 5. Explain various stream classes of Java? What is Threading? Explain. Q.No. 6. Write short notes on Media Tracker class. Explain the need of Image Filter class. Section C (Long Answer Type Questions) Attempt all questions. Each question carries 8 marks. 15

16 Q.No. 7. Explain the steps involve during application development in JAVA. What is an applet? Explain how applets are used in net based application. Q.No. 8. Differentiate between Class and Interface. What is the need of interface? Explain. What is constructor? Explain with examples. Q.No. 9. Explain the differences between packages and interfaces. What is Exception? Also explain its types. Q.No. 10. Write a note on TCP/IP Socket programming. Write a program for TCP socket connection in Java. What is datagram? Explain the datagram packet and datagram server and client. Q.No. 11. What do you understand by scroll pane? Explain its events. What are the advantages of swing over AWT?