Professional Documents
Culture Documents
DISCRETE SRUCTURES
1) Let A and B be any two arbitrary events then which one of the following is true ?
Answer = D
2) If X and Y be the sets. Then the set ( X - Y) union (Y- X) union (X intersection Y ) is equal to?
a. X union Y
b. Xc union Yc
c. X intersection Y
d. Xc intersection Yc
Answer = A
a. e<=n
b. e<=2n
c. e<=3n
d. None of these
Answer = B
Answer = B
5) Probability that two randomly selected cards from a set of two red and two black cards are of
same color is ?
a. 1 / 2
b. 1 / 3
c. 2/3
d. None of these
Answer = B
6) The number of circuits that can be created by adding an edge between any two vertices in a
tree is ?
a. Two
b. Exactly one
c. At least two
d. None
Answer = B
b. A self loop
c. Two circuits
d. n number of paths
Answer = A
8) The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to
guarantee that three cards are from some same suit is ?
a. 8
b. 3
c. 9
d. 12
Answer = C
a. union, intersection
b. Intersection , complement
Answer = C
d. None of above
Answer = D
a. A Compiler
b. A language expression
c. A regular expression
d. None of these
Answer = B
Explanation: Context free Grammar generate the context free languages. These are defined by the
rule of the form A -> b Where Aanon terminal and b is the string of terminals.
a. Finite automata
c. Deterministic automata
d. None of these
Answer = B
Explanation: Push down automata manipulate the stack, as a part of performing a transition.
13) A Pushdown automata is.....if there is at most one transition applicable to each configuration ?
a. Deterministic
b. Non Deterministic
c. Finite
d. Non Finite
Answer = A
Explanation:If in every situation only one transition is available as continuation of computation,
then the result is a deterministic push down automation (DPDA).
a. Finite diagram
b. State diagram
c. Node diagram
d. E-R diagram
Answer = B
Explanation: State diagram is called the graphical representation of Finite automata.
15) If two sets A and B have no common elements i.e (A intersection B) has no element then such
sets are known as ?
a. Intersection
b. Union
c. Disjoint
d. Complement
Answer = C
Explanation:If two sets have no element in common then they are called disjoint sets.
d. None of these
Answer = C
Answer = A
Explanation: A regular language is accepted by the finite automation. Every regular language is
context free.
18) Which of the following does not belong to the context free grammer?
a. Terminal symbol
b. Non-terminal symbol
c. Start symbol
d. End symbol
Answer = D
Explanation:Context free grammar consist of terminal symbols, non terminal symbols, set of
production rules, a start symbol but does not have any End symbol.
c. English grammar
d. None of above
Answer = A
Explanation: Regular grammar is context free grammar. Such a grammar restricts its rules to a
single non terminal on the left hand side and right hand side consisting of a single terminal.
a. Union
b. Kleene star
c. Concatenation
d. All of above
Answer = D
Explanation: Context free language is closed under union, kleene star and concatenation.
c. Equations
d. None of these
Answer = B
Explanation: A graph contains the edges and vertices
Answer = A
Explanation: The number of edges connected on a vertex v with the self loop counted twice is
called the degree of vertex.
23) If for some positive integer k, degree of vertex d(v)=k for every vertex v of the graph G, then G
is called... ?
a. K graph
b. K-regular graph
c. Empty graph
d. All of above
Answer = B
Explanation: A graph in which all vertices are of equal degree is called regular graph.
24) A graph with no edges is known as empty graph. Empty graph is also known as... ?
a. Trivial graph
b. Regular graph
c. Bipartite graph
d. None of these
Answer = A
Explanation: Trivial graph is the second name for empty graph.
Answer = B
Explanation: A walk is defined as finite altering sequence of vertices and edges. No Edges appear
more than once but vertex may appear more than once.
26) If the origin and terminus of a walk are same, the walk is known as... ?
a. Open
b. Closed
c. Path
d. None of these
Answer = B
Explanation: A walk which begins and ends with same vertex is called closed walk otherwise it is
open.
a. Cyclic graph
b. Regular graph
c. Tree
d. not a graph
Answer = C
a. max { d(u,v): u belongs to v, u does not equal to v : where d(u,v) is the distance between u&v}
c. Both A and B
d. None of these
Answer = A
Explanation: The eccentricity E(v) of a vertex V in the graph is the distance from v to the vertex
farthest from v in G.
Answer = A
Explanation: The diameter or radius of a graph G is largest distance between two vertices in the
graph G.
a. nn-2
b. n*n
c. nn
d. n2
Answer = A
31) A tour of G is a closed walk of graph G which includes every edge G at least once. A .....tour of
G is a tour which includes every edge of G exactly once ?
a. Hamiltonian
b. Planar
c. Isomorphic
d. Euler
Answer = D
Explanation: If some closed walk in a graph contains all the edges then the walk is called Euler.
a. Euler
b. Hamiltonian
c. Tree
d. Path
Answer = D
Explanation:Path is a way from one node no another but not a graph.
a. A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
b. A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two
non - empty disjoint subset X and Y in such a way that each edge of G has one end in X and one
end in Y.
d. None of these
Answer = A
34) A continuous non - intersecting curve in the plane whose origin and terminus coincide ?
a. Planer
b. Jordan
c. Hamiltonian
d. All of these
Answer = B
Explanation: The jordan graph is the set of all vertices of minimum eccentricity that is the set of
all vertices A where the greatest distance to other vertex B is minimal.
b. A plane graph
c. A graph in which the degree of every vertex and every face is atleast 3
d. All of above
Answer = D
Explanation: A polyhedral graph is the undirected graph formed from the vertices and edges of a
convex polyhedron
36) A path in graph G, which contains every vertex of G once and only once ?
a. Eulartour
b. Hamiltonian Path
c. Eular trail
d. Hamiltonian tour
Answer = B
Explanation:A Hamiltonian circuit in a connected graph is defined as a closed walk that traverse
every vertex of G exactly once except the starting vertex.
b. A tree
c. Minimum weights
d. All of above
Answer = D
Explanation: A tree is said to be spanning tree of connected graph G if it is subgraph of G and
contains all the vertices of G.
a. Spanning tree
b. Rooted tree
c. Weighted tree
d. None of these
Answer = B
Explanation:A tree in which one vertex distinguish from all other is called rooted tree.
b. max( d(u,v) )
c. Both A and B
d. None of these
Answer = C
Explanation: The diameter of a graph G is largest distance between two vertices in a graph G.
d. None of these
Answer = C
Explanation: The vertex of a graph is called even or odd based on its degree.
41) If the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2),
pop are performed on a stack, the sequence of popped out values are ?
a. 2, 2, 1, 1, 2
b. 2, 2, 1, 2, 2
c. 2, 1, 2, 2, 1
d .2, 1, 2, 2, 2
Answer = A
Explanation: The elements are popped from the top of the stack.
a. radix sort
b. quick sort
c. recursion
Answer = A
Explanation: A simple version of an LSD radix sort can be achieved using queues as buckets.
43) A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec, it can approximately
sort ?
a. 400 names
b. 800 names
c. 750 names
d. 800 names
Answer = A
Explanation:For sorting 200 names bubble sort makes 200 x 199/2 = 19900 comparisons. The time
needed for 1 comparison is 200 sec. In 800 sec it can make 80,000 comparisons. We have to fine
n, such that n(n - 1)/2 = 80,000. From this n is approximately 400.
44) A machine needs a minimum of 100 sec to sort 1000 names by quick sort.The minimum time
needed to sort 100 names will be approximately ?
a. 50.2 sec
b. 6.7 sec
c. 72.7 sec
d. 11.2 sec
Answer = B
Explanation: In the best case quick sort algorithm makes n log(n) comparisons. so 1000 x log
(1000) = 9000 comparisons, which takes 100 sec. To sort 100 names a minimum of 100 log(100) =
600 comparisons are needed. This takes 100 x 600/9000 = 6.7 sec.
45) The number of binary trees with 3 nodes which when traversed in post order gives the
sequence A,B,C is ?
a. 3
b. 9
c. 7
d. 5
Answer = D
46) The average search time of hashing with linear probing will be less if the load factor ?
b. equals one
d. none of above
Answer = A
Explanation:Load factor is the ratio number of records that are currently present and the total
number of records that can be present. If the load factor is less, free space will be more. This
means probability of collision is less. So the search time will be less.
47) A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is ?
a. log2n
b. n - 1
c. n
d. 2n
Answer = B
Explanation: It can be proved by induction that a binary tree with n leaf nodes will have total of 2n
- 1 nodes. So number of non-leaf nodes is (2n - 1)-n=n-1
a. Interrupts
b. DMA
c. Polling
d. Cache memory
Answer = D
Explanation:In principal of phenomenon the same value or same memory location is being used
frequently.
c. higher dimension
d. none of above
a. ab + cd - *
b . ab cd + - *
c. ab + cd * -
d. ab + - cd *
Answer = A
b. lattice
c. boolean algebra
d. none of these.
Answer= A
a. Boolean algebra
b. modular lattice.
c. complete lattice
d. None of these
Answer=A
53) Different partially ordered sets may be represented by the same hasse diagram if they are
same.
a. same
c. isomorphic
d. order isomorphic
Answer=D
a. 16
b. 8
c. 15
d. 4
Answer=C
55) If * is defined on R* as a*b= ab/2, then identity element in the group (R*,*) is
a. 1
b. 2
c. ½
d. 1/3
Answer =B
56) If sets A and B have 3 and 6 elements each, then minimum number of elements in AU B is
a. 3
b. 6
c. 9
d. 18
Answer= B
a. n
b. 2n
n2
c.
d. 2n
Answer=D
58) if F(x) and g(x) are defined on domains A,B respectively then domain of f(x)+g(x) is
a. AUB
b. A intersection B
d A-B
Answer= B
a. 3
b. 6
c. 8
d. 9
Answer=C
a. 8
b. 9
c. 18
d. 512
Answer=D