Data Structures and Algorithms Super Imp
Data Structures and Algorithms Super Imp
Module-1
Module-2
Module-3
1.Define Linked Lists. Explain in detail, the primitive operations performed on Singly Linked
Lists. List the different types of linked lists.
2.What is the Doubly linked list? Write C functions for the following operations on Doubly
Linked List (DLL).
1.Concatenation of 2 DLL. 2. Search the DLL for the given key element.
3.Insert a node at the beginning 4. Deleting a node at rear end
5.delete_front 6. Inserting a node at specified position.
3.Write the function to perform the following on SLL: (usually using integer data type)
a.Creating an ordered SLL. (or create a list) b. Count number of elements (Length)
c.Search an element (Linear & Binary – Integer) d. Display all the elements in SLL
e.Deleting a node at rear end of SLL. f. Insert a node at front end of SLL.
g.Inverting a singly linked list. (Reversing) h. Finding the length of a circular list.
4.Explain the advantages of DLL over singly linked lists? Explain with example.
5.Write a note on Sparse matrix.
Module-4
2.Define fite. List basic file operations. Explain any four operations with syntax and
examples.
3.Define Hashing. Explain the_:method of sorting data using a Hash function in a Hash
table. identify the problem that occurs during the value storage. Explain how you resolve
the problem using the Hashing technique.
4.What are the different types of traversal techniques? Find the resultants of the types of
graph traversal methods on the following graph :
7.Explain how an insertion sort works? Suppose an array A contains 8 elements as follows:
50,30,10,20,40,60,70. Trace insertion sort algorithm for sorting in ascending order