M bullocks and N tractors take 10 days to plough a field. If we halve the number of bullocks and double the number of tractors, it takes 7 days to plough the same field. How many days it will take M bullocks alone to plough the field?
28.75 days
26.25 days
25.25 days
30 days
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The average of 6 consecutive even numbers is 45. Find the highest number?
46
50
48
52
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

A dishonest shopkeeper uses 80cm scale instead of metre scale and claims to sell at the cost price. What is his % profit?

30

33.33

25

20

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

The ratio of the number of boys and girls in a college is 8:7, if the percentage increase in the number of boys and girls are 25% and 20% respectively. What will be the new ratio?

14:17

18:21

25:21

5:4

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

John can do a piece of work in 18 days. Ali can do the same work in 24 days and Bishal in 36 days. John and Bishal worked for 4 days and handed it to Ali. Ali worked for some days and handed it again to John and Bishal 6 days before completing the work. For how many days did Ali work?

4 days

6.5 days

7 days

3.75 days

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
What is the synonym of the word MALEFACTOR
FELONY

CULPABLE

CULPRIT

OFFENSIVE

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Fill in the blank with the right homophone

____________ lands have no water.

Baron

Barren

Baxen

Barron

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Fill in the blanks with right participle.

The car warrants __________

Wash

Washing

Being washed

Washed

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Read the passage and answer the question

Tripura is a state in northeastern India. The third-smallest state in the country, it covers 10,491 km2 (4,051 sq mi) and is bordered by Bangladesh to the north, south, and west, and the Indian states of Assam and Mizoram to the east. In 2011 the state had 3,671,032 residents, constituting 0.3% of the country's population.

The area of modern Tripura—ruled for several centuries by the Tripuri dynasty—was part of an independent princely state under the protectorate of the British Empire. The independent Tripuri Kingdom (also known as Hill Tippera) joined the newly independent India in 1949.

Tripura lies in a geographically disadvantageous location in India, as only one major highway, the National Highway 8, connects it with the rest of the country. Five mountain ranges—Boromura, Atharamura, Longtharai, Shakhan and Jampui Hills—run north to south, with intervening valleys; Agartala, the capital, is located on a plain to the west. The state has a tropical savanna climate, and receives seasonal heavy rains from the south west monsoon. Forests cover more than half of the area, in which bamboo and cane tracts are common. Tripura has the highest number of primate species found in any Indian state. Due to its geographical isolation, economic progress in the state is hindered. Poverty and unemployment continue to plague Tripura, which has a limited infrastructure. Most residents are involved in agriculture and allied activities, although the service sector is the largest contributor to the state's gross domestic product.

What is hindered in Tripura due to geographical isolation?

Population growth

Agriculture

Rains

Economic progress

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Choose a figure which would most closely resemble the unfolded form of figure C.

1
2
3
4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The signature of main in C program is :

int main(int argc, char **argv);

If an object file of C program is “program” and the program is run using the following:

./program hello world

Then value of argc is?

3
2
1
4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following is TRUE?
The cost of searching an AVL tree is θ(log n) but that of a binary search tree is O(n)
The cost of searching an AVL tree is θ(log n) but that of a complete binary tree is θ(n log n)
The cost of searching a binary search tree is O(log n ) but that of an AVL tree is θ(n)
The cost of searching an AVL tree is θ(n log n) but that of a binary search tree is O(n)
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What is the output of the following program?

#include<stdio.h>

main( )

{ int fun();

fun();

(*fun) ();

}

int fun( )

{ printf("CSE");}

CSE
CSECSE
CSECSECSE
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What us the output of following C program?

#include <stdio.h>

int main() {

int a=10;

int b=5;

a=a^b;

b=a^b;

a=a^b;

printf("%d %d",a,b);

return 0;

}

