Time Left - 09:00 mins

UPPCL AE 2019: Quiz 2

Attempt now to get your rank among 301 students!

Question 1

If a planner graph, having 25 vertices divides the plane into 17 different regions. Then how many edges are used to connect the vertices in this graph.

Question 2

Consider the following C declaration
Struct {
short s[5];
union {
float y;
long z;
ju;
} t;
Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is (bytes) ?

Question 3

Starvation can be avoided by which of the following statements?
(i) By using the shortest job first resource allocation policy.
(ii) By using a first come first serve resource allocation policy.

Question 4

In Boolean algebra

times ones = ___________.

Question 5

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is:

Question 6

Consider a language L over alphabet {a, b}. If we construct DFA for L then trap state needs to be introduce in case of

Question 7

The identification of common, sub-expression and replacement of run-time computations by compile-time computations is :

Question 8

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is

Question 9

Which layer connects the network support layers and user support layers?

Question 10

What will be the equation of simplification of the given K-Map ?

301 attempts
3 upvotes
4 comments

Tags :

GATE & PSU CS General

Aug 2GATE & PSU CS