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

Direction: A number is wrong in the following number series. Select the wrong number.

64, 130, 264, 536, 1076

Direction: Each statement has a blank followed by four options. Select the most appropriate word for the blank.

Guru was always able to maintain a _______ face when he said something silly, and that contrast made everyone laugh.

A supermarket launched a scheme that if a customer purchases two CDs, one extra CD will be free and if he purchases 3 Mobile he will get one extra Mobile free. If the cost price of 3 CD and 4 Mobile be Rs.6700 and Rs.232500 respectively. If a customer purchase 2 CD and 3 Mobile as per scheme he availed 1 product free of each category, then at what price these product should be sold so that the agency can get overall profit of 17.5%

In the following question, two/three statements are given followed by four conclusions. You have to consider the statements to be true even if they seem to be at variance from commonly known facts. You have to decide which of the given conclusions, if any, follow from the given statements.

Statements:

I. Some cats are owls.

II. Some owls are elephant.

Conclusion:

I. Some cats are elephant.

II. All owls are elephant.

In the following question, a set of labelled sentences is given. Out of the four alternatives, select the most logical order of the sentences to form a coherent paragraph.

P) The over 11-km Mundka-Bahadurgarh section of Delhi Metro’s Green Line, connecting the capital of Haryana, was inaugurated by the Prime Minister.

Q) The rapidly growing industry in the area was waiting for Metro connectivity, said Mr.PM, adding that it would create new employment opportunities and benefit students.

R) Built at a cost of Rs 2,028 crore, the Mundka-Bahadurgarh elevated section, with seven stations, is the third Metro extension between Delhi and Haryana.

S)Mr. Prime Minister said Bahadurgarh was known as the Gateway of Haryana and would now be the Gateway of Development with the advent of the Metro.

Study the information given below and answer the questions based on it.

Eight friends, A, B, C, D, E, F, G and H are sitting around a circle (not necessarily in the same order) facing the centre. B sits third to the left of F. E is an immediate neighbour of both B and H. Only one person sits between A and H. C and G are immediate neighbours of each other. Neither C nor G is an immediate neighbour of B. Only one person sits between C and D.

Who amongst the following is an immediate neighbour of both A and H?

Direction: Study the line graph carefully and answer the given questions.

The graph shows that the total number of students attended the exams and the total number of students passed in the exam in different years of a school.

Note:

1. The total number of students enrolled in each year= The total number of students who appeared in the exam + The total number of students who didn’t appear in the exam

2. The total number of students who appeared in the exam= The total number of students passed in the exam + The total number of students who failed in the exam

What is the average number of students failed over the years?

S={1,2,...,n} of n unit-time tasks with deadlines {d1, d2, ..., dn} and penalty(non –ve) {w1, w2 ,..., wn} for missing the deadlines. Objective is to find a schedule for S that minimizes the total penalty. Execution of each task requires one unit of time. Given below is a set of tasks:

Tasks that are left out or that missed deadlines

Consider the following statements regarding Eigenvalues:

S1: Eigenvalues of A and A-1 are the same.

S2: Eigenvalues of A and AT are the same.

S3: If A is a singular matrix, then at least one of its Eigenvalue is 0.

Which option is correct?

Consider a new data structure which is named as A- tree. Consider the properties of new discovered A-tree:

• The nodes are inserted in such a way that all the nodes in the left subtree of a particular node are smaller than that node. Also, all the nodes in the right subtree of a particular node are larger than that node

• The height of the tree is balanced in such a way that the height of the left subtree and height of the right subtree differ by almost one.

Let the minimum number of nodes required to generate an A- tree of height 6 = 'a' and the maximum number of nodes which can be there in A- tree of height 6 = 'b' , find |a-b| = ________.

Which of the following statements about parser is/are CORRECT?

I. Canonical LR is more powerful than SLR

II. SLR is more powerful than LALR

III. SLR is more powerful than Canonical LR

Which algorithm is mainly used in military applications to send and receive messages.

Given a disconnected graph on 10 vertices, what is the max number of edges it can have ________.

C What does the following fragment of c program print?

#include

int main()

{

static int GATE[]={100,200,300,400,500};

static int *ptr = {GATE+2,GATE,GATE+3,GATE+4,GATE+1}

int **p = ptr;

ptr++;

printf("%d%d", ptr - p, **ptr};

}

The output of the program is______

Assume host A having an IP address of 125.32.16.5 with a subnet mask of 255.255.255.128. Also, assume another host B, having an IP address of 125.32.16.120 with a subnet mask of 255.255.255.192. Which of the following is correct?

Consider the following statements:

S1: The number of relations which are both reflexive and asymmetric is 0

S2: The number of relations which are both symmetric and asymmetric is 0

Which option is correct :

A system Jarvis requested for a specific site "abc.co", in return to this request it got the error as "LOOKUP FAILED". Now consider the following services:

1) SMTP

2) TCP

3) UDP

4) DNS

Which of the above service(s) are failed when we get the error as "LOOKUP FAILED"

Consider a binary tree in which every node has 3 attributes (Left child pointer, DATA, right child pointer). The tree has 3 levels. Now consider the following three cases:

Case 1: The tree is completely filled

Case 2: The last level of the tree is half-filled

Case 3: The last level of the tree is quarterly filled

If the total number of pointers in case 1 = a

similarly, the total number of pointers in case 2 = b

and, the total number of pointers in case 3 = c

Find the value of (b+c-a).

Consider a Demand Paging Environment Where the system requires 4 bytes to store integers and page size is of 256 bytes.

Assume the given code.

Int a [][] = new int a[200][250];

Int i=0, j=0;

While (i++ < 200)

{

while (j++< 250)

a [i][j]= 0;

}

What is the number of pages referenced from the system while executing the above code?

Consider the following statements:

S₁ : When in any application the number of insertion are very large but the number of deletion are very less. Then unordered array data structure give better performance than ordered array data structure.

S₂ : When in any application number of insertion and number of deletion are same then binary search tree data structure give better performance than max heap data structure.

Which of the following is correct?

A secondary index on a non candidate key

Consider the following elements:

5 , 12 , 3 , 15 , 4 , 6 , 10

These elements are inserted one-by-one into two separate heaps, one min-heap and another max heap. Then these two heaps are stored in two different arrays starting from index How many elements have the same index value in both the arrays _______.

The trace and determinant of a 2 × 2 matrix are known to be –2 and –35 respectively. Its eigenvalues are :

Assume that the time required for the eight functional units, which operate in each of the eight cycles, are as follows

5ns, 8ns, 6ns, 10ns, 15ns, 12ns, 6ns, 8ns

Assume that pipelining adds 1ns of overhead. Find the speedup versus the single cycle datapath.

If the connection of the input 3×8 decoder is as shown in the figure, then the output F(A,B,C) can be expressed as

Consider the disk with following characteristics. Computer Network

• Transfer speed of 107 bytes/sec

• 10,000 RPM

• Average seek time of 8ms

• Each disk operation has 2 ms overhead, Assume system bus has a maximum bandwidth of 133 Megabytes per second and network connection has bandwidth of 107 bytes/sec. HTML files have an average of 8000 bytes. Each HTML file occupied one sector.

Find the throughput to transfer HTML files? (Round to nearest integer). Assume throughput is the number of HTML files read per second?

ptions~

(a) 72

(b) 73

(c) 75

(d) 76

Consider a B+ tree in which the maximum number of keys in a node is 8. What is the minimum number of keys present in a non-leaf node?

Correct Answer