Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1,...,Ok}. This is done in the following manner:

**Step 1**. T acquires exclusive locks to O1, . . . , Ok in increasing order of their addresses.

**Step 2**. The required operations are performed.

**Step 3**. All locks are released. This protocol will

- a)guarantee serializability and deadlock-freedom
- b)guarantee neither serializability nor deadlock-freedom
- c)guarantee serializability but not deadlock-freedom
- d)guarantee deadlock-freedom but not serializability

Correct answer is option 'A'. Can you explain this answer?

SHAGUN RAJENDER answered • 3 hours ago

The above scenario is Conservative 2PL(or Static 2PL). In Conservative 2PL protocol, a transaction has to lock all the items it access before the transaction begins execution. It is used to **avoid deadlocks**. Also, 2PL is conflict serializable, therefore it **guarantees serializability.** **Therefore option A** **Advantages of Conservative 2PL :**

- No possibility of deadlock.
- Ensure serializability.

- Less throughput and resource utilisation because it holds the resources before the transaction begins execution.
- Starvation is possible since no restriction on unlock operation.
- 2pl is a deadlock free protocol but it is difficult to use in practice.

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

- a)8, _, _, _, _, _, 10
- b)1, 8, 10, _, _, _, 3
- c)1, _, _, _, _, _,3
- d)1, 10, 8, _, _, _, 3

Correct answer is option 'B'. Can you explain this answer?

SUMAN KUMARI answered • 14 hours ago

Let us put values 1, 3, 8, 10 in the hash of size 7. Initially, hash table is empty

The value of function (3x + 4)mod 7 for 1 is 0, so let us put the value at 0

The value of function (3x + 4)mod 7 for 3 is 6, so let us put the value at 6

The value of function (3x + 4)mod 7 for 8 is 0, but 0 is already occupied, let us put the value(8) at next available space(1)

The value of function (3x + 4)mod 7 for 10 is 6, but 6 is already occupied, let us put the value(10) at next available space(2)

In programming languages like C, C++, Python . . . the memory used by a program is typically separated into two parts, the stack and the heap.

Consider the following statements:

1. A stack is efficient for managing nested function calls.

2. Stack space is limited while heap space is not.

3. The stack cannot be used for persistent data structures.

- a)1 and 2 are true but 3 is false.
- b)1 and 3 are true but 2 is false.
- c)2 and 3 are true but 1 is false.
- d)All three statements are true.

Correct answer is option 'B'. Can you explain this answer?

VIJAY KUMARI answered • 14 hours ago

Because Size of heap and stack both are limited. There is nothing which is unlimited. Yes but Size of stack and Size of heap is constant. It means that If there is total size available is 10, and If i used 7 block for stack then i can only use 3 block for heap but not more than that. i.e Size of stack and size of heap are inversely proportional. I mean that if size of stack increases then size of heap decreases, and vice versa.

What will be the output of the following C program?

- a)3 1 2 2 1 3 4 4 4
- b)3 1 2 1 1 1 2 2 2
- c)3 1 2 2 1 3 4
- d)3 1 2 1 1 1 2

Correct answer is option 'A'. Can you explain this answer?

SAVITA THAKUR answered • 14 hours ago

count(3) will print value of n and d. So 3 1 will be printed and d will become 2.

Then count(2) will be called. It will print value of n and d.

So 2 2 will be printed and d will become 3.

Then count(1) will be called. It will print value of n and d.

So 1 3 will be printed and d will become 4.

Now count(1) will print value of d which is 4. count(1) will finish its execution.

Then count(2) will print value of d which is 4.

Similarly, count(3) will print value of d which is 4.

So series will be A.

Then count(2) will be called. It will print value of n and d.

So 2 2 will be printed and d will become 3.

Then count(1) will be called. It will print value of n and d.

So 1 3 will be printed and d will become 4.

Now count(1) will print value of d which is 4. count(1) will finish its execution.

Then count(2) will print value of d which is 4.

Similarly, count(3) will print value of d which is 4.

So series will be A.

The Hello protocol sends periodic updates to ensure that a neighbor relationship is maintained between adjacent routers.

- a)True
- b)False

Correct answer is option 'A'. Can you explain this answer?

NIVEDITA JAGDISH answered • 14 hours ago

Answer: a

Explanation: The Hello protocol sends periodic updates to ensure that a neighbor relationship is maintained between adjacent routers.

Explanation: The Hello protocol sends periodic updates to ensure that a neighbor relationship is maintained between adjacent routers.

The following sequence of operations is performed on a stack,

PUSH(10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH(20), POP

The sequence of values popped out is

PUSH(10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH(20), POP

The sequence of values popped out is

- a)10, 10, 20, 10, 20
- b)20, 20, 10, 10, 20
- c)10, 20, 20, 10, 20
- d)20, 20, 10, 20, 10

Correct answer is option 'B'. Can you explain this answer?

HIMANI SHIV answered • 14 hours ago

Consider the following control circuit which contains a 3-bit register and a black box with some combinational logic

The initial state of the circuit is Q_{1} Q_{2} Q_{3} = 000.

The circuit generates the control sequence.

(010) → ( 110) → ( 001) →(001) → . . . → ( 001)

On successive clock cycles. Which of the following sets of equations are implemented by the combinational logic in the black box?

The initial state of the circuit is Q

The circuit generates the control sequence.

(010) → ( 110) → ( 001) →(001) → . . . → ( 001)

On successive clock cycles. Which of the following sets of equations are implemented by the combinational logic in the black box?

- a)
- b)
- c)
- d)

Correct answer is option 'C'. Can you explain this answer?

POOJA DEVI answered • 14 hours ago

Hemant Gaikwad asked • 24 minutes ago

Given the relations

employee (name, salary, deptno) and department (deptno, deptname, address)

- a)Department address of every employee
- b)Employees whose name is the same as their department name
- c)The sum of all employees’ salaries
- d)All employees of a given department

Correct answer is option 'C'. Can you explain this answer?

r_{1} = {b* ab* ab* ab*)*, r_{2 =} (b* ab* ab*)*. What is L(r_{1}) ∩ L(r_{2})?

- a)[(b* ab* ab* ab*)*]
- b)[(b* ab* ab*)*]
- c)[(if ab* a b*)
^{6}] - d)[(b* ab* ab* ab* ab* ab* ab*)*]

Correct answer is option 'D'. Can you explain this answer?

PRIYANKA KUMARI answered • 14 hours ago

r

r

An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, … , dn respectively. Which of the following 6-tuples is NOT graphic?

- a)(1, 1, 1, 1, 1, 1)
- b)(2, 2, 2, 2, 2, 2)
- c)(3, 3, 3, 1, 0, 0)
- d)(3, 2, 1, 1, 1, 0)

Correct answer is option 'C'. Can you explain this answer?

SEEMA DEVI answered • 14 hours ago

The required graph is not possible with the given degree set of (3, 3, 3, 1, 0, 0). Using this 6-tuple the graph formed will be a Disjoint undirected graph, where the two vertices of the graph should not be connected to any other vertex ( i.e. degree will be 0 for both the vertices ) of the graph. And for the remaining 4 vertices the graph need to satisfy the degrees of (3, 3, 3, 1).

Let's see this with the help of a logical structure of the graph :

Let's say vertices labelled as <ABCDEF> should have their degree as <3, 3, 3, 1, 0, 0> respectively.

Now E and F should not be connected to any vertex in the graph. And A, B, C and D should have their degree as <3, 3, 3, 1> respectively. Now to fulfill the requirement of A, B and C, the node D will never be able to get its degree as 1. It's degree will also become as 3. This is shown in the above diagram.

Hence tuple <3, 3, 3, 1, 0, 0> is not graphic.

The reference polynomial used in a CRC scheme is x^{4} + x^{3} + 1. A data sequence 1010101010 is to be sent, Determine the actual bit string that is transmitted.

- a)10101010100011
- b)10101010101110
- c)10101010100110
- d)10101010100010

Correct answer is option 'D'. Can you explain this answer?

MONIKA SOM answered • 14 hours ago

Reference polynomial x^{4} + r^{3} + 1 =11001

Datasequence = 1010101010

On dividing 1010101010 by 11001,

We get CRC (i.e. remainder) = 0010

On appending this CRC on data sequence, we get the actual message transmitted i.e. 10101010100010.

Datasequence = 1010101010

On dividing 1010101010 by 11001,

We get CRC (i.e. remainder) = 0010

On appending this CRC on data sequence, we get the actual message transmitted i.e. 10101010100010.

Ambati Rajendra asked • 1 hour ago

How is a privilege exception dealt with?

- a)The program is alted and the system switches into supervisor mode and restarts the program execution
- b)The Program is stopped and removed from the queue
- c)The system switches the mode and starts the execution of a new process
- d)The system switches mode and runs the debugger

Correct answer is option 'A'. Can you explain this answer?

Four page frames and page references in the order 0 2 1 3 2 1 0 1 2 1

By using LRU page replacement algorithm the least recently used page will be

By using LRU page replacement algorithm the least recently used page will be

- a)0
- b)1
- c)2 .
- d)3

Correct answer is option 'D'. Can you explain this answer?

SIDDHARTH VARMA answered • 14 hours ago

For the sequence 0, 2, 1, 3, 2, 1, 0, 1, 2, 1

EIGRP send the hello message after every ___________ seconds

- a)5 seconds (LAN), 60 seconds (WAN)
- b)5 seconds (LAN), 5 seconds (WAN)
- c)15s
- d)180s

Correct answer is option 'A'. Can you explain this answer?

VIVEK KUMAR answered • yesterday

Answer: a

Explanation: EIGRP send the hello message after every5 seconds (LAN), 60 seconds (WAN).

Explanation: EIGRP send the hello message after every5 seconds (LAN), 60 seconds (WAN).

1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4...... In the above sequence what is the number of the position 2888 of the sequence

- a)1
- b)4
- c)3
- d)2

Correct answer is option 'C'. Can you explain this answer?

HARSH SINGH answered • yesterday

First if we count 1223334444. they are 10

In the next term they are 20

Next they are 30 and so on

So Using n(n+1)2×10≤2888

For n = 23 we get LHS as 2760. Remaining terms 128.

Now in the 24th term, we have 24 1's, and next 48 terms are 2's. So next 72 terms are 3's.

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?

I. 7, 6, 5, 4, 4, 3, 2, 1

II. 6, 6, 6, 6, 3, 3, 2, 2

III. 7, 6, 6, 4, 4, 3, 2, 2

IV. 8, 7, 7, 6, 4, 2, 1, 1

II. 6, 6, 6, 6, 3, 3, 2, 2

III. 7, 6, 6, 4, 4, 3, 2, 2

IV. 8, 7, 7, 6, 4, 2, 1, 1

- a)I and II
- b)III and IV
- c)IV only
- d)II and IV

Correct answer is option 'D'. Can you explain this answer?

RAJAT KUMAR answered • yesterday

A generic algorithm or method to solve this question is 1: procedure isV alidDegreeSequence(L) 2: for n in list L do 3: if L doesn’t have n elements next to the current one then return false 4: decrement next n elements of the list by 1 5: arrange it back as a degree sequence, i.e. in descending order 6: if any element of the list becomes negative then return false 7: return true Rationale behind this method comes from the properties of simple graph. Enumerating the f alse returns, 1) if L doesn’t have enough elements after the current one or 2) if any element of the list becomes negative, then it means that there aren’t enough nodes to accommodate edges in a simple graph fashion, which will lead to violation of either of the two conditions of the simple graph (no self-loops and no multiple-edges between two nodes), if not others.

... more1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4...... In the above sequence what is the number of the position 2888 of the sequence

- a)1
- b)4
- c)3
- d)2

Correct answer is option 'C'. Can you explain this answer?

ARYAN CHATURVEDI answered • yesterday

First if we count 1223334444. they are 10

In the next term they are 20

Next they are 30 and so on

So Using n(n+1)2×10≤2888

For n = 23 we get LHS as 2760. Remaining terms 128.

