Time Left - 40:00 mins

# BARC full Mock-14

Attempt now to get your rank among 247 students!

Question 1

Which of these is supported by method overriding in Java?

Question 2

Question 3

Which of the following graph traversals closely imitates level order traversal of a binary tree?

Explanation: Both level order tree traversal and breadth first graph traversal follow the principle that visit your neighbors first and then move on to further nodes.

Question 4

What is a full binary tree?

Question 5

IPv6 does not use _________ type of address.

Question 6

The header length of an IPv6 datagram is ___________

Question 7

______ and _______ are the two binary operations defined for lattices.

Question 8

If every two elements of a poset are comparable then the poset is called ________

Question 9

A finite automaton accepts which type of grammar?

Question 10

Which of the following statement is true?

Question 11

Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata, respectively. Which one of the following is TRUE?

Question 12

Consider the following statements:
1. Turing machine is more powerful than finite automata
2. Turing machine is more powerful than push down automata
Which one of the above statement is true?

Question 13

To avoid deadlock ____________

Question 14

In a Multiple instance Resource allocation graph, cycle is a:

Question 15

In which of the following cases non – preemptive scheduling occurs?

Question 16

Relational Algebra is a __________ query language.

Question 17

Which of the following are the basic operators:

Question 18

_________ is used to represent the relationship.

Question 19

When only one instance of the entity on the left, and more than one instance of an entity on the right associates with the relationship then this is known as?

Question 20

Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ___________.

Question 21

The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is ___________.

Question 22

A fair six-sided dice is rolled twice. Assume six-sided dice is numbered as 0, 1, 2, 3, 4, 6. Given that the sum of values shown at first and second roll is 6, what is the probability that the value of the first rolled dice is less than or equal to the value of the second rolled dice?

Question 23

A fair dice is tossed eight times. Probability that on the eighth throw a third six is observed, is

Question 24

Hardwired control units are faster than Micro-programmed control units because?

Question 25

Which of the following is true?

Question 26

The address <500, 20, 32> corresponds to which cylinder number?

Question 27

Which of the following derivations does a top-down parser use while parsing an input string?

Question 28

Consider the following grammar:

E A+B|B

B int | (A) | B * int

Consider the following statements:

1) Grammar is left recursive.

2) Grammar is not left recursive.

Which of the following statements are true?

Question 29

A 4-to-1 multiplexer has ___  select lines

Question 30

Which of the following is a combinational circuit:
• 247 attempts