- What are the types of graphs
- What is the difference between directed
- What is the other name for directed
- What are the commonly used representations
- What are the different ways of visiting
- Write the algorithm for depth first
- Write the algorithm for breadth first
- What is a spanning tree
- What are the properties of a
- What is depth first spanning
- What is breadth first spanning
- What is the use of spanning
- How do you determine the cost of
- What is the condition to be satisfied by
- What is the use of Dijkstra’s
- What is the type of the algorithm used
- Does the minimum spanning tree of
- What is a graph
- What are the types of collision resolution techniques
- List the hashing functions based on the
- What are the methods available to
- Which of the following algorithms is slower
- What is logic followed by shell
- What are the other names for
- How many arrays are required for
- What is the complexity of merge
- Write the algorithm for merge
- What is the complexity of heap
- What do you mean by “In place”
- Out of the following which is the slower
- How many arrays are used in
- Write the algorithm for heap
- What is the complexity of quick
- What is the other name for quick
- Write the algorithm for quick
- What is logic of quick sort
- What is the complexity of insertion
- Write the algorithm for insertion
- What is the complexity of selection
- Write the algorithm for selection
- What is the best case complexity for
- What is the use of modified bubble
- How can you solve the limitation of
- Why the complexity of bubble sort is same
- What is the complexity of bubble
- Why is the term bubble used in
- Write the algorithm for bubble
- What are the types of internal
- When should we use external
- When should we use internal
- What are the types of sorting
- What is sorting
- What is the disadvantage of binary
- What is the advantage of binary search
- Write the algorithm for binary
- What is the condition to use
- Write the syntax for linear search
- Write the syntax for linear search
- What is linear search
- What is searching
- Name the operations that can be
- What is the other name for min
- What is the other name for max
- What is min heap
- What is max heap
- What are the types of
- What is a heap
- Using which structure is the priority
- What is the data structure used
- Write the syntax of B-tree
- What is a B-tree
- What is a multiway tree
- Write the syntax of 2-3tree
- What are the conditions to be followed to
- How can you overcome the disadvantage
- What is the disadvantage of AVL
- At what condition the balancing has to
- How can you determine whether right sub
- How can you represent balance factor
- How do you check whether a tree is
- Write the syntax of AVL tree
- How do you calculate the balance
- What are the elements of an AVL
- Why are balanced binary trees called
- What is the other name for balanced
- What is a balanced binary
- What is a forest
- Write the syntax of node of a general tree
- Name the pointers which are to be maintained
- What are siblings
- What is a general tree
- What are the conditions to be checked when
- Write the syntax of threaded binary
- What are the elements of a node in
- What is the limitation of threads in
- What are left threads
- What are right threads
- How do you calculate the number of branches
- How do you calculate the number of nodes
- How do you calculate the external nodes if
- What are external nodes
- What are internal nodes
- What is the other name for extended
- How do you convert a binary tree into
- If you traverse the expression tree in in-order
- If you traverse the expression tree in post
- If you traverse the expression tree in
- What are expression trees
- What are the applications of binary
- What are the possible conditions encountered
- Write the algorithm for inserting a node
- Write the algorithm for searching a
- What are the different operations that
- What is a binary search tree
- What are the different ways in which
- Write the syntax for structure of
- What are the elements of each
- Write the algorithm for post-order
- Write the algorithm for pre-order
- Write the algorithm for in-order
- What is the primary difference in
- What are the different methods of
- What is the efficient data
- What is traversal of
- What is a complete binary
- What is depth of a tree
- What is a level of
- What is a degree of a
- What is a strictly binary
- What is descending of
- What is climbing of tree
- What is a left descendant
- What is an ancestor
- What is a father node
- What is a leaf node
- What is a root
- What is a node?
- What is an empty binary
- What does a binary tree
- What is a binary tree?
- What is a tree?
- What are the applications of priority
- What is the minimum number of queues
- Which notations are used in evaluating
- Where are the return values stored while
- Which data structure is used in recursion
- Name few applications of multilinked
- Is a linked list linear or non linear data
- If you are using C language to implement the
- What are the major data structures used in the
- Name the areas of application of
- What is a data structure?
- What is an algorithm?
- What are the properties of an algorithm?
- What are the types of algorithms?
- Define iterative algorithms?
- Define recursive algorithms?
- What is an array?
- What is a data structure?
- What are the types of data structures?
- What is a linear data structure?
- What is non linear data structure?
- What are the types of array operations?
- What is a matrix?
- What are the types of matrix operations?
- What is the condition to be checked for the multiplication
- Write the syntax for multiplication of
- What is a string?
- What is use terminating null character?
- What is an empty string?
- What are the operations that can be performed on a string?
- What is Brute Force algorithm?
- What are the limitations of arrays?
- How can you overcome the limitations of
- What is a linked list?
- What is the difference between an array and
- What is a node?
- What does node consist of?
- Write the syntax of node creation?
- Write the syntax for pointing to next
- What are self referential structures?
- How can you identify the end of a
- Write the syntax to identify the end of the
- How can you access the elements of a
- Write the algorithm for displaying the nodes of
- What are the operations that can be
- What are the situations in inserting
- Write the algorithm for insertion of a
- Write the algorithm for inserting node at the
- Write the algorithm for inserting a new node in the
- Write the algorithm for inserting a node at the
- What are the situations in deleting
- Write the syntax for deletion of a node?
- Write the algorithm for deleting the first node of the
- Write the algorithm for deleting the last node?
- Write the algorithm for deleting a specified
- What are the advantages of a linked list?
- What are the applications of linked lists?
- What are the types of linked lists?
- What is the limitation of linked list?
- How can you overcome the limitation of linked list?
- What is a circular linked list?
- How can you traverse a circular linked
- What is recursion?
- What is the limitation of circular linked
- How can you overcome the limitation of circular
- What is a doubly linked list?
- What are the operations that can be performed on
- Using which data structure are the stacks and
- What is the disadvantage of doubly linked list in
- What is a circular doubly linked list?
- What is a sparse matrix?
- What is a stack?
- What is the other name for stack?
- What are the operations done on
- Define push.
- Define pop.
- What are the ways of representing a stack?
- Write the algorithm of adding an element to a stack
- Write the algorithm for removing an element from
- What is the limitation in representing a stack
- Write the algorithm for push operation on stack
- Write the algorithm for pop operation on stack
- What are the applications of stacks?
- What is stack overflow?
- What is stack underflow?
- What is polish notation?
- What are the types of polish
- What is a queue?
- What is other name for
- What are the ways of representing
- What is front end?
- What is rear end?
- Write the algorithm of adding an element to a queue
- Write the algorithm for removing an element
- What are the applications of queues
- What is the limitation in representing a
- Write the syntax of node creation for queue
- Write the algorithm for adding a data element to
- Write the algorithm for removing a data element from
- What is queue overflow?
- What is queue underflow?
- What is circular queue?
- Why do we need circular queue
- Write the algorithm of adding an element to
- What is a dequeue?
- What is a priority queue?
- What are the operations performed on a
- What are the rules followed in using
- Write the syntax of node creation for priority