Mock

2/4/22, 8:30 PM GATE CS Applied Course
 +91 844-844-0102 gatecse@appliedroots.com Importance of the GATE exam PRACTICE TESTS My Account Logout
OVERALL ANALYSIS Solution Report
All Correct Answers Wrong Answers Not Attempted Questions
Q.1)
Negative Marks: 0.33 MCQ Subject: General Aptitude Max Marks: 1 
The following pie-chart represents the result of 600
successful students in various subjects of an examination.
The percentage of students who passed in English is

Time taken to answer this question 00:01:50 hrs
Hide Answer
Add Notes
View Notes
Show Comments
A 15% Correct Option |  Attempted
Solution: (A)
B 20%
C 5%
D 12%
Q.2)
Select the pair of words that exhibit the same
relationship between each other.
Pardon : Offence :: ?
Hide Answer
Add Notes
View Notes
Show Comments
A Forgive : Wrong Correct Option
Solution: (A)
First refers to the act of letting off the second.
B Surrender : Fugitive
C Detect : Violation
D Repent : Sin Your answer is Wrong
https://gate.appliedroots.com/report?id=354570 1/45
Q.3)
Read the passage carefully and answer the question.
Sedimentary rocks are formed by the process of sedimentation. Layer after layer of minerals is deposited over a
great span of time, resulting in the formation of a sedimentary rock. As a result, each layer is different if the
conditions under which its deposits were different. Thus we can say that a sedimentary rock is a sort of
museum, holding the records of all the time over which it was formed, which by all means can be as long as a
billion years.
A sedimentary rock gets its name from the fact that
Hide Answer
Add Notes
View Notes
Show Comments
A These rocks are formed up of small sediments of minerals.
B It is very old and is a slow process
C Sedimentary rocks are formed as a result of sedimentation of minerals. Correct Option |  Attempted
Solution: (C)
The answer, if you read the paragraph carefully, you will have guessed is c. Note that sometimes a paragraph
may contain information that is not correct, but you will have to select the answer that is present in the
paragraph, not the one that you think is factually correct.
D The rocks are broken into small sediments easily.
Q.4)
A pathway having a uniform width of 2 metres was
made in a rectangular field. What is the area of the field excluding the path if the dimensions of the field are 30 meters
and 50 meters?

Hide Answer
Add Notes
View Notes
Show Comments
A 1100
B 1300
C 1460
D 1444 Correct Option |  Attempted
Solution: (D)
Q.5)
A 6
B 7
C 5
D 8
Hide Answer
Add Notes
View Notes
Show Comments
A 6
B 7 Correct Option
Solution: (B)
C 5
D 8
Q.6)
Identify the error in the given sentence
With the literacy rates in this region as low as ten per cent we need to encourage the local people to build schools.
Hide Answer
Add Notes
View Notes
Show Comments
A With the literacy rates in this Correct Option |  Attempted
Solution: (A)
The problem is with the first part. As there is only one region that is being talked about, we cannot use the plural
form ‘rates’. The correct usage would be ‘literacy rate’.
B region as low as ten per cent
C we need to encourage the
D local people to build schools
Q.7)

Hide Answer
Add Notes
View Notes
Show Comments
A If only Assumption I is implicit
B If only Assumption II is implicit Your answer is Wrong
C If either Assumption I or II is implicit
D If neither Assumption I nor II is implicit Correct Option
Solution: (D)
The advertisement is for BSA cycles. There is no information given about the cost or the features of other
brands of cycles. So, neither I nor II is implicit.
Q.8)
The manager of a department store decides to
measure employee satisfaction by selecting four departments at random, and conducting interviews with all the
employees in those four departments. What type of survey design is this?
Hide Answer
Add Notes
View Notes
Show Comments
A cluster Correct Option
Solution: (A)

Cluster: In a clustered sample, subgroups of the population are used as the sampling unit, rather than
individuals. The population is divided into subgroups, known as clusters, which are randomly selected to be
included in the study. Clusters are usually already defined.

Stratified: In this method, the population is first divided into subgroups (or strata) who all share a similar
characteristic. It is used when we might reasonably expect the measurement of interest to vary between the
different subgroups, and we want to ensure representation from all the subgroups.

Simple random: In this case each individual is chosen entirely by chance and each member of the population
has an equal chance, or probability, of being selected. One way of obtaining a random sample is to give each
individual in a population a number, and then use a table of random numbers to decide which individuals to
include.

Systematic: Individuals are selected at regular intervals from the sampling frame. The intervals are chosen to
ensure an adequate sample size. If you need a sample size n from a population of size x, you should select
every x/n th individual for the sample.
B stratified
C simple random Your answer is Wrong
D systematic
Q.9)
Hide Answer
Add Notes
View Notes
Show Comments
B Correct Option |  Attempted
Solution: (B)
Q.10)

