viva questions for data structures with c++

Data Structures with C++

Viva Questions

1)      What is  data, data type and data object?

2)      Define data structure

3)      Define ADT

4)      Explain in brief types of data structures

5)      Define algorithm. Characteristics of algorithm

6)       Define pseudocode and flowchart

7)      What is time  complexity and space complexity?

8)      Deffine  1-D, 2-D and n-D array

9)      List  out the advantages and disadvantages of arrays

10)   Define stack and explain in brief each of its operation

11)  Stack ADT

12)  Creating a stack   int Stack[100];

                int top = −1;

13)  Syntax to check whether stack is empty  ?

               if(top == −1)

                return 1;

             else

    return 0;

14)  Pushing element into the stack?

           if(top == MaxCapacity − 1)

           cout << "Stack overflow (full)";

            else

             {

              top ++;

              stack[top] = Element;

          }

15)  Poping element from the stack

       if(top == −1)

        cout << "Stack underflow\n";

       else

      return(Stack[top−−]);

16)  List out the applications of stack

17)  Define recursion

18)  Variants of recursion (each in brief)

19)  Define queue and queue ADT

20)  Queue operations

21)  Define circular queue

22)  Define deque

23)  Define  linked list, double linked list and circular linked list

24)  Define header node and data node

25)  Define tree, directed and undirected graphs with ex

26)  Define null graph and isolated vertex with ex

27)  Define weighted graph with ex

28)  Degree of vertex with ex

29)  Define Acyclic graph with ex

30)  Define binary tree and its properties with a diagram

31)  Binary tree ADT

32)  Define graph and its ADT

33)  Define DFS and BFS

34)  Define spanning tree and minimal spanning tree

35)  Define prims and kruskals algorithm

36)  Define searching and sorting

37)  Define two techniques of searching(sequential and binary search)

38)  Explain types of sorting(internal and external)

39)  Define bubble sort with ex

40)  Explain insertion sort with ex

41)  Explain selection sort with ex

42)  Explain quick sort with ex

43)  Define hashing

44)  What is a hash function?

45)  Define rehashing

46)  List out different hash functions

47)  What is linear probing?