CS-6201 - Discrete Structures oed answer key
Showing 61 to 80 of 106 total answers.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
What is the maximum possible number of nodes in a binary tree at level 6
Answer
64
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Every tree with at least two nodes has at least two nodes of what degree?
Answer
1
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the following graphs is not a characteristics of isomorphic graphs?
Answer
Graphs with different adjacency matrices
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Data structure is defined as a specialized format for _______ and ______ data
Answer
organizing, storing
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Describe the process of removing an element at the tail of a singly linked list
Answer
Removing an element at the tail of the singly list is not easy
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
A data structure wherein the data have to be stored and retrieved in reverse order
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
How many nonisomorphic simple graphs are there with five vertices and three edges?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
The size of a singly linked list is always fixed but the size can grow dynamically
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the following programming language is NOT used to implement a data structure?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
When inorder traversing a tree resulted e a c k f h d b g; the preorder traversal would return.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of the following is a recurrence relation for the sequence that begins 3, 6, 9, 12, 15, ...?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
In order to get the contents of a binary search tree in ascending order, one has to traverse it in.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
"A simple graph with 15 vertices with each having a degree of 5 can exist." This statement is ________.
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
The first step to insert an element at the tail of a linked list is to increase the size of the linked list
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
The preorder and post order traversal of a Binary Tree generates the same output. The tree can have maximum
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Suppose you wish to prove this statement "If n is an integer, then n =E2=89=A4 n3." Which of the following is correct?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Which of is a formula for the sequence 3, 6, 12, 24, 48, ...? Assume that the first term in the sequence is called a0?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2
Consider the following finite automaton A over =CE=A3 = {a,b,c}:Which of the following statements about A is/are correct?
#CS-6201
Awesome StudentQuestion • Discrete Structures 2