Hide Answer
Add Notes
View Notes
Show Comments
A
in a funny position
B in a serious position
C in a sad situation
D in an embarrassing or awkward situation Correct Option |  Attempted
Solution: (D)
The idiom ‘in a pickle’ means to be in a troublesome situation or an awkward situation. Example: Raj got himself
in a pickle when he was caught red-handed with his secret strategy.
Q.1)
Negative Marks: 0.33 MCQ Subject: Theory of Computation Max Marks: 1 

Hide Answer
Add Notes
View Notes
Show Comments
A { ; , ) , +,$ }
B {;,),+} Correct Option |  Attempted
Solution: (B)

Follow(P) = Follow(E)
Follow(E) = {+} U Follow(A)
Follow(A) = {), ;}
⇒ {+, ), ;}
C { ) , +,$ }
D { ; , +,$ }
Q.2)
NAT Subject: computer organization Max Marks: 1 
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (6)
RAW from 1-3 ($t1),

2-3 ($t2),
3-4($t3),
3-6 ($t3),
5-6($t4),
6-7($t5).
Q.3)
MSQ Subject: Computer Networks Max Marks: 1 
The most important and common protocols associated TCP/IP
internetwork layer are.
Hide Answer
Add Notes
View Notes
Show Comments
A Internet Control Message Protocol (ICMP) Correct Option |  Attempted
Solution: (A)
All of them can be associated with the TCP/IP here.
B Bootstrap Protocol (BOOTP) Correct Option
Solution: (B)
C Dynamic Host Configuration Protocol (DHCP) Correct Option |  Attempted
Solution: (C)
D Address Resolution Protocol (ARP) Correct Option |  Attempted
Solution: (D)
Q.4)
Negative Marks: 0.33 MCQ Subject: digital logic systems Max Marks: 1 
Consider the following 32-bit single-precision
floating-point number given below:
00111110011010000111001010110000
The closest decimal value to this floating-point number is
Hide Answer
Add Notes
View Notes
Show Comments
A 14.5
B 22.7
C 0.145
D 0.227 Correct Option
Solution: (D)
Q.5)
MSQ Subject: DBMS Max Marks: 1 

Hide Answer
Add Notes
View Notes
Show Comments
A The given decomposition of Designer into Designer1 and Designer2 is a dependency

preserving.
B The given decomposition of Designer into Designer1 and Designer2 is not Correct Option |  Attempted
dependency preserving.
Solution: (B)

For the given FD’s:
Name_of_style, Type_of_dress -> Dress_material
Dress_material -> Shoe_style
Shoe_style -> Name_of_style

The candidate keys are:

(Name_of_style, Type_of_dress )+ = {Name_of_style, Type_of_dress , Dress_material, Shoe_style)
(Shoe_style, Type_of_dress)+ = {Name_of_style, Type_of_dress , Dress_material, Shoe_style)

Based on this, the FD’s present in each decomposed relation will be:
Designer1(Name_of_style, Type_of_dress, Dress_material) will have FD {Name_of_style, Type_of_dress
-> Dress_material}

Designer2(Dress_material, Shoe_style) will have FD {Dress_material -> Shoe_style)

As we can see that the FD Shoe_Style -> Name_of_style is not preserved, therefore, the given
decomposition is not DP.
Also, the common attribute in between both the relation is Dress_material, is not the part of the candidate
key of relation Designer.
Hence, the correct options are (ii) and (iv).

C The common attribute of Designer1 and Designer2 is the candidate key in relation
Designer.
D The common attribute of Designer1 and Designer2 is not the candidate key in Correct Option |  Attempted
relation Designer.
Solution: (D)

For the given FD’s:
Name_of_style, Type_of_dress -> Dress_material
Dress_material -> Shoe_style
Shoe_style -> Name_of_style

The candidate keys are:

(Name_of_style, Type_of_dress )+ = {Name_of_style, Type_of_dress , Dress_material, Shoe_style)
(Shoe_style, Type_of_dress)+ = {Name_of_style, Type_of_dress , Dress_material, Shoe_style)

Based on this, the FD’s present in each decomposed relation will be:
Designer1(Name_of_style, Type_of_dress, Dress_material) will have FD {Name_of_style, Type_of_dress
-> Dress_material}

Designer2(Dress_material, Shoe_style) will have FD {Dress_material -> Shoe_style)

As we can see that the FD Shoe_Style -> Name_of_style is not preserved, therefore, the given
decomposition is not DP.
Also, the common attribute in between both the relation is Dress_material, is not the part of the candidate
key of relation Designer.
Hence, the correct options are (ii) and (iv).
Q.6)
Negative Marks: 0.66 MCQ Subject: Algorithms Max Marks: 2 
What is the Time Complexity of the code below ?

