Time Left - 08:00 mins

DMRC CS 2018 Practice Quiz - 13(Tech)

Attempt now to get your rank among 221 students!

Question 1

The average successful search time for sequential search ‘n’ items is

Question 2

Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely?
(i) preorder and postorder (ii) inorder and postorder
(iii) preorder and inorder (iv) level order and postorder

Question 3

How many check bits are required for 16 bit data word to detect 2 bit errors and single bit correction using hamming code?

Question 4

Suppose after analyzing a new cache design, you discover that the cache has far too many conflict misses and this needs to be resolved. You know that you must increase associativity in order to decrease the number of cache misses. What are the implications of increasing associativity?

Question 5

The join operation can be defined as

Question 6

Which of the followings are equal things when there is only one CPU in a system?

Question 7

A binary full-subtractor.

Question 8

The person who ensures that systems are developed on time, within budget, and with acceptable quality is a

Question 9

Cryptanalysis is used

Question 10

Consider the following recursive C function that takes two arguments.
unsigned int foo(unsigned int n, unsigned int r){
if (n > 0) return ((n%r) + foo(n/r, r));
else return 0;
}

What is the return value of the function foo when it is called as foo (513, 2)?

221 attempts
1 upvote
0 comments

Tags :

GATE & PSU CS General

Apr 1GATE & PSU CS