# BARC 2020: Full Length Mock 2 (App update required to attempt this test)

Attempt now to get your rank among 405 students!

Question 1

46, 36, 34, 24, 52, 57, 56

Which of the following cannot be inserted to the table due to quadratic probing?

Question 2

Question 3

If we run Dijkstra’s single source shortest path algorithm for the following edge weighted directed graph with vertex 5 as the source

In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized

5, 6, 7, 8, 4, 3, 2, 1

Question 4

What is minimum weight spanning tree of the given graph?

Question 5

Question 6

1) p-->next = null;

2) s1-->next = s;

3) s = s1;

where s points to the first node, s1 points to the last node and p points to the previous node( 2nd last node). which order of these three statements will provide the exact functionality to move last node to front.

Question 7

Question 8

Question 9

a + b + c * d / e ^ f ^ g * h

Question 10

1) Stack

2) Queue

3) Linked list

4) Trees

List-I

p. Serving request of singled shared resource

q. Implementing other data structures

r. Recursive function

s. Implementing algorithms

Question 11

Question 12

void function (int * A, int n)

{

if (n! = 0)

{

printf (“%d”, A[n – 1]);

function (A + 1, n – 1);

}

}

Find the third output produced by the function call function (A, 5), and A is an array initially holds {10, 20, 30, 40, 50}.

Question 13

main()

{

int i=1;

printf("%d%d%d",i,++i,i++);

}

Question 14

Statement 1: It is possible to generate both clustered as well as primary index for a given file at a same time.

Statement 2: When Sorting of file is done it is possible to sort it on the basis of single key only.

Which of the following is true?

Question 15

If emp1 and emp2 are renames of relation emp, then above query evaluates females employee with __________

Question 16

Question 17

Question 18

Question 19

Question 20

Question 21

1) Authentication in the Diffie- Hellman key exchange can be broken using reflection attack.

2) Diffie-Hellman suffers from man in the middle attack.

3) If n be the number of nodes in the network, then using no of keys required for one to one communication between each and every node is n.

Which of the following are false?

Question 22

Question 23

Question 24

Question 25

S : Sign bit

E: Exponent

M : Mantissa

The value of floating point number in this system is,

V = (-1)^{s} ×2E^{—127} × 1.F

Then what is the corresponding decimal value if the floating point stored is: 3F800000

Question 26

Question 27

10, 63, 98, 50, 20, 35, 65.

If SSTF is used for scheduling the disk accesses. Then request for cylinder 20 s served after how many requests?

Question 28

a, b, c, a, b, d, a, d, b, c, b

How many pages fault occurs using optimal (min) page replacement policy, if memory has 3 empty frames.

Question 29

Question 30

If LRTF is used for scheduling these process to the CPU, than Time at which process P3 will complete is __________

Question 31

Which of the following string in not in the set denoted by R?

Question 32

S1 : Mealy Machine has high power than Moore machine.

S2 : Mealy Machine has less number of states than Moore machine.

Question 33

S1 : DCFL's are closed under complement

S2 : DCFL's are closed under Homomorphism

S3 : DCFL's are closed under union with regular

Which option is correct ?

Question 34

S1 : A regular language L_{1} has 3 states in its DFA , then the complement of L_{1} will also have 3 states in its DFA.

S2 : A context free language L_{2} has 4 states in its PDA. The complement of L_{2} will also have 4 states in its PDA.

Question 35

E -> EsEs/Bcc/cC/F

F -> a/adC

C -> b/epsilon

The number of productions in simplified CFG is _____. Fill in the blank -

Question 36

int main() {

char 1d='a';

int b=10;

/* Adding the two times of a number b

int c= b+b;

/*result is 20*/

printf("%d",c);

}

Question 37

S -> ABa/BAc

A -> d/e/epsilon

B -> f/epsilon

Which of the following is true regarding the FIRST() & FOLLOW() function of LL(1) parser?

Question 38

EE(T)|T

TT*F|id

F(id)

Which of the following can be correct handle in bottom up parsing for the above grammar?

Question 39

can be written as:

Question 40

_{3}Q

_{2}Q

_{1}Q

_{0}=1110)

Question 41

Question 42

a. The minimum no. of NAND gates required to realize XOR is 4 and the minimum no. of NOR gates required to realize XOR is 5.

b. The minimum no. of NAND gates required to realize XOR is 5 and the minimum no. of NOR gates required is 4.

c. The minimum no. of NAND gates required to realize XNOR is 4 and the minimum no. of NOR gates required is 5.

d. The minimum no. of NAND gates required to realize XNOR is 5 and the minimum no. of NOR gates required is 4.

Which of them is true?

Question 43

Question 44

Question 45

Statement 1- Inverse of any element in Group G is unique.

Statement 2- Subgroup of a graph G is closed under union and intersection property.

Statement 3- Every group pf prime order is abelian group.

Statement 4- Every group of even order always contain one element of order 2.

Number of statements are correct is

Question 46

Question 47

Question 48

Question 49

Question 50

- 405 attempts
- 5 upvotes
- 0 comments

Tags :

GATE & PSU CSGeneralPosted by: