.png){kind=logo}
PDF Download
FREE AND STUDY GAMES ABOUT M2 - CCS0015 EXAM
QUESTIONS
Actual Qs and Ans Expert-Verified Explanation
This Exam contains:
-Guarantee passing score -45 Questions and Answers -format set of multiple-choice -Expert-Verified Explanation Question 1: TRUE/FALSE: A static stack is implemented using arrays.
Answer:
FALSE /
Question 2: TRUE/FALSE: cout << list.front() << endl; front returns a reference to the last element of the list.
Answer:
FALSE; outputs first
Question 3: [T/F] list [int] myList; // is a valid declaration
Answer:
FALSE Question 4: TRUE/FALSE: Appending a node means adding a node at the start of the list.
Answer:
FALSE; adding at the end
Question 5: TRUE/FALSE: A doubly linked list has both a next and previous node pointers.
Answer:
TRUE /
Question 6: [T/F] list.unique();
unique removes any element that has the same value as the element
Answer:
FALSE*
Question 7: TRUE/FALSE: STL lists are also efficient at adding elements at their back because they have a built-in pointer to the last element in the list.
Answer:
TRUE /
Question 8: TRUE/FALSE: The STL stack container may be implemented as a vector, a list, or a deque.
Answer:
TRUE /
Question 9: TRUE/FALSE: In a dynamic stack, the pointer TOP is like the HEAD which always point to the first element of the linked list.
Answer:
TRUE /
Question 10: [T/F] In a DYNAMIC STACK, the node that was POPPED is deleted.
Answer:
TRUE /
Question 11: TRUE/FALSE: In inserting a node, finding its proper location and following a certain order is necessary.
Answer:
TRUE /
Question 12: TRUE/FALSE: Each node in a linked list contains one or more members that represent data and a pointer which can point to another node.
Answer:
TRUE /
Question 13: [T/F] In a dynamic stack, pointer TOP points to a fixed value in the linked list and does not move.
Answer:
FALSE; point to most recently added node /
Question 14: Which of the following is an application of a stack?
Group of answer choices Printer Spooler Calculator CPU Scheduling Sending of Network Packets
Answer:
CALCULATOR /
Question 15: [T/F] The STL empty function will yield a value of true if the stack has elements.
Answer:
FALSE; will yield false / Question 16: The following are stack operations except:
Answer:
CLEAR /
Question 17: TRUE/FALSE: Pop function will always retrieve the top.
Answer:
TRUE /
Question 18: TRUE/FALSE: In addition to the data, each node contains a pointer, which can point to another node.
Answer:
TRUE /
Question 19: TRUE/FALSE: The STL function push retrieves an element at the top of the stack.
Answer:
FALSE; add an element instead of retrieving /
Question 20: The manner in which a stack behaves?
Answer:
LIFO /
Question 21: The following are 3 possible containers that can be used in implementing the STL
Stack, except:
Answer:
ARRAY /
Question 22: TRUE/FALSE: A linked list is a series of connected nodes, where each node is a data structure.
Answer:
TRUE /
Question 23: TRUE/FALSE: cout << list.back() << endl; The back member function returns a reference to the last element in the list.
Answer:
TRUE /
Question 24: TRUE/FALSE: A linked list can grow or shrink in size as the program runs.
.png)