Hide Answer
Add Notes
View Notes
Show Comments
A Your answer is Wrong
D Correct Option
Solution: (D)
Q.7)
MSQ Subject: Theory of Computation Max Marks: 2 
Hide Answer
Add Notes
View Notes
Show Comments
A LL(1) and LR(0)
B Not LL(1) but LR(0) Correct Option
Solution: (B)
C Not LR(0) but SLR(1)
D Both LR(0) and SLR(1) Correct Option
Solution: (D)
Q.8)
Negative Marks: 0.33 MCQ Subject: computer organization Max Marks: 1 
Match the following (Addressing mode and their
corresponding effective addresses of the operands.
Note: A refers to the address and R refers to the registers

Hide Answer
Add Notes
View Notes
Show Comments
A I-c, II-d, III-e, IV-a, V-b Correct Option |  Attempted
Solution: (A)
B I-c, II-a, III-e, IV-d, V-b
C I-c, II-d, III-b, IV-a, V-e
D I-c, II-a, III-b, IV-d, V-e
Q.9)
NAT Subject: operating systems Max Marks: 2 
Using the LRU page replacement algorithm, the number of page faults
for the following page reference string considering 3 frames is ______

9, 5, 4, 2, 5, 8, 9, 1, 2, 4, 5, 5, 3, 8, 2, 5, 3, 2, 0
Note: Note : Marks given to all as original question had reference string missing

Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (16)
Q.10)
MSQ Subject: Algorithms Max Marks: 2 
Fractional knapsack using greedy method
Consider the following items with their corresponding profits and weights
Given a Knapsack with capacity of 15 units of weight, which of the following is an optimal solution if we are
allowed of have fraction of items (the least possible value is of 1 unit weight).
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option |  Attempted

Items 5, 1, 2, 4
Solution: (A)
As this problem is about fractional knapsack, let us calculate the profit/weight and then we can add them in the
order of decreasing profit /weight
Items 5, 1, 2, 4 is one possible solution

and items 5, 1, 2, 7 and 1/2 of item 4 is another possible solution
and items 5, 1, 2, and 1/2 of item 3 is also a possible solution.
B Items 5, 1, 2, 7 and 1/2 of item 4 Correct Option
Solution: (B)

C Items 5, 1, 2, and 1/2 of item 3 Correct Option |  Attempted
Solution:
(C)

D Items 5, 1, 2, 7 and 3/4 of item 6
Q.11)
NAT Subject: Theory of Computation Max Marks: 2 
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (4)
Q.12)
NAT Subject: operating systems Max Marks: 2 
Consider a file currently consisting of 100 blocks. Assume that the file
control block is already in memory.
The number of disk I/O operations required for the contiguous allocation case where a block is removed from the
middle(51st block) is ________
Assumptions :
Assume that there is no room to grow in the beginning, but there is room to grow in the end.
Assume that the block information to be added is stored in memory.
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (98)
The block is removed from the middle.

For contiguous allocation strategies, we need 49 disk I/Os for reading the last 49 blocks into memory, and 49
disk I/Os for writing the 49 blocks back to disk starting from the 51th block.
In total, we need 98 disk I/Os.
Q.13)
MSQ Subject: Data Structures Max Marks: 1 
Consider the following Binary search tree
Which of the following order of insertion would result in the above BST.
Hide Answer
Add Notes
View Notes
Show Comments
A 21, 5, 30, 10, 0, 25, 45 Correct Option |  Attempted
Solution: (A)
A. 21, 5, 30, 10, 0, 25, 45 would result in the same BST

B. 21, 30, 5, 0, 10, 45, 25 would result in the same BST
C. 21, 5, 30, 10, 45, 0, 25 would result in the same BST
D. 21, 30, 5, 25, 10, 45, 0 would result in the same BST.
Therefore, all the options are correct.
B 21, 30, 5, 0, 10, 45, 25 Correct Option |  Attempted
Solution: (B)

C 21, 5, 30, 10, 45, 0, 25 Correct Option |  Attempted
Solution: (C)

D 21, 30, 5, 25, 10, 45, 0 Correct Option |  Attempted
Solution: (D)


Q.14)
NAT Subject: Algorithms Max Marks: 1 
Consider the following undirected graph given that each of the
horizontal edge has edge weight 1 and each of the vertical edge has edge weight 2,
the number of MST of the graph is ___
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (64)

