1 What is the time complexity of finding the height of a binary tree?

2 What is the output of the following function for input [1, 0, 0, 0, 9, 6, 0, 7, 0] ?

3 What is the functionality of the following code?

4 If the solution incorporates optimal solutions to the two related subproblems, it has the following property

5 A Binary Tree in which every node has 0 or 2 children is called?

6 What does the following function do for a linked list?

7 Worst case time complexity for access and insertion in array is

8 Worst case time complexity for access and insertion in linked list is

9 Which of the following function removes the last element of a linked list?

10 In the top-down approach of dynamic programming in contrast to bottom-up approach

11 Prim’s minimum spanning tree algorithm is based on dynamic programming?

12 Breadth First Search requires which of the following data structures to implement?

13 Queue follows which policy

14 When we try to pop an empty stack, the stack

15 What is the output of the following code for the linked list?

16 Which is the best data structure for expression evaluation?

17 What is the search complexity in direct addressing in hash table?

18 What does the following program do where q is a queue data structure?

19 How to correct the following code to delete from a linked list?

20 Which of the following is the best object design for Animal, cat, dog?

21 What is the correct DFS(Depth First Search) sequence for the following graph?

22 The Time complexity for Depth first search is? Where V is vertices and E is edges in a graph

23 The time complexity of enqueue operation in Queue is?

24 Which is the correct max-heap property?

25 Which of the following is not the valid operation of the max-priority queue?

26 What is the time complexity to search an element in the linked list?

27 What does the if statement on line 19 does?

28 Which of the following statements is false for the doubly linked list?

29 In the priority queue if two elements have the same priority they are arranged based on?

30 Priority queue is usually implemented using?

31 In which traversal root node is visited at the last?

32 Which data structure is used to implement recursive function calls?

33 Which data structure is used to implement breadth first traversal?

34 Which of the following is false?

35 Worst case time complexity for binary search is?

36 The number of leaf nodes in a full binary tree with n nodes is equal to

37 What is the binary heap property?

38 What is the maximum number of nodes in a binary tree of height h?

39 Which is the correct postfix notation for (1+2)*(3+4)?

40 push() and pop() functions are used for?

41 Adjacency list is used to represent?

42 Dijkstra’s single-source shortest-paths algorithm uses

43 Let x and y be two numbers that can be zero. Which of the following sets of operations can be used to swap them without using any temporary variable?

44 We have a list of 1000 ordered elements. Binary search takes 1ms to search for an element in this list. What will be the time required to search in a list of 10^6 elements?

45 What is the time complexity for the following functions to find the factorial of a number?

46 What is the output of the following expression?

47 Which of the following can be used to multiply a number a by 8?

48 What is the time complexity of the following code?

49 We have 2 programs to find the 2nd largest element in an array. Which is better in terms of time complexity?

50 What is the time complexity? If n= len(A)

51 What is the size of a class?

52 What is the time complexity of the following function?