When the most significant byte of a word is at the smallest address, the architecture is called

Polymorphisms means

A computer system has a RAM of 4 GB and a cache of 512MB. Assuming that the least significant bit is b₀ ,the cache location using direct mapping is given by

Which of the following is TRUE about Vectors interrupts?

The maximum number of items in a B-tree of order m and height h is

Each B-tree node can have at-most p tree pointers, p-1 data pointers and p-1 search key field values. These must fit into a single disk block if each B-tree node is to correspond to a disk block. Suppose the search field is V =9 bytes long, the disk block size is B=512 bytes, record (data) pointer is P_r =7 bytes and a block pointer is P=6 bytes. What is the value of p?

What is the order p of a B+-tree given that the search key field is V=9 bytes long, the block size is B= 512 bytes, record pointer is Pr=7 bytes and a block pointer is P=6 bytes.

Consider a schema R(A, B, C, D, E) with functional dependencies A → B, B→ C, BC → A , A→D , E→A, D→E. Which of the following is not a key?

The tuples in relation R(A,B) are {(1,2),(1,3), (3,4)) and the tuples in relation S(B,C) are (2,5), (4,6), (7,8)}. The number of tuples in the result of the following SQL query are:

Select * from R Natural Outer Join S;

A unit of storage that can store one or more records in a hash fiIe organization is denoted as

Which of the following will undo all statements upto commit?

If a system has a 32-bit processor, what are the number of page table entries if the page size is 16KB?

Zombie process is a process

Wireless LANs do not use CSMA/CD because

If a host has an IP address 201.40.67.31/25, what are the network ID and broadcast address of the network to which this host belongs:

If the MF bit-0, Fragment Offset : 1480 and Total Length : 520 in an IP datagram, then the length of datagram is

When the TTL of a datagram sent from a host H1 is 1, the data can reach a host which is

Five segments of data of sizes 100B, 400B, 200B, 300B and 50B are sent using TCP and PSH bit is set on each of the segments. There are no retransmission timeouts. The acks received are 101, 101, 701, 701 and 1051. In which order are the segments received

One major difference between RIPv1 and RIPv2 are:

The Memory Buffer Register(MBR) is best understood by which of the following descriptions

A Program that allows multiple operating systems to share a single hardware processor, in current terminology is called as

Which type of operating system would be needed to allow the students in a class to read a file that the teacher also had open?

Read the passage below and then answer the questions (23 - 26).

I thank the ACM for this award. I can't help but feel that I am receiving this honor for timing and serendipity as much as technical merit. UNIX swept into popularity with an industry-wide change from central main frames to autonomous minis. There is an old adage, "Dance with the one that brought you," which means that I should talk about UNIX. I have not worked on mainstream UNIX in many years, yet I continue to get undeserved credit for the work of others. Therefore, I am not going to talk about UNIX, but I want to thank everyone who has contributed. That brings me to Dennis Ritchie. Our collaboration has been a thing of beauty. In the ten years that we have worked together, I can recall only one case of miscoordination of work. On that occasion, I discovered that we both had written the same 20-line assembly language program. I compared the sources and was astounded to find that they matched character-for-character. The result of our work together has been far greater than the work that we each contributed.

Whom did the speaker of the above paragraph work with for 10 years?

Read the passage below and then answer the questions (23 - 26).

I thank the ACM for this award. I can't help but feel that I am receiving this honor for timing and serendipity as much as technical merit. UNIX swept into popularity with an industry-wide change from central main frames to autonomous minis. There is an old adage, "Dance with the one that brought you," which means that I should talk about UNIX. I have not worked on mainstream UNIX in many years, yet I continue to get undeserved credit for the work of others. Therefore, I am not going to talk about UNIX, but I want to thank everyone who has contributed. That brings me to Dennis Ritchie. Our collaboration has been a thing of beauty. In the ten years that we have worked together, I can recall only one case of miscoordination of work. On that occasion, I discovered that we both had written the same 20-line assembly language program. I compared the sources and was astounded to find that they matched character-for-character. The result of our work together has been far greater than the work that we each contributed.

