Find the third proportional to 8 and 12?

14

16

18

20

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Arrange the following in descending order.

2 : 3, 3 : 4, 5 : 6, 1 : 5

5 : 6 > 3 : 4 > 2 : 3 < 1.5
5 : 6 > 3 : 4 < 2 : 3 > 1.5
5 : 6 < 3 : 4 < 2 : 3 < 1.5
5 : 6 > 3 : 4 > 2 : 3 > 1.5
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A loan of Rs.10000 is to be paid back by 4 equal annual installments. If the rate of interest is 10% S.I. per annum, find the value of each installment?
Rs 3480.72
Rs 3560.48
Rs 3043.47
Rs 3500
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A does half as much work as B in three-fourth of the time. If together they take 18 days to complete the work, how much time shall B take to do it?
60 days
15 days
45 days
30 days
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
How many different words can be formed with the letters of the word ‘VICE CHANCELLOR’, so that vowels will not come together?
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A man can row upstream 12 kmph and downstream 18 kmph. Find the man rate in still water and the rate of the stream?
3,18
15, 3
3, 15
18, 3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Find the odd word from the list

( Orange, Mandarins, Grapefruit, Pear)

Orange

Mandarins

Grapefruit

Pear

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which Sentence is grammatically correct?
Sheela goes out to buy vegetables.
The Sparrow sitting on the roof.
Heavy rain lashed West Bengal.
Where are my books?
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Sakshi tore the _____
Vail
vale
veil
whale
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Read the passage and answer the question

PASSAGE

Tondanuru in Karnataka’s Mandya District, popularly known as Kere Tonnur, has been associated with Sri Ramanujacharya. Tondanuru literally means the place of devotees. It was a flourishing centre of Sri Vaishnava faith and philosophy. Ramanujacharya lived here in the early 12th century and propagated his teachings.

There are over 70 inscriptions found here dating from pre-Hoysala period to the Mysore Wodeyar. Interestingly, a majority of the inscriptions are written in Tamil, in grantha script. It attests to the frequent visits here by Sri Vaishnava devotees from TamilNadu.

The history of Tonnuru can be traced to the prehistoric period as megalithic burial sites have been found in the region. It has been under the control of the gangas of Talakad, Cholas and the Hoysalas and later came under the Vijayanagara, Mysore Wodeyar, and also Hyder Ali and Tipu Sultan. Hoysala chronicles record Tonnura as one of the sub-capital of the period.

The village of Tonnuru in Pandavapura taluk, around 130 km from Bengaluru, is situated amidst fertile paddy fields, coconut groves and a large pond that supplies water for agriculture, with granite hills all around. Local traditions ascribe the excavation of the pond to Ramanujacharya, who also created a channel for water supply.

The religious importance of Tonnur was enhanced by the stay of Sri Ramanujacharya. Tonnuru temples dedicated to the Vaishnavite faith were built or renovated during his presence. It is clear from records that Ramanuja came to Tonnur after Hoysala king Bittiga, who ruled in the 12th century became Vishnuvardhna and an ardent follower of Vishishtadvaita philosophy. Ramanuja’s teachings persuaded many people of the region to become his followers. Later, he moved to Melgate where he stayed for a long period. Sri Yatiraja Dasa became his follower and propagated his teachings.

Question:

The inscriptions found in Tonnuru are of which script?

Devanagari
Grantha
Brahmi
Gurmukhi
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What is the output of the following C program?

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

int main() {

char *src1 = "123456789";

char *dst1 = (char *)malloc( 5 );

printf("src1: %s\n", src1);

strcpy(dst1, src1);

printf("dst1: %s\n", dst1);

return 0;

}

src1: 123456789

dst1: 123456789

Compiler error
Run time error
src1: 123456789
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following code segment:

int array[20], *p1, *p2;

k = &array[10];

z = &array[14];

Which of the following statements is incorrect w.r.t. pointers?

k + 2
z – 2
z + k
z – k
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Consider the disjoint sets S1, S2 and S3 represented above. If Union operation is performed on S1, S2 and S3 what will be the resultant tree if we use Union by Rank method.