Now in the 24th term, we have 24 1's, and next 48 terms are 2's. So next 72 terms are 3's.

Which multicast address does the OSPF Hello protocol use?

- a)224.0.0.5
- b)224.0.0.6
- c)224.0.0.7
- d)224.0.0.8

Correct answer is option 'A'. Can you explain this answer?

PRANJAL GUPTA answered • yesterday

Answer: a

Explanation: 224.0.0.5 is the multicast address does the OSPF Hello protocol use.

Explanation: 224.0.0.5 is the multicast address does the OSPF Hello protocol use.

If a DFA is represented by the following transition table, then how many states does the corresponding minimal DFA contains?

- a)2
- b)3
- c)4
- d)5

Correct answer is option 'C'. Can you explain this answer?

ADITYA ANMOL answered • yesterday

Drawing the DFA corresponding to the given transition table:

Use DFA minimization algorithm

The corresponding minimum state DFA for this language can be constructed as

Only 4 states are needed.

Use DFA minimization algorithm

The corresponding minimum state DFA for this language can be constructed as

Only 4 states are needed.

Linked lists are not suitable for implementing

- a)insertion sort
- b)Binary search
- c)Radix sort .
- d)Polynomial manipulation

Correct answer is option 'B'. Can you explain this answer?

ANMOL BANSAL answered • yesterday

In case of using link list, one cannot randomly access the data or only serial data access is there. But, in case of binary search one needs to jump randomly either to first half or other half, which is not possible with linked list.

Rasazna Kls asked • 10 hours ago

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.

- a)Array
- b)Linked List
- c)Heap Data Structures like Binary Heap, Fibonacci Heap
- d)None of the above

Correct answer is option 'C'. Can you explain this answer?

The postfix expression for the infix expression: A + B* (C + D) / F + D * E is:

- a)AB + CD + *F / D + E*
- b)ABCD + *F / + DE* +
- c)A*B+ CD ? F*DE ++
- d)F*DE ++

Correct answer is option 'B'. Can you explain this answer?

ASHISH RANJAN answered • yesterday

Infix: A + B *(C + D)/ F + D *E

Postfix: ABCD + *F/ + DE* +

Postfix: ABCD + *F/ + DE* +

The smallest element of an array’s index is called its

- a)Lower bound
- b)Upper bound
- c)Range
- d)Extraction

Correct answer is option 'A'. Can you explain this answer?

ADITYA DATTATRAY answered • yesterday

Smallest element of an array’s index is called its LOWER BOUND and largest array index is called its UPPER bound.

Which language does the following PDA accept and b is given by

- a)
- b)
- c)
- d)

Correct answer is option 'D'. Can you explain this answer?

ANKIT SINGH answered • yesterday

So, strain at least contain 011, push 0, skip 1

Level order traversal of a rooted tree can be done by starting from the root and performing

- a)Preorder traversal
- b)Inorder traversal
- c)Depth first search
- d)Breadth first search

Correct answer is option 'D'. Can you explain this answer?

AYUSH ASWAL answered • yesterday

Level order traversal of rooted tree can be done by starting from root and visiting all node at k level before visiting any node at k + 1 level, which is nothing but breadth first search.

Sai Kumar asked • 13 hours ago

Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.

- a)Worst case time complexity of both algorithms is same.
- b)Worst case time complexity of Kruskal is better than Prim
- c)Worst case time complexity of Prim is better than Kruskal

Correct answer is option 'A'. Can you explain this answer?

Semaphores are used to solve the problem of

1. Race condition

2. Process synchronization

3. Mutual exclusion

1. Race condition

2. Process synchronization

3. Mutual exclusion

- a)1 and 2
- b)2 and 3
- c)All of the above
- d)None of the above

Correct answer is option 'B'. Can you explain this answer?

DEEPAK JAIN answered • yesterday

Semaphores are used in deadlock avoidance by using them during interprocess communication. It is used to solve the problem of synchronisation among processes.

Pre-emptive scheduling, is the strategy of temporarily suspending a running process

