Data Structures and algorithm in C Notes PDF Interview Questions and Programs

Questions

1.      List out few of the Application of tree data-structure?

Ø  The manipulation of Arithmetic expression,

Ø  Symbol Table construction,

Ø  Syntax analysis.

2.      List out few of the applications that make use of Multilinked Structures?

Ø  Sparse matrix,                   Index generation.

3.      In tree construction which is the suitable efficient data structure?

            (a) Array           (b) Linked list              (c) Stack           (d) Queue   (e) none

(b) Linked list

4.      What is the type of the algorithm used in solving the 8 Queens problem?

            Backtracking

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

            If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.

6.      What is the bucket size, when the overlapping and collision occur at same time?

            One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

Click Here for Data Structure in C Algorithm Programs Source code download:

Data Structure in C program Binary Search Tree Dev c++
Data Structure in C program Doubly Linked List Dev c++
Data Structure in C program Queue using Linked List Dev c++
Data Structure in C program stack using linked list Dev c++
Data Structure in C program singly linked list Dev c++
Data Structure in C program Doubly Ended Queue Deque Dev c++
Data Structure in C program Stack using Array Dev c++
Data Structure in C program Prefix Conversion Dev c++
Data Structure in C program Postfix Evaluation Dev c++
Data Structure in C program Circular Queue Dev c++

If you are intersted in C interview questions

check

C Interview Questions Answer PDF