End-Term Examination Second Semester [MCA] MAY-JUNE 2006

Transcription

1 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1. is compulsory and is of 20 marks. Attempt one out of two questions from remaining four units. All questions in units are of 10 marks each. Q. 1 (a) Differentiate between the terms variable and parameter. (b) Determine the length and number of substring of string THREAD. A* (B + C) * D/E. (c) Find the number of elements in the array A (1:8, -5:5, -10:5). Which will be the first and the last element of this array (d) When is a link list better than arrays. (e) Why infix expressions are converted into postfix expressions. (f) Circular Queues is better than linear queues. Justify the statement. (g) A given binary search tree is to be sorted. Which traversal method should be applied? (h) Why searching is easier in sorted list. (i) Discuss any one hash function. (j) What is a B-tree? Q. 2 (a) Given a linear sorted array having N elements and that it can store MAX elements. Write an algorithm to insert the contents of ITEM into it. (b) Consider a linked list defined by START. It has a node with address P. Write an algorithm to split it into two link lists one starting with START and second has P as into first node. Q. 3 (a) The element of a binary tree. A B C D E F G Have to be stored in an array. Write the desired algorithm. Te output should also indicate number of elements in the tree.

2 (b) Find the path matrix using WARSHALL algorithm for the graph G. G A B G D C Q. 4 (a) Given list of numbers arranged in the form of linear array 44, 33, 11, 51, 77, 90, 99, 22. Using quick sort algorithm find the element of the array when 44 is set it position. Also discuss the status of STACK. (b) Given the sorted list in the form of linear arrays having N and M elements. Write an algorithm to MERGE these lists into a single sorted list. The name of the elements these are repeated is to be enumerated. Q. 5 (a) What is file organization? Why it is needed. Discuss in detail sequential file organization with its MERITS and DEMERITS. UNIT III Q. 6 Write an algorithm to convert a given infix expression into an equivalent portfolio expression. Illustrate the working of the algorithm on the following infix expression. ((8*7) + 4) * (7+9)/6-10 Q. 7 Describe any two of the following algorithms: (a) Kruskal s Algorithm (b) Shell Sort (c) Polyphone Merge sort

3 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY 2005 Time: 3 Hours Maximum Marks: 60 Q. 1 (a) Define B-Tree (b) Convert following infix expression into prefix and postfix A* (B + C) * D/E. (c) Give the difference between external and internal sorting. Give names of some external sorting techniques. (d) Define stack and give some application s of stacks. (e) How many nodes are there on level I of a binary tree? Prove the answer. (f) Define transitive closure of a graph. (g) Define inverted files. (h) Describe adjacency list representation of graph with the help of an example. (i) Give two examples of Hash function. (j) Give difference between complete and full binary tree. UNIT - I Subject: Data Structure Note: Question 1. is compulsory and is of 20 marks. Attempt one out of two questions from remaining four units. All questions in units are of 10 marks each. Q. 2 How polynomial are represented using linked list. Write program for addition of two polynomials represented using linked list. Q. 3 Explain with the help of algorithm how infix expression converted to postfix expression using stack. UNIT - II Q. 4 Write Prim s algorithm for finding minimum cost spanning tree. Show its working on a graph. Q. 5 Explain how trees can used for representation of disjoint sets. Explain Union of find operations on these sets. UNIT - III Q. 6 Explain Merge sort algorithm and show its working on following members 4, 10, 2, 6, 8, 12, 5, 7

4 Q. 7 What is hashing? What are various types of Hash functions? What are various methods of collision resolution? UNIT - IV Q. 8 What do you mean by file organization? Explain various file organization techniques. Q. 9 Write short notes on any two of the following Index techniques (d) Cylinder surface indexing (e) Hashed Indexes (f) Tree indexing