- a)Before the CPU time slice expires
- b)To allow starving processes to run
- c)When it requests I/O
- d)None of these

Correct answer is option 'A'. Can you explain this answer?

AARAV KUMAR answered • yesterday

In pre-emptive scheduling suspanding temporarily a running process is done before the CPU time slice expires.

The NAND can function as a NOT gate if

- a)Inputs are connected together
- b)Inputs are left open
- c)One input is set to 0
- d)One input is set to 1

Correct answer is option 'A'. Can you explain this answer?

PRATYUSH SAHU answered • yesterday

NAND gate work as NOT if inputs are connected together i.e.

Spatial locality refers to the property that once a location is referenced

- a)It will not be referenced again
- b)It will be referenced again
- c)A nearby location will be referenced soon
- d)None of the above

Correct answer is option 'C'. Can you explain this answer?

JAGDEEP KUMAR answered • yesterday

Spatial locality of reference says that once a location is referenced then there is a high probability that a nearby location will be referenced soon.

Suppose the elements 7, 2, 10 and 4 are inserted, in that order, into the valid 3- ary max heap found in the above question, Which one of the following is the sequence of items in the array representing the resultant heap?

- a)10, 7, 9, 8, 3, 1, 5, 2, 6, 4
- b)10, 9, 8, 7, 6, 5, 4, 3, 2, 1
- c)10, 9, 4, 5, 7, 6, 8, 2, 1, 3
- d)10, 8, 6, 9, 7, 2, 3, 4, 1, 5

Correct answer is option 'A'. Can you explain this answer?

MRITYUNJAY KUMAR answered • yesterday

After insertion of 7

After insertion of 2

After insertion of 10

After insertion of 4

If for non-zero x, where a

- a)
- b)
- c)
- d)

Correct answer is option 'A'. Can you explain this answer?

SMIT LOKHANDWALA answered • yesterday

Integrating both sides,

(2) and (3) by multiplying (2) by and (3) by and subtracting

If L_{1}, is regular and L_{2} is CFL over ∑* which of the following statement is incorrect?

- a)L
_{1}∪ L_{2}is CFL - b)L
_{1}∩ L_{2}is regular - c)L
_{1}* is regular - d)None of these

Correct answer is option 'B'. Can you explain this answer?

TEJASVI PALIYA answered • yesterday

Since L_{1} and L_{2} are regular and context free languages respectively CFL are closed under regular ∪, ∩, therefore

(a) L_{1} ∪ L_{2} is CFL and therefore regular too.

(b) L_{1} ∩ L_{2} is not regular

(c) L_{1} * is regular

(a) L

(b) L

(c) L

Madhu Arasi asked • 19 hours ago

Which of the following statements about relative addressing mode is FALSE?

A. It enables reduced instruction size

B. It allows indexing of array element with same instruction

C. It enables easy relocation of data

D. It enables faster address calculation than absolute addressing

A. It enables reduced instruction size

B. It allows indexing of array element with same instruction

C. It enables easy relocation of data

D. It enables faster address calculation than absolute addressing

- a)A
- b)B
- c)C
- d)D

Correct answer is option 'D'. Can you explain this answer?

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91,3, 8, 37,60, 24. The number of nodes in the left subtree and right subtree of the root respectively is

- a)(4,7)
- b)(7,4)
- c)(8, 3)
- d)(3,8)

Correct answer is option 'B'. Can you explain this answer?

ATUL SINGH answered • yesterday

The binary search tree is as follows:

The number of nodes in the left subtree and right subtree of the root respectively is (7, 4).

Sparse matrices have

- a)Many zero entries
- b)Many non-zero entries
- c)Higher dimension
- d)None of the above

Correct answer is option 'A'. Can you explain this answer?

HEMANT KUMAR answered • 2 days ago

Sparse matrices are those matrices in which most of the elements are zero.

In contrast, if most of the elements are non-zero then the matrix is considered DENSE.

In contrast, if most of the elements are non-zero then the matrix is considered DENSE.

The time complexity of the following C function is, (assume n> 0)

int recursive (int n )

