Introduction To Data Structures - Study Mode

Show All Answers

[#186] What is the functionality of the following code? Choose the most appropriate answer. public int function()
{
if(head == null)
return Integer.MIN_VALUE
int var
Node temp = head
Node cur
while(temp.getNext() != head)
{
cur = temp
temp = temp.getNext()
}
if(temp == head)
{
var = head.getItem()
head = null
return var
}
var = temp.getItem()
cur.setNext(head)
return var
}

(A) Return data from the end of the list

(B) Returns the data and deletes the node at the end of the list

(C) Returns the data from the beginning of the list

(D) Returns the data and deletes the node from the beginning of the list

Correct Answer

(B) Returns the data and deletes the node at the end of the list

[#187] What does the following function do for a given Linked List with first node as head? void fun1(struct node* head)
{
if(head == NULL)
return
fun1(head->next)
printf("%d ", head->data)
}

(A) Prints all nodes of linked lists

(B) Prints all nodes of linked list in reverse order

(C) Prints alternate nodes of Linked List

(D) Prints alternate nodes in reverse order

Correct Answer

(B) Prints all nodes of linked list in reverse order

[#188] After performing these set of operations, what does the final list look contain? InsertFront(10)
InsertFront(20)
InsertRear(30)
DeleteFront()
InsertRear(40)
InsertRear(10)
DeleteRear()
InsertRear(15)
display()

(A) 10 30 10 15

(B) 20 30 40 15

(C) 20 30 40 10

(D) 10 30 40 15

Correct Answer

(D) 10 30 40 15

[#189] The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution? struct node
{
int value
struct node next
}
void rearrange(struct node list)
{
struct node p, q
int temp
if ((!list) || !list->next)
return
p = list
q = list->next
while(q)
{
temp = p->value
p->value = q->value
q->value = temp
p = q->next
q = p?p->next:0
}
}

(A) 1, 2, 3, 4, 5, 6, 7

(B) 2, 1, 4, 3, 6, 5, 7

(C) 1, 3, 2, 5, 4, 7, 6

(D) 2, 3, 4, 5, 6, 7, 1

Correct Answer

(B) 2, 1, 4, 3, 6, 5, 7

[#190] Consider the following definition in c programming language. struct node
{
int data
struct node * next
}
typedef struct node NODE
NODE *ptr
Which of the following c code is used to create new node?

(A) ptr = (NODE*)malloc(sizeof(NODE))

(B) ptr = (NODE*)malloc(NODE)

(C) ptr = (NODE*)malloc(sizeof(NODE*))

(D) ptr = (NODE)malloc(sizeof(NODE))

Correct Answer

(A) ptr = (NODE*)malloc(sizeof(NODE))