5 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY 2004 Time: 3 Hours Maximum Marks: 60 Note: Attempt any five questions. Subject: Data Structure Q. 1 (a) What is difference between Big-O and Small-O notation. Define them. 4 (b) Give an example of algorithm that has following complexity (in terms of Big-O). 4 (i) O (1) (ii) O(N) (iii) O (N 2 ) (iv) O (n log n) (c) Algorithm 1 does a particular task in time N 3 where N is no. of elements processed. Algorithm 2 does same task in time 3N (i) What are Big-O requirement of each algorithm. (ii) Under what conditions, if any, would the less efficient algorithm executes more quickly than more efficient algorithm? Q. 2 (a) Write a procedure to print elements of a singly linked list in reverse order while traversing it only once. 6 (b) Let a queue be implemented as a circular linked structure with an external pointer accessing the rear element: 6 (i) Draw a sketch of such a queue with one node. (ii) Write a algorithm for insertion and deletion. Q. 3 (a) Write an algorithm to implement selection sort. 7 (b) Sort the following numbers (Showing each iteration) using 5 Quick Sort :- 57, 73, 43, 77, 83, 63, 87. Q. 4 Write a algorithm to convert infix expression to postfix expression using stack. Also, write an algorithm to evaluate postfix expression. 12 Q. 5 Define sparse matrix. Implement sparse matrix as an array. Give an algorithm to transpose a sparse matrix for this implementation. 12 Q. 6 (a) What do you mean by file organization? Differentiate between sequential, hashed and random file organization. 6 (b) What is aim of hashing? What are different hashing techniques? What are the problems encountered in them and how to overcome them. 6

6 Q. 7 (a) Write a algorithm for topological sort of a graph. 7 (b) Taking an example of a graph. Show how breadth first search operates on this graph. 5 Q. 8 Write short notes on any three of the following :- 3 x 4 (a) Balanced Merge sort (b) Critical path (c) B + tree (d) B-tree

7 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY 2003 Time: 3 Hours Maximum Marks: 60 Note: Attempt any five questions. Subject: Data Structures Q. 1 (a) Explain why there might be tradeoffs between saving computer (Execution) time and saving programming time. 3 (b) Explain the difference between sequential array based representation and linked representation of a list with examples. 4 (c) Explain the difference between internal and external sorting with example. 3 (d) Define Big-O notation. 2 Q. 2 (a) Write a procedure in C/C++ to add two single variable polynomial using linked list. 7 (b) Write an algorithm that implement insertion and deletion operation on circular queue. 5 Q. 3 (a) Formulate an algorithm to implement insertion sort. 6 (b) Derive time complexities for insertion sort, quick sort, and selection sort. 6 Q. 4 (a) Define B-Tree. What is the difference B-Tree and B + -Tree. 5 (b) Construct an AVL tree in which element are inserted in following order : 72, 44, 100, 200, 30, 57, 10 5 (c) What is difference between tree, binary tree and a graph? 2 Q. 5 Write a non-recursive algorithm for preorder traversal of a tree. Give example also. 12 Q. 6 (a) Write an algorithm to implement breadth first search for a graph. 6 (b) Taking an example of graph, show how depth first search operates on the graph. 12 Q. 7 What is sparse matrix? Implement sparse matrix as an array. Give an algorithm to add and subtract two sparse matrices for this implementation. 6 Q. 8 Write short notes on any three of the following :- 12 (a) Polyphase mergesort. (b) Search Tree (c) Inverted Tree (d) Hashing

