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

Attempt now to get your rank among 374 students!

Question 1

Question 2

Question 3

Question 4

Hf(Key) = key mod 8

Find the number of collisions _________ when the follows keys are inserted in hash table in given order if linear probing is used.

25, 39, 46, 55, 89, 23, 68

Question 5

Question 6

PreOrder : 180 80 50 40 45 60 70 90 110 120

Question 7

Question 8

Question 9

1) To say whether an element x does not exist, in worst case in AVL tree is O(n).

2) To find smallest element in worst case, in BST is O(logn)

3) To insert an element in BST, takes O(nlogn) in worst case.

4) To find an element, in Binary tree it takes O(logn) in worst case.

Question 10

Question 11

#include <stdio.h>

main(){

int a=6;

static int b=a;

a+;

}

Question 12

Question 13

Char c[ ] = “GATE2011”;

char *p = c;

printf(“%s”, p + p [3] – p [1] ) ;

Question 14

__A__, B, C) and S (

__D__, E), relation S maintain a foreign key for D on attribute A of relation R. Consider the following statements:

A) Each record of R is related to 0 or more record of S.

B) Each record of S is related to 0 or more record of R.

C) Each record of S is related to 0 or 1 record of R.

D) Each record of R is related to 0 or 1 record of S.

Which of the following is true?

Question 15

Question 16

Transaction…..

Commit;

Rollback;

What does Rollback do?

Question 17

Question 18

Question 19

Question 20

Question 21

12.55.13.135

Question 22

1) Hard wired control

2) vertical microprogramming

3) Horizontal microprogramming

Question 23

Question 24

Question 25

Question 26

Question 27

What is the value of x and y respectively? (Note: m is the memory access time, k is the level of page tables and c is the TLB access time.)

Question 28

Question 29

If the best-fit algorithm is used, total size of left out partitions not alloted to any process is:

Question 30

Question 31

Question 32

Question 33

Question 34

" and L , x should not be a prefix of y."

If the above property is satisfies then the language L is :

Question 35

S -> aDBN {B.a =D.a , S.b = B.b}

B -> epsilon {B.b = epsilon}

S -> bDYTN { T.a = D.a, S.b = T.b}

T -> epsilon {T.b =epsilon}

N -> n {N.a =n}

Where .a & .b are the attributes corresponding to the production. Which of the following is correct?

Question 36

A -> A#B { A.val = A1.val + B.val }

A -> B {A.val = B.val}

B -> B$C {S1}

B -> C {B.val = C.val}

C -> num {C.val= number}

If the expression 8 # 6 $ 2 # 8 $ 6 # 2 $ 1 is evaluated to 70 then which of the following rule will be placed at S1?

Question 37

int main() {

float b;

b=sum(10,20);

printf("%d",b);

return 0;

}

sum(float a,float b) {

if(a<0)

return b;

sum(a/2,b/2);

}

Question 38

A -> A+A/A-A/b

After eliminating the left factoring is -

Question 39

What can be said about above counter? If the initial states are reset.

Question 40

Question 41

In this circuit, the race around

Question 42

Question 43

Question 44

^{2}+y

^{2}=1, x, y ∈ R}. Then P is-

Question 45

_{30}= {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation I be partial ordering on D30. The all lower bounds of 10 and 15 respectively are

Question 46

Question 47

^{4}– 16x

^{3}+ 24x

^{2}+ 37 is

Question 48

E = Project effort measured in person-months or person-years

LOC = Lines of Code estimate for the project

t = Length of project measured in months or years

B = "Special skills factor"

P = "Productivity Parameter"

Find Estimation form of the model.

Question 49

Question 50

- 374 attempts
- 4 upvotes
- 3 comments

Tags :

GATE & PSU CSGeneralPosted by: