Data Structure CUP

From the following which is not the operation of data structure?

• Operations that manipulate data in some way

• Operations that perform a computation

• Operations that check syntax errors

• Operations that monitor an object for the occurrence of a controlling event

In a circular linked list, insertion of node requires modification of ………………… pointer.

• Zero

• One

• Two

• Three

What is the missing statement in the max algorithm of the 2d array?

Algorithm: Maximum

Input: Array

Output: maxValue

Method: Let maxValue = Array[0][0]

Repeat for K = LBr to UBr Repeat for J = LBc to UBc

\*Missing statement*\

[End Loop]c [End Loop]r

Display("Maximum value in Array is: ", maxValue) End

• If (Array[K][ J ] > maxValue ) Then maxValue = Array[ K ][ J ] [End If]

• If (maxValue >Array[K][ J ] ) Then maxValue = Array[ K ][ J ] [End If]

• If (Array[J][ K] > maxValue ) Then maxValue = Array[ J ][ K ] [End If]

• If (Array[K][ J ] > maxValue ) Then Array[ K ][ J ] = maxValue [End If]

Which among the following segments of code add the node at the beginning of a single LinkedList?

• newNode.next = head , Head = newNode

• Head = newNode , newNode.next = head

• newNode.next = tail , Head = newNode

• newNode.next = head , tail = newNode

Which of the following is an advantage of a circular linked list?

• If not handled proper validation then code may go in an infinite loop.

• Not easy to reverse a circular linked list.

• any node can be starting point means we can traverse each node from any point.

• Harder to find the end of the list and loop control.

How do you count the number of elements in the circular linked list?

• a) set temp = head.Next; while(temp != head) temp = temp.Next; length++; return length;

• b) Set temp = head.Next; while(temp != null) temp = temp.Next; length++; return length;

• c) Set temp = head.Next; while(temp != head && temp != null) temp = head.Next; length++; return length;

• d) Set temp = head.Next; while(temp != head && temp == null) temp = head.Next; length++; return length;

In a singly linked list, how does each node store the reference to the next node?

• Pointer

• Index

• Value

• Key

What is the advantage of a linked list over an array?

• Constant time access

• Dynamic size

• Sequential access

• Automatic resizing

In a circular linked list, where does the last node point to?

• Null

• The first node

• The previous node

• It points nowhere

What is the time complexity for traversing a singly linked list with 'n' nodes?

• O(1)

• O(log n)

• O(n)

• O(n^2)