5 10
15 5
50 2
10 5
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
How many different binary search trees can be constructed using six distinct keys?
256
132
128
264
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
IN BFS,
Each vertex is enqueued at most once in queue and dequeued once
Each vertex is enqueued twice in queue and dequeued once
Each vertex is enqueued twice in queue and dequeued twice
Each vertex is enqueued at once in queue and dequeued twice
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Given a sequence of numbers: 19, 6, 8, 11, 4, 13, 5, 27, 43, 49, 31, 25, If these numbers are inserted into a BST from left to right and If you remove 19 from the binary search tree then the TWO potential binary search trees that you can end up with are: [MSQ]
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
void main( )

{

static int i = 5;

if ( -- i)

{

main ( );

printf(“%d ”, i);

}

}

The output of the program is?

0 0 0 0
0 0 0 0 0
5 4 3 2 1
4 3 2 1 0
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

The number of comparisons required to search 48 in the hash table with chaining is pos = x % 10. The array of elements inserted into hashtable is 0, 32, 42, 200, 150, 22, 48, 120, 18, 108, 12, 110, 38, 24

1
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following statement(s) is/are TRUE? [MSQ]
The minimum number of elements in a max heap of height 'n' is 2^n
The maximum number of elements in a max heap of height 'n' is 2^(n+1) -1
The average time complexity of finding max element from a min heap of size n is θ(n)
Heap sort is not an in-place sorting algorithm
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following data structures will allow merge sort to work in O(nlogn) time? [MSQ]
Array
Singly linked list
Doubly Linked list
Heap
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider an algorithm A which solves problems by dividing them into eight sub problems each with half the size of the original problem, recursively solving each subproblem, and then combining the solutions in linear time. What is the time complexity of this algorithm? [MSQ]
Equal to O(n^2)
Equal to O(n^3)
Equal to O(n^2) and no chance to get less than O(n^2)
Equal to O(n^3) and no chance to get less than O(n^3)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
An undirected graph G=(V, E) contains n ( n = 2k, for k > 1) nodes named as V1 , V2 , ...., Vn . Two nodes Vi and Vj are connected if and only if (i+j) % 2 = 0. Each edge (Vi ,Vj) is assigned a weight of (i+j). Further the graph has one edge from V1 to V2,

The length of a path from Vn to Vn-1 in the minimum spanning tree is___

2n + 2
2n + 3
2n − 1
2n + 5
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Let's assume that after scanning a file we found the following character frequencies:

Character

A

B

C

D

E

F

Frequency

12

2

7

13

14

85

How many numbers of bits saved using Huffman coding algorithm ____?

(Note: Assume each character is stored with three bits without using any algorithm)

161
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Intersection of CFL and an infinite regular language [MSQ]
Must be CFL
May be regular
Must be infinite
Cannot be DCFL
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following regular expression R such that

R: (∈+0+1)* (0.∈.0) (∈+0+1)* + (∈+0+1)* (1.∈.1) (∈+0+1)*

The minimal NFA which accepts language generated by R will have _______ states

4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider a language L which is CFL but not DCFL. Select the correct option [MSQ]
Complement of L may or may not be CFL
Complement of L cannot be DCFL
Complement of L can be CSL but it cannot be CFL.
Complement of L can be DCFL but it cannot be regular.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a Turing machine (which acts as a transducer), which takes binary number as input and gives the one’s complement of input string and also after writing the output on Tape the head should be positioned at the beginning of the output. (Here ={0,1} and Г={0,1,B})

Two persons X and Y designed two Turing machines M1 and M2 for the given problem stated above.

Choose the correct option.

Only M1 is correct.
Only M2 is correct.
Both M1 and M2 are correct.
Both M1 and M2 are not correct.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

L1is CFL, L2is DCFL
L1 is DCFL, L2is CFL
Both L1,L2are CFLs
Both L1,L2are DCFLs
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following regular expression

(00*)1 + 1

Select the correct option

The regular expression generates all strings which ends with “1”.
The regular expression generates all strings which ends with “1” and have at least one “0” .
Every string generated by given regular expression will end with “1”
None of these
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Consider the following grammar where {S,X,Y} are non terminals and {v,w,z} are set of terminals.

