Time Left - 12:00 mins
BARC 2018 Live Quiz Session Questions : 08/03/2018
Attempt now to get your rank among 276 students!
Question 1
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes.
for ( int x = 2; x < N; x = x + 1 ) {
int y = x
while ( y < N ) {
bits[y] = 1
y = y + x
}
}
Which of the following statements is/are true?
I. The algorithm requires O(N) temporary space.
II. The algorithm demonstrates an asymptotic algorithmic complexity of O(N ln(N)).
III. After the initialization shown above, it is possible to determine in O(1) time whether a natural number n < N is prime.
for ( int x = 2; x < N; x = x + 1 ) {
int y = x
while ( y < N ) {
bits[y] = 1
y = y + x
}
}
Which of the following statements is/are true?
I. The algorithm requires O(N) temporary space.
II. The algorithm demonstrates an asymptotic algorithmic complexity of O(N ln(N)).
III. After the initialization shown above, it is possible to determine in O(1) time whether a natural number n < N is prime.
Question 2
Consider the following SDT.
S → M { print “2”;} A
M → 1 { print “ ”;}
A → D { print “1”;} E
D → 2 { print “ ”;}
E → E { print “ ”;} A
E → 3 { print “ ”;}
A → S { print “4”;} Y
S → 4 { print “ ”;}
Y → ε { print “ ”;}
If the bottom up parsing is used to parse the input string “1234” then find the output number produced (without any spaces).
S → M { print “2”;} A
M → 1 { print “ ”;}
A → D { print “1”;} E
D → 2 { print “ ”;}
E → E { print “ ”;} A
E → 3 { print “ ”;}
A → S { print “4”;} Y
S → 4 { print “ ”;}
Y → ε { print “ ”;}
If the bottom up parsing is used to parse the input string “1234” then find the output number produced (without any spaces).
Question 3
In computer network data bit fetching rate from server to client computer can be increased by –
Question 4
A 3.5 inch micro floppy high density disk contains the data _________.
Question 5
Suppose you have a stack in which the values 1 through 5 must be pushed on the stack in that order, but that an item on the stack can be popped at any time. Give a sequence of push and pop operations such that the values are popped in the following order:
(a) 2, 4, 5, 3, 1
(b) 1, 5, 4, 2, 3
(c) 1, 3, 5, 4, 2
It might not be possible in which case?
(a) 2, 4, 5, 3, 1
(b) 1, 5, 4, 2, 3
(c) 1, 3, 5, 4, 2
It might not be possible in which case?
Question 6
Database that are designed and managed specifically to meet information needs are called
Question 7
What will be the minimum number of flipflop required for a mod-258 counter?
Question 8
In software maintenance tackling the changes in the hardware or software environment where the software works, is
Question 9
In finite Automata, if output symbol is associated with transition then it is called:
Question 10
For playing an online game, what network is ideal (among the given 4 examples) whose Ping result is –
- 276 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralApr 8GATE & PSU CS
