BARC full Mock-20 for GATE & PSU CS Exams

Question 1

In C, after executing the following code what are the values of x, y and z?
int x,y = 10, z = 12;
x = y++ + z++;

Question 2

Consider the following code segment.
for(int k =0 ; k<20 ; k=k+2)
{
if(k%3==1)
printf(k+" ");
}

What is printed as a result of executing the code segment?

Question 3

Create a Binary Search Tree for the following nodes

15, 10, 13, 12, 90, 70, 110, 85, 60, 7, 11

The Inorder Predecessor of the root node is ______.

Question 4

Evaluate

Value is ______.

Question 5

The weight and profit is given as follows
Weight= {10, 20,30}
Profit= {60, 100, 120}
W=50
The maximum profit made from this 0-1 knapsack problem is_________

Question 6

The minimum number of comparisons required to find the max and min in an array of 20 elements?

Question 7

Consider a 2-way set associative mapping is used where there are 8 cache blocks (0 – 7). If LRU is used to replace the memory blocks (0, 4, 9, 5, 16, 13, 15, 19, 25, 63, 24) then what is the number of blocks present in cache after end of sequence?

Question 8

How many cycles are required for a 100 MHz processor to execute a program which requires 5 seconds of CPU time?

Question 9

A five-stage pipeline has a clock cycle time of 5ns. If the non-pipeline clock is also of the same duration then what is the speed up for 75% of pipeline efficiency?

Question 10

Which of the following is valid IP address assigned to a host?

Question 11

Which of the following protocol is used for transferring electronic mail message from one machine to another?

Question 12

Match List-1 with List-2 and select the correct answer using the options given.

List-1

A) Physical layer

B) Network layer

C) Data link layer

List-2

1) Collision Detection

2) Bit encoding

3) Host identification

Question 13

The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called ______.

Question 14

On a system using non-preemptive scheduling, processes with expected 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wait time?

Question 15

SELECT name

FROM instructor

WHERE salary <= 100000 AND salary >= 90000;

This query can be replaced by which of the following ?

Question 16

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of

data are stored in a bit serial manner in a sector. The capacity of the disk is

Question 17

The following functional dependencies are given:

AB → CD, AF → D, DE → F, C → G, F → E, G → A

Which one of the following options is false?

Question 18

Consider a system having the page table with 4K entries and logical address is 29 bits. What is the length of physical address in bits if the system has 512 frames ? _________

Question 19

The infix expression A + (B - C) * D is correctly represented in prefix notation as

Question 20

S->aA|b
A->Ab|

The following grammar is?

Question 21

Consider the following table :

Matching A, B, C, D in the same order gives :

Question 22

Consider the following assembly code
MOV R₁,b ; R₁b
MOV R₂,c ;
MUL R₁,R₂ ;
MOV t₁,R₁ ;
MOV R₁,a ;
MOV R₂,t₁ ;
ADD R₁,R₂ ;
MOV t₂,R₁ ;
MOV R₁,t₂ ;
MOV d,R₁ ;
Find the correct expression which is equivalent to the above code.

Question 23

If L and

are recursively enumerable then L is

Question 24

Simplify the given Boolean Algebra:
(AB)’(A’ + B)(B’ + B)

Question 25

A card is drawn from a pack of 52 cards. The probability of getting a queen of club or a king of heart is?

Question 26

The number of corona positive people in a city in a month follows poisson distribution with mean of 7.8. find the probability that number of corona positive is less than 3 during a randomly selected month is

Question 27

If the two matrices $Description: E:\Gate\isro-cs\ISRO_CS_2008_files\image018.png$ and $Description: E:\Gate\isro-cs\ISRO_CS_2008_files\image019.png$ have the same determinant, then the value of X is

Question 28

If A,B,C, are any three matrices , then A’+B’+C’ is equal to

Question 29

In Quicksort, which of the following is true?

i) Ideal for sorted array

ii) Works best when input is not almost sorted.

iii) worst case is O(n²)

iv) Better than insertion sort for every type of input.

Question 30

What is the result of

?