Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  GATE Computer Science Engineering(CSE) 2025 Mock Test Series  >  Practice Test: Computer Science Engineering (CSE) - 5 - Computer Science Engineering (CSE) MCQ

Practice Test: Computer Science Engineering (CSE) - 5 - Computer Science Engineering (CSE) MCQ


Test Description

30 Questions MCQ Test GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Practice Test: Computer Science Engineering (CSE) - 5

Practice Test: Computer Science Engineering (CSE) - 5 for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2025 Mock Test Series preparation. The Practice Test: Computer Science Engineering (CSE) - 5 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Practice Test: Computer Science Engineering (CSE) - 5 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Practice Test: Computer Science Engineering (CSE) - 5 below.
Solutions of Practice Test: Computer Science Engineering (CSE) - 5 questions in English are available as part of our GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) & Practice Test: Computer Science Engineering (CSE) - 5 solutions in Hindi for GATE Computer Science Engineering(CSE) 2025 Mock Test Series course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Practice Test: Computer Science Engineering (CSE) - 5 | 65 questions in 180 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Practice Test: Computer Science Engineering (CSE) - 5 - Question 1

Choose the most approximate word from the options given below to complete the following sentence.If I had known that you were coming, I _______ you at the airport

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 1

The sentence talks about a past incident and a condition has been mentioned. Thus option 2 fits here correctly. 'Would have' is the correct tense to be used here. Option 1 is illogical. 'Would' must be used here and not 'will' as it is in the past tense. Past perfect tense is incorrect here.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 2

Choose the most approximate word from the options given below to complete the following sentence.

I believe in the _____ of positive thinking thus always recommend these books to my clients.

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 2

The word that fits here is a noun thus options 3 and 4 are eliminated. The form should be singular as for abstract nouns we do not use the plural form. Option 1 is thus the correct answer.

The word powerful is an adjective and 'empowering' is a verb.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Practice Test: Computer Science Engineering (CSE) - 5 - Question 3

Consider a circle of radius r. Fit the largest possible square inside it and the largest possible circle inside the square. What is the radius of the innermost circle?

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 3

 

The radius of outer circle = r

∴ Diagonal of square = 2r

 

Side of square (a)=√2r

Practice Test: Computer Science Engineering (CSE) - 5 - Question 4

A bird files along the three sides of a field in the shape of an equilateral triangle at speeds of 3, 6, 8 km/hr respectively. The average speed of the bird is

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 4

Average speed = Total distance/Total time

Practice Test: Computer Science Engineering (CSE) - 5 - Question 5

Choose the most appropriate words from the options given below to fill in the blanks.

She was ______ to travel abroad and _____ in the field of commerce as per her wishes.

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 5

The sentence mentions a person doing something as per her wishes thus the first word must be a positive reaction. 'Restive' which means 'restless' and 'jinxed' which means 'cursed' are incorrect here. Between options 1 and 3,the word 'elated' which means 'too happy' and the word 'venture' which means 'undertake a risky or daring journey or course of action' fit here correctly. The word 'cease' means 'stop' and does not convey a proper meaning. Thus option 3 is the correct answer.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 6

In a 1600 m race around a circular track of length 400 m, the faster runner and the slowest runner meet at the end of the sixth minute, for the first time after the start of the race. All the runners maintain uniform speed throughout the race. If the faster runner runs at twice the speed of the slowest runner. Find the time taken by the faster runner to finish the race.

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 6

As, the faster runner is twice as fast as the slowest runner, the faster runner would have complete two rounds by the time the slowest runner completes one round.

Their first meeting takes place after the fastest runner takes 6 min to complete two rounds and the slowest runner completes one round.

Time taken to complete one round by fastest runner = 6/2 = 3 minutes

Rounds needed to complete the race = 1600/400 = 4

Time taken to complete the race = 4 × 3 = 12 min

Practice Test: Computer Science Engineering (CSE) - 5 - Question 7

Select the pair that best expresses a relationship similar to that expressed in the pair:

Horse: Foal

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 7

The young one of a horse is called a foal. Similarly, the young one of a goose is known as gosling. Thus, option 2 contains the pair that best expresses a relationship similar to that expressed in the given pair. In all the other pairs, the first word expresses the male form of the latter.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 8

Read the following passage and find out the inference stated through passage.

Juvenile delinquency is also termed as Teenage Crime. Basically, juvenile delinquency refers to the crimes committed by minors. These crimes are committed by teenagers without any prior knowledge of how it affects the society. These kind of crimes are committed when children do not know much about outside world.

Which of the following Inferences is correct with respect to above passage? 

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 8

