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) - 10 - Computer Science Engineering (CSE) MCQ

Practice Test: Computer Science Engineering (CSE) - 10 - 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) - 10

Practice Test: Computer Science Engineering (CSE) - 10 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) - 10 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Practice Test: Computer Science Engineering (CSE) - 10 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) - 10 below.
Solutions of Practice Test: Computer Science Engineering (CSE) - 10 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) - 10 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) - 10 | 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) - 10 - Question 1

The candidate from our constituency was attacked during his __________ for the MP elections.

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

canvas – a type of cloth
canvass – a campaign or surve

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

Which of the following has the closest meaning to the sentence below :

She is an __________ writer. Everyone in the industry respects her.

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

imminent – about to happen, to take place very soon
eminent – remarkable, distinguished

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

Which of the following pairs are not related :

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

Irritate and Nettle are synonyms. Both mean to excite a feeling of anger. Rest all are antonyms.

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

Select the most appropriate option that would solve the problem.

Problem – What is the profit made by the shopkeeper?

Statements:

(I) The shopkeeper sold 200 articles at Rs.10 each.

(II) The profit per article is same as the cost price per article.

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

From (I), selling price per article = Rs. 10
From (II), cost price per article = profit per article
Now, selling price = cost price + profit
So, cost price per article = profit per article = Rs. 5
Total 200 articles are sold.
Thus, total profit = Rs. 1000
Therefore, both (I) and (II) are together sufficient, but neither alone.

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

What is the probability of getting atmost two tails when an unbiased coin is tossed thrice?

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

Sample space = {HHH, HHT, HTH, THH, HTT, THT, TTH, TTT}
Desired options are HHH, HHT, HTH, THH, HTT, THT, TTH.
Thus, P(atmost two tails) = 7/8

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

 Select the option closest to the meaning of the idiom – Skeleton crew

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

Skeleton crew means the least number of employees required to keep a work running

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

For the given statement, select the assumption(s) that follow:

Statement – A large number of people from city S are moving to city T owing to extremely high temperature.

Assumption :

(I) City T has lower temperature than city S.

(II) City T has adequate resources to meet this shift.

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

I is true as city T must be having lower temperature than city S. That is the reason why the people of city S have decided to move to city T.

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

 A bag contains 5 balls out of which some or maybe all are black. 2 balls are drawn from the bag and both are found to be black. What is the probability that all balls in the bag are black?

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

Since 2 black balls were drawn, the number of black balls may be either of 2,3,4,5.
Let A2 = bag contains 2 black balls
A3 = bag contains 3 black balls
A4 = bag contains 4 black balls
A5 = bag contains 5 black balls
E = 2 black balls are drawn

P(E / A2) = 2C2 / 5C2 = 1/10
P(E / A3) = 3C2 / 5C2 = 3/10
P(E / A4) = 4C2 / 5C2 = 3/5
P(E / A5) = 5C2 / 5C2 = 1

Since the number of black balls is unknown, all events A2, A3, A4, A5 are equally likely.
So, P(A2) = P(A3) = P(A4) = P(A5) = 1/4

By Bayes’ theorem,
P(A5 / E) = {P(A5) X P(E / A5) } / [{P(A2) X P(E / A2) } + {P(A3) X P(E / A3) } + {P(A4) X P(E / A4) } + {P(A5) X P(E / A5) }]

P(A5 / E) = {1/4 X 1} / [{1/4 X 1/10} + {1/4 X 3/10} + {1/4 X 3/5} + {1/4 X 1}]

P(A5 / E) = 1/2 = 0.5

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

Answer the question on the basis of the given table.

 

Q. If the number of male post–graduate employees in company H is 1800, what percent of female employees in that particular company is NOT post–graduate?

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

Number of post graduate employees in company H = 80% of 3360 = 2688
Number of male post–graduate employees in company H = 1800
Therefore, number of female post–graduate employees in company H = 2688 – 1800 = 888
Also, Total female employees in company H = (5 / 14) * 3360 = 1200
So, number of female non post–graduate employees in company H = 1200 – 888 = 312
Hence, required percentage = (312 / 1200) * 100 = 26 %.

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

Answer the question on the basis of the given table.

 

Q. Which company has the highest number of employees per office?

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

F = 2788 / 17 = 164
H = 3360 / 21 = 160
B = 2880 / 18 = 160
C = 2310 / 14 = 165

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

Given h(z) = (z+2)2 + 3(z+2) – 8, determine two functions f(z) and g(z) which when composed together as f(g(z)) will generate h(z).

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

From option C, f(g(z)) = f(z+2) = (z+2)2 + 3(z+2) – 8 = h(z)

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

What is the value of limx–>0 (cos x – 1) / x

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

There is a property in limits that limx–>0 (cos x – 1) / x = 0.

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

Match the best case complexity :

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

Selection sort has a complexity O ( n2 ) in every case.
Insertion sort has the best case when the input is already sorted. Every insert requires constant time.
Heap sort has a complexity O (n log(n)) in every case.

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

Consider the below Pseudo code written in C style

 

Q. Which of the following is true about above code.

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

T(n) = 2 T(n–1) + c, which is O(2n).
Since there can be atmost O(n) elements in function call stack, extra space required is O(n).

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

