GOVERNMENT POLYTECHNIC HIMATNAGAR Information Technology

Transcription

1 GOVERNMENT POLYTECHNIC HIMATNAGAR Information Technology Subject:Data Structures Subject Code: Semester: III Assignment-1 1.What is Data Structure? Explain Primitives & Non-Primitive data structure with example. 2. Explain characteristics of array. 3. Define time complexity and space complexity. 4.Explain following for Searching an element into an array (i) Linear Search (ii) Binary Search 5. Briefly explain String operations. 6.Explain Linear and Non-Linear Data Structures. 7.Explain LIFO structure. Write an Algorithm for any two operation on LIFO. 8. Write an Application of STACK.Compare circular queue with normal queue. 9.Write an Algorithm for inserting and deleting an element from circular queue. 10. Write an algorithm to compare two strings. 11. Explain various String operations with example. 12.Explain following terms: (a) priority queue (b) Graph and Directed Graph 13.What is stack? Explain PUSH and POP operations in STACK with its algotithm. 14. What is Queue? Explain disadvantages of simple queue. 15. Convert following expression into the postfix notation: (i) a+b/(c*d)-e (ii) (a/b) * (c/(d+e)-f)

2 Assignment-2 1. Write a program to compare two strings s1 and s2. 2. Write a program for concatenation of strings s1 and s2 in string s3. 3. Give the syntax of declaring one dimensional array in C and explain with Example Also explain row-major order of an array with example. 4.Declare a 5 x 5 array of integers in C and write a program segment to initialize all its diagonal elements to 1 and rest of the elements to 0 5. Explain pointer data type. How a pointer variable is declared and initialized in C? Explain giving example. 6. What is Circular queue? Write and explain algorithm to insert element in circular queue. 7. What is Queue? Explain disadvanges of simple queue. 8. Explain priority queue.explain recursion with their types. 9. Write Infix, Prefix, Postfix notations with a suitable example. Also mention Operator precedence associated with it. 10. What is singly Linked List? Write an algorithm to copy a linked list. 11. Write an algorithm to delete a node from doubly linked list. 12. Write an algorithm to insert new node in an ordered linked list. 13. Write an algorithm to INSERT a node in Singly Linked List. 14. Write an algorithm to INSERT a node in Doubly Linked List. 15. Write an algorithm to DELETE a node in Doubly Linked List.

3 Assignment-3 1. What is a linked list? List the various operations that can be performed on a linked list. 2. Differentiate between linked list and sequential list. 3. Difference between singly linked list and doubly linked list. List advantage of doubly linked list over singly linked list. 4. What is an ordered Linked List? Write an algorithm to insert new node into an ordered Linked List. 5. Write short-note on Hash table. 6. Write an algorithm for merge sort. 7. Write an algorithm of bubble sort. 8. Write an algorithm of quick sort. 9. Give tracing of following list of numbers using Selection sort. 23,32,47,11, 65,99,57,84, Give trace of following list of numbers using Quick sort 42,23,76,11,65,58,94,36,99, What is Hashing? Explain any one Hashing function in detail. 12. Explain binary search method. Write an algorithm for binary search method. 13. Write a program in C/C++ for sorting array of integers using selection sort method. 14. Explain shell sort method with example. 15. Give trace of radix sort algorithm using following data 42,23,74,17,65,57,94,36,99,87,70,81,64,222

4 Assignment-4 1. Explain sequential searching and name three conditions under which sequential search of list is preferable over binary search. 2. Explain Collision Resolution techniques. 3. Explain Hashing Function in Detail. 4. What is searching? write an algorithm for Binary search. 5. Explain Hashing Function. 6. Explain Collision Resolution Techniques. 7. Write a program in C to sort N numbers into ascending order using Bubble sort method. 8. What is Tree traversal? What are the different methods? write an algorithm for PREORDER traversal. 9. Write short note on Application of trees. 10. Define following : (a) M-ary tree (b) Complete Binary tree 11.What is tree traversal? what are different methods of tree traversal? Write an algorithm for PREORDER traversal. 12. Define: (i) root node (ii) leaf node (iii) directed tree (iv) String array (v)sibling (vi) directed graph (vii) weighted graph 13. List various tree traversal methods and explain. 14. Construct a binary tree for the following data: 50, 55, 35, 15, 52, 65, 33, 47, 75, 72 Take 50 as root node. Reconstruct the tree after addition of the nodes 27 and Define binary tree? List operation on binary tree. Explain any one operation in detail. 16. Define following with necessary figure/example. Terminal node, sibling, level, non terminal node.

5