8 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] JUNE 2001 Time: 3 Hours Maximum Marks: 70 Note: Attempt any five questions. Subject: Data Structures Q. 1 (a) Write a routine, which reads the matrix, If non-zero elements are less than 25% of total elements, it converts this matrix to SPARSE matrix representation. 7 (b) What is advantage of circular queues over queues? Write add & delete routine for it. 7 Q. 2 (a) Differentiate between tree and binary tree. 4 (b) Write a module for insertion of node t as right child of s in threaded binary tree. Clearly explain its working using a suitable binary tree. 10 Q. 3 (a) Write a routine for traversal of singly linked list without using any additional node. 9 (b) What do you mean by dynamic memory allocation? In which cases, it is used. 5 Q. 4 (a) Write PUSH & POP routines for linked stack. 6 (b) How do you determine run-time of algorithms? Give an example of O (n log n). 5 (c) Define generalized lists. 3 Q. 5 (a) Assume that we have a sorted array of elements in descending order. Can binary search algorithm still be implemented on it? If yes, write the modified algorithm. If not, justify why not? 7 (b) If a list is already sorted in descending order, how fast will be insertion sort for ascending? Clearly explain. 7 Q. 6 (a) For an undirected graph G with n vertices & e edges, show that 6 n d 1 = 2 e where d 1 = degree of vertex i. i =1 (b ) By considering the complete graph with n vertices, show that no. of spanning trees is atleast 2 n

9 Q. 7 (a) Write an algorithm to insert a new key value X into a tree in which the keys are sampled from left to right, one character at a time. 7 (b) Define and explain inverted files. 7 Q. 8 (a) How overflow is handled in hashing. 10 (b) Define and explain cellular partitioning

10 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] AUGUST 2000 Subject: Data Structure Time: 3 Hours Maximum Marks: 70 Note: Attempt four questions in all, including Q. No. 1, which is compulsory. Q. 1 (a) What do you mean by data structure? Explain with the help of two examples. 3 (b) What do you mean by complexity of an algorithm? Explain with an example.3 (c) Define a Binary Search tree. Draw the expression tree for the following: x : = (a<b) or (e < f) 3 (d) Determine the order in which the vertices of following binary tree will be visited in post order traversal (e) Write a function in C that will count the number of nodes in linked binary tree. 5 (f) Convert following INFIX expression to POSTFIX expression A+ (B*C) * (D + E) * F 2 (g) Give the average case and worst case complexity for the following algorithm (i) Selection Sort (ii) Quick Sort 4 (h) Define AVL tree. Convert the following into an AVL tree. 4 7 (i) 1 (ii)

11 (i) Describe briefly sequential file organization with an example. 3 (j) What is the difference between internal and external sort. 2 (k) Write a function in C to delete a node, different from first and last node, from a linked list. 4 (l) Give the node structure of a binary search tree. Using it write a recursive function to traverse a tree in preorder. 4 Q. 2 Give the array implementation of the stack. Write function for pushing and poping elements from a stack. 10 Q. 3 Draw a binary search tree when the keys arrive in the given order. 10 p, x, b, e, a, c, f, y, q, r Delete the nodes containing the keys in the following order a, e, x Q. 4 Describe the heap sort method for sorting the following list 10 15, 16, 13, 19, 5, 7, 4, 18 Show the result of the intermediate steps also. Q. 5 (a) For the following digraph Obtain the transitive closure. Give the steps for finding the transitive closure. (b) Write a recurrence relation for obtaining n th terms of the Fibonacci series. 3 Q. 6 Write a program in C to implement depth-first traversal of a graph. 10 Q. 7 Define a B-tree. Draw a B-tree of order 5 when the keys arrive in the following order. a, f, g, b, h, d, j, m, s, e, r, i, e, x, n, l, u, t, p and then delete the keys in the reverse order of arrival. 10 Q. 8 Give the array implementation of a circular queue. Write functions in C to insert and delete an element from circular queue