None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Limitations of Direct Address Table are:
Prior knowledge of maximum key value
Practically useful only if the maximum value is very less.
It causes wastage of memory space if there is a significant difference between total records and maximum value.
All of these
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What will be the output of the following program?

#include<stdio.h>

struct Cricket

{

char team1[20];

char team2[20];

char ground[18];

int result;

}match[4] = {

{"IND","AUS","PUNE",1},

{"IND","PAK","NAGPUR",1},

{"IND","NZ","MUMBAI",0},

{"IND","SA","DELHI",1}

};

void main()

{

struct Cricket *ptr = match;

ptr+=2;

ptr--;

printf("\n%s Vs %s",ptr->team1,ptr->team2);

}

IND Vs AUS
IND Vs PAK
IND Vs NZ
IND Vs SA
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
What will be the output of following 4 lines of codes?(2 mark)

const char* p = "Hello";

printf ("%c ", *p);

printf ("%c ", *++p);

printf ("%c ", *p++);

printf ("%c ", *p);

H e e l
H e l l
H e l o
H H e l
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal.

Which of the following statements is always true?

u,v must be an edge in G, and u is a descendant of v in T
u,v must be an edge in G, and v is a descendant of u in T
If u,v is not an edge in G then u is a leaf in T
If u,v is not an edge in G then u and v must have the same parent in T
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
char **k[3][3][3];

Consider the array, defined above. Which one of the following definitions and initializations of p is valid?

char ** (* p) [3][3] = k;
char ***** p = k;
char * (* p) [3][3][3] = k;
const char ** p [3][3][3] = k;
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
How many number of spanning trees for the following graph is_____

8
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
dij(k-1) , dik(k-1) + dkj(k-1)
dik(k-1) , djk(k-1) + dij(k-1)
dij(k-1) , dij(k-1) + djk(k-1)
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
θ(n^log93 log3 n)
θ(n^log93 log2 n)
θ(n^log23 log2 n)
θ(n^log32 log2 n)
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The bob company uses a compression technique to encode the secret message before transmitting over the network. (Note : Each character in the input message takes 1 byte.)

Suppose the secret message contains the following characters with their frequency:

Character

P

Q

R

S

T

U

Frequency

5

10

15

20

23

27

If the compression technique used is Huffman Coding, how many bits will be saved in the message___

555
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
The numbers 1, 2, .... n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be____?
p
p+1
n-p
n-p+1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider an array containing ‘n’ distinct elements and we need to sort them in non-decreasing order as follows: First find the minimum, remove this element from the array and find the minimum of the remaining elements, remove this element and so on until the array becomes empty. In the best case, how many comparisons are needed?
O(n)
O(n^2)
O(nlogn)
None of these
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following languages

L1={ a^n b^n b b^n | n>0 }

L2={ a^n b^(n+m) | m, n>0}

Select the correct option.

Both L1 and L2 are CFL but not DCFL.
L1 is DCFL but not regular while L2 is regular.
Both L1 and L2 are DCFL but not regular.
L1 is DCFLbut not regular while L2 is CFL but not DCFL.
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following grammar G

S-> aS | aA

A-> aA | aB | ∈

B-> aB | bB | ∈

The number of states in minimal DFA accepting the language generated by above grammar are _____

4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
For Σ = {a,b}, let us consider the regular language L = aaab*. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?
3
4
5
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.66
Consider the following languages [MSQ]

L1={a^n b^n c^m | n,m>0}

L2={a^m b^n c^n | n,m>0}

Select the correct option.

(L1 ∩ L2) will be CSL but not CFL.
(L1 ∪ L2) will be CFL but not DCFL.
L1.L2 will be CSL but not CFL.
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Select the correct options. [MSQ]
Union of two co-finite languages must be finite.
Union of the complement of two co-finite languages must be finite.
Union of two co-finite languages can never be 𝛴*.
Intersection of the complement of two co-finite languages must be finite.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider the following regular expression R= ab*a*b. Assume string “ababaaababbab”, the number of tokens generated by regular expression R for the given string will be _________

3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the given below grammar.