{ if ( n = = 1)

return (1);

else

return (recursive ( n - 1) + recursive ( n - 1));

}

int recursive (int n )

{ if ( n = = 1)

return (1);

else

return (recursive ( n - 1) + recursive ( n - 1));

}

- a)O(n)
- b)O(n log n)
- c)0(n
^{2}) - d)O(2
^{n})

Correct answer is option 'D'. Can you explain this answer?

UTSAV KUMAR answered • 2 days ago

T(n) = T ( n - 1) + T ( n - 1)+1

[recursive (n - 1) = T( n - 1)]

= 2T( n - 1)+1 = O(2^{n} [using substitution method]

[recursive (n - 1) = T( n - 1)]

= 2T( n - 1)+1 = O(2

Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order:

5, 28, 19, 15, 20, 33, 12, 17, 10

The maximum, minimum, and average chain lengths in the hash table, respectively, are

5, 28, 19, 15, 20, 33, 12, 17, 10

The maximum, minimum, and average chain lengths in the hash table, respectively, are

- a)3, 0, and 1
- b)3, 3, and 3
- c)4, 0, and 1
- d)3, 0, and 2

Correct answer is option 'A'. Can you explain this answer?

RAHUL MISHRA answered • 2 days ago

Satish Gaikwad asked • yesterday

Consider the following pseudo code. What is the total number of multiplications to be performed?

- a)Half of the product of the 3 consecutive integers.
- b)One-third of the product of the 3 consecutive integers.
- c)One-sixth of the product of the 3 consecutive integers.
- d)None of the above.

Correct answer is option 'C'. Can you explain this answer?

Critical region is

- a)A part of the operating system which is not allowed to be accessed by any process.
- b)A set of instructions that access common shared resource which exclude one another in time.
- c)The portion of the main memory which can be accessed only by one process at a time.
- d)None of these

Correct answer is option 'B'. Can you explain this answer?

SAMBHAV SHRIVASTAVA answered • 2 days ago

Critical region is a set of instructions that access common shared resource which exclude one another in time. Critical region is primarily centred on the usage of global shared resources (or variables) among the processes.

Supervisor call

- a)Is a call made by the supervisor of the system.
- b)Is a call with control functions.
- c)Are privileged calls that are used to perform resource management functions, which are controlled by the operating system.
- d)Is a call made by someone working in root directory.

Correct answer is option 'C'. Can you explain this answer?

V K answered • 2 days ago

In computers, especially IBM mainframes, a supervisor call (SVC) is a processor instruction that directs the processor to pass control of the computer to the operating systems supervisor program.

Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. Then the relational algebra expression is always equal to

- a)σ
_{A = a }(r) - b)r
- c)
- d)None of these

Correct answer is option 'C'. Can you explain this answer?

SHIVAM KUMAR answered • 2 days ago

The relational algebra expression:

Hence (c) is the required option.

Hence (c) is the required option.

A-2-3-tree is a tree such that

1. All internal nodes have either 2 or 3 children.

2. All paths from root to the leaves have the same length

The minimum number of internal nodes of a 2-3 tree having 9 leaves could be

1. All internal nodes have either 2 or 3 children.

2. All paths from root to the leaves have the same length

The minimum number of internal nodes of a 2-3 tree having 9 leaves could be

- a)4
- b)5
- c)6
- d)7

Correct answer is option 'A'. Can you explain this answer?

ABHISHEK KUMAR answered • 2 days ago

As all the leaves are on same level. So, to have the maximum number of internal nodes for 9 leaves our tree should be like as follows:

Which of the following schemes are used for ensuring atomicity?

- a)Log with deferred modification
- b)Log with immediate modification
- c)Shadow paging
- d)All of the above

Correct answer is option 'D'. Can you explain this answer?

BISHWEASHWAR SUKLA answered • 2 days ago

Following ensure atomicity:

• Log with deferred and immediate modification.

• Shadow paging.

• Log with deferred and immediate modification.

• Shadow paging.

At a particular time of ocmputation the value of a counting semaphore is 7. Then 20 P operations and 15 V operation were completed on this semaphore. The resulting value of the semaphore is