Who or what is the speaker NOT going to talk about?

Read the passage below and then answer the questions (23 - 26).

I thank the ACM for this award. I can't help but feel that I am receiving this honor for timing and serendipity as much as technical merit. UNIX swept into popularity with an industry-wide change from central main frames to autonomous minis. There is an old adage, "Dance with the one that brought you," which means that I should talk about UNIX. I have not worked on mainstream UNIX in many years, yet I continue to get undeserved credit for the work of others. Therefore, I am not going to talk about UNIX, but I want to thank everyone who has contributed. That brings me to Dennis Ritchie. Our collaboration has been a thing of beauty. In the ten years that we have worked together, I can recall only one case of miscoordination of work. On that occasion, I discovered that we both had written the same 20-line assembly language program. I compared the sources and was astounded to find that they matched character-for-character. The result of our work together has been far greater than the work that we each contributed.

What astounded the speaker?

Read the passage below and then answer the questions (23 - 26).

I thank the ACM for this award. I can't help but feel that I am receiving this honor for timing and serendipity as much as technical merit. UNIX swept into popularity with an industry-wide change from central main frames to autonomous minis. There is an old adage, "Dance with the one that brought you," which means that I should talk about UNIX. I have not worked on mainstream UNIX in many years, yet I continue to get undeserved credit for the work of others. Therefore, I am not going to talk about UNIX, but I want to thank everyone who has contributed. That brings me to Dennis Ritchie. Our collaboration has been a thing of beauty. In the ten years that we have worked together, I can recall only one case of miscoordination of work. On that occasion, I discovered that we both had written the same 20-line assembly language program. I compared the sources and was astounded to find that they matched character-for-character. The result of our work together has been far greater than the work that we each contributed.

"I thank the ACM for this award." What award can it be?

It is not possible to construct a graph having

f: N x N → N is a function where f(m,n)=2^m.3ⁿ. Then f is

The time complexity of the following code segment is NOT of the order

while (n≠1)

{

n=n/2;

}

Two algorithms A and B are being compared for their efficiency on an input of size n. The running time of A is n³ seconds and the running time of B is n² hours. Find the smallest n for which B is faster than A.

Let (a₁,a₂,a₃,......,a_n-1,a_n) be a list of numbers in ascending order except for a_n, where a_n < a₁. Then the time taken by insertion sort and bubble sort algorithms respectively to sort the list are

A Regular Expression for the language L over the alphabet Σ={a,b)* consisting of strings with exactly 2b's is

Which of the following generates the same language as L, Where L={xⁿ yⁿ | n ≥1}

I: E→ xEy | xy

II: xy | (x⁺ xyy⁺)

III: x⁺ y⁺

How many new processes will be created in case a process executes the following

code:

fork();

fork();

fork();

As n → ∞, the function 2 ^√(n) grows faster than

Which of the following holds under the assumption that P ≠ NP

Let G be a connected graph with "v" nodes and "e" edges. The number of edges to be dropped to form a tree are

Let G be an Eulerian weighted graph with sum of the weights of edges as 1000. What is the weight of Eulerian circuit of G

Let L be a bounded, distributive, complemented Lattice and a,b,c be the elements of L, then which of the following is valid

Convert FEDCBA into octal number

Thrashing can be reduced by

Let m and n be the natural numbers and let prime(n) be true if n is a prime. Which of the following expression says that there are an infinite number of primes

A disadvantage of an inverted page table as compared to a normal page table is

Consider the following two Statements:

(A) There are infinitely many interesting whole numbers

(B) There are finitely many uninteresting whole numbers

Which of the following is Tnun

A simple graph on 8 vertices is given such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6 and a vertex of degree 7. Which of the following can be degree of the last vertex

Consider the set of all 2x2 matrices whose entries are either 0 or 1. A matrix is randomly chosen from that set. What is the probability that the determinant of the chosen matrix is -ve

The Program counter contains the number 9ABC and the address part of instruction contains 134. If relative mode if addressing is used, find the effective address

The function below has a flaw. Which one of the following describes the deficiency?

int fibonacci(int n)

{

if (n>0)

{

switch(n)

{

default: return (fibonacci(n-1) + fibonacci(n-2) ;

case 1:

case 2: return 1;

}

}

return -1;

}.

What is the output of the following code?

public class Test1{

public static void main(String[] args){

ChildClass c = new ChildClass();

c .print() ;

}

}

class ParentClass{

int id=1;

void print() {

System.out.println(id);

}

}

class ChiLdClass extends parentClass{

int id=2;

}

Let A : {1,2,3,4,5,6,7,8,9,10} A1={1,2,3,4}, A2: A2={5 ,6,7}, A3={4,5,7,9}, A4={4,8,10}, A5={8,9,10}, A6={1,2,9,6,8,10}. which of the following are partitions of A

The main memory can store 32K words of 12 bits each. If direct cache mapping is used with a cache capability of 512 words, what is the size of each cache location.

Let R={(1,2),(2,3),(3,4)} be a relation on {1,2,3,4}. which one of the following is transitive closure of R?

If G is a polyhedral graph with 12 vertices and 30 edges then

How many queues are needed to implement a priority queue

What is the most suitable data structure to store permutation of a given set of alphabets in terms of search complexity

Comment on the output of the given C code

#include

struct temp

{

int a;

int b;

int c;

};

main ( )

{

struct temp p[ ]={1, 2, 3, 4, 5, 6, 7, 8, 9};

printf(“%d”, p[0].a)

}

What is the search complexity of. finding nearest neighbors in a huge data set of size n

A min-max heap is defined as follows: Each node at an even level in the tree is less than all of its descendants, while each node at an odd Level in the tree is greater than all of its descendents

If the values are inserted in the order (3,6,9,19,27,48,50,66) in the min-max heap, what value would be found at position 5 in min-max heap (root is counted as position 1)

Which is the suitable data structure that finds duplicates in a list of numbers whose range is small

If two function declarations were made as follows:

f(int arr[])

pf(int *arr)

Which of the following statement is True?

What is the output of the following Java code

int count=1;

int num=25;

while (count<25)

{

num= num- 1 ;

count++ ;

}

System. out.println(count +” “+num);

An example of NP-Hard decision problem which is not NP-Complete.

Which algorithm can be used for the solution of Single Source Shortest Path problem when the edges are of negative lengths:

If a complete binary tree with n nodes is represented sequentially using array then for any node with index i, 1 ≤ i ≤ n we have:

If X=ABCB, Y=BDCAB, the Longest Common Subsequence (LCS) of X and Y is

Consider the following C++ program (Assume no syntax errors)

#include

#include

#include

using namesPace std;

int main()

{

cout << Enter the number n: ;

int n;

cin >> n;

int sum = 0;

for (int i=1; i<=n ; i++)

for (int j=1; j<=i ; j++)

for (int k=1; k<=j ; k++)

{

cout<<” \n UOH”;

}

}

Asymptotic running time of the segment is

How many times "UoH" will be printed for the value of n:8 for the c++ code of question number 66

The relationship between time slice of a round-robin scheduler and the context switch time is as follows

In an operating system, a process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is :

An operating system supports multi-threading system. In Many to Many model when a thread performs a blocking system call :

Consider a disk where blocks 2,3,4,5,8,9,10,11,12,13,17,18,25,26 and 27 are free and the rest of the blocks are allocated. If the block numbering starts from 0, then the free space bitmap would be :

A system with 5 processes P0 through P4 and three resource types A, B, C has A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the following snapshot of a

Process(P0, P1, P2, P3, P4)

Allocation (process-wise: P0 through P4 top to bottom)

A B C

0 1 0

2 0 0

3 0 2

2 1 1

0 0 2

Max (process-wise: P0 through P4 top to bottom)

A B C

7 5 3

3 2 2

9 0 2

2 2 2

4 3 3

Available

A B C

3 3 2

The sequence leads the system to:

A disadvantage of an inverted page table as compared to a normal page table is

In how many ways can nine students be partitioned into three teams containing four, three and two students respectively

A connected planar graph with 15 vertices divides the plane into 12 regions. How many edges does the graph have