S->XYX

X-> Yv | wX | ∈

Y->zX

Select the correct option

First(S) = {∈, z,w}

Follow(X)={v,w,z,$}

Follow(Y)={v,w,z}

First(X)={z,w}

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following grammar along with semantic actions [MSQ]

S-> SS { print +}

S-> a {print a}

For input string “aaa” the correct output will be

aa+a+
aaa++
+aa+a
a+a+a
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following grammar [MSQ]

A->AA+ | a

Select the correct option.

The given grammar is not LL(1).
The given grammar is not LR(0)
The given grammar is CLR(1).
The number of states in LALR(1) and CLR(1) parsers is the same for the given grammar.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following statements [MSQ]
The code area does not grow or shrink in size during program execution in C programming language.
The stack memory will always get allocated more space in memory in comparison to heap memory in a C program.
Semantic error can occur at runtime also.
Heap allocation is required for the languages which support dynamic data structures.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Which of the following statements about Ripple Carry Adder(RCA) and Carry Look-ahead Adder(CLA) is false?
CLA is faster than RCA
CLA is costlier than RCA
The circuit of CLA is relatively complex.
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What values of X,Y and Z result in a minimal expression?

X=1, Y=0, Z=1
X=1, Y=1, Z=0
Both
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
If (9AB)16-(8BC)16= (X)8, then X=___
0357
0356
0257
0256
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider a 3 variable function with the condition f(x,y,z)= f(x’,y,z). The number of functions possible is ___?
16
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a counter that counts the sequence 0-1-0-3 and repeats. The minimum number of T flip-flops required to implement the counter is ____
3
4
2
5
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Can you identify the property of a transaction that the following statement describes?

“Either all operations of the transaction are reflected properly in the database, or none are”.

Atomicity
Consistency
Isolation
Durability
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the smartphone table and the functional dependencies on it.

smart_phone(name, model, manufacturer, battery)

FD1: model → name

FD2: model → manufacturer, battery

FD3: model, manufacturer → battery

Identify the correct statement related to the relation smartphone. [MSQ]

smart_phone is in Second Normal Form
smart_phone is in Third Normal Form
smart_phone cannot be normalized due to FD3
smart_phone is in First Normal Form
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Multilevel index on a file with the following Information key field = 10 bytes, Block pointer = 4 bytes, Number of records = 25000, Size of the block = 1024 bytes.

Find the average number of block access (storing follows unspanned strategy)

(Assume first level index is Secondary index)

3
4
2
1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
SELECT S.name

FROM Sailors S

WHERE NOT EXISTS ((SELECT A.bid

FROM Boats A) EXCEPT

(SELECT C.bid

FROM Reserves C

WHERE C.Sid=S.Sid))

What is above query returns ?

The names of sailors who have reserved all boats
The names of sailors who have reserved any boat
The name of sailors who have not reserved any boat
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following information about the process is identical for a parent and the newly created child processes, immediately after the fork system call?
The process id (PID)
The file descriptor (fd) opened by the parent.
Both of these
None of these
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The memory addresses generated by the CPU when executing instructions of a process are called____________
Logical addresses
Symbolic addresses
Physical addresses
None of these
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
“It is necessary for threads to have separate stacks”. Pick up the correct reason(s) for the above statement : [MSQ]
The threads need to have separate execution states
The threads need to run independently
The threads are not part of the process
None of these.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a process with 4 pages 0,1, 2 and 3. The process accesses pages in the following sequence: 0, 1, 0, 2, 3, 3, 0, 2. Assume that the main memory can hold only 3 out of these 4 pages, is initially empty, and there is no other process executing on the system. Assuming the demand paging system is using an LRU replacement policy, how many page faults do page accesses above generate?
3
4
5
6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the Compare-and-Swap synchronization mechanism to implement mutual exclusion on a critical section. Compare_and_Swap(&lock, oldval, newval) is atomic and writes newval into var and returns true if the old value of var is oldval. If the old value of var is not oldval, Compare-and-Swap returns false and does not change the value of the variable. Assume that the lock is initialized to 0.