Since teenagers here have tender age and commit crimes unknown to its consequences, clearly they should not be treated as any criminal. They need to be taught so that they can make difference between right and wrong and do not commit these crimes in future. Hence inference in option 1 is correct.

Previous

Practice Test: Computer Science Engineering (CSE) - 5 - Question 9

If n and y are positive integers and 450 y = n³, which of the following must be an integer? 

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 9

450 y = n³ implies that 450 y is the cube of an integer. 

When we prime-factorize the cube of an integer, we get 3 (or a multiple of 3) of every prime factor.

8 is the cube of an integer because 8 = 2³ = 2*2*2.

Thus, when we prime-factorize 450 y, we need to get at least 3 of every prime factor. 

Here's the prime factorization of 450 y:

450 y = 2 * 3² * 5² * y 

Since 450 provides only one 2, two 3's, and two 5's, and we need at least 3 of every prime factor, the missing prime factors must be provided by y. Thus, y must provide at at least two more 2's, one more 3, and one more 5. 

Smallest possible case: 

y = 2² * 3 * 5

Practice Test: Computer Science Engineering (CSE) - 5 - Question 10

The graph shows cumulative frequency % of research scholars and the number of papers published by them. Which of the following statements is true?

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 10

In this problem, cumulative frequency is given, so converting into frequency

From the table, it is clear that option b, i.e.

60% of the scholars published at least 2 papers is correct.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 11

Consider the following system of equations in three real variables x, y, z.

2x – 3y + 7z = 5

3x + y – 3z = 13

2x + 19y – 47z = 32

The system of equation has

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 11

Augmented matrix will be

Rank of A ≠ Rank of Augmented matrix

Hence given system of equations has no solution.

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 12

One of the addresses in a block is 135.16.27.116/20, the third octet (in decimal) of the first IP address in the block is _______.


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 12

Concept:

Keep the n leftmost bits of given address in the block and set the 32 − n rightmost bits to 0s to find the first address where n is the prefix length. 

Calculation:

Here, prefix length is 20.

135.16.27.116 ⇒⇒ 10000111 00010000 00011011 01110100 

The first 20 bits of this octal are fixed as 10000111 00010000 0001

The remaining 32 – 20 = 12 bits can get a maximum value as 0000 00000000.

So the possible first octal IP address is 10000111 00010000 00010000 00000000 which is 135.16.16.0

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 13

What is the output of the following C code:

int main( ) 

{

int p=8,q=-3,r=0;

int x,y,z; 

x = p && q && r ;

y = p || q && r ;

z = p && q || r ;

printf ( "%d", x+y+z ) ; 

return 0;

}


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 13

Practice Test: Computer Science Engineering (CSE) - 5 - Question 14

Consider two relational schemas: 

emp(ID, name, address, phone number, deptID)

department(ID, managerID, deptname, location)

What does the following relational expression perform?

 

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 14

The expression retrieves name of all employees in the Marketing department along with their manager ID.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 15

Let q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 16

A continuous random variable, X is distributed in interval 0 – 10. The probability, P(x = 2) is ______


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 16

In case of continuous random variable probability at a point = 0

Practice Test: Computer Science Engineering (CSE) - 5 - Question 17

In a compiler, a lexical analyzer

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 17

The lexical analyzer reads the stream of character making up the source program and groups the characters into meaningful sequences called as lexemes. For each lexeme, the lexical analyzer produces as output a token of the form <token name, attribute value>

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 18

Let L be the set of all strings generated by the regular automata over input alphabet {x,y}. The minimum number of states in a minimal DFA that accepts all the strings of length not more than 250 is ________.


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 18

Strings of length not more than 250 means all those strings whose length is less than or equal to 250.

Note: If |w| <= n, the number of states in minimal DFA is n+2.

Therefore, the minimum number of states in a minimal DFA that accepts all the strings of length not more than 250 is 252.

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 19

A process executes the following code.

void main()

{

if(fork()==0)

{

for(int i = 0; i<5; i++)

{

printf(“Hello”);

}

}

else

for(int j = 0; j<5; j++)

{

printf(“Hello”);

}}

Find the number of times ‘Hello’ will be printed.


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 19

fork() can be used to create a new process, known as a child process. This child is initially a copy of the parent but can be used to run a different branch of the program or even execute a completely different program. After forking, child and parent processes run in parallel. fork() returns 0 in child process and non-zero value in parent process.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 20

Bob wants people to know his public key but at the same time, he wants no one to accept a forged key as his. He decides to create a public key certificate. He goes to Certificate Authority(CA) where CA asks for Bob’s ______ key and signs the certificate with his _______ key.

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 20

