Data Structure Quiz with Answers

Data Flair

3 years ago

Free Data Structures and Algorithms courses with real-time projects Start Now!!

This quiz contains questions based on data structure and algorithm. These are a selected set of questions that will help you recall all the important concepts of data structures and algorithms. Let’s start!!!

Time limit: 0

Quiz Summary

0 of 20 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 20 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

Current

Review / Skip

Answered

Correct

Incorrect

Question 1 of 20

1. Question

If we calculate the Fibonacci series using recursion, what is the number of function calls invoked to calculate it for the ‘n’ number of terms?

n

n-1

n+1

Not fixed

Correct

Incorrect

Question 2 of 20

2. Question

What is the output of the following code?

void Fun(int);

int main()

{

    Fun(3);

    return 0;

}

void Fun(int n)

{

    if(n>0)

    {

        Fun(n-1);

        cout << n;

        Fun(n-1) ;

    }

}

1211213

121

1213121

121121

Correct

Incorrect

Question 3 of 20

3. Question

Which of the following is not an advantage of using arrays to implement the heap data structure?

Random accessing

Better performance due to cache friendliness

Less usage of pointers

Accessing the previous element becomes easier

Correct

Incorrect

Question 4 of 20

4. Question

What is the output of the following code?

void main()

{

    int a;

    a=3>2<1>4<6==0;

    cout << a;

}

1

10

None of these

Correct

Incorrect

Question 5 of 20

5. Question

Which of the following statements about tree data structure is false?

In a complete binary tree having ‘n’ nodes, there are (n+1) leaf nodes

Any tree with n nodes always has (n-1) edges.

We can uniquely construct a labelled binary tree if we have its postorder traversal.

None of these.

Correct

Incorrect

Question 6 of 20

6. Question

An arithmetic tree is generated for the expression [-a + (b * c)] / (-d). Which operator is placed at the root node?

+

–

*

/

Correct

Incorrect

Question 7 of 20

7. Question

Which of the following statements about arrays and the linked list is false?

It is easy to insert and delete elements in the linked list.

Random accessing is allowed in the typical implementation of a linked list

Arrays have better cache locality which makes their performance better.

The size of the array has to be pre-decided.

Correct

Incorrect

Question 8 of 20

8. Question

Let f(n) = n²logn and g(n) = n(log n)¹⁰. Which of the following is correct?

f(n) = O(g(n)) and g(n) ≠ O(f(n))

g(n) = O(f(n)) and f(n) ≠ O(g(n))

f(n) ≠ O(g(n)) and g(n) ≠ O(f(n))

f(n) = O(g(n)) and g(n) = O(f(n))

Correct

Incorrect

Question 9 of 20

9. Question

Let f(n) and g(n) be two functions. Then, which of the following options depicts the worst-case scenario?

f(n) ≥ c* g(n)

f(n) ≤ c* g(n)

f(n) ≥ g(n)

None of these

Correct

Incorrect

Question 10 of 20

10. Question

Which of the following is the definition of a connected graph?

A graph in which every node is adjacent to every other node

A graph that does not contain loops

A graph that does not contain parallel edges

A graph in which there is a path between every pair of vertices.

Correct

Incorrect

Question 11 of 20

11. Question

Which sorting technique should we use if we have more amount of data than the total RAM available to us?

Heapsort

Selection sort

Insertion sort

Merge sort

Correct

Incorrect

Question 12 of 20

12. Question

What is the postfix of the following expression?

    p+(q*r – s)

+-s*rqp

pqr+*-s

pqrs+*-

pqr*s-+

Correct

Incorrect

Question 13 of 20

13. Question

What will be the output of the following program?

int main()

{

    int x = 2;

    {

        int x = 4;

    }

    cout << x;

    return 0;

}

Garbage value

4

2

Runtime error

Correct

Incorrect

Question 14 of 20

14. Question

What is the total number of stack permutations possible for a stack of size 3?

One

Three

Five

Seven

Correct

Incorrect

Question 15 of 20

15. Question

What does the following code perform?

int fun(struct node* Head){

    struct node* slow, fast;

    slow = Head;

    fast = Head;

    while(slow && fast && fast->next){

        slow = slow->next;

        fast = fast->next->next;

        if(slow == fast)

            return 1;

    }

}

Reverse a linked list

Detect a loop inside a linked list

Count the number of nodes in a linked list

Print all the even nodes in a linked list

Correct

Incorrect

Question 16 of 20

16. Question

If we wish to compute the shortest path from a given node to every other node, which of the following methods can be used? Given the graph is an unweighted, undirected graph.

Prim’s algorithm

Using DFS on the graph starting from that particular node

Using BFS on the graph starting from that particular node

Dijkstra’s algorithm

Correct

Incorrect

Question 17 of 20

17. Question

Which of the following methods cannot be used to code the logic for the Fibonacci series?

Iterative approach

Recursive method

Dynamic programming

Greedy algorithm

Correct

Incorrect

Question 18 of 20

18. Question

Which of the following is true for a circular linked list?

Components are linked together in some sequential manner

There is no beginning or end

Components have a hierarchical arrangement

Forward and backward traversal within the list is permitted

Correct

Incorrect

Question 19 of 20

19. Question

For a doubly-linked list, how many pointers do we need to perform the insertion operation?

7

4

1

None of these

Correct

Incorrect

Question 20 of 20

20. Question

What is the time complexity of the following function?

int fun(int n){

    if(n == 1)

        return 1;

    else

        return fun(n-1) + fun(n-1);

}

O(n)

O(n log n)

O(n²)

O(2ⁿ)

Correct

Incorrect

Summary

The above Data Structure quiz contains 20 questions each of MCQ type out of which only one option is correct. It covers almost all the important topics that are important from an interview point of view.

Hope you enjoyed it.