12 END TERM EXAMINATION Second sem[mca] MAY-2008 Q1. (a) What is subscripted variable, why it is needed? (b) Difference between TRAVERSING, SEARCHING AND SORTING. (c) How local variable differ from GLOBAL VARIABLES. (d) Determine minimum number of bits required to store a character in the memory of the computer assuming the programming language require atleast 48 characters. (e) Explain the formula required to determine the address of the element of n subscripts. (f) For searching operation which is better ARRAY OR LINKED LIST. (g) Define DEQUEUES. What is their need? (h) What is the advantage of INORDER THREADING IN TREES? (i) Why Data files are needed? (j) Draw an undirected graph with 5 nodes and 7 edges. (2x10=20) Q2. (a) Input a two dimensional array of order mxn. Write an algorithm which should output this array and another two dimensional array (m+1)x(n+1), in which the elements of (m+1) row should be the sum of elements of m rows of (n+1) column should be the sum of n columns. (b) Translate the infix expression Ax(B+C)/D-Ex(F+G/H-K) into Postfix expression in showing the position of stack after each operation. (10) OR (a) Consider a sorted list defined by FIRST. Write an algorithm to insert the Content of ITEM in it. (b) Given the function:- A(m,n) = n+1 if m=0 = A(m-1,1) if m 0 but n 0 = A(m-1,A(m,n-1)) m 0,n 0 Obtain the value of A(1,3) showing each steps. (10)

13 Q3. (a) E denotes the following algebric expression [a+(b-c)]x[(d-e)/(f+g-h)] Draw Binary tree. Change it in to prefix expression using TRAVERSAL method. (b) Define Adjoint Matrix. Obtain the matrix A for the graph. Also compute A 2. (10) OR (a) Given a binary search tree. Write an algorithm to add the contents of ITEM. (b) Define Path Matrix. Obtain the path matrix for the above graph. (10) Q4. (a) Describe the algorithm of Bubble Sort. Trace it using following Numbers 25, 57, 48, 37, 12. (b) Define HASHING. Find the digit hash address of each number 9614, 2885, 3176, 9044, 5281 using method with m=79. (10) OR (a) Using the algorithm of QUICKSORT determine the position of P in PLEASURE showing the contents after each iteration. (b) Given a sorted of n elements. Show by taking an example of at least six elements that BINARY SEARCH is better than Linear search. (10) Q5. Mention different types of file organization. Explain in details RANDOM File organization. (10) OR What is indexing? What are its different ways? Explain in details TREE indexing. (10)

14

15 (Please write your Exam Roll No.) Exam Roll No. END TERM EXAMINATION SECOND SEMESTER (MCA) MAY-JUNE 2009 Paper Code: MCA-102 Subject: Data Structures Paper Id: (Batch: ) Time : 3 Hours Note: Q. is compulsory. Intenal choice is indicated. Q1. Answer any ten from the following: Maximum Marks:60 (2x10=20) (a) (b) Give examples of time-space tradeoff. How would you create generic data structures (capable of holding data of any type) in C? (c) (d) (e) (f) (g) (h) (i) What are Priority Queues? What are their applications? What is the time complexity of insert and delete operations in a linked queue if pointer to the head of the queue is maintained. Give an example situation where a duoublestack can utilized more efficiently than two separate stacks. Which traversal order would you prefer to clone a BST? Why? Demonstrate insert operation in an AVL tree for the key values: 10, 20, 30, 5 and 7? What are decision trees? Where are they used? What is Transitive Closure of a graph? How would you generate it?

16 (j) A list is ordered from smaller to largest when a sort is called. Which sorting algorithm would take the shortest time to execute? Justify. (k) (l) (m) (n) (o) Name an O(n) sorting algorithm with its drawback? Describe any two hash functions. What limitations are added to external sort algorithms when the data is stored on tape drives? How many disk accesses are required in direct addressing mode of random file organization if the records have variable length? Justify. Name a file organization technique that supports batch Operations and range queries efficiently. Justify your choice. UNIT-I Q2. (a) Write a C program that converts a sparse matrix (less than 25% populated) to a linked list of its non-zero entries, ensuring that the original data can be retrieved back from this linked storage. (5) (b) Evaluate and compare the average case time complexity Of Binary Search and Linear Search algorithms. (5) OR Q3. (a) Write a C function to merge two sorted linked lists into new sorted list. (5) (b) (c) Give any three applications of stacks and queues each in System Programming. (3) List advantages and disadvantages of arrays over linked lists. (2)