S→ X&Z | Y*

X→ YZ

Y→ #Y | Z

Z→ &++S | Ο΅

For which non terminal /non terminals, the “*” is a part of corresponding FOLLOW set.

{Y}
{ Y, Z}
{S, Y, Z}
{S, X, Y, Z}
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following features can be captured by context free grammar alone. [MSQ]
Matching curly braces
Matching nested parentheses
Syntax of if-else
Equality of data type in LHS and RHS of an expression
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00

X is declared as int X[4][3]
X is declared as int X[3][4]
X is declared as char X[4][3]
X is declared as char X[3][4]
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the input string “a+b*c+d” is being parsed by an operator precedence parser. At a certain instance the stack pointer and the pointer in the input buffer is shown as below:

STACK POINTER:

INPUT POINTER:

Note: Given

$β‹–a, aβ‹—+, $β‹–+, +β‹–b, bβ‹—*, +β‹—*, $β‹–*,

*β‹–c, c β‹— +, *β‹–+, +β‹– d, dβ‹—$, + β‹— $, * β‹— $

What is the action taken by the operator precedence parser at this instance?

pop “c” as c β‹— +
push “c” as * β‹– c
pop “*” as * β‹– c
push “c” as c β‹— +
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Identify the correct statement about Foreign Key.
A data element/attribute within a data field of a data record that is not unique, and cannot be used to distinguish one data record in a database from another data record within a database table.
A data element/attribute within a data field of a data record within a database table that is a secondary key in another database table.
A data element/attribute within a data field of a data record within a database table that is a primary key in another database table.
A data element/attribute within a data field of a data record that enables a database to uniquely distinguish one data record in a database from another data record within a database table.
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Integrity constraints ensures that changes made to the database by authorized users do not result in
Loss of functional dependencies
Loss of keys
Loss of tables
Loss of data consistency
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the set of functional dependencies: F = { P → QR, Q → R, P → Q, PQ → R} Identify the correct canonical cover for the above given set.
{ P → QR; Q → R; P → Q; }
{ P → Q; Q → R; }
{ P → QR; PQ → R; P → Q; Q → R }
{ P → QR; }
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider a B+-tree in which the maximum number of keys in a node is 17. The minimum number of keys in any non-root node is ______
8
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Under what conditions does FCFS scheduling result in its shortest possible average response time? [MSQ]
Processes arrive in the ready queue with the shortest completion times first.
All processes have the same completion time.
Processes arrive in the ready queue with the largest completion times first.
None of these.
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
If access to memory takes 100 ns and reading a page from disk takes 10 ms, what is the average memory access time (including page fault overhead) if page faults occur in 0.1% of the memory references? You may assume that there is no additional overhead due to TLB misses.
1 micro seconds
10 milli seconds
1 milli seconds
10 micro seconds
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
In which of the storage placement strategies a program is placed in the largest available hole in the main memory?
First fit
Best fit
Worst fit
None of the above
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following code in which item=0, A and B are shared variables. Pick the correct choice from the given options.

The above code ensures mutual exclusion on shared variable item.
The above code does not ensure mutual exclusion on shared variable item.
The above code ensures bounded waiting.
None of the above
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following is/ are FALSE? [MSQ]
The dispatcher is responsible for setting process priorities.
Virtual addresses must be the same size as physical addresses.
Page offsets in virtual addresses must be the same size as page offsets in physical addresses
None of these.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Let computer A and B have IP addresses 72.195.126.113 and 72.195.126.91 respectively and both use subnet mask ‘N’. Then what is the value of ‘N’ that should not be used out of the following, if both belong to the same network?
255.255.255.0
255.255.255.128
255.255.255.192
255.255.255.224
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The value of HLEN of IP packet is 1000 in binary. The number of bytes of operations field included in this packet are ________bytes.
12
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following statement given below

S1 : In 1-persistent CSMA (Carrier Sense Multiple Access), a station senses the channel when it wants to send a frame. If the channel is idle then it sends the frame otherwise it does not continually sense and wait for a random amount of time and repeats the same process.

S2 : Traceroute always gives the right path from source to destination.

