Techincal interview,
Data Structure Questions
Posted by careerblog1
Published on
- What is a data structure?
- What does abstract data type means?
- Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
- Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked)
- How is it possible to insert different type of elements in stack?
- Stack can be described as a pointer. Explain.
- Write a Binary Search program
- Write programs for Bubble Sort, Quick sort
- Explain about the types of linked lists
- How would you sort a linked list?
- Write the programs for Linked List (Insertion and Deletion) operations
- What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
- What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
- Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
- Explain binary searching, Fibinocci search.
- What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
- How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
- A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
- A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
- When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
- The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?
- What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
- Which sort show the best average behavior?
- What is the average number of comparisons in a sequential search?
- Which data structure is needed to convert infix notations to post fix notations?
- What do you mean by:
- Syntax Error
- Logical Error
- Runtime Error
How can you correct these errors? - In which data structure, elements can be added or removed at either end, but not in the middle?
- How will inorder, preorder and postorder traversals print the elements of a tree?
- Parenthesis are never needed in prefix or postfix expressions. Why?
- Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.
0 comments
Readers Comments