data structure Choose the correct answer from the multiple choice

1 question Consider the following sequence of stack operations: push(d), push(h), popO. push(t), push(s), pop popO.push(m) Assume the stack is initially empty, what is the sequence of popped values ? a) hsf b) shf c) fsh d) hfs a correct answers a b) correct answer: b correct answer: correct answerd Bo brak Oncek 1/20 Sonrak Kapat Sinav Bitir question Consider the following pseudocode that uses a stack. Declare a stack SI Get the input string from the user While there are more characters in the input string) read a character from the input string W the characters will be read starting from the beginning of string push the character on the stack si push the character on the stack si While (stack si is not empty) Pop a character off the stack si Write the popped character to the screen What is output for input "hello"? a) hheelllloo b) oolllleehh c) hellohello d) olleholleh question Given the following code: struct Node SIEF ADDEEN ADDEEN SUL int data: struct Node prev: struct Node* next; Which one of following statements delete the node pointed by X? (Assume that X does not point to head or tail of the linked list) a) X->prev->next=x->prev; x->next-prev=X->next; b) X->prev->prev=X->next; x->next->next=X ->prev: c) X->prev->next-X->next; X->next-prev=X->prev; a) X->prev->prev=X->prev; x->next->next-X->next; Cerap Listesi a) correct answer a b) correct answerb correct answer d) correct answerd question Given the following code: struct Node int data: struct Node prev: struct Node next; struct Noda hend; void funx [ if(head=NULL) 1 return; struct Node current=head; while (current->next!=NULL) current=current->next; while (current !=NULL) 1 printf("%d ", current->data); current-current->prev; What is the functionality of this function? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) None a) correct answer: a b) correct answer: correct answer: Bo brak or