Here we can consider vertices {1,2,3,4}, {5, 6, 7, 8}, {9, 10, 11, 12} and {13, 14, 15, 16} to be components
all the edge connecting them are to be added and one of the connecting amongst each of the red, blue
and green edges should be selected,
The number of ways in which this can be done is C(4,1)*C(4,1)*C(4,1)=64.
Q.15)
Which of the following is/are non-regular
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
Solution: (B)
C Correct Option |  Attempted
Solution: (C)
D Correct Option
Solution: (D)
Q.16)
Consider a byte-addressable computer with 24-bit addresses, a cache
capable of storing a total of 64KB of data and blocks of 32 bytes. If the cache is a 2-way set associative then the
address AACDFF(in hex) is mapped to the set (in decimal)____
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (623)
Q.17)
NAT Subject: digital logic systems Max Marks: 1 
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (3142)
Q.18)
MSQ Subject: Discrete Mathematics Max Marks: 1 

Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
B Correct Option
Solution: (B)
C Your answer is Wrong
D Correct Option
Solution: (D)
Q.19)
Negative Marks: 0.33 MCQ Subject: C Programming Max Marks: 1 
What will be output if you will compile and execute the
following c code?

Hide Answer
Add Notes
View Notes
Show Comments
A 012
B
0123
C 123 Correct Option |  Attempted
Solution: (C)
D Compiler error
Q.20)
NAT Subject: Computer Networks Max Marks: 2 
Assume a hypothetical computer network in which the protocol
hierarchy has 10 layer. The application layer generates a 200KB message. What is the size of the header in KB if
20% of the network bandwidth is filled with header.
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (5)
So, fraction of header in the channel is 20% = 0.2
N = 10, M = 200, H = header size which we have to find,
Now, 0.2 = 10*H / (10 * H + 200*10^3)
0.2 * 10 * H + 0.2 * 200 * 10^3 = 10^H
2H + 40 * 10 ^3 = 10H
40 * 10 ^3 = 8H
H = 5 * 10^3
or H = 5KB.
Hence header size is equal to 5KB
Q.21)
Negative Marks: 0.66 MCQ Subject: Discrete Mathematics Max Marks: 2 

Hide Answer
Add Notes
View Notes
Show Comments
A 2
B 4
C 9 Correct Option
Solution: (C)

If a valid argument has a false conclusion, then at least one premise must be false. A valid argument cannot
have all true premises and a false conclusion. So if a valid argument does have a false conclusion, it cannot
have all true premises. Thus at least one premise must be false.

An argument with false premises and a true conclusion can be valid.
For example:
All cats are human
Socrates is a cat
Therefore, Socrates is human
The argument has false premises and a true conclusion. But the argument is valid since it's impossible for the
premises to be true and the conclusion false. In other words, if the premises are true the conclusion is
guaranteed to be true, which is how validity is defined.

--------------------------------------------------------------------------------
Premise :
2 is prime and 2 = 1 + 1. So, statement1 is False. One premise is False.

Conclusion :
n is not prime is False. False implies any truth value is True.
So, the conclusion is True as n is prime.

Premise is False, Conclusion is True. Valid Argument
--------------------------------------------------------------------------------
Premise :
4 is not prime , so Stmt1 is True
4 is even, it is sum of two odd numbers (4 = 1 + 3), So, Stmt2 is True
Smt3 is True as 4 = 1 + 3

Conclusion :
4 is not prime, and 4 is even. So, Conclusion is True

Premise is True, Conclusion is True. Valid Argument.
-------------------------------------------------------------------------------
Premise is True, but Conclusion is False. Invalid Argument.

----------------------------------------------------------------------------------

D None of the above Your answer is Wrong
Q.22)
NAT Subject: Discrete Mathematics Max Marks: 1 
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (8)
It is equal to the number of subsets of {4,5,6} = 2^3 = 8
Q.23)
T(n)=T(n-1)+n/2
Then T(n)=___
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option |  Attempted
Solution: (A)
Q.24)
What is the output of the following c-code?
A 320
B 1
C 64
D Compiler error
Hide Answer
Add Notes
View Notes
Show Comments
A 320
B 1
C 64 Correct Option
Solution: (C)
D Compiler error
Q.25)
Negative Marks: 0.33 MCQ Subject: Engineering-Mathematics Max Marks: 1 
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
Q.26)
Negative Marks: 0.66 MCQ Subject: DBMS Max Marks: 2 
Which of the below give relational algebra expressions (with respect to the above schema) is not like the others
(results the same)?
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
Q.27)
Negative Marks: 0.66 MCQ Subject: Data Structures Max Marks: 2 
Consider the following sequence of operations on an
empty stack O(n) push O(nlogn) pop and O(n) push operations, the total time required for the above sequence of
operations is
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
Q.28)
What will be output if you will compile and execute the
following c code?

