CS-6201 - Discrete Structures oed answer key

Showing 21 to 40 of 106 total answers.

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

The size need to be specific during declaration

Answer

The statement describes an array

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

How many edges does a tree with V vertices have?

Answer

V - 1

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following applies Last In Last Out?

Answer

None of the choices

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Let p and q be propositions. does not imply is:

Answer

True

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following is a linear data structure?

Answer

Stack

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Binary tree is similar to an array in data structure

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following is not a recurrence relation?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

The number of different directed trees with 3 nodes is

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following is an example of data structure?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following describes a Stack data structure?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following does not describes a linked list?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

After creation, the size of an array can grow or increase

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Finite automata requires minimum _______ number of stacks.

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Which of the following is not the part of ADT description?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

A terminal node in a binary tree is called _______________.

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Doubly linked list doubles the size of a singly linked list

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

How many terms does the binomial expansion of (2x+3)99 has?

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

Two finite state machines are said to be equivalent if they

#CS-6201
Awesome StudentQuestion • Discrete Structures 2

What is the 8th term in the binomial expansion of (2x+y)16?

Page 2 of 6