Two finite state machines are said to be equivalent if they
have same number of edges
have same number of states and edgesCorrect
recognize same set of tokens
have same number of states
What is the 8th term in the binomial expansion of (2x+y)16?
5,857,280 x7 y9
5,857,280 x8 y8
5,857,280 x9 y7Correct
5,857,280 x16 y16
What is the coefficient of aby98 in the binomial expansion of (ab+y)99?
99Correct
98
100
4,851
What is the coefficient of x101 y99 in the expansion of (2x-3y)200?
C(200,101) (2)101 (-3)99
C(200,101) (2)99 (-3)101
C(200,99) (2)101 (-3)99Correct
C(200,99) (2)99 (-3)101
What is the maximum possible number of nodes in a binary tree at level 6
32
16
64Correct
128
What is the negation of a tautology?
ContradictionCorrect
Unary Negation
Implication
Binary Negation
What is the probability of arriving at a traffic light when it is red if the red signal is flashed for 30 sec, the yellow signal for 5 sec, and the green signal for 40 sec?
The probability is 040Correct
The probability is 050
The probability is 045
The probability is 035
When inorder traversing a tree resulted e a c k f h d b g; the preorder traversal would return.
faekcdhgbCorrect
abcdefghk
eafkhdcbg
faekcdbhg
Which concept considers the arrangement of objects / elements in a set?
permutationsCorrect
pigeonhole
counting theory
combination
Which is not an invariant when determining if graphs are isomorphic?
same degree of vertices
existence of closed loopsCorrect
same number of edges
same number of vertices
Which logical operator represents the statement "if and only if"?
biconditionalCorrect
conditional
implication
conjunction
Which of is a formula for the sequence 3, 6, 12, 24, 48, ...? Assume that the first term in the sequence is called a0?
an = 3(n+1)
an = 3n + 3
an = 3 =C2=B7 2n-1
none of the givenCorrect
an = 2an-1
Which of the following applies Last In Last Out?
None of the choicesCorrect
Stack
Linked List
Queue
Which of the following describes a Stack data structure?
A Stack is a Last In First Out
Stack uses the push() and pop() function
All of the choicesCorrect
A Stack in an ordered list
Which of the following describes an algorithm?
algorithm can be a programming language
algorithm is used to store data
executed in a way to get a required outputCorrect
algorithm is software that used to compute complex numbers
Which of the following does not describes a linked list?
None of the choicesCorrect
A linked list can contain any data type
A linked list can be sorted
A linked list can be unsorted
Which of the following does NOT describes non-linear data structure?
Data can be traverse in singular runCorrect
Tree is an example of a non-linear data structure
Each item is attached with many other items
Implementation is difficult
Which of the following graphs is not a characteristics of isomorphic graphs?
Graphs with the same number of vertices
Graphs with the same number of edges
Graphs with different adjacency matricesCorrect
Graphs with the same adjacency matrices
Which of the following is a linear data structure?
StackCorrect
Graph
None of the choices
Binary Tree
Which of the following is a recurrence relation for the sequence that begins 3, 6, 9, 12, 15, ...?
an = 3an-1
an = an-2 + 6Correct
an = an-1 + 3n
an = 3n
Which of the following is an example of data structure?
Collection of books
Computer memory allocation
Stack of plates
all of the choicesCorrect
Which of the following is NOT a characteristic of a data type?
set of values
set of representation
set of functionsCorrect
set of operations
Which of the following is not a component of a data structure?
None of the choicesCorrect
Operations
Algorithm
Storage Structures
Which of the following is not a recurrence relation?
primality of numbersCorrect
fibonacci sequence
simple and compound interest computations
geometric sequence
Which of the following is not the part of ADT description?
Operations
Data
None of the choicesCorrect
All of the choices
Which of the following programming language is NOT used to implement a data structure?
C
None of the choicesCorrect
Python
Ruby
Which of the following statement is correct?
Stack applies the FIFO
Queue applies the FILO
Stack applies the LIFOCorrect
Queue applies the LIFO
Which of the following statements about binary trees is NOT true?
Every binary tree has at least one nodeCorrect
No correct answer
Every non-root node has exactly one parent
Every node has at most two children
Every non-empty tree has exactly one root node
Which of the proposition is is:
all of the given
A contradiction
Logically equivalent to Correct
A tautology
Which rule states that if (k + 1) or more objects are placed into k boxes, then there is at least one box containing two or more of the objects?
product rule
sum rule
pigeonhole principleCorrect
inclusion-exclusion
You have 12 balls, numbered 1 through 12, which you want to place into 4 boxes, numbered 1 through 4. If boxes can remain empty, in how many ways can the 12 balls be disturbed among the 4 boxes?