Sagar Institute of Science & Technology Interview Questions and Answers

Explains OOP vs POP, dynamic vs static binding, virtual functions, templates, while loops, pointers to arrays and functions.

• OOP focuses on objects and classes while POP focuses on procedures and functions.

• Dynamic binding is resolved at runtime while static binding is resolved at compile time.

• Virtual functions allow for polymorphism and dynamic binding.

• Templates allow for generic programming.

• Three ways to make a while l...read more

Questions on data structures and algorithms including stack, queue, binary search tree, and BFS vs DFS.

• Recursion is a function that calls itself. It is used in many algorithms such as quicksort and binary search.

• An empty queue has front and rear pointers pointing to the same location. A full queue has no empty spaces to insert new elements.

• To insert an element in a binary search tree, compare the value of the new eleme...read more