17 Q4. (a) Write a C function to insert a node in a threaded BST. (5) (b) What is topological sorting of a graph? Show the working of the topological sorting algorithm (clearly stating the output after each pass) for the graph whose adjacency matrix is given below: (5) Q5. (a) Write a C program to delete a node from binary search Tree. (5) (b) Show the working of Prim's algorithm on the following Graph: (5) UNIT-III Q6. (a) Demonstrate the working of Shell Sort Algorithm on the Following list taking 5, 3, 1 as increment values: (5) 22, 7, 5, 1, 10, 9, 20, 12, 35, 16, 11, 8, 3, 25, 6

18 (b) Explain the working of balanced K-way merge sort using 2K and K+1 tapes. Explain the advantages and disadvantages of the two approaches. (5) OR Q7. (a) Explain various collision resolution techniques, while hashing a set of keys clearly stating their advantages and disadvantages. (5) (b) (c) Demonstrate the working of polyphase merge sort with three tapes, give that initial number of sorted run is 55. (4) How would polyphase mergesort proceed if the initial number of runs is not a Fibonacci number? (1) UNIT-IV Q8. (a) Explain Cylinder surface indexing and the mechanism used for searching a record using this indexing technique. (5) (b) (c) Explain the usage of cellular partitions for organizing file storage. How can this technique be used for improving efficiency of read write operations? (4) While searching a key, how is number of disk accesses related to the order of a tree in tree based indexes? (1) OR Q9. (a) Explain inverted file organization, how is it different from regular files and indexes? List its advantages and disadvantages. (4) (b) Explain tree based indexing using m-way trees. (6) **********

19 END TERM EXAMINATION SECOND SEMESTER [MCA] MAY 2010 Paper Code: MCA 106 Paper ID: Subject : Computer System Architecture Time : 3 Hours Maximum Marks : 60 Note: Question 1 is compulsory. Attempt one question from each unit. Q1. Explain in brief: (6*2=12) a) Explain Big O notations. (2) b) Compare B+ and B* trees. (2) c) Explain graph coloring technique and give its applications. (2) d) Give best case and worst case analysis for quick sort and merge sort. (2) e) Explain hashed file organization. (2) f) Give an example to illustrate polynomial arithmetic expression using linked list. (2) g) Give applications of stacks and queues. (2) h) Give representations of threaded binary tree. (2) i) Give analysis of Dijkstra algorithm. (2) j) Compare prims and kruskal Spanning tree algorithm (2) UNIT-I Q2 a) Convert the folloing infix expression to its equivalent prefix and postfix expression: (A B)/((D+E)*F) (4) b) Wite an algorithm to delete an element from double linkes list (6) i. At beginning of list. ii. At end of list. iii. After a node P. Q3 a) Write algorithm to implement muplication of two polynomial P1 and P2 (4) b) Compare queues and deques. c) Define and give examples for any two of the following : i. Sparse Matrix. ii. Row major order expression. iii. Column major order expression. UNIT-II Q4. a) Give an example for AVL tree (2)

20 b) Write Kruskal s algorithm and give its analysis. (5) c) Compare Dijkastra s and Floyd Warshall s algorithm. (3) Q5 a) Consider the following undirected graph G V1 4 v v5 9 2 v V6 6 v7 Using Prim s algorithm, generate minimum spanning tree for the above graph. Give sequence of steps also. (4) b) Give an example to illustrate graph coloring and its applications. (3) c) Give an example to illustrate topological sort. (3) UNIT-III Q6 a) Mention any tow techniques for each of the following: (4) i. Internal Sorting Technique. ii. Extrnal Sorting Technique. b) Compare the following with a suitable example: (6) i.k way merge sort ii. Balanced merge sort. iii. Polyphase merge sort.

21 Q7. a) Compare the following: (6) i. Radix Sort ii. iii. Shell Sort. Selection Sort. b) Consider the list: (4) 50, 40, 20, 60, 80, 35, 90, 45 Sort the given list using quick sort. Give sequence of steps also. UNIT-IV Q8. a) Explain the following file organization technique: (6) i. Random Organization. ii. iii. Inverted Organization. Cellular Partition Organization b) Compare tree indexing and hashed indexing techniques. (4) Q9. a) Mention any three file queries. (2) b) Explain linked file organization and trie indexing technique. (5) c) Explain cylinder surface indexing. (3)