- a)42
- b)2
- c)7
- d)12

Correct answer is option 'B'. Can you explain this answer?

RITWIK SAINI answered • 2 days ago

Number of wait process = 20 i.e. decrement Number of signal process = 15 i.e. increment Therefore value of semaphore at the end of program execution

= Initial value - Number of P(C) + Number of V(C)

= 7 - 20 + 15 = 2

= Initial value - Number of P(C) + Number of V(C)

= 7 - 20 + 15 = 2

Which statement is false?

- a)PING is a TCP/IP application that sends datagrams once every second in the hope of an echo response from the machine being PINGED.
- b)If the machine is connected and running a TCP/IP protocol stack, it should respond to the PING datagram with a datagram of its own.
- c)If PING encounters an error condition, an ICMP message is not returned.
- d)PING displays the time of the return response in milliseconds or one of several error message.

Correct answer is option 'C'. Can you explain this answer?

MOHD FUZAIL answered • 2 days ago

PING is a command which is used to check the particular port is working or not by sending echo frame and receiving echo response in specified time.

In question number 25, if the number of available page frames is increased to 4 then the number of page transfer

- a)Decreases
- b)Increases
- c)Remains the same
- d)None of the above

Correct answer is option 'B'. Can you explain this answer?

VISHNU M answered • 2 days ago

We find the required number of page transfer is 10. So, increasing the number of pages need not necessarily reduce the number of page faults. It is the actual sequences of references that decides.

The word length of a CPU is defined as

- a)The maximum addressable memory size.
- b)The width of a CPU register (integer or float point).
- c)The width of the address bus.
- d)The number of general purpose CPU registers.

Correct answer is option 'B'. Can you explain this answer?

ADITYA NIGAM answered • 2 days ago

The word length of processor is defined as the width of a CPU registers i.e. at a time number of instruction process by the processor.

If half adders and full adders are implemented using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be

- a)0,17
- b)16,1
- c)1 , 1 6
- d)8 , 8

Correct answer is option 'C'. Can you explain this answer?

AKSHAZ SOOD answered • 2 days ago

As we know that n bit full adder circuit can represent (n + 1) bits sum. In order to represent addition of two 17 bits numbers we require minimum of 16 full adder and 1 half adder.

Note: For the first bit we can use either HA or FA. Hence, for addition of two 17 bit numbers inspire of 17 full adders we can perform the same task using 16 FA and 1 HA.

Hence (c) is the correct option.

Note: For the first bit we can use either HA or FA. Hence, for addition of two 17 bit numbers inspire of 17 full adders we can perform the same task using 16 FA and 1 HA.

Hence (c) is the correct option.

The following bit pattern represents a floating point number in IEEE 754 single precision format:

The value of the number in decimal form is

The value of the number in decimal form is

- a)- 10
- b)- 13
- c)- 26
- d)None of these

Correct answer is option 'C'. Can you explain this answer?

SHUBHAM VINAY answered • 2 days ago

Sign bit is 1 implies number is negative. Exponent bits: 10000011 Exponent is added with 127 bias in IEEE single precision format.

So, Actual exponent

= 10000011 - 127

= 131 - 127 = 4

Mantissa bits: 101000000000000000000000

In IEEE format, an implied 1 is before mantissa.

Hence the Number is -1.101*2^{4}

= - (11010)_{2} = - 26

So, Actual exponent

= 10000011 - 127

= 131 - 127 = 4

Mantissa bits: 101000000000000000000000

In IEEE format, an implied 1 is before mantissa.

Hence the Number is -1.101*2

= - (11010)

Navya Nalamasa asked • yesterday

- a)A serializable schedule
- b)A schedule that is not conflict serializable
- c)A conflict serializable schedule
- d)A schedule for which a precedence graph cannot be drawn

Correct answer is option 'B'. Can you explain this answer?

The main function of shared memory is to

- a)Use primary memory efficiently
- b)Do intra process communication
- c)Do inter process communication
- d)None of these

Correct answer is option 'C'. Can you explain this answer?

ROHIT KUMAR answered • 2 days ago

