DS

The given diagram represents

• Two way Header Linked List

• Two way Circular Linked Lst

• Two way Circular Header Linked List

• Two way Linked List

State True or false: The diagram below is representing Insertion of a node in free storage list.

• true

• false

which of the following data structure is/are classified as linear data structure

• Linked List
• Array
• Stack
• Queue
• All of the above

If the given array is one dimensional array,the memory address of 10th element can be calculated by the formula

• LOC(Array[10])=Base(Array)+w(10-lbr)
• LOC(Array[10])=Base(Array[10])+(10-lbr)
• LOC(Array[10])=Base(Array[10])+w(10-ubr)
• None of the above

The following is two way list

• Grounded header list

• Circular header list

• Linked list with header and traiter nodes

• None of above

The number of swappings needed to sort the numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is:

• 11
• 13
• 12
• 14

Best efficient way of representing the sparse matrix is

• Method of Linearization
• Method of Vector Representation
• Method of Linked Representation
• Method of Matrix Representation

As on today,the best sorting algorithm has___________ performance

• n O(log n)
• O(n)
• O(n*n)
• O( log n)

For a linear search, with the average case complexity the total number of comparisons may take place in 1 execution:

• n/2
• (n+1)/2
• n
• None of the above

In a circular linked list

• components are all linked together in some sequential manner.
• components are arranged hierarchically.
• forward and backward traversal within the list is permitted.
• there is no beginning and no end.