22 END TERM EXAMINATION SECOND SEMESTER [MCA] MAY-2011 Paper Code: MCA102 Subject: Data &File Structure Q1 (a) What do we mean by time and space complexity of an algorithm? (b) Compare the stack and queue data structure. (c) Compare B + and B* trees. (d) Let G be a simple connected graph with n vertices and m edges. Explain any O(log m) is O(log n). (e) What is the best case analysis of Merge sort and shell sort? (f) Give any two uses of tree data structure. (g) How do we retrieve date from sequential file? (h) What is a hash function? Why it is used? (i)define a critical path in the graph. (j) What is topological sorting? UNIT-I Q2 (a) Convert the following infix expression to its equivalent prefix and postfix expression (A+B)/((D-E) *F). (b) Consider the following queue of characters, implemented array of six memory locations. Front=2, Rear=3, queue=_,a,d,_,_,_ where _ denote empty memory cell. Describe the queue as The following operations takes place:- (i)add S (ii)add f (iii) delete two letters (iv)shift towards left to bring all free space to the right side. Q3 (a) A binary tree T has 3 nodes. The inorder and preorder traversals of yield the following sequence of nodes:- Inorder E A C K F H D B G

23 Preorder F A E K C D H G B (b) A certain professor among us claims that a preorder traversal of a heap will lest out its keys in a Sorted order. Draw a small example of a heap that proves him wrong. UNIT-II Q4 (a) Differentiate between the shortest path problem and the minimal spanning tree problem through an example. (b) Explain Warshall s algorithm taking an example of your choice. Q5 Draw a simple, connected weighted graph with 8 vertices and 16 edges each with unique edge Weights identify one vertex as a start vertex and illustrate a running of Dijkastra s algorithm on this Graph. UNIT-III Q6 (a) Sort the following list of numbers. Elaborating the steps of selection sort 95,43,51,7,1,46. (b)consider the following undirected graph G. a b 7 2 e 6 8 c 4 3 d f 9 g Generate minimum spanning tree for the above graph using Kruskal s algorithm. Q7 (a) Explain sequential file organization. What are the advantages and disadvantages of this kind of Organization? (b) What do you understand by topological sort

24 UNIT-IV Q8) (a) Differentiate between double buffering and block buffering. (b) What are various error control techniques? Explain their uses. Q9 Explain the following:- (a) Multistacks and multiqueues (b) Big O notation (c) Activity Network (d) Coloring of graph (e) Merging files k way

25 (Please write your Exam Roll No.) Exam Roll No.... Paper Code: MCA 102 END TERM EXAMINATION SECOND SEMESTER [MCA] MAY-JUNE 2012 Subject: Data & File Structure Time : 3 Hours Maximum Marks :60 Note: Part-I is compulsory. Attempt one question from rest of the parts. PART-I Q1 Attempt any ten questions of the following :- (2*10=20) a) What is the difference between null array and empty array? b) Why always array start with index 0? c) What is a null Macro? d) Differentiate between static and dynamic list? e) What is the difference between null and void pointers? f) What do you mean by complete graph? g) What is a CONST pointer? h) What is sorting? How is sorting essential with data base applications? i) What is the difference between FIFO and LIFO? j) Explain the working of Tree Sort? k) Differentiate between Tree and Graph? l) What is the static list? How is it implemented? PART-II Q2 (a) Write a program to implement stack operation push and pop with pointer. (5) (b) Convert infix expression to its equivalent postfix expression (x+y-z) / (h+k) - z? (5) Q3 (a) Write a program to implement queue containing eight elements and perform the insertion and deletion operation. (5) (b) Convert the following prefix expression into postfix expression //*+ABCDE. (5) PART-III Q4 (a) Write a function that returns the height of an AVL tree. (5) (b) Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an initially empty binary search tree. Q5 (a) Write an algorithm that takes only a pointer to the root of a binary tree T and computes the number of nodes in T. (5) (5) (b) Show that the maximum number of nodes in a binary tree of height H is 2 H+1-1. (5)

