MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following traversal techniques lists the nodes of binary search in ascendingorder? |
| A. | pre order |
| B. | post order |
| C. | in order |
| D. | root order |
| Answer» D. root order | |
| 2. |
Every finite subset of a lattice has ____________. |
| A. | a Least Upper Bound and Greatest Lower Bound |
| B. | many Least Upper Bounds and a Greatest Lower Bound |
| C. | many Least Upper Bounds and many Greatest Lower Bounds |
| D. | either some Least Upper Bounds or some Greatest Lower Bounds |
| Answer» B. many Least Upper Bounds and a Greatest Lower Bound | |
| 3. |
An edge with identical ends is called _________. |
| A. | complete graph |
| B. | bipartite graph |
| C. | loops |
| D. | link |
| Answer» D. link | |
| 4. |
A _______ is an ordered collection of objects. |
| A. | relation |
| B. | function |
| C. | set |
| D. | proposition |
| Answer» D. proposition | |
| 5. |
R is a relation on N given by N = {(x, y): 4x + 3y = 20}. Which of the following belongs to R? |
| A. | (– 4, 12) |
| B. | (5, 0) |
| C. | (3, 4) |
| D. | (2, 4) |
| Answer» E. | |
| 6. |
One to one onto function is also called __________. |
| A. | bijective |
| B. | injective |
| C. | surjective |
| D. | composite function |
| Answer» B. injective | |
| 7. |
PDNF is also called _____________ |
| A. | sum of product canonical form |
| B. | product of sum canonical form |
| C. | sum canonical form |
| D. | product canonical form |
| Answer» B. product of sum canonical form | |
| 8. |
Traveling salesman problem is example for_______graph. |
| A. | eulerian |
| B. | hamiltonian |
| C. | tournament |
| D. | planar |
| Answer» C. tournament | |
| 9. |
A mapping x into itself is called __________. |
| A. | reflexive |
| B. | symmetric |
| C. | transitive |
| D. | equivalence |
| Answer» B. symmetric | |
| 10. |
If P then Q is called _________ statement |
| A. | Conjunction |
| B. | disjunction |
| C. | conditional |
| D. | bi conditional |
| Answer» D. bi conditional | |
| 11. |
Number of distinct nodes in any elementary path of length p is ________. |
| A. | p |
| B. | p-1 |
| C. | p+1 |
| D. | p*1 |
| Answer» D. p*1 | |
| 12. |
In a bounded lattice, an element b belongs to L is called a complement of an element abelongs to L if ______. |
| A. | a*b=0 |
| B. | a+b=1 |
| C. | both a and b |
| D. | none |
| Answer» D. none | |
| 13. |
A regular grammar contains rules of the form _____. |
| A. | A tends to AB |
| B. | AB tends to a |
| C. | A tends to aB |
| D. | AB tends to CD |
| Answer» D. AB tends to CD | |
| 14. |
A = {1,3,5,7,9} is a __________. |
| A. | null set |
| B. | finite set |
| C. | singleton set |
| D. | infinite set |
| Answer» C. singleton set | |
| 15. |
A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which ofthe following statement is TRUE? |
| A. | R is not an equivalence relation. |
| B. | R is an equivalence relation having one equivalence classes |
| C. | R is an equivalence relation having two equivalence classes |
| D. | R is an equivalence relation having three equivalence classes |
| Answer» D. R is an equivalence relation having three equivalence classes | |
| 16. |
The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______. |
| A. | reflexive, not symmetric, transitive |
| B. | not reflexive, symmetric, transitive |
| C. | reflexive, symmetric, not transitive |
| D. | reflexive, not symmetric, not transitive |
| Answer» C. reflexive, symmetric, not transitive | |
| 17. |
If G is a connected planar graph then it has a vertex of degree _______. |
| A. | 3 or less |
| B. | 4 or less |
| C. | 5 or less |
| D. | 6 or less |
| Answer» D. 6 or less | |
| 18. |
Every connected graph contains a ________. |
| A. | tree |
| B. | sub tree |
| C. | spanning tree |
| D. | spanning subtree |
| Answer» D. spanning subtree | |
| 19. |
A ____ is an edge e such that w(G-e)>w(G). |
| A. | cut vertex of G |
| B. | cut edge of G |
| C. | ends of G |
| D. | path of G |
| Answer» C. ends of G | |
| 20. |
Context free grammar is also known as _______ grammar. |
| A. | type 0 |
| B. | type 1 |
| C. | type 2 |
| D. | type 3 |
| Answer» D. type 3 | |
| 21. |
p → p is logically equivalent to |
| A. | p |
| B. | tautology |
| C. | contradiction |
| D. | none of these |
| Answer» C. contradiction | |
| 22. |
If a compound statement is made up of three simple statements then the number of rows inthe truth table is _______. |
| A. | 2 |
| B. | 4 |
| C. | 6 |
| D. | 8 |
| Answer» E. | |
| 23. |
The diagonal entries of A A^T where A is the adjacency matrix are the _______. |
| A. | outdegrees of the node |
| B. | indegrees of the nodes |
| C. | unit degree of the nodes |
| D. | in & out degrees of the nodes |
| Answer» B. indegrees of the nodes | |
| 24. |
If R be relation ‘ |
| A. | {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)} |
| B. | {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)} |
| C. | {(3, 3), (3, 5), (5, 3), (5, 5)} |
| D. | { (3, 3), (3, 4), (4, 5)} |
| Answer» D. { (3, 3), (3, 4), (4, 5)} | |
| 25. |
In a grammar or language LAMDA is used to denote _______. |
| A. | empty word |
| B. | entire set |
| C. | set of words |
| D. | set of letters |
| Answer» B. entire set | |
| 26. |
Which of the following is declarative statement? |
| A. | it’s right |
| B. | three is divisible by 3. |
| C. | two may not be an even integer |
| D. | i love you |
| Answer» C. two may not be an even integer | |
| 27. |
In Backus Naur Form the symbol:: = is used instead of _______. |
| A. | { } |
| B. | tends to |
| C. | <> |
| D. | $ |
| Answer» C. <> | |
| 28. |
If there are more than 2 LMD for a string then it is said to be ___________. |
| A. | Ambigious |
| B. | unambigious |
| C. | language |
| D. | finite state automata |
| Answer» B. unambigious | |
| 29. |
To prove the statement P tautologically implies the statement Q, it is enough to prove that_________. |
| A. | P conditional Q is a contradiction |
| B. | P conditional Q is a tautology |
| C. | P biconditional is a contradiction |
| D. | P biconditional Q is a tautology |
| Answer» C. P biconditional is a contradiction | |
| 30. |
If ((p → q ) → q) → p is F, then |
| A. | p is t, q is t |
| B. | p is t, q is f |
| C. | p is f, q is t |
| D. | p is f, q is f |
| Answer» D. p is f, q is f | |
| 31. |
If a node v is reachable from node u then the path of minimum length u to v is called _____. |
| A. | reachability |
| B. | node base |
| C. | geodesic |
| D. | accessibility |
| Answer» D. accessibility | |
| 32. |
In a graph if few edges have directions and few do not have directions then the graph iscalled _________. |
| A. | multi graph |
| B. | directed graph |
| C. | undirected graph |
| D. | mixed graph |
| Answer» E. | |
| 33. |
Let f : ( - 1, 1 ) → B be a function defined by f ( x ) = 2 1 x 1 2x tan - - , then f is both one-one and onto when B is the interval |
| A. | (0,π/2) |
| B. | (0,(-π)/2) |
| C. | (π/2,(-π)/2) |
| D. | ((-π)/2,π/2) |
| Answer» E. | |
| 34. |
The converse of p → q is |
| A. | ∼q → ∼p |
| B. | ∼ p → ∼ q |
| C. | ∼ p → q |
| D. | q → p |
| Answer» E. | |
| 35. |
A relation R in X is said to be a ________, if it is reflexive and symmetric. |
| A. | void relation |
| B. | circular |
| C. | partial order relation |
| D. | compatibility relation |
| Answer» E. | |
| 36. |
Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2, 3, 4}. Therelation R is ____. |
| A. | transitive |
| B. | reflexive |
| C. | not symmetric |
| D. | function |
| Answer» D. function | |
| 37. |
The number of vertices in a full binary tree is _______. |
| A. | odd |
| B. | even |
| C. | equal |
| Answer» B. even | |
| 38. |
The degree of vertex v in G is __________. |
| A. | number of edges of G incident with v |
| B. | number of loops in G |
| C. | number of links in G |
| D. | number of sub graph in G |
| Answer» B. number of loops in G | |
| 39. |
The set (A - B) – C is equal to the set |
| A. | (a – b) ∩ c |
| B. | (a∪ b) – c |
| C. | (a – b) ∪ c |
| D. | (a ∪ b) – c |
| Answer» E. | |
| 40. |
Let p denote the statement: “I finish my homework before dinner”, q: “It rains” and r: “I will go for a walk”, the representative of the following statement: if I finish my homework before dinner and it does not rain, then I will go for walk is |
| A. | p ˄ ~q ˄ r |
| B. | (p ˄ ~q )→ r |
| C. | p →(~q˄ r) |
| D. | (p →~q)→ r) |
| Answer» C. p →(~q˄ r) | |
| 41. |
A self complemented distributive lattice is called _______. |
| A. | boolean algebra |
| B. | modular lattice |
| C. | complete lattice |
| D. | self dual lattice |
| Answer» B. modular lattice | |
| 42. |
If an edge e is said to join the vertices u and v then the vertices u and v are called __. |
| A. | initial vertices |
| B. | terminal vertices |
| C. | ends of e |
| D. | all the above |
| Answer» C. ends of e | |
| 43. |
If p →q is F, then |
| A. | p is t, q is t |
| B. | p is f, q is t |
| C. | p is f, q is f |
| D. | p is t, q is f |
| Answer» E. | |
| 44. |
To any graph G there corresponds a vertex in a matrix called ________matrix. |
| A. | incidence |
| B. | adjacency |
| C. | square |
| Answer» B. adjacency | |
| 45. |
The set of all divisors of 24 are ___________. |
| A. | {1, 2, 3, 4, 6, 8, 12, 24} |
| B. | {2, 3, 4, 6, 8, 12} |
| C. | {1, 3, 6, 12,} |
| D. | {2, 4, 6, 8} |
| Answer» B. {2, 3, 4, 6, 8, 12} | |
| 46. |
A formula consisting of disjunctions of min-terms is called _________. |
| A. | DNF |
| B. | CNF |
| C. | PDNF |
| D. | PCNF |
| Answer» D. PCNF | |
| 47. |
In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cellright and reaching the state S1 is given by ________. |
| A. | f(Si , x) = Sj |
| B. | f(S0 , a) = S1 |
| C. | f(Si , a) = Sj |
| D. | f(S0 , x) = S1 |
| Answer» C. f(Si , a) = Sj | |
| 48. |
The relation R defined on the set A = {1, 2, 3, 4, 5} by R = {(x, y) : x2 – y2 < 16} is given by |
| A. | {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)} |
| B. | {(2, 2), (3, 2), (4, 2), (2, 4)} |
| C. | {(3, 3), (4, 3), (5, 4), (3, 4)} |
| D. | none of the above |
| Answer» E. | |
| 49. |
S -> aAB, AB -> bB, B -> b, A -> aB satisfies ___________ type of grammar |
| A. | 0 |
| B. | 1 |
| C. | 0,1 |
| D. | 2 |
| Answer» D. 2 | |
| 50. |
Let X and Y be the sets of all positive divisors of 400 and 1000 respectively (including 1 and the number). Then, n (X ÇY) is equal to |
| A. | 4 |
| B. | 6 |
| C. | 8 |
| D. | 12 |
| Answer» E. | |