S3 : Link state is an inter domain protocol.

Which of the following statements is/are true?:

S1 and S2 only
S1 and S3 only
S2 and S3 only
None of the above
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider Shubhani wants to transfer files from host A to host B connected via a link with 10 Mbps bandwidth. Shubhani chooses a maximum file size to transfer with maximum segment size 1460 B. If a total 66 bytes of transport, network and data link layer header are added to each segment before the packet is sent over link, then the time to transmit a file is ________ minutes.
60 minutes
58 minutes
56 minutes
54 minutes
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
If A, B, C, D are square matrices of order n with non zero determinants. If given that ABCD=1 Then the value of B^-1 is
ACD
A^-1D^-1 C^-1
CDA
ADC
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A bag contain 3 white 2 black, 4 red balls. Four balls are chosen with replacement and kept in a cart. What is the probability that the cart is having a single white ball and rest non white is
32/81
1/9
½
13/27
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The derivative of |x| is [MSQ]
|x|
x
|x|/x

x/|x|
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The value of the limit

is y/4, then the y value is ___

5
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following are not simple graph(s) [MSQ]
5 vertices and 11 edges
8 vertices and 32 edges
25 vertices and 25 edges
200 vertices and 2 edges
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Which of the following have Eulerian circuit for the given graphs with 5 vertices of set V={1,2,3,4,5}

Note: The notation of the graph follows that the alphabet represents the Edge and the ordered pair associated to that alphabet {x,y} indicate that there is edges between x to y. The vertices are named with numbers {1,2,3,4,5}.

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The probability of two events A, B are given as P(A) =1 and P(B) =½ choose the correct answer(s)

[MSQ]

P(A/B) is equal to P(A)
P(B/A) is equal to P(A/B)
P(B/A) is equal to P(A)
P(A/B) - P(B/A) = ½
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The value of x for which the function m(x) = x^2 e^-x attains maximum value is ___
2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
What is the size of the main memory whose last memory location address is 0xFFFF, if it byte addressable memory?
32KB
64KB
10KB
16KB
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following is not true regarding the IO transfer using DMA ?
In cycle stealing mode for the transfer of every word of IO data DMA request has to be raised.
In cycle stealing mode after the transfer of every word of IO data the data bus control has to be released by the DMA.
In burst mode once DMA takes control of the data bus it releases only after transferring the entire block IO of data.
In burst mode once DMA takes control of the data bus it releases after transferring one word of IO data.

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A disk drive has an innermost track diameter as 35 cm with maximum recording density as 2KB/cm. Using a R/W head the disk is rotating at 6000-RPM. What is the data transfer rate, assuming there is a single read/write head?
4.4 KB/ms
8.8 KB/ms
22 KB/ms
44 KB/ms
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A file system with 200 GByte disk uses a file descriptor with 4 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 512 Bytes and the size of each disk block address is 4 Bytes. The maximum possible file size in this file system is
8 KB
288 KB
2888 KB
8258 KB
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider 128 KB 2-way set associative cache with 256-byte block size. The system has 32 bits physical address. What is the number of comparators and size of each comparator required for tag matching, respectively?
(2, 16)
(2, 18)
(18, 2)
(20, 2)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

  1. What are the minimum possible literal counts of the product-of-sum and sum-of-product representations respectively of the function given by the following Karnaugh map ? Here, “d” denotes "don't care".

2,2
1,1
3,3
4,4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

  1. Consider the following K-map.

The number of non-essential prime implicants in the K-map is___.

2
5
6
1
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider a ROM matrix which is used for multiplying two 8-bit numbers. The word size of the ROM matrix is___
8 bits
12 bits
32 bits
16 bits
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Let the numbers A= 1000011 and B= 1010100 be the unsigned binary numbers. Then A - B =____. (Use 2’s complement)
-(0010000)
-(0010001)
-(1101110)
-(1101101)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following statements is true? (MSQ)
The given gate can operate as positive-logic AND gate
The given gate can operate as negative-logic OR gate
The given gate can operate as positive-logic OR gate
The given gate can operate as negative-logic AND gate
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00