Shared memory is that memory that can be simultaneously accessed by multiple programs with an intent to provide communication among them or to avoid redundant copies. Shared memory is a way of interchanging data between programs.

Page fault occurs when

- a)The page is corrupted by application software
- b)The page is in main memory
- c)The page is not in main memory
- d)The tries to divide a number by 0

Correct answer is option 'C'. Can you explain this answer?

LUIS ALDRIGE answered • 2 days ago

Page fault occurs when required page that is to be needed is not found in the main memory. When the page is found in the main memory it is called page hit, otherwise miss.

Overlay is

- a)A part of an operating system
- b)A specific memory location
- c)A single contiguous memory that was used in the olden days for running large programs by swapping
- d)Overloading the system with many user files

Correct answer is option 'C'. Can you explain this answer?

JYOTI RAJ answered • 2 days ago

Overlay means “the process of transfers a block of program code or other data into internal memory, replacing what is already stored". Overlaying is a programming method that allows programs to be large than the computer’s main memory.

Gaurav Kumar asked • yesterday

An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?

- a)Graph G has no minimum spanning tree (MST)
- b)Graph G has a unique MST of cost n-1
- c)Graph G has multiple distinct MSTs, each of cost n-1
- d)Graph G has multiple spanning trees of different costs

Correct answer is option 'C'. Can you explain this answer?

- a)K4 is planar while Q3 is not
- b)Both K4 and Q3 are planar
- c)Q3 is planar while K4 is not
- d)Neither K4 nor Q3 are planar

Correct answer is option 'B'. Can you explain this answer?

SANKHA SUVRA answered • 2 days ago

A Graph is said to be planar if it can be drawn in a plane without any edges crossing each other. Following are planar embedding of the given two graph

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?

- a)1
- b)2
- c)3 or 4
- d)5 or 6

Correct answer is option 'B'. Can you explain this answer?

PIYUSH THAKUR answered • 2 days ago

In Heapsort, we first build a heap, then we do following operations till the heap size becomes 1. a) Swap the root with last element b) Call heapify for root c) reduce the heap size by 1. In this question, it is given that heapify has been called few times and we see that last two elements in given array are the 2 maximum elements in array. So situation is clear, it is maxheapify whic has been called 2 times.

Tarun Patial asked • yesterday

Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is

In the following answers, the operator '^' indicates power.

In the following answers, the operator '^' indicates power.

- a)2^(i-1)
- b)2^i
- c)2^(i+1)
- d)2^[(i+1)/2]

Correct answer is option 'A'. Can you explain this answer?

Javed Ahmad asked • yesterday

Which of the following is not true about comparison based sorting algorithms?

- a)The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
- b)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
- c)Counting Sort is not a comparison based sorting algortihm
- d)Heap Sort is not a comparison based sorting algorithm

Correct answer is option 'D'. Can you explain this answer?

SUBHADIP KHAWAS asked • yesterday

If the coefficient matrix is C_{n×n} and its corresponding rank is *c* also the augmented matrix is A_{n×(n+1)} and its corresponding rank is *a, *then how many statements given below are incorrect?

I. If *c ≠ a*, the equations are inconsistent with an infinite number of solutions.

II. If *c* = *a < n*, the equations are inconsistent

III. If *c* = *a =n*, equation may be inconsistent.

Correct answer is '3'. Can you explain this answer?

Damayanti Daule asked • yesterday

Which one of the following is FALSE?

- a)A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.
- b)Available expression analysis can be used for common subexpression elimination.
- c)Live variable analysis can be used for dead code elimination.
- d)x = 4 ∗ 5 ⇒ x = 20 is an example of common subexpression elimination.

Correct answer is option 'D'. Can you explain this answer?

Virat Kohli asked • yesterday

Which of the following is true about merge sort?

- a)Merge Sort works better than quick sort if data is accessed from slow sequential memory.
- b)Merge Sort is stable sort by nature
- c)Merge sort outperforms heap sort in most of the practical situations.
- d)All of the above.

Correct answer is option 'D'. Can you explain this answer?

Fetching relevant content for you

Ask a question