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

Two solutions of alcohol A and B were mixed to obtain 20 litres of new solution C. Before they were mixed, the first solution A contained 1.6 litres of alcohol while the second solution B contained 1.2 litres of alcohol. Before mixing if the percentage of alcohol in the first solution A was twice that in the second B, what was the volume of the first solution A before mixing?

In this question, out of the four alternatives, choose the option which is closest in meaning to FURORE.

Find the pair of letters which will come in blank spaces marked as ‘?’.

V W X Y E D C B R S T ? ?

We are given a square of side 22 cm. A circle of maximum possible diameter is inscribed in this square. If a point is chosen at random inside the square, then the probability that it will lie inside the circle is ____________.

Based on the given statements, select the most appropriate option to solve the question.

Sheetal wants to sell her bicycle at either a profit of K% or a loss of K%. What is the value of K?

Statement 1: Difference between the amount Sheetal gets in the 2 cases is ₹ 2560

Statement 2: If Sheetal’s profit is Rs K, her profit in percentage is 7.5%.

Triangles ABC and CDE have a common vertex C with side AB of triangle ABC being parallel to side DE of triangle CDE. If length of side AB = 4 cm and length of side DE = 10 cm and perpendicular distance between sides AB and DE is 9.8 cm, then the sum of areas of triangle ABC and triangle CDE is _________ cm².

Interior angles of a polygon with 8 sides are in arithmetic progression. If the smallest interior angle measures 100° then find the largest interior angle?

Consider the following problems.

1. longest common subsequence

2. Optimal Binary search tree

3. Fractional knapsack problem

4. Matrix chain multiplication

Which of the above problems can be solved using dynamic programming?

Suppose that the minimum spanning tree of the following edge weighted graph contains the edges with weights x, y and z.

What is the maximum value of x+y+z?

Which of the following standard algorithm is not an greedy algorithm?

For the sequence

500, 535, 512, 721, 436, 611, 624, 632, 643

Lexicographic sort gives time complexity of:

Consider the following SDT

G→A-T{G.x=A.x-T.x}

A→Ea{A.x=E.x2}

EEb{E1.x=1+E2.x}

E→ξ{E.x=-1}

T→Eb(T.x=Ex-2}

If above SDT uses L- attributed definition then what is the value of an attribute x at root after evaluation for an input string “ba-bb”.

Match the following:

While opening a TCP connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order 32 bits of the counter of the ToD clock is to be used for the initial sequence numbers. The clock counters increments once per millisecond. The maximum packet lifetime is given to be 64s.

Which one of the choices given below is closest to the minimum permissible rate at which sequence numbers used for packets of a connection can increase?

Both hosts and routers are TCP/IP protocol software. However, routers do not use protocol from all layers. The layer for which protocol software is not needed by a router is

If the instruction length in a system is 32 bits and memory has 32 words. Then find the 1 address instructions if there are 42 address instructions’.

Consider execution of 100 instructions on a 5 stage pipeline. Let P be the probability of an instruction being a branch. What must be the value of P such that speed up is atleast 4?

(Assume each stage takes 1 cycle to perform it’s task and branch is predicted on fourth stage of the pipeline)

What is the output of the following C code?

#include

#include

void main()

{

int index;

for(index=1; index<=5;i++)

{

printf("%d",index);

if(i == 3)

continue;

}

}

Consider the following code

int DO(char *gate)

{

char *gate1 = gate;

char *gate2 = gate + strlen (gate) – 1;

while (gate1 < =gate2)

{

if (*gate1 ++! = *gate2 --)

Return 0;

}

return 1;

}

What is the functionality of the above function Do ()?

Consider the following code for inorder traversal of a binary tree.

Void traversal (node *root)

{

if (root ==0)

{

Print f(“empty tree”);

}

else

{

itraversal (root left);

printf("%d\n”, root data);

Iiraversal (root right);

}

}

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

R{a,b,c} and S{x,y,z} are two relations in which x is a foreign key referring to the primary key of relation R.

Consider the following operations. Which among these operations may violate the referential integrity constraint?

Suppose that we have the following three tuples in a legal instance of a relation schema S with three attributes ABC (listed in order): (1,2,3), (4,2,3), and (5,3,3). Which of the following dependencies can you infer does not hold over schema S?

Number of binary trees formed with 5 nodes are

The Boolean function f implemented in the figure using two input multiplexers is

Consider a complete undirected graph A with 6 vertices. All the vertices are labelled. What is the number of distinct cycles of length 4 in this graph?

The number of colours required to properly colour the vertices of every planar graph is

While opening a TCP connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order 32 bits of the counter of the ToD clock is to be used for the initial sequence numbers. The clock counters increments once per millisecond. The maximum packet lifetime is given to be 64s.

Which one of the choices given below is closest to the minimum permissible rate at which sequence numbers used for packets of a connection can increase?