Hide Answer
Add Notes
View Notes
Show Comments
A Equal Your answer is Wrong
B Greater than
C Less than
D Compile error Correct Option
Solution: (D)
x=i // here is incorrect we can not intialise the static variable with another variable at the time of declaration.
Q.29)
In TCP, MSS is 8B. If during the 6th RTT the network is congested and
timeout occurs, by using congestion algorithm then the threshold value is _________(in Bytes). (assume initial
congestion window size for the first transmission is 1 MSS )
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (128)

1st transmission: 1 MSS
2nd transmission: 2 MSS

3rd transmission: 4 MSS
4th transmission: 8 MSS

5th transmission: 16 MSS
6th transmission: 32 MSS [ Window th = 32 / 2 = 16 MSS]
16 MSS = 16 * 8 = 128 B
Q.30)
Consider the following ER diagram:
The bold line shows the total participation of the entities in the relationship as well as depicts the weak entity,
and identifying relationship.
Which of the following is the correct relational schema for the given ER diagram.
Hide Answer
Add Notes
View Notes
Show Comments
B Your answer is Wrong
C Correct Option
Solution: (C)
Q.31)
What is the output of the following c-code?

Hide Answer
Add Notes
View Notes
Show Comments
A 6
B 7
C 8
D 9 Correct Option |  Attempted
Solution: (D)

fun(5)= 5 + fun(3) = 9
fun(3) = 3 + fun (1) = 4
fun(1) =1 + fun(-1) = 1
Q.32)
A w1(A), r2(A), w1(B), r2(B), c1, c2
B w1(A), w1(B), c1, r2(A), r2(B), c2
C w1(A), w2(A), a2, c1, r3(A), r3(B), c3
D Both B and C
Hide Answer
Add Notes
View Notes
Show Comments
A w1(A), r2(A), w1(B), r2(B), c1, c2
B w1(A), w1(B), c1, r2(A), r2(B), c2 Correct Option
Solution: (B)

(i) Given schedule: w1(A), r2(A), w1(B), r2(B), c1, c2
The given schedule is recoverable as T2 is reading the data from T1 and committing after the commit of
T1.
But it has a conflicting rollback. If T1 aborts after R2(B), then T2 will also roll back.
Also, it is not strict as none of the reads are committed reads. Therefore, it is not the correct option.

(ii) Given schedule: w1(A), w1(B), c1, r2(A), r2(B), c2
This schedule is recoverable as there are no dirty reads.
Since T2 is reading the data after the commit of T1, therefore, there it avoids conflicting rollback, and also,
the read of T2 is after the commit of T1, therefore, the given schedule is also strict.
Hence, it is the correct option.

(iii) Given schedule: w1(A), w2(A), a2, c1, r3(A), r3(B), c3
The given schedule is recoverable as T1 commits before T3.
It does not have any cascading rollbacks as when T1 commits before any operation of T3. But it is not a
strict schedule.
A schedule is strict if for any two transactions Ti, Tj, if a write operation of Ti precedes a conflicting
operation of Tj (either read or write), then the commit or abort event of Ti also precedes that conflicting
operation of Tj. Since W2(A) occurs before the commit or abort of W1(A), therefore, it is not a strict
schedule.
C w1(A), w2(A), a2, c1, r3(A), r3(B), c3
D Both B and C
Q.33)
MSQ Subject: Data Structures Max Marks: 2 
Consider the following code to compute the height of a binary tree, choose
the appropriate for the blanks 1,2 and 3.

Hide Answer
Add Notes
View Notes
Show Comments
A 1. lDepth > rDepth 2. (lDepth + 1) 3. (rDepth + 1) Correct Option |  Attempted
Solution: (A)
In this recursive function, if the height of the left sub tree is greater than that of the right sub tree then we have
to return height of left sub tree+1, otherwise we have to return height of right subtree+1.
B 1. rDepth > lDepth 2. (lDepth + 1) 3. (rDepth + 1)
C 1. lDepth > rDepth 2. (rDepth + 1) 3. (lDepth + 1)
D 1. rDepth > lDepth 2. (rDepth + 1) 3. (lDepth + 1) Correct Option |  Attempted
Solution: (D)
In this recursive function, if the height of the left sub tree is greater than that of the right sub tree then we have
to return height of left sub tree+1, otherwise we have to return height of right subtree+1.
Q.34)
MSQ Subject: digital logic systems Max Marks: 2 
Which of the following statements are not true about the circuit given
below:
A The given counter is an asynchronous mod-4 counter.
B It is a self-start counter.
C If the initial state Q1Q0 is 00, then the state after 264 clock pulses is also 00.
D If the T - flip flop is replaced by the D flip flop then the counting sequence
generated by the counter will be 0, 1, 3, 2, 2, 2, …
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
The given counter is an asynchronous mod-4 counter.
Solution: (A)
(i) the given counter is a synchronous counter and not asynchronous as both the flip flops are sharing the
same clock.
(ii)
Hence, the counter will be:

