Scribd
Upload
4 views

DS Assignments

The document contains assignments and tutorials covering topics such as binary trees, time complexity, data structures, sorting algorithms, graphs, and dynamic storage management. Specific problems include explaining tree traversals, calculating time complexity, comparing data structures, describing skip lists and hash tables, defining abstract data types, converting expressions to postfix notation, and algorithms for linked lists, radix sorting, and searching.

Uploaded by

shraddha_mundadada
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

DS Assignments

The document contains assignments and tutorials covering topics such as binary trees, time complexity, data structures, sorting algorithms, graphs, and dynamic storage management. Specific problems include explaining tree traversals, calculating time complexity, comparing data structures, describing skip lists and hash tables, defining abstract data types, converting expressions to postfix notation, and algorithms for linked lists, radix sorting, and searching.

Uploaded by

shraddha_mundadada
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSGNMENT 1

1. What is a Binary Tree.Explain inorder and postorder traversals with example


2. What is time complexity? Compute the frequency count for
for I : =1 to n
for j : =i+1 to n
for k : =j+1 to n
for l : =k+1 to
x = x + 1;
3. Difference between sequential allocation and linked allocation? OR Difference between
Linear List and Linked List? OR Difference between Arrays and Linked List
4.

ASSGNMENT 2
1. Explain the in brief the following i) red black tree ii) m-way search tree iii) b tree in)
b+ tree v) sparse matrix vi) AVL tree
2. What is skip list? Give its representation. Write an algorithm to insert
new item (k,e) in the skip list S.
3. Explain sequential search. Write an algorithm for sequential search.
4. Define sorting? What is the difference between internal and external sorting methods?
5.

TUTORIAL 1
1. What is hash data structure? The keys: 32, 18, 23, 2, 3, 44, 5 and 15 are inserted into
an initially empty hash table of length 10 with hash function H (key)= key mod 10
and linear probing is used to resolve collision. What is hash table content after every
key insertion?

TUTORIAL 2
1. What is Abstract Data Type(ADT)?Explain why queue is called ADT?
2. Convert the A*B+C/D expression into postfix using stack.

TUTORIAL 3
1. Construct algorithm for following operations on a Doubly Linked List 1) CREATE AT END 2)
DELETE AT START 3) TRAVERSE
2. What is singly circular linked list? Write an algorithm to traverse the list and also
enlist different operations performed on it.
3. Write a short note on dynamic storage management. Explain how it is done in C.

TUTORIAL 4
1. What is threaded binary trees? Give the threaded binary tree of the following binary tree
2. Explain the following graph terminology with figure
i) Undirected graph
iii) Simple path
ii) Total degree of vertex
iv) Cycle

TUTORIAL 5
1. What is selection Sort? Sort the number following numbers in ascending order and
also show the worst case time complexity of selection sort is O (n2 ).
2. Explain sequential search. Write an algorithm for sequential search.
3. Sort the following list using radix sort sort. Show all the passes neatly.
3 45 7 18 9 4 89 103 11 21

You might also like