Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Transcription

1 Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate between primitive data type, abstract data type, and polymorphic data type? Q 3:- What is a Data Type? Differentiate between primitive data type, abstract data type, and polymorphic data type? Q 4:- What is algorithm? What is the criteria that every algorithm must satisfy? Q 5:- What is algorithm complexity? What is the need of measuring the complexity of an algorithm? Q 6:- What are the components of space complexity? Q 7:- What are the components of time complexity? Q 8:- What do you mean by time space trade off among algorithms? Q 9:- Which Notation is popularly used to express the complexity of an algorithm? Describe that Notation? Q 10:- Differentiate between iteration and recursion? 1

2 Tutorial#2 Q 1:- What is an array? What are different types of arrays? Q 2:- How a linear array is represented in memory? Q 3:- How a two dimensional array is represented in memory? Q 4:- What is a sparse matrix? How sparse matrices can be represented efficiently in memory? Q 5:- What is a Stack? Is Stack a linear or non linear data structure? Q 6:- Can we implement a stack in C whose elements can be of different types? If your answer is yes then how? Q 7:- How Peek() operation differs from pop() operation? Q 8:-While representing a stack using linked lists, we have implemented additional operation dispose() to remove the stack from memory? Why such operation is not implemented for stack represented using an array? Q 9:-Given the following arithmetic expression in infix notation as 12/(7-3)+2*(3+8)-7 Translate this expression into postfix notation and then evaluate it. Q 10:-what do u mean by recursion? Give the classification of recursion and explain it? 2

3 Tutorial#3 Q 1:- What is a queue? Is queue a linear or non linear data structure? Q 2:- Queue is a special type of list? Comment? Q 3:- How do an array based queue compares with linked queue? Q 4:- Why an operation to check queue overflow is not implemented on linked queue? Q 5:- Can we implement a queue in C whose elements can be of different type? If your answer is yes, then show how? Q 6:- How peek() operation differs from Dequeue() operation? Q 7:-While representing a queue using linked lists, we have implemented additional operation dispose() to remove the stack from memory? Why such operation is not implemented for queue represented using an array? Q 8:-How do a linear queue compares with circular queue? Q 9:-Explain the term D-queue? Q 10:-Explain the term Priority Queue? Application of Priority Queue? 3

4 Tutorial#4 Q 1:- How do a linear list compare with a linear array? Q 2:- Is it possible in C to implement a heterogeneous list? If, Yes how? Q 3:- What advantages does a doubly linked list have over a linear linked lists? Q 4:- What is the advantage of a header node in a linked list? Q 5:- What will be the complexity of the operation to remove an element from the end of the linear linked list? Q 6:- What will be the complexity of the operation to remove an element in the beginning of the linear linked list? Q 7:-In a circular linked list, how the end of list condition will be tested? Q 8:-Define the term Garbage Collection and Compaction? Q 9:-Differentiate between Linear linked list and circular linked list? Q 10:-Diffentiate between Circular linked list and doubly linked list? 4

5 Tutorial#5 Q 1:- What do you mean by a complete binary tree? Draw one such binary tree? Q 2:-What is the maximum number of nodes at kth level of binary tree? Q 3:- Why binary trees, usually, are not represented using arrays? Q 4:- Binary search tree combines the best worlds of arrays and linked lists into one structure? Comment? Q 5:- Compare and contrast between a binary and binary search tree? Q 6:- What is a thread? How is it useful? Q 7:-What are the advantages of threading a binary search tree? Q 8:-Define the Huffman algorithm related to tree? Q 9:-Define all the traversal of binary search tree with example? Q 10:-How the height of a binary search tree effects its performance? 5

6 Tutorial#6 Q 1:- What do you mean by linear search? Explain it with example? Q 2:- What do you mean by binary search? Explain it with example? Q 3:- What are the limitations of direct address tables? Q 4:- What is a hash table? What are the advantages of hash tables over direct address tables? Q 5:-What is Hashing? Q 6:- What is a hash function? What should be the characteristics of a good hash function? Q 7:-Describe the various hash function? Q 8:-What is a collision? How collisions can be handled? Q 9:-Demonstrate the insertion of keys 28,5,19,15,33,12,17,77,20 into a hash table with 9 slots and collision resolved by separate chaining. Let the hash function be h(k)=k mod 9. Q 10:-What do you mean by hash function? Classified it with the help of example? 6

7 Tutorial#7 Q 1:- What is sorting? What is its importance? Q 2:- How do Quick Sort and Heap Sort methods compare as far as performance is concerned? Q 3:- Can you implement Quick Sort method without recursion? If yes show its implementation? Q 4:- Sort the list 213,145,456,700,515,295,674,925 using bucket sort method? Q 5:- Sort the list 213,145,456,700,515,295,674,925 using quick sort method? Q 6:- Sort the list 213,145,456,700,515,295,674,925 using merge sort method? Q 7:- Sort the list 213,145,456,700,515,295,674,925 using bubble sort method? Q 8:- Sort the list 213,145,456,700,515,295,674,925 using selection sort method? Q 9:- Sort the list 213,145,456,700,515,295,674,925 using heap sort method? Q 10:- Sort the list 213,145,456,700,515,295,674,925 using tree sort method? 7

8 Tutorial#8 Q 1:- How an AVL tree differs from a binary search tree? How AVL trees are represented in computer memory? Q 2:- What do you mean by B Tree? Explain It? Q 3:- Draw the parse tree for the expression (A+B)*C+(D+E) Q 4:- Explain the process of obtaining a binary tree, which represents a given ordered tree? Give example? Q 5:-Explain the method of representing any ordered forest by a unique binary tree? Q 6:- Explain the rotation which we performed in AVL Tree? Q 7:- Differentiate between B and B+ Tree? Q 8:- Explain the process of threading of a binary tree for in order traversal with examples? Q 9:- Discuss the advantages and disadvantages of a threaded storage representation for binary trees? Q 10:- Draw the binary search tree that results from inserting into an initially empty tree records with the keys E A S Y Q U E S T I O N And then deleting the Q? 8

9 Tutorial#9 Q 1:- Is graph a linear or non linear data structure? Q 2:- How graphs can be represented in computer memory? Give relative merits and de-merits of each representation scheme? Q 3:-We have an application using which a railway passenger can know whether there exists a path from a given city to another city i.e. does there exists a railway link direct or indirect. Which way graph should be represented in memory? Q 4:- How breadth first search differs from depth first search? Can we perform these searches on weighted graphs? Justify your answer? Q 5:-What is topological sort? Explain? Q 6:- Explain the term strongly connected components? Q 7:- What do you mean by degree of a vertex? Explain with Example? Q 8:- How graph can be represented? Explain? 9