BARC full Mock-3 for GATE & PSU CS Exams

Question 1

Consider the following C program:

int main ()

{

int x = 20;

static int y = x;

if (x = = y)

printf (“Equal”);

else

printf (“Not Equal”);

return 0;

}

What will be the output for above C program?

Question 2

The following ‘C’ statement :
int * f [ ] ( );
declares:

Question 3

Choose a correct statement about C structure elements.

Question 4

Convert the following prefix expression into a postfix expression :

* – + A B C D

Question 5

A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way propagation delay is 100 milliseconds. Assuming no frame is lost, the sender throughput is __________ bytes/second.

Question 6

Consider a system using Go-Back-N protocol over fiber link with bandwidth 1 Gbps and packet size 512 B. Propagation speed of fiber is 2 × 10⁸ msec with length 1 Km. Assume error-free and duplex communication with ACK packet size 64 B . Then the value of N that yields maximum utilization of sender is ________.

Question 7

Let A and B be two non-empty relations on a set S. Which of the following statements is false?

Question 8

Which of the following statements is/are True?
S₁ : In a lattice every two elements need not have both join and meet.
S₂ : In a distributive lattice L, a given element can have atmost one complement.

Question 9

Complement of a DFA can be obtained by :

Question 10

What is the meaning of regular expression Σ* 001 Σ*?

Question 11

Consider this Context-Free Grammar:

S →aSa | bSb | aSb | bSa | ԑ

The language L generated by grammar is?

Question 12

Context free grammar is not closed under?

Question 13

A system has 9 identical resources and n process competing for them. Each process can request maximum 4 resources. Minimum possible value of N which lead to dead lock ________.

Question 14

If there are 6 units of resource R in the system and each process in the system requires 2 units of resource R, then how many processes can be present at maximum so that no deadlock will occur?

Question 15

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in following sequence-

4, 34, 10, 7, 19, 73, 2, 15, 6, 20

Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used?

Question 16

Find attribute closure of (CD)⁺ in R(ABCDE) with functional dependencies as follows:

AB→C,

B→D,

C→E,

D→A

Question 17

Candidate key with at least two attributes is called as:

Question 18

Which record allows part of a record to be in one block and the rest of it to be on the next block?

Question 19

In dense Index:

Question 20

Given a hash table T with load factor 80 that stores 2000 elements, the number of slots is _________

Question 21

In a simple undirected graph with ‘n’ vertices maximum degree for each vertex is

Question 22

In a sample of size 5 results in the sample values 4,7,5,8 6. Calculate the sample variance of the above sample set.

Question 23

suppose there is two players Ram and Shyam who are throwing a pair of dice alternatively. Ram will win the game if he throws 6 before Shyam throws 5 and Shyam wins if he throws 5 before Ram throws 6. If Ram begins the play then probability of wining game by Ram is

Question 24

The most appropriate matching for the following pairs is-

Question 25

Which of the following addressing modes are suitable for program relocation at run time?

1) Absolute addressing

2) Base addressing

3) Relative addressing

4) Indirect addressing

Question 26

Given below are two statements:

Statement I: Hardwired control unit can be optimized to produce fast mode of operation.

Statement II: Indirect addressing mode needs two memory reference to fetch the operand.
From above statements. choose the correct answer from the options given below

Question 27

Consider the following grammar:

SaA|B

AaA|b

B

Question 28

The Bottom-up parser uses?

Question 29

Find the number of Prime implicants &Essential prime implicants in the given K-map

Question 30

The prime implicant which has at least one element that is not present in any other implicant is known as ___________