ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 81 to 100 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following best describes the code spop(10);
Answer
An error will occur
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A stack and a queue are different names for the same ADT.
Answer
FALSE
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
LINK is the pointer pointing to the ____________________.
Answer
predecessor node
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Moving from one node to another is called _______________
Answer
Link hopping or pointer hopping
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Sequential implementation is represented as a linear list
Answer
False
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The elements are removal from a stack in _________ order.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
To delete an element, we get the data from the first node
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following best describes the code apush(10);
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following data structure is non-linear type?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
An Abstract Data Type that stores elements hierarchically.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In a 2-tree, nodes with 0 children are called ___________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In linked lists, there are no NULL links in ______________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
the association of keys and values defines a ____________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The following are some of the applications of heaps except
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This is the term used to delete an element from the stack.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following is not the part of ADT description?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
You may insert an element in the middle of the linked list
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Deleting an element is only allowed in a singly linked list
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis