Datastructures Viva Questions

Q1.What is a Register?

Ans- A register is a small amount of memory within the CPU that is used to temporarily store instructions and data.

Q2.An _________ data type is a keyword of a programming language that specifies the amount of memory needed to store data and the kind of data that will be stored in that memory location?

Ans-abstract

Q3.What are the different Abstract Data Type Groups?

A) Integer, Floating-Type, Character & Boolean are the four different data type groups

Explanation: You determine the amount of memory to reserve by determining the appropriate abstract data type group to use and then deciding which abstract data type within the group is right for the data. The different abstract data type groups are Integer, Floating-Type, Character & Boolean

Q4.Which of the following abstract data types are NOT used by Integer Abstract Data type group?

A) Short

B) Int

C) float

D) long

Explanation: The integer abstract data type group consists of four abstract data types used to reserve memory to store whole numbers: byte, short, int , and long

Q5.What pointer type is used to implement the heterogeneous linked list in C?

The answer is the void pointer. The heterogeneous linked list contains different data types in it's nodes and we need a link, pointer, to connect them. Since we can't use ordinary pointers for this, we use the void pointer. Void pointer is a generic pointer type, and capable of storing pointer to any type.

Q6.What is the minimum number of queues needed to implement the priority queue?

Two. One queue is used for the actual storing of data, and the other one is used for storing the priorities.

Q7.Which data structure is used to perform recursion?

The answer is Stack. Stack has the LIFO (Last In First Out) property; it remembers it's ‘caller’. Therefore, it knows to whom it should return when the function has to return. On the other hand, recursion makes use of the system stack for storing the return addresses of the function calls.

Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written explicit, stack is to be used.

Q8.What are some of the applications for the tree data structure?

1- Manipulation of the arithmetic expressions.

2- Symbol table construction.

3- Syntax analysis.

Q9.Which data strucutres algorithm used in solving the eight Queens problem?

Backtracking

Q10.In an AVL tree, at what condition the balancing is to be done?

If the "pivotal value", or the "height factor", is greater than one or less than minus one.

Q11.There are 8, 15, 13, and 14 nodes in four different trees. Which one of them can form a full binary tree?

The answer is the tree with 15 nodes. In general, there are 2^n-1 nodes in a full binary tree.

By the method of elimination:

Full binary trees contain odd number of nodes, so there cannot be full binary trees with 8 or 14 nodes. Moreover, with 13 nodes you can form a complete binary tree but not a full binary tree. Thus, the correct answer is 15.