CA is a federal or state organization that binds a public key to an entity and issues a certificate. The CA has a well-known public key itself that cannot be forged. The CA checks Bob's identification. It then asks for Bob's public key and writes it on the certificate. To prevent the certificate itself from being forged, the CA signs the certificate with its private key.

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 21

Consider the following functions:

f1(a, b, c) = Ʃm(0, 1, 3, 5) + d(2, 4)

f2(a, b, c) = Ʃm(1, 6) + d(2, 3, 5)

How many functions are possible for f1 + f2?


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 21

Therefore, the number of functions possible = 22 = 4

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 22

Consider the statement 

do

{

i = i + 1;

}

While(a[i] < b);

The minimum number of variables required in three address code of the above statement is _____.


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 22

t1 = i + 1

i = t1

t2 = i * 8 // refers memory allocation for given data type

t3 = a[t2]

if t3 < b

Hence, 3 variables are required in three address code.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 23

Which of the following are one of the maximal and minimal elements respectively of the poset ({2, 4, 5, 10, 12, 20, 25}, /)

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 23

Therefore, maximal elements are {12, 20, 25} and the minimal elements are {2, 5}.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 24

The post order traversal of a binary search tree is given by 25, 30, 20, 45, 60, 50, 40, 35. The pre order traversal of this tree will be given by:

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 24

Post-order traversal: 25, 30, 20, 45, 60, 50, 40, 35

In order traversal is the arrangement of keys in ascending order. Therefore,

In order traversal: 20, 25, 30, 35, 40, 45, 50, 60

The tree is given by:

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 25

Consider the following weighted graph. Bellman-Ford algorithm is implemented on the given graph with source P. The shortest distance from source P to vertex T is ______.


*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 26

In a TCP connection, the client closes the connection using three-way handshaking. The client TCP sends the last segment an ack segment with an acknowledgment no. 2164. What is the value of sequence number in FIN + ACK segment sent by server TCP? Assume that there is no data transfer between client and server TCP.


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 26

Concept:

The client TCP after receiving close command sends the first segment, FIN segment. In which only FIN flag is set.

Let the sequence no. be x and acknowledge no. be y.

The server TCP sends FIN + ACK segment after receiving the FIN segment.

Here, sequence no will be y and ack no will be x + 1.

The client TCP sends the last segment an ACK segment. This segment contains an acknowledgment number which is plus 1 the sequence number received in the FIN + ACK segment from the server.

Calculation:

Acknowledgment number in last segment i.e. ACK segment is 2164. Hence, sequence number in FIN + ACK segment is 2164 – 1 = 2163

Practice Test: Computer Science Engineering (CSE) - 5 - Question 27

Consider the following languages:

I. {amb| m = 3n + 1, where m,n >=0}

II. {ap | p is a prime number}

III. {aibj | i ≠ 5j, where i,j>=0}

IV. {w | w Є {a,b}, na(w) = nb(w) + 1}

Which of the above languages are context free?

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 27

I, III and IV are CFL because one comparison can be done by a push down automata at one time.

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 28

Consider a FAT-based file system which is stored on a disk of 900 GB. The data block size is 45000 bytes. The total overhead in each entry is 6 bytes in size. The maximum size of a file that can be stored on this disk is ______ MB


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 28

Total number of entries = 2 ×× 107 

Space occupied by overhead = 2 x 107 x 6 = 12 x 107

Maximum file size = total file system size – space consumed by overhead

= 90000 x 107 – 12 x 107

= 899880 MB

*Answer can only contain numeric values
Practice Test: Computer Science Engineering (CSE) - 5 - Question 29

The chromatic number of a planar graph is not greater than ________


Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 29

The chromatic number of a planar graph is no greater than four.

Practice Test: Computer Science Engineering (CSE) - 5 - Question 30

Consider the following grammar:

S→Pp 

P→QR 

Q→q|ε 

R→r|ε

Find the value of first(P) and follow(Q)?

Detailed Solution for Practice Test: Computer Science Engineering (CSE) - 5 - Question 30

First(S) = {p, q, r} 

First(P) = {q, r, ε} 

First(Q) = {q, ε} 

First(R) = {r, ε}

Follow(S) = {$} 

Follow(P) = {p} 

Follow(Q) = {p, r} 

Follow(R) = {p}

View more questions
55 docs|215 tests
Information about Practice Test: Computer Science Engineering (CSE) - 5 Page
In this test you can find the Exam questions for Practice Test: Computer Science Engineering (CSE) - 5 solved & explained in the simplest way possible. Besides giving Questions and answers for Practice Test: Computer Science Engineering (CSE) - 5, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)