Saturday, April 14, 2007

DATASTRUCTURE QUESTIONS

What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)

Explain binary searching, Fibinocci search.

Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. MNB

What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Write the programs for Linked List (Insertion and Deletion) operations

How would you sort a linked list?

Explain about the types of linked lists

Write programs for Bubble Sort, Quick sort

Write a Binary Search program

Stack can be described as a pointer. Explain.

How is it possible to insert different type of elements in stack?

Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1

Evaluate the following prefix expression " ++ 26 + - 1324"

What does abstract data type means?

No comments:

Post a Comment