Time Left - 10:00 mins

SSC Scientific Assistant CS/IT Weekly Toppers Quiz- 16

Attempt now to get your rank among 928 students!

Question 1

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

Question 2

A software programe stored in a ROM that cannot be changed easily is known as

Question 3

Given the following expression grammar:
E → E * F | F + E | F
F → F - | id
Which of the following is true?

Question 4

Let G be the following grammar.

Find the total number of reductions using LR(1) parser for the string a*a+ac using grammar G.

Question 5

TCP has

Question 6

A group of personal computers are configured to work together for speeding up the execution of a single program in

Question 7

The method used for resolving data dependency conflict by the compiler itself is

Question 8

If in an arithmetic operation carry input to the MSB is the same as carry output of MSB of the accumulator then it employs

Question 9

The infix expression A + (B - C) * D is correctly represented in prefix notation as

Question 10

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in order traversal sequence of the resultant tree?

928 attempts
13 upvotes
14 comments

Tags :

GATE & PSU CS General

Apr 4GATE & PSU CS