Since we can reach the counting loop through any state, therefore, it is a self-starting counter.

(iii) If the initial state is 00, then after 3 clock pulses the state will be reset to 00. Since 264 mod 3 = 0,
therefore, the state after 264 clock pulses will be 00 only.

(iii) If the T flip flop is replaced by the D flip flop, the characteristic table will be:

Hence, the counting sequence will be 00 -> 01 -> 11 -> 10-> 10 -> …
That is: 0, 1, 3, 2, 2, 2, 2….

Hence, the only incorrect statement is (i).
B It is a self-start counter.
C If the initial state Q1Q0 is 00, then the state after 264 clock pulses is also 00.
D If the T - flip flop is replaced by the D flip flop then the counting sequence generated by
the counter will be 0, 1, 3, 2, 2, 2, …
Q.35)
Which of the following is/ are True
Hide Answer
Add Notes
View Notes
Show Comments
A Your answer is Wrong
Solution: (B)
Solution: (C)
D Correct Option
Solution: (D)
Q.36)
NAT Subject: Discrete Mathematics Max Marks: 2 
The number of edges a simple graph has if its degree sequence is
4,3,3,2,2 is _____
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (7)
Q.37)
NAT Subject: Theory of Computation Max Marks: 2 
The number of states in a minimal deterministic finite automata that is
equivalent to the given epsilon-NFA are _____
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (5)
Epsilon closure(1) = {1,2}

Epsilon closure(2) = {2}
Epsilon closure(3) = {3}
Equivalent NFA is
Equivalent DFA for the NFA is
Q.38)
You are designing an instruction set for your computer. All the
instructions are the same size (12 bits long). The size of an address field is 4 bits. You have already designed 10 2-
address instructions and 64 one address instructions. How Many zero address instructions can you fit?
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (512)
Q.39)
In stop and wait protocol , If the packet size is 1 KB and propagation
time is 15ms the channel capacity is 109 bits / sec then find the channel utilization in percentage? [Write your answer
upto three places of decimal]
Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer
Solution: (0.026 TO 0.027)
Your Answer is wrong (66.667)
Q.40)
An athlete is one of eight finalists for a running
event at an olympic games. The probability of him finishing 1st is 0.05, 2nd is 0.15, 3rd is 0.25, 4th is 0.20, 5th is
0.15, 6th is 0.10, 7th is 0.05, 8th is 0.05. In what position would this athlete be expected to finish the race ____
A 6
B 4
C 0.15
D 0.25
Hide Answer
Add Notes
View Notes
Show Comments
A 6
B 4 Correct Option
Solution: (B)

Expected value of a random variable x on a sample space “S” is denoted by E(X)
Here P is the probability function
X is random variable which denotes the position at which athlete finishes the race
where P(S) denotes the probability of athlete finishing the race at X(S) position
E(X) = (1*0.05)+(2*0.15)+(3*0.25)+(4*0.20)+(5*0.15)+(6*0.10)+(7*0.05)+(8*0.05)
= 4
C 0.15
D 0.25
Q.41)
Assume there are M records for B+ tree to index. Given a
case, there is a range query on this index with results spanning N leaf nodes. How many pointers in the B+ tree will
be traversed to retrieve the results?
Hide Answer
Add Notes
View Notes
Show Comments
C Correct Option
Solution: (C)
Q.42)
Negative Marks: 0.33 MCQ Subject: Theory of Computation Max Marks: 1 
The regular expression (a* + b)* is equivalent to
which of the following regular expressions:
Hide Answer
Add Notes
View Notes
Show Comments
A a*b* Your answer is Wrong
B (a*b + b)*
C (a + b*)* Correct Option
Solution: (C)

(a*+b)* allows any string over {a, b} and is the same as (a + b)* .
Option (a) only allows strings of the form ai bj .
Options (b) and (d) do not allow strings of the form ai with no b’s.
D (a*b)*
Q.43)
Which of the following is/are context free languages
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
B Correct Option
Solution: (B)
Solution: (C)
D Correct Option
Solution: (D)
Q.44)
MSQ Subject: operating systems Max Marks: 2 

Hide Answer
Add Notes
View Notes
Show Comments
A 2.8 Correct Option |  Attempted
Solution: (A)
B 3.0
C 3.2 Correct Option |  Attempted
Solution: (C)
D 4.0 Correct Option |  Attempted
Solution: (D)
Q.45)
NAT Subject: Algorithms Max Marks: 2 
A message is to be sent which consist of only the following characters along
with their frequencies as shown below, the message length is of 500 characters what is the expected length if is
encoded using Huffman encoding.

