STUPIDSID
1 (a)
(i) Write algorithm to sum values in vector V and find out the execution time required.
(ii) Explain the equation that finds out the address of the element of the one dimensional array. Assume necessary data.
(ii) Explain the equation that finds out the address of the element of the one dimensional array. Assume necessary data.
7 M
1 (b)
i) Convert the following Polish(prefix) expression to Reverse Polish(suffix)
notation
a. ++abc
b. +a+bc
c. +a*bc
d. *a+bc
(ii) Does a time sharing computer use a queue or stack? Explain.
a. ++abc
b. +a+bc
c. +a*bc
d. *a+bc
(ii) Does a time sharing computer use a queue or stack? Explain.
7 M
2 (a)
Write an algorithm for inserting a node and deleting a node in doubly linked linear List.
7 M
2 (b)
Write steps of procedure to insert an element to the top of the stack and remove top element from a stack.
7 M
2 (c)
What is the advantage of Polish expression over infix notation? Write an algorithm to convert an infix expression into reverse Polish expression.
7 M
3 (a)
(i) Write a recursive algorithm to find factorial.
(ii) Which type of allocation is called linked allocation? Define singly linked linear list.
(ii) Which type of allocation is called linked allocation? Define singly linked linear list.
7 M
3 (b)
(i) Explain the threaded storage representation for binary trees.
(ii) Define the inorder, postorder and preorder traversal for the following tree.
IMAGE
(ii) Define the inorder, postorder and preorder traversal for the following tree.
IMAGE
7 M
3 (c)
(i) What are the advantages of circular lists over singly linked list?
(ii) Explain- Why doubly linked lists are much more efficient with respect to deletions than singly linked lists?
(ii) Explain- Why doubly linked lists are much more efficient with respect to deletions than singly linked lists?
7 M
3 (d)
(i) Define adjacency matrix. When two digraphs are considered to be
equivalent?
(ii) Explain the breadth first search and depth first search tree traversal on the following graph.
IMAGE
(ii) Explain the breadth first search and depth first search tree traversal on the following graph.
IMAGE
7 M
4 (a)
Write an algorithm for inserting and deleting an element from queue.
7 M
4 (b)
(i) Define 2-3 tree. Describe the characteristic of 2-3 tree.
7 M
5 (a)
What is collision? Explain two broad classes of collision resolution techniques.
7 M
5 (b)
Explain the binary search method. Write an algorithm for performing a binary Search.
7 M
5 (c)
What is hashing? Explain hashing functions.
7 M
5 (d)
Explain the multi key file organization and access methods.
7 M
More question papers from Data Structures