26 PART-IV Q6 (a)sort the sequence 4, 8, 11, 6, 2, 1, 15, 26, 3 using insertion sort. What is the running of insertion sort if all keys are equal? (5) (b) Show how Heap sort processes the input- 85, 500, 300, 250, 186, 225, 175. (5) Q7 (a) Write an algorithm to find Maximum Cost Spanning tree. Is this harder than finding the Minimum Cost Spanning tree? (5) PART-V Q8 (a) Explain the following types of file organization techniques:- (6) (i) Sequential file organization (ii) Indexed sequential file organization (iii) Direct file organization (b) Difference between K way polyphase merges. (4) Q9 (a) Differentiate between sequential file access, random file access and Direct file access and write advantages and disadvantages of one another. Write the situation when which kind of file would be best be used. (6) (b) What is console I/O and define its types? (4) **********

27 (Please write your Exam Roll No.) Exam Roll No.... END TERM EXAMINATION SECOND SEMESTER [MCA] MAY- JUNE 2013 Paper Code: MCA 102 Subject: Data & File Structures (New) Time: 3 Hours Maximum Marks: 60 Note: Attempt five questions including Q. No. 1 which is compulsory. Select one question from each unit. Q1 Attempt any ten of the following briefly: [2x10] a) Which operation works faster with a linked list as compared to an array? Why? b) When does Queue Underflow Exceptional Condition arise and how can it be avoided? c) Name a linear data structure that allows insertion and deletion on only one end. Also state its two uses. d) In an expression tree, what is evaluated first, the leaf nodes or the internal nodes? e) Give definition for the struct Stack that can be used for non-recursive in-order traversal of a tree. f) What is the worst case time complexity of searching a node in a BST? Draw a sample tree that leads to this case. g) State and explain an advantage of a B+ tree over a B tree. h) Which data structure would you use for DFS traversal of a graph? What about BFS? i) Which internal sorting algorithm would you use in case the input is almost sorted? Why? j) What is critical path in a graph? What is its significance? k) What is the average time complexity of insert operation and search operation in a Hash table? l) Which sorting algorithm is used for external sorting? Why? m) How is parity used for error control? Q2. Unit I a) Write a C program to create a linked list as a copy of an existing linked list. [6] b) Compare the advantages and disadvantages of representing polynomials using linked lists and arrays respectively? [4] Q3. a) Write C functions to implement a stack. Also write a function that uses your stack to reverse a string. [7] b) How would you ensure enqueue and dequeue operations on a linked queue, are performed in O (1)? Explain. [3] P.T.O

28 Q4 Unit II a) Write a function to clone a binary search tree. [5] b) Demonstrate (construct the tree and show the links and threads) threading for a right-in-threaded tree built using the input 12, 3, 23, 4, 2, 21 [5] Q5 a) Explain RR imbalance and the process of resolving it (with code snippets) using AVL rotations. [6] b) What is a B-tree? What is the need for B trees? [4] Q6 Unit- III a) Write the BFS algorithm for graph traversal [5] b) Demonstrate Quick Sort for following data set: 12, 3, 23, 45, 21, 22, 2, 50, 9, 32 [5] Q7 a) Demonstrate the running of Dijkstra s algorithm to find the shortest path between node A and all other nodes of the following graph. [5] 12 B 11 C D 10 E 12 F b) Explain different collision resolution techniques in Hashing. [5] Q8 Unit- IV a) Compare K-Way merge sort using K+1 and 2*K tapes. [5] b) Explain batch processing using Master and Transaction files. [5] Q9 a) Demonstrate how polyphase merge sort overcomes the problem of K-Way merge sort using K+1 tapes? b) Write a short note on buffering. *************