Skill/Topic: ArrayA) Same nameB) different nameC) Multiple namesD) Unique nameExplanation: An array is a way to reference a series of memory locations using the same name. Each memory location is represented
Latest Answer : A) Same name. ...
Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: Popping is the reverse process of pushing: it removes an item from the stack. It is important to understand that popping an item off the stack
Latest Answer : yes. pop removes top element frm stack ...
Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: The pop() member method removes the value from the top of
Latest Answer : pop() method is used when we want to remove item frm stack. ...
Skill/Topic: Stacks using an ArrayA) VariableB) IndexC) CharacterD) FloatExplanation: The value at the top attribute is an index.
Latest Answer : top of stack implemented using an array is represented by the array index. ...
Skill/Topic: QueueA) TrueB) False
Latest Answer : in Double ended queue data can removed from either side ...
Skill/Topic: QueueA) TrueB) FalseExplanation: The ~Queue() member function is the destructor.It uses the delete operator to remove the array from memory when the instance of the Queue class goes out of
Latest Answer : False.. it is destructor. ...
Skill/Topic: Linked ListA) LinkB) NodeC) Data structureExplanation: Each entry in a linked list is called a node. Think of a node as an entry that has three subentries. One subentry contains the data,
Latest Answer : Each element in link list is called LINK ...
Skill/Topic: Linked ListA) A linked list is a data structure consisting of elements called nodes. Each node points to the next and the previous node, thereby linking nodes together to form a linked list.
Latest Answer : linked list is a data structure consisting of elements called nodes. ...
Skill/Topic: Linked ListA) NoneB) OneC) TwoD) ThreeExplanation: A node has three elements. These are the current data and pointers to the previous node and the next node on the linked list
Latest Answer : At least 2 or 3. A singly linked list will have at least one data element and a pointer. A doubly linked list will have at least one data element and 2 pointers. ...
Skill/Topic: Linked ListA) TrueB) FalseExplanation: Yes, a node can reference more than one data element if the current data element of the node is a pointer to a group of data such as an instance of
Latest Answer : Yes, a node itself can contain as many data elements as it needs and it can also reference other data elements. Following is an example of a complex node strcuture in a linked liststruct linkList{struct empNode{string empName;long empNo;struct empSal ...