Question

Question 6: Given a dynamic implementation of a stack of characters, named Stack, with the functions push and pop already implemented. What is the following code fragment doing? string strl, str2; Stack s; cin >> strl; for (int i=0; i<strl.length(); i++) s.push(str1[i]); for (int i=0; i<strl.length(); i++) s.pop(str2[i]); a) Prompting the user to enter a value for str1 and checking if str1 is palindrome b) Prompting the user to enter a value for str1 and copying it in reverse order into str2 c) Prompting the user to enter a value for str1 and copying it into str2 d) Removing spaces from strl and copying it to str2 e) None of the above Question 7: A queue performs the following commands (in pseudo-code): enqueue 2, 6, 8, 3, 10 dequeue two elements enqueue 7, 1, 5, 6 dequeue three elements What numbers are now at the front and rear of the queue? a) number at front is 7 and at rear is 6 b) number at front is 7 and at rear is 2 c) number at front is 2 and at rear is 7 d) number at front is 6 and at rear is 7 e) None of the above Question 8: The queue data structure is not suitable for: a) Implementation of recursion b) Communication software c) Operating systems d) Allocating resources and printing e) None of the above Question 9: If you add the following nodes to a binary search tree in the order they appear (left- to-right): 6 34 17 19 16 3 5 What will be the output of a preorder traversal of the resulting tree? a) 6 3 5 34 17 16 19 b) 3 5 6 16 17 19 34 c) 5 3 16 19 17 34 6 d) 6 34 17 16 19 3 5 e) None of the above

          Question 6: Given a dynamic implementation of a stack of characters, named Stack, with the
functions push and pop already implemented. What is the following code fragment doing?
string strl, str2;
Stack s;
cin >> strl;
for (int i=0; i<strl.length(); i++)
s.push(str1[i]);
for (int i=0; i<strl.length(); i++)
s.pop(str2[i]);
a) Prompting the user to enter a value for str1 and checking if str1 is palindrome
b) Prompting the user to enter a value for str1 and copying it in reverse order into str2
c) Prompting the user to enter a value for str1 and copying it into str2
d) Removing spaces from strl and copying it to str2
e) None of the above
Question 7: A queue performs the following commands (in pseudo-code):
enqueue 2, 6, 8, 3, 10
dequeue two elements
enqueue 7, 1, 5, 6
dequeue three elements
What numbers are now at the front and rear of the queue?
a) number at front is 7 and at rear is 6
b) number at front is 7 and at rear is 2
c) number at front is 2 and at rear is 7
d) number at front is 6 and at rear is 7
e) None of the above
Question 8: The queue data structure is not suitable for:
a) Implementation of recursion
b) Communication software
c) Operating systems
d) Allocating resources and printing
e) None of the above
Question 9: If you add the following nodes to a binary search tree in the order they appear (left-
to-right): 6 34 17 19 16 3 5
What will be the output of a preorder traversal of the resulting tree?
a) 6 3 5 34 17 16 19
b) 3 5 6 16 17 19 34
c) 5 3 16 19 17 34 6
d) 6 34 17 16 19 3 5
e) None of the above

Question 6: Given a dynamic implementation of a stack of characters, named Stack, with the
functions push and pop already implemented. What is the following code fragment doing?
string strl, str2;
Stack s;
cin >> strl;
for (int i=0; i<strl.length(); i++)
s.push(str1[i]);
for (int i=0; i<strl.length(); i++)
s.pop(str2[i]);
a) Prompting the user to enter a value for str1 and checking if str1 is palindrome
b) Prompting the user to enter a value for str1 and copying it in reverse order into str2
c) Prompting the user to enter a value for str1 and copying it into str2
d) Removing spaces from strl and copying it to str2
e) None of the above
Question 7: A queue performs the following commands (in pseudo-code):
enqueue 2, 6, 8, 3, 10
dequeue two elements
enqueue 7, 1, 5, 6
dequeue three elements
What numbers are now at the front and rear of the queue?
a) number at front is 7 and at rear is 6
b) number at front is 7 and at rear is 2
c) number at front is 2 and at rear is 7
d) number at front is 6 and at rear is 7
e) None of the above
Question 8: The queue data structure is not suitable for:
a) Implementation of recursion
b) Communication software
c) Operating systems
d) Allocating resources and printing
e) None of the above
Question 9: If you add the following nodes to a binary search tree in the order they appear (left-
to-right): 6 34 17 19 16 3 5
What will be the output of a preorder traversal of the resulting tree?
a) 6 3 5 34 17 16 19
b) 3 5 6 16 17 19 34
c) 5 3 16 19 17 34 6
d) 6 34 17 16 19 3 5
e) None of the above

Added by Alexandra B.

Question

Please give Ace some feedback