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

Statements:
All pillows are beds.
No fruit is pillow.
Some foods are fruits.
Conclusions:
I. At least some foods are pillows.
II. Some beds are definitely fruits.

Direction: Study the following information carefully and answer the questions given below:

P, Q, R, S, T, U, V and F are sitting around a circle facing the centre. U is third to the right of Q, who is third to the right of F. P is third to the left of F. R is fourth to the left of P. T is third to the right of S. S is not a neighbour of P.Four of the following five are similar in a certain way based on their positions in the seating arrangement and so form a-group. Which of the following does not belong to that group?

Following bar graphs shows time taken by different pipes to fill that particular percentage of tank which is described in tabular data. For Ex- Pipe 1 fills the 10 % of tank in 6 mins.
Now, read the following data and answer the question carefully:


A Tank has three pipes; two of them are used to fil the tank while another one used to empty the tank namely: pipe 3, pipe 5 to fill the tank and a third pipe for making the tank empty. When all three pipes are open, 7/18^th part of the tank is filled in 1 hours. How much time will the third pipe take to empty the completely filled tank 10 times the bigger than the previous one.

In a school, 12th class consists of 30% male students of which 30% male students failed in the class. Total 82% students passed in 12th examination out of 900 students. Calculate the total number of female passed students?

Directions: Rearrange the following six sentences (A), (B), (C), (D), (E) and (F) in the proper sequence to form a meaningful paragraph: then answer the questions given below them.

A). Indian Government remain concerned about potential spillover effects from the unconventional monetary policies of the advanced economies, which could cause disruptive volatility of exchange rates, asset prices and capital flows.
B). The challenges are related to high public debt and unemployment, poverty and inequality, lower investment and trade, negative real interest rates along with signs of prolonged low inflation in advanced economies.
C). In this context, emerging markets and developing countries (EMDCs) continue to be major drivers of global growth.
D). The global recovery continues, although growth remains fragile, with considerable divergences across countries and regions.
E). It is important to strengthen the framework of international financial cooperation, including through instruments such as swap-lines, to mitigate the negative impacts of monetary policy divergence in reserve currency issuing countries.
F). Structural reforms, domestic adjustment and promotion of innovation are important for sustainable growth and provide a strong and sustainable contribution to the world economy.
Which of the following will be the Second sentence?

17 25 34 98 121 339

There are 3 red balls and 5 green balls in a bag. If two balls are picked at random from the bag then find the probability of getting a red ball?

The size of a proper subgroup of a finite group G is 31. The size of the smallest possible group G is ____.

Find the number of seven digit integers with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only.

Consider the following statements:
i. Selection sort performs minimum number of swaps.
ii. Insertion sort performs worst in case of sorted array.
iii. Floyd Warshall uses dynamic programming to calculate all pairs of shortest paths

Q. Which of the statements are true?

Consider the following recursive function find.
int find (int A[], int n)
{
int sum=0;
if(n==0) return0;
sum = find(A, n-1)
if (A[n-1]<0) sum=sum+1;
return sum;
}
Q. What is the worst case running time above function find (A[], n) when array A has 0 to n-1 elements?

Let A be a collection of objects. An efficient method for converting it into a set is first to sort the objects of A. Then, walk through the sorted sequence and remove all duplicates. What is the running time of this method?

The following function test takes argument a queue and uses stack to perform some function:
void test(Queue *A)
{
Stack T;
while (!isEmpty(A))
push(&T, deQueue(A));
while (!isEmpty(&T))
enQueue(A, pop(&T));
}
Q. What does the function test do?

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;
}
Q. What is the functionality of above function Do ()?

{
printf(“%d%d%d%d%d”, ‘ \n ‘ ,printf(“\0”),printf(“\n”),’ \0 ‘ , ‘ \b ‘ );
}
What will be printed by this above code?

Given T_s : Transfer time
B : Number of bytes to be transferred
N : Number of bytes on a track
R : Rotational speed.
Q. Which of the following expression gives the total aveage access time?

Cache with 4 Blocks of 4 bytes. Give the number of cache hits and cache miss respectively

We have three stations P, Q, R connected in serial manner. P is connected to Q through a 3Gbps fibre optic link and length is 500Km. Q is connected to R through 60Mbps link and length is 15Km.All the links are full duplex in nature. A file is sent from station A to C. Packet size is 1KB.We use sliding window protocol such that SWS=RWS. Find the optimal SWS packets.

Consider a 3-bit number A and 2 bit number B are given to a multiplier. The output of multipier is realized using AND gate and one bit full adders. If minimum number of AND gates required are X and one bit full adders required are Y, then X + Y =

The output F of the 4-to-1 MUX shown in figure is

Let L= {|M accepts some string} where M is a Turing machine. Find the language L?

Let A, B, C and D are problems. Consider the following polynomial reductions to known about the problem B.
(i) A≤B (A is reducible to B)
(ii) C≤ D
(iii) B≤ D
Find the correct statement from the following.

Consider the relation scheme of the relation SCHEDULE shown below. What is the highest Normal form of this relation?
SCHEDULE (Stud_ID, Class, Stud_Name, Stud_Major, Class_Time, Building_Room, Instructor)
Assume the following functional dependencies
Stud_ID →Stud_Name
Stud_ID →Stud_Major
Class →Class_Time
Class →Building_Room
Class →Instructor

In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T₁) and TS(T₂) be the timestamps of transactions T₁ and T₂ respectively. Besides, T₁ holds a lock on the resource R, and T₂ has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp.
if TS(T₂) < TS(T₁) then
T₁ is killed
else T₂ waits.
Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

Consider the following statements
(i) SQL’s aggregation can’t be expressed in relational algebra
(ii) SQL’s grouping construct can be expressed in relation algebra.
Which of the following is correct?

Which of the following SQL query find all the tuples having temperature greater than that of Paris.

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.