Time Left - 10:00 mins

CBSE-NET Section Test - 1

Attempt now to get your rank among 286 students!

Question 1

In order to implement a n variable switching function, a MUX must have:

Question 2

In order that a code is ‘t’ error correcting, the minimum Hamming distance should be:

Question 3

With a four programs in memory and with 80% average I/O wait, the CPU utilization is?

Question 4

The octal equivalent of hexadecimal (A.B)16

Question 5

A reduced state table has 18 rows. The minimum number of Flips flops needed to implement the sequential machine is:

Question 6

Queue is a _________ list.

Question 7

Which two of the following are equivalent for an undirected graph G?
(i) G is a tree
(ii) There is exactly one path between any two distinct vertices of G
(iii) G contains cycles and has (n – 1) edges
(iv) G has n edges

Question 8

In a full binary tree of height k, there are _________ internal nodes.

Question 9

A binary tree is said to have max heap property if the elements along any path:

Question 10

X.25 protocol consists of:
  • 286 attempts
  • 2 upvotes
  • 4 comments
Apr 14GATE & PSU CS