I-kon free test for Shreeyash Engineering College: Question paper

1. 1
Mock GATE,
I-kon Engineering Academy,
Osmanpura, Aurangabad
Duration:- 1hr
Full Name:-
Name of College:-
Mobile No.:- Email ID:-
Note:-
1. Each question carries 1 mark.
2. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE
marks(1/3 rule).
Q.1 A starvation free job scheduling policy guarantees that no job waits indefinitely for service.
Which of the following job scheduling plicies is starvation free
(A) Round Robin (B) Priority Queuing
(C) Shortest Job First (D) Youngest Job First
ANSWER=
Q.2 Consider the following transformations on a string of five bits
T1: Complement any two bits
T2: Exchange any two bits
which of the following can not be obtained from the string 00000 by any sequence of applications
of T1 & T2
(A) 11011 (B) 10001
(C) 01010 (D) 00100
ANSWER=
Q.3 Which of the following is the name of the data structure in a compiler that is resposible for
managing information about variables & their attributes
(A) Abstract Syntax Tree(AST) (B) Attributed Grammar
(C) Symbol Table (D) Semantic Stack
ANSWER=
Q.4 Suppose that P(x, y) means “x is parent of y” & M(x) means “x is male”. If F(v, w) equals
M(v) ∧ ∃x, y(P(x, y) ∧ P(x, v) ∧ (y = v) ∧ P(y, w))
what is meaning of the expression F(v, w)
(A) v is a brother of w. (B) v is a nephew of w.
(C) v is an uncle of w. (D) v is a grandfather of w.
ANSWER=
Q.5 Which of the following statements about Ehernets is typically FALSE?
(A) Ethernets use circuit switching to send message.
(B) Ethernets use buses with multiple masters.
(C) Network connected by Ethernets are limited in length to a few hundred meters.
(D) Packets sent on Ethernets are limited in size.
ANSWER=
Q.6 Which of the following is(are) true about virtual memory systems that use pages?
I. The virtual address space can be larger than amount of physical memory.

2. 2 Mock GATE, I-kon Engineering Academy
II. Programs must be resident in main memory throughout their execution.
III. Pages correspond to semantic characteristics of the program
(A) I only (B) I & II only
(C) II only (D) I, II & III
ANSWER=
Q.7 In the Internet Protocol(IP) suite, which of the following best describes the purpose of the
Address Resoultion Protocol(ARP)
(A) To translate web addresses to host names.
(B) To determine the IP address of a given host name.
(C) To determine the hardware addrss of a given host name.
(D) To determine the hardware address of a given IP address.
ANSWER=
Q.8 Let k be an integer greater than 1. which of the following represents the order of growth of
the expression
n
i=1 ki
(A) Θ(kn
) (B) Θ(kn·log n
)
(C) Θ(kn
· log n) (D) Θ(k2kn
)
ANSWER=
Q.9 Mergesort works by splitting a list of n numbers in half, sorting each half recursively and
merging the two halves. which of the following data structures will allow mergesort to work in
O(nlog n) time?
I. A singly linked list.
II. A doubly linked list.
III. An array.
(A) None (B) III only
(C) I & II only (D) I, II & III
ANSWER=
Q.10 Which of the following statements about datagrams sent by a node in a network is(are)
true?
I. Datagrams at the source must be the size of the smallest transmission unit(MTU) of all the
links on a path to the destination.
II. Datagrams may be fragmented during network.
III. Datagrams are reasembled only at the destination.
(A) I only (B) I & II only
(C) II only (D) II & III only
ANSWER=
Q.11 Consider the following grammar
S −→ (S)
S −→ x
which of the follwing statements is(are) true?
I. The grammar is ambiguous.
II. The grammar is suitable for top-down parsing.
III. The grammar is suitable for bottom-up parsing.
(A) I only (B) III only
(C) II only (D) II & III only
ANSWER=

3. 3
Q.12 Let P be a procedure that for some inputs calls itself(i.e. is recursive). If P is guaranteed
to terminate, which of the following must be true?
I. P has a local variable.
II. P has an execution path where it does not call itself.
III. P either refers to global variable or has at least one parameter.
(A) I only (B) I & II only
(C) II only (D) II & III only
ANSWER=
Q.13 Let A be a finite nonempty set with cardinality n. The number of subsets S ⊆ A having
odd cardinality is
(A) 2n/2
(B) n
(C) 2n−1
(D) none of the above
ANSWER=
Q.14 Of the following sorting algorithms, which has a running time that is LEAST dependent on
the initial ordering of the input?
(A) Insertion Sort (B) Quicksort
(C) Selection Sort (D) Mergesort
ANSWER=
Q.15 The language {ww|w ∈ (0 + 1)∗
}
(A) Not accepted by any Turing Machine
(B) Accepted by Turing machine, but by no pushdown automata
(C) Accepted by pushdown automata, but not context free
(D) regular
ANSWER=
Q.16 Which of the following regular expression is equivalent to (a∗
+ b)∗
(c + d)?
(A) a∗(c + d) + b(c + d) (B) a∗(c + d) + b∗(c + d)
(C) (a + b)∗c + (a + b)∗d (D) (a∗ + b)c + (a∗ + b)d
ANSWER=
Q.17 Consider the following process
begin
x := y
x := x + 1
end
If x and y are initially 0 and two copies of the process run concurrently sharing the same
data, what is the set of possible values of x after both copies of process terminate?
(A) {1} (B) {2} (C) {1, 2} (D) {0, 1, 2}
ANSWER=
Q.18
S −→ (S + S)
S −→ (S ∗ S)
S −→ a
How many distinct parse trees does the string a+a*a+a have under the grammar
above?
(A) 5 (B) 6 (C) 7 (D) 8
ANSWER=

4. 4 Mock GATE, I-kon Engineering Academy
Q.19 Which of the following decimal numbers have exact representation in binary nota-
tion?
(A) 0.1 (B) 0.2 (C) 0.4 (D) 0.5
ANSWER=
Q.20 Any set of Boolean operators that is sufficient to represent all Boolean expressions
is said to be complete. Which of the following is not complete?
(A) {AND, NOT} (B) {NOT, OR} (C) {AND, OR} (D) {NAND}
ANSWER=
*****ALL THE BEST*****