DS Quiz-1

Consider the following pseudocode that uses a stack

declare a stack of characters

while ( there are more characters in the word to read )

{

read a character

push the character on the stack

}

while ( the stack is not empty )

{

pop a character off the stack

write the character to the screen

}

• geeksquizgeeksquiz

• ziuqskeeg

• geeksquiz

• ziuqskeegziuqskeeg

Which of the following correctly declares an array?

• (A) int geeks[20];

• (B) int geeks;

• (C) geeks{20};

• (D) array geeks[20];

1. Process of inserting an element in stack is called ____________

• a) Create

• b) Push

• c) Evaluation

• d) Pop

Process of removing an element from stack is called __________

• a) Create

• b) Push

• c) Evaluation

• d) Pop

In a stack, if a user tries to remove an element from empty stack it is called _________

• a) Underflow

• b) Empty collection

• c) Overflow

• d) Garbage Collection

Pushing an element into stack already having five elements and stack size of 5, then stack becomes

• a) Overflow

• b) Crash

• c) Underflow

• d) User flow

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

• a) Pointer to character

• b) Pointer to integer

• c) Pointer to node

• d) Node

Consider the following definition in c programming languagestruct 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));

Linked list is considered as an example of ___________ type of memory allocation.

• a) Dynamic

• b) Static

• c) Compile time

• d) Heap

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;

}

}

• 1, 2, 3, 4, 5, 6, 7

• 2, 1, 4, 3, 6, 5, 7

• 1, 3, 2, 5, 4, 7, 6

• 2, 3, 4, 5, 6, 7, 1