Hide Answer
Add Notes
View Notes
Show Comments
Correct Answer |  Attempted
Solution: (1120)

A-11
B-01
C-001
D-000
E-10
Expected number of characters required for a message of 500 characters is
500*((0.23*2)+(0.37*2)+(0.14*3)+(0.10*3)+(0.16*2))=1120.
Q.46)
Negative Marks: 0.33 MCQ Subject: operating systems Max Marks: 1 

Hide Answer
Add Notes
View Notes
Show Comments
A P1, P0, P3, P2, P4
B P0, P2, P3, P1, P4
C P0, P4, P1, P3, P2
D None of the above Correct Option |  Attempted
Solution: (D)

The system is in a safe state.

A feasible execution sequence: P0, P3, P4, P1, P2.
Q.47)
Negative Marks: 0.33 MCQ Subject: computer organization Max Marks: 1 
A 64KB, 4-way set associative cache has 16 byte
blocks. If addresses are 32 bits, how many bits are used for the tag, index, and offset in this cache?
A 16, 12 and 4
B 18, 10 and 4
C 12, 16 and 4
D 10, 18 and 4
Hide Answer
Add Notes
View Notes
Show Comments
A 16, 12 and 4
B 18, 10 and 4 Correct Option
Solution: (B)
C 12, 16 and 4
D 10, 18 and 4
Q.48)
Negative Marks: 0.66 MCQ Subject: digital logic systems Max Marks: 2 
An 8 X 1 MUX has inputs A, B and C connected to
the selection inputs s2, s1 and s0, respectively. The data inputs, D0 through D7, are as follows: I1 = I2 = I7 = 0; I3 =
I5 = 1; I0 = I4 = D; and I6 = D'. The minimum number of literals in the Boolean SOP function determined by the given
MUX is
A 9
B 13
C 10
D 12
Hide Answer
Add Notes
View Notes
Show Comments
A 9
B 13 Correct Option
Solution: (B)
C 10
D
12
Q.49)
Hide Answer
Add Notes
View Notes
Show Comments
A 0
B 1 Correct Option
Solution: (B)
C X
1/X-1
Q.50)
Negative Marks: 0.33 MCQ Subject: Computer Networks Max Marks: 1 
Which one of the following allows a user at one site
to establish a connection to another site and then pass keystrokes from local host to remote host ?
A HTTP
B FTP
C Telnet
D TCP
Hide Answer
Add Notes
View Notes
Show Comments
A HTTP
B FTP
C Telnet Correct Option
Solution: (C)
Telnet is used for accessing remote computers. Using telnet a user can access the computer remotely. With
Telnet, you can log on as a regular user with whatever privileges you may have been granted to the specific
application and data on the computer.
D TCP
Q.51)
Consider a connected and undirected graph for
which we intend to solve the single source shortest path problem from a given node.
Statement I: The Bellman Ford algorithm will work and successfully report the shortest path even if the graph
consist of a negative weight edge only.
Statement II: The Bellman Ford algorithm will work and successfully report the shortest paths even if the graph
consist of a negative weight edge as well as the negative weight cycles.
Hide Answer
Add Notes
View Notes
Show Comments
A Only statement I is true. Correct Option
Solution: (A)
In case of a graph with negative weight cycle shortest paths do not exist for all the vertices, in case of negative
weight edges Bellman Ford algorithm returns the shortest path correctly.
B Both statement I and II are true.
C Only statement II is true.
D Both statement I and II are false.
Q.52)
The sensitivity and specificity for breast cancer
screening during a clinical breast cancer examination by a trained expert are approximately 0.54 and 0.94
respectively. If 2% of women in India have breast cancer. Find the probability that a woman who tests positive during
a clinical breast examination actually has breast cancer__
Hide Answer
Add Notes
View Notes
Show Comments
A 0.0696
B 0.54
C 0.1552 Correct Option
Solution: (C)
D 0.46
Q.53)
Negative Marks: 0.33 MCQ Subject: Computer Networks Max Marks: 1 
........... is responsible for converting the higher-level
protocol addresses to physical Network Addresses.
Hide Answer
Add Notes
View Notes
Show Comments
A Address Resolution Protocol (ARP) Correct Option |  Attempted
Solution: (A)
ARP is responsible for getting the mac address of the system.
B Reverse Address Resolution Protocol (RARP)
C Bootstrap Protocol (BOOTP)
D Internet Control Message Protocol (ICMP)
Q.54)
Negative Marks: 0.33 MCQ Subject: operating systems Max Marks: 1 
Consider the following statements S1 and S2:
S1 : Another term for binary semaphore is mutex lock.
S2 : The Peterson and Dekker software algorithms for mutual exclusion rely on the ability to atomically fetch a word
from memory, and atomically store a word to memory.
Which of the following are correct?
A S1 is True, S2 is False
B S1 is False, S2 is True
C Neither S1 nor S2 are True
D Both S1 and S2 are True
Hide Answer
Add Notes
View Notes
Show Comments
A
S1 is True, S2 is False
B S1 is False, S2 is True Correct Option
Solution: (B)