Consider the below Pseudo code written in C style

 

Q. Which of the following is true about the function in the above code.

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

The function represents code for a variation of subset sum problem.
Here we find if there is a subsequences with sum of squares of elements equal to X or not.

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

Consider the following tree. How many nodes will have the same position regardless of the fact whether the tree is traversed in DFS or BFS order? (Consider that we select children from right to left starting from the rightmost child)

 


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

DFS – ACEFHGBD
BFS – ACFBEHGD
So, A,C and D have the same position.
Thus, 3 is the required answer.

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

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16, 4, 2. What is the height of the binary search tree?

(Here height is defined as number of edges on longest path from root to a leaf)

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

The height of a binary search tree is the maximum distance of a leaf node from the root.

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

Which of the following is true about the given grammar

(NOTE : Here, ‘eps’ represesnts epsilon)

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

FIRST (S) = {i, a}
FIRST (E) = {e, eps}
FIRST (C) = {b}

FOLLOW (S) = {$, e}
FOLLOW (E) = {$, e}
FOLLOW (C) = {t}

When we make the LL(1) parse table, we get a conflict in E row.
Thus, the given grammar is not LL(1).

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

Which of the following is equivalent to :

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

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

Which of the following sets will have same number of elements in their power set?

Set 1 = {1, 2, 3, 4, 5, 6}
Set 2 = {{1, 2}, {3, 4}, {5, 6}}
Set 3 = {1, 2, 3, 4, {5, 6}}
Set 4 = {{1, 2, 3}, {4, 5, 6}}

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

No. of elements in Set 1 = 6. So, No. of elements in the power set of Set 1 = 26 = 64
No. of elements in Set 2 = 3. So, No. of elements in the power set of Set 1 = 23 = 8
No. of elements in Set 3 = 5. So, No. of elements in the power set of Set 1 = 25 = 32
No. of elements in Set 4 = 2. So, No. of elements in the power set of Set 1 = 22 = 4

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

Consider a 4 – bit Johnson Counter initialized to ‘0000’. What is the number of clock cycles required for the counter to reset to ‘0000’?


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

The Johnson counter resets the input, i.e., reaches the initial input in ‘2n’ clock cycles, where ‘n’ is the number of bits. So, for 4 – bit counter, the counter will reset in 2 X 4 = 8 clock cycles.

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

Consider register reference instructions. Which one of the following is true:

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

In register reference instructions, the first 12 bits (0 – 11) specify the register operation.
The next three bits are 111 and specify opcode and the last bit of the instruction is mode which is 0.
Therefore, last 4 bits are always 1110.

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

Which class of ports does the port number 48151 belongs?

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

Port numbers 1 – 1023 belong to the ‘well – known’ ports.
Port numbers 1024 – 49151 belong to Registered ports
Port numbers 49152 – 65535 belong to Private ports.

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

Consider the fragment offset field in the IPv4 header. What is its maximum value in bytes ?


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

The length of fragment offset field is 13 bits. Also, fragment offset is measured in 8 – byte blocks.
So, maximum offset is (213 – 1) X 8 = 65528 bytes.

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

 Match the protocols with the port numbers.

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

HTTPS – 443
SNMP – 161
SMB – 445
POP3 – 110

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

Consider below the regular expressions over alphabet {0, 1, 2}

(i) (0 + 01 + 012))*
(ii) 0*(0 + 1)*(0+1+2)*
(iii) 0*(ε + 01)*(Φ + 012)*
(iv) 0* + (01)* + (012)*

 

Q. Which of the above regular expressions represent same language as 0*(01)*(012)*

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

Making a DFA is all that is required to get the correct answer.

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

Assuming a 16 – bit address space with 12 logical pages. What is the size of each page ?

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

It takes 4 bits to reference 12 logical pages (24 = 16, so maximum 16 pages can be referenced in 4 – bits). Now, we are left with 16 – 4 = 12 bits, which can be used for pages.
So, page size = 212 = 4K

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

What is the output of the following C program :

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

For calculating ‘m’, any non – zero value is considered TRUE. In conditional operator, ++i makes i = –1, which makes it go to the TRUE case of the conditional operator. Now, ––k will return 0 and since there is AND after that, it will not be calculated any further as False && False or False && True will always return False.
So, i = –1, j = 2, k = 0, m = 0.

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

Consider a table STUDENTS and the following two SQL queries.

Query 1 – DELETE FROM STUDENTS;

Query 2 – TRUNCATE TABLE STUDENTS;

 

Q. Which of the following is TRUE :

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

Both the queries will remove all the rows from the table. But, query 1 can be undone by using rollback whereas query 2 is permanent. Also, DELETE fires all the associated triggers whereas TRUNCATE does not.

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

 

Q. What is the sum of all the elements of the L and U matrices as obtained in the L U decomposition?

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

So, the sum of all elements is 9.

View more questions
55 docs|215 tests
Information about Practice Test: Computer Science Engineering (CSE) - 10 Page
In this test you can find the Exam questions for Practice Test: Computer Science Engineering (CSE) - 10 solved & explained in the simplest way possible. Besides giving Questions and answers for Practice Test: Computer Science Engineering (CSE) - 10, 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)