Time Left - 30:00 mins

Mission NIELIT-2017 Day 25: MiniMock -4 (All Subject)

Attempt now to get your rank among 1078 students!

Question 1

The Knapsack problem belongs to which domain of problems ?

Question 2

The time complexity of Quicksort algorithm depends heavily on the selection of :

Question 3

The structure or format of data is called :

Question 4

A top down parser generates :

Question 5

The noise due to random behavior of charge carriers is :

Question 6

Communication between a computer and a keyboard involves ________ transmission.

Question 7

The principal of locality of reference justifies the use of ?

Question 8

The IETF standard documents are called :

Question 9

What will be output if you will compile and execute the following c code ?
void main ()
printf(“%d”,sizeof(5.2));

Question 10

What will be output if you will compile and execute the following c code ?
char c=125;
c=c+10;
printf(“%d”,c);

Question 11

If there is more than one key for relation schema in DBMS then each key in relation schema is classified as :

Question 12

Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as :

Question 13


The Circuit is equivalent to :

Question 14

If A B = C, then

Question 15

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to :

Question 16

Which one of the following is NOT necessarily a property of a Group?

Question 17

Consider the function in the interval [ , ]. The number and location(s) of the local minima of this function are :

Question 18

Let A, B, C, D be n × n matrices, each with non-zero determinant. If ABCD=1, then B-1 is :

Question 19

Process that periodically checks status of an I/O devices, is known as :

Question 20

How many wires are threaded through the cores in a coincident-current core memory?

Question 21

Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified as:

Question 22

Software Requirement Specification (SRS) is also known as specification of :

Question 23

If L1 is CFL and L2 is regular language which of the following is false ?

Question 24

Given two DFA’s M1 and M2. They are equivalent if :

Question 25

Assume that the operators +, -, x are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x, +, -. The postfix expression corresponding to the infix expression
a + b x c – d ^ e ^ f is
  • 1078 attempts
  • 8 upvotes
  • 27 comments
Sep 27GATE & PSU CS