int Compare-and-Swap(int *var,int oldval,int newval) {

int temp = *var;

if(*var == oldvalue)

*var = newvalue

return temp;

}

Entry{

P:_________

}

//Critical Section

Exit{

lock=0;

}

Choose the correct predicate P in the Entry section, to achieve mutual exclusion.

while( Compare-and-Swap(&lock, 1, 1)!=0);
while( Compare-and-Swap(&lock, 1, 0)!=0);
while( Compare-and-Swap(&lock, 0, 1)!=0);
None of these
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The maximum length of the cable (in km) for transmitting data at a rate of 100 Mbps in ethernet LAN with frame size of 1000 bits (take signal speed as 2 × 106 km/sec) is
10 Km
20 Km
30 Km
None of these.
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
At which layer, the trailer usually contains bits used for error detection?
Network
Session
Transport
Data Link
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A computer on a 6 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long can the computer transmit at the full 6 Mbps ________ in (sec).
1.6 sec
2.6 sec
3.6 sec
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider two nodes, A and B are attached to opposite ends of a 1200 meter cable with signal propagation speed is 2 × 108 m/sec. Frame size used by both nodes is 1500 bits including header and preambles. Assume transmission rate is 100 Mbps and there are four switches between node A and B each insert 20 bit delay as a processing time in addition to store and forward delay. If only A has a packet to send, then the time taken to reach A’s packet at B is ________ μsec.
81.8 μsec
82.8 μsec
83.8 μsec
84.8 μsec
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The number of graphs possible with 3 unlabelled vertices are_____
4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
The value of ‘x’ for which the matrix

Is singular _______

3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
0
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
The value of the integration

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

A function is defined as

[-1, +1]

No value

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The linear system of equations

x+y+z=2,

x+2y+3z=7,

x+4y+7z=17 has

Infinite solutions
Finite with consistent solutions
consistent with unique solution
a trivial solution
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A deck of cards are divided into 4 sets. The first three sets has 17 cards each and the final set must have a single card. The number of ways of such distribution are__

51!/ (17!)^3
52!/ (17c3 * 3^3 * 3!)
51!/ (17!)^3 3!
52!/ (17!)^3 3!
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

There are 450 students in a college. Each student has to choose one or more elective out of management, history and physics. Further following information is also known

1) 75 students selected only management and physics.

2) 84 students selected only management and history.

3) 52 students selected only physics and history.

4) The number of students who selected only history is 137 less the number of students who selected only

management.

5) In total 238 students selected management as an elective.

6) In total 240 students selected history as an elective


The number of students selected both management and physics as elective are______

98
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
A computer has a main memory of 1GB. How many bits are required for memory address if the smallest addressable memory unit is a word and each word is of size 16 bits?
30
29
21
20
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the disk pack with the following specifications.

16 surfaces,

64 tracks/surface,

128 sectors/track,

256 bytes/sector.

What is the capacity of disk pack?

256MB
128MB
64MB
32MB
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A Hard disk has an average seek time of 5 ms. The transfer rate is 24 MB/sec. The disk rotates at 6,000 rpm and the controller overhead is 0.2 msec. Find the average time to read or write 6KB of data ?
10.45 ms
20.43 ms
30.24 ms
25.11ms
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 30% less time but incurs 25% more CPI (clock cycles per instruction) as compared to the program running on P1. If the clock frequency of P1 is 1GHz, then the clock frequency of P2 (in GHz) is _________

1.78

3.2

4.8

6.4

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A cache memory unit with a capacity of N words and block size of B words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 12 bits. If the cache unit is now designed as a 16-way set-associative cache, the length of the TAG field is ____________ bits.

16
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66