CS-6201 - Discrete Structures oed answer key
Showing 1 to 20 of 106 total answers.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
ADT means
Answer
Abstract Data Type
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
A queue is a FIFO list
Answer
True
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
A node is _____________
Answer
An elements
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Implementation of ADT requires
Answer
choosing a data representation
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the proposition is is:
Answer
Logically equivalent to
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Size of a liked list can be zero
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
What is the negation of a tautology?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Logic is a system based on __________.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Storage capacity of an array is static
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
This is a statement that is always false.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
A full binary tree with 2n+1 nodes contain
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
How many nodes in a tree have no ancestors?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Stack applies the Last In First Out process
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the following statement is correct?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
A train is an example of _____ data structure
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
The first node of a linked list is called head
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the following describes an algorithm?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Array is a common example of a linear structure
#CS-6201
Awesome StudentQuestion • Discrete Structures 2