S1 : False
They are not the same, they are used for different purposes :
A mutex can be released only by the thread that has acquired it.
A binary semaphore can be signaled by any thread (or process).

Binary Semaphore :
Binary semaphores are semaphores which can assume the values 0 and 1 only. They are used for
implementing the locks by using a signalling mechanism for achieving mutual exclusion.
Here, if the value of semaphore is 0 it means it is locked so, lock is unavailable.
If the value of semaphore is 1 it means it is unlocked so, lock is available.
Mutex :
A mutex provides mutual exclusion, either producer or consumer can have the key (mutex) and proceed with
their work. As long as the buffer is filled by the producer, the consumer needs to wait, and vice versa.
At any point of time, only one thread can work with the entire buffer. The concept can be generalized using
semaphore.

S2 : True
It does require them to be atomic. Dekker's algorithm does too.
Suppose turn and flag are not atomic. That means that P0 can set turn and flag[0], but there exists an interval of
time when P1 can still view them as not set, and can enter its critical section. Symmetrically, P0 can enter the
CS too.
C Neither S1 nor S2 are True
D Both S1 and S2 are True
Q.55)
Hide Answer
Add Notes
View Notes
Show Comments
A Correct Option
Solution: (A)
close

Mock

Uploaded by

Copyright:

Available Formats

You might also like

Mock

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mock

Uploaded by

Copyright:

Available Formats

2/4/22, 8:30 PM GATE CS Applied Course

OVERALL ANALYSIS Solution Report

All Correct Answers Wrong Answers Not Attempted Questions

The percentage of students who passed in English is

A 15% Correct Option |  Attempted

A Forgive : Wrong Correct Option

First refers to the act of letting off the second.

D Repent : Sin Your answer is Wrong

A These rocks are formed up of small sediments of minerals.

B It is very old and is a slow process

D The rocks are broken into small sediments easily.

Time taken to answer this question 00:02:15 hrs

D 1444 Correct Option |  Attempted

A With the literacy rates in this Correct Option |  Attempted

B region as low as ten per cent

C we need to encourage the

D local people to build schools

Time taken to answer this question 00:00:43 hrs

A If only Assumption I is implicit

B If only Assumption II is implicit Your answer is Wrong

C If either Assumption I or II is implicit

D If neither Assumption I nor II is implicit Correct Option

A cluster Correct Option

C simple random Your answer is Wrong

Time taken to answer this question 00:00:21 hrs

B Correct Option |  Attempted

Time taken to answer this question 00:00:13 hrs

D in an embarrassing or awkward situation Correct Option |  Attempted

Time taken to answer this question 00:03:14 hrs

B {;,),+} Correct Option |  Attempted

RAW from 1-3 ($t1),

A Internet Control Message Protocol (ICMP) Correct Option |  Attempted

All of them can be associated with the TCP/IP here.

B Bootstrap Protocol (BOOTP) Correct Option

All of them can be associated with the TCP/IP here.

C Dynamic Host Configuration Protocol (DHCP) Correct Option |  Attempted

All of them can be associated with the TCP/IP here.

D Address Resolution Protocol (ARP) Correct Option |  Attempted

All of them can be associated with the TCP/IP here.

D 0.227 Correct Option

Time taken to answer this question 00:01:17 hrs

A The given decomposition of Designer into Designer1 and Designer2 is a dependency

Time taken to answer this question 00:00:27 hrs

A Your answer is Wrong

A LL(1) and LR(0)

B Not LL(1) but LR(0) Correct Option

C Not LR(0) but SLR(1)

D Both LR(0) and SLR(1) Correct Option

Note: A refers to the address and R refers to the registers

A I-c, II-d, III-e, IV-a, V-b Correct Option |  Attempted

B I-c, II-a, III-e, IV-d, V-b

C I-c, II-d, III-b, IV-a, V-e

D I-c, II-a, III-b, IV-d, V-e

Time taken to answer this question 00:02:40 hrs

A Correct Option |  Attempted

Items 5, 1, 2, 4 is one possible solution

and items 5, 1, 2, and 1/2 of item 3 is also a possible solution.

B Items 5, 1, 2, 7 and 1/2 of item 4 Correct Option

Now, 0.2 = 10H / (10 H + 200*10^3)

A ab Your answer is Wrong

C (a + b) Correct Option