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