In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by

- a)Dijkstra’s algorithm starting from S.
- b)Warshall’s algorithm
- c)Performing a DFS starting from S.
- d)Performing a BFS starting from S.

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

ARCHIT GUPTA answered • 1 hour ago

* Time Comlexity of the Dijkstra’s algorithm is O(|V|^2 + E)

* Time Comlexity of the Warshall’s algorithm is O(|V|^3) *

DFS cannot be used for finding shortest paths

* BFS can be used for unweighted graphs. Time Complexity for BFS is O(|E| + |V|)

* Time Comlexity of the Warshall’s algorithm is O(|V|^3) *

DFS cannot be used for finding shortest paths

* BFS can be used for unweighted graphs. Time Complexity for BFS is O(|E| + |V|)

Consider the sequence S_{0},S_{1},S_{2},.... defined as follows: S_{0} = 0, S_{1} = 1 and S_{n} = 2S_{n-1} + S_{n-2} for n __>__ 2. Which of the following statements is FALSE?

- a)for every n
__>__1, S_{2n}is even - b)for every n
__>__1, S_{2n+1}is odd - c)for every n
__>__1, S_{3n}is multiple of 3 - d)for every n
__>__1, S_{4n}is multiple of 6 - e)none of the above

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

G AMSHUMAAN answered • 1 hour ago

S_{n} = 2S_{n−1} + S_{n−2}

Characterstic polynomial for this recurrence is x^{2} = 2x + 1

x^{2} − 2x − 1 = 0

The solution to the recurrence relation is of the form :

The solution to the recurrence relation is of the form :

Sai Kumar asked • 16 minutes 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?

- a)32
- b)50
- c)52
- d)100
- e)None of the above

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

ARNAB SAHA answered • 1 hour ago

x>=4 and y>=4 , So we can take both x =5 & y = 5

x+y >= 10 => Satisfied , 5+5 = 10

2x + 3y >= 20. Satisfied.

This is infact minimum value.

Other options =>

4,4 => x+y constraint fail

4,5 => x+y fail

6,4 => Still giving 52 as sum which is more than 50 !, This can not be answer.

7,3 => 49+9 > 58 > 50.

x+y >= 10 => Satisfied , 5+5 = 10

2x + 3y >= 20. Satisfied.

This is infact minimum value.

Other options =>

4,4 => x+y constraint fail

4,5 => x+y fail

6,4 => Still giving 52 as sum which is more than 50 !, This can not be answer.

7,3 => 49+9 > 58 > 50.

In questions 2.1 to 2.10 below, each blank (___) is to be suitably filled in.

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

YAGYESH SHARMA answered • 1 hour ago

Use LH rule:

First Derivative: [x(e^{x}) + (e^{x}-1) - 2(sinx)]/[xsinx + (1 - cosx)]

Second Derivative: [xe^{x} + e^{x} + e^{x} - 2cosx]/[{xcosx + sinx + sinx]

Third Derivative: [xe^{x} + e^{x} + e^{x} + e^{x} + 2sinx]/[-xsinx + cosx + cosx + cosx]

Put x = 0: [0+1+1+1+0]/[0+1+1+1] = 3/3 = 1.

First Derivative: [x(e

Second Derivative: [xe

Third Derivative: [xe

Put x = 0: [0+1+1+1+0]/[0+1+1+1] = 3/3 = 1.

If the characteristic polynomial of a (the set of real numbers) is and one eigenvalue of M is 2, then the largest among the absolute values of the eigenvalues of M is _______

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

OMOMKOMKAOMKAROMKAR GUGUPGUPTGUPTE answered • 1 hour ago

Given that λ = 2 is an eigen value. So, it must satisfy characterstic equation.

Context-free languages and regular languages are both closed under the operations(s) of

(i) Union

(ii) Intersection

(iii) Concatenation

(i) Union

(ii) Intersection

(iii) Concatenation

- a)(i) and (ii) only
- b)(ii) and (iii) only
- c)(i) and (iii) only
- d)All of these

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

ARITRA SINHA answered • 1 hour ago

Regular and context free languages are both closed under union and concatenation while only regular is closed under intersection.

Let π_{A } be a problem that belongs to the class NP. Then which one of the following is TRUE?

- a)There is no polynomial time algorithm for π
_{A} - b)If π
_{A}can be solved deterministically in polynomial time, then P = NP - c)If π
_{A}is NP-hard, then it is NP-complete - d)π
_{A}may be undecidable

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

ASHISH RAJ answered • 1 hour ago

it is given that π_{A} ∈ NP

∴ If π_{A} is NP-hard, and since it is given that π_{A} ∈ NP , this means that π_{A} is NP-complete

∴ choice (c) is correct.

Notice that choice (a) is incorrect since as P ∈ NP, some NP problems are actually P and hence polynomial time algorithm can exist for these.

Choice (b) is incorrect since, If π_{A} can be solved deterministicaily in polynomial time, it does not generate that P=NP, unless of-course it is additionally known that π_{A} is NP-complete.

Choice (d) is incorrect since,

All problems belonging to P or NP have to be decidable.

∴ If π

∴ choice (c) is correct.

Notice that choice (a) is incorrect since as P ∈ NP, some NP problems are actually P and hence polynomial time algorithm can exist for these.

Choice (b) is incorrect since, If π

Choice (d) is incorrect since,

All problems belonging to P or NP have to be decidable.

Shweta Sonkar asked • 2 hours ago

Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?

- a)Insertion Sort with time complexity O(kn)
- b)Heap Sort with time complexity O(nLogk)
- c)Quick Sort with time complexity O(kLogk)
- d)Merge Sort with time complexity O(kLogk)

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

Choose the correct statements:

- a)Enum variables can be assigned new values.
- b)Enum variables can be compared.
- c)Use of enumeration enhances the logical clarity of a program, Although it does not increase the power of C.
- d)All of the above

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

AMAN KARAKOTI answered • 1 hour ago

Enum variable type is a special flavor of a long type variable with an enum, we can specify a number of valid values for that variable and descripted constant names for the values of the enum. These values are used instead of constant. Enum variable can be declared. The advantage of enum is it provide logical clarity of a program.

A problem in NP is NP-complete if

- a)It can be reduced to the 3-SAT problem in polynomial time.
- b)The 3-SAT problem can be reduced to it in polynomial time.
- c)It can be reduced to any other problem in NP in polynomial time.
- d)Some problem in NP can be reduced to it in polynomial time.

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

SAMARTH PAUL answered • 1 hour ago

3-SAT being an NPC problem, reducing NP problem to 3-SAT would mean that NP problem is NPC

Algorithm design technique used in quicksort algorithm is

- a)Dynamic programming
- b)Backtracking
- c)Divide and conquer
- d)Greedy method

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

TARUSH TIWARI answered • 1 hour ago

Quick sort algorithm is based on divide an conquer approach.

Since we conquer the array by dividing it one the basis of pivot elements till the sorted array is obtained

Since we conquer the array by dividing it one the basis of pivot elements till the sorted array is obtained

The number of spanning trees for a complete graph with seven vertices is

- a)2
^{5} - b)7
^{5} - c)3
^{5} - d)2
^{2x5}

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

ANANT DEV answered • 12 hours ago

Number of spanning tree possible with n-node = n^{n-2}

Given, n = 7

Total number of spanning trees = 7^{5}

Given, n = 7

Total number of spanning trees = 7

Which of the following is not true?

- a)Any LL grammar is unambiguous.
- b)DCFL’s are never inherently ambiguous.
- c)If G is an LR(k) grammar, then L(G) is a DCFL.
- d)All CFL’s which are not DCFL’s are ambiguous.

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

PRAKHAR AGRAWAL answered • 12 hours ago

• Every LL grammar must be unambiguous but every unambiguous need not be LL grammar.

• Ambiguity in language starts from CFL. So, DCFL cannot be inherently ambiguous.

• if G is an LR(K) grammar, then L{G) is a DCFL.

• Every CFL’s which are not DCFL need not be ambiguous.

• Ambiguity in language starts from CFL. So, DCFL cannot be inherently ambiguous.

• if G is an LR(K) grammar, then L{G) is a DCFL.

• Every CFL’s which are not DCFL need not be ambiguous.

Vishakha Kakde asked • 7 hours ago

After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just

before committing suicide, he came across a spider attempting tirelessly to have its net. Time

and again, the spider failed but that did not deter it to refrain from making attempts. Such

attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible

goal of the spider to have the net. Ultimately, the spider succeeded in having its

net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.

And then, Bruce went back again and won many a battle, and the rest is history.

before committing suicide, he came across a spider attempting tirelessly to have its net. Time

and again, the spider failed but that did not deter it to refrain from making attempts. Such

attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible

goal of the spider to have the net. Ultimately, the spider succeeded in having its

net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.

And then, Bruce went back again and won many a battle, and the rest is history.

Which one of the following assertions is best supported by the above information?

- a)Failure is the pillar of success
- b)Honesty is the best policy
- c)Life begins and ends with adventures
- d)No adversity justifies giving up hope

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

Consider the following set of languages:

Which of the above language is not context free?

Which of the above language is not context free?

- a)L
_{1}and L_{3} - b)L
_{2}and L_{3} - c)L
_{1}and L_{2} - d)All L
_{1}, L_{2}and L_{3}.

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

DILPREET SINGH answered • 12 hours ago

In L

Hence it is not CFL.

L

⇒ Number of a’s = number of b’s and number of c’s. This cannot be done by single stack

L

⇒ Number of a’s = number of b’s and number of c’s = number of d/’s. This can be done in single stack.

Gireesha Gogula asked • 8 hours ago

Given the basic ER and relational models, which of the following is INCORRECT?

- a)An attribute of an entity can have more than one value
- b)An attribute of an entity can be composite
- c)In a row of a relational table, an attribute can have more than one value
- d)In a row of a relational table, an attribute can have exactly one value or a NULL value

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

Ambati Rajendra asked • 9 hours 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?

Let m, n be positive integers. Define Q(m, n) as

Then Q(m, 3) is (a div b, gives the quotient when a is divided by b)

- a)a constant
- b)p x (m mod 3)
- c)p x ( m div 3)
- d)3 x p

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

NISHA KUMARI answered • 12 hours ago

Two cases: Q(m, 3)

(i) m ≥ n : here m ≥ 3

For

∵ Since 3 is divide by 3 only 1 time = 0 + P= P.

So this recursive program generate P, m/n times until m < n.

So, Q(m, 3) = Px(m div 3)

(i) m ≥ n : here m ≥ 3

For

∵ Since 3 is divide by 3 only 1 time = 0 + P= P.

So this recursive program generate P, m/n times until m < n.

So, Q(m, 3) = Px(m div 3)

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm.

List-I (Recursive Algorithm)

P. Binary search

Q. Merge sort

R. Quicksort

S. Tower of Hanoi

List-li (Recurrence Relation)

Which of the following is the correct match between the algorithms and their recurrence relations?

P. Binary search

Q. Merge sort

R. Quicksort

S. Tower of Hanoi

List-li (Recurrence Relation)

Which of the following is the correct match between the algorithms and their recurrence relations?

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

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

MANJULA DHIMAN answered • 12 hours ago

Binary search : T(n) = T(n/2) + 1

Merge sort : T(n) = 2T(n/2) + cn

Quick sort : T(n) = T(n - k) + T(k) + cn

Merge sort : T(n) = 2T(n/2) + cn

Quick sort : T(n) = T(n - k) + T(k) + cn

Tower of Hanoi : T(n) = 2T(n - 1) + 1

In an E-R diagram ellipses represent

- a)Entity sets
- b)Relationship among entity sets
- c)Attributes
- d)Link between attributes and entity sets

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

SUNITA KUMARI answered • 12 hours ago

In a E-R diagram, a rectangle represents entity set, relationship among entity set are represented by diamond box. Attributes are represented by ellipse and the link between attributes and entity set are represented by straight lines.

The Ackermann’s function

- a)Has quadratic time complexity
- b)Has exponential time complexity
- c)Can't be solved iteratively
- d)Has logarithmic time complexit

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

DIVYA SHARMA answered • 12 hours ago

Ackermann’s function has exponential time complexity,

Gaurav Kumar asked • 10 hours ago

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?

The relational algebra expression equivalent to the following expression:

is:

is:

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

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

MONIKA TEMPTA answered • 12 hours ago

The expression

can be represented in relational algebra as

It says that select those rows from relation r where A = 10 union where B = 20.

Hence option (b) is correct.

can be represented in relational algebra as

It says that select those rows from relation r where A = 10 union where B = 20.

Hence option (b) is correct.

Kernel is

- a)Considered as the critical part of the operating system.
- b)The software which monitors the operating system.
- c)The set of primitive functions upon which the rest of operating system functions are built up.
- d)None of the above

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

RANJNA KUMARI answered • 12 hours ago

Kernel is the set of primitive functions upon which the rest of operating system functions are built up.

Prashant Choudhary asked • 14 hours ago

Peterson’s algorithm is the solution of which of the following problem.

- a)Deadlock
- b)Mutual exclusion
- c)Trashing
- d)Paging

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

KAJAL PAWAN answered • yesterday

Peterson's algorithm restricts process entry. It ensures that the concurrent processes will enter alternatively into critical section. So, also solving problem of mutual exclusion.

Damayanti Daule asked • 19 hours ago

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?

Consider the following entity relationship diagram (ERD), where two entities E1 and E2 have a relation R of cardinality 1 : m.

The attributes of E1 are A11, A12 and A13where , A11 is key attribute. The attributes of E2 are A21, A22, and A23 where A21 is the key attribute and A23 is a multi-valued attribute. Relation R does not have any attribute. A relational database containing minimum number of tables with each table satisfying the requirements of the third normal form (3NF) is designed from the above ERD. The number of tables in the database is

The attributes of E1 are A11, A12 and A13where , A11 is key attribute. The attributes of E2 are A21, A22, and A23 where A21 is the key attribute and A23 is a multi-valued attribute. Relation R does not have any attribute. A relational database containing minimum number of tables with each table satisfying the requirements of the third normal form (3NF) is designed from the above ERD. The number of tables in the database is

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

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

KANCHAN BALA answered • yesterday

Since each table is to in 3

1 for entity set E

With the help of which of the following relations operation set we can perform division on relations?

- a){π, x, -}
- b)
- c){x,-}
- d){x}

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

NISHA KUMARI answered • yesterday

With the help of {π, x, -} we can perform division operation.

Note: Division operator produces a relation R(X) that includes all tuples t[x] in R(z) that appear in R in combination with every tuple from R_{2}y) when Z = X ∪ Y.

Note: Division operator produces a relation R(X) that includes all tuples t[x] in R(z) that appear in R in combination with every tuple from R

Which protocol is exterior routing?

- a)BGP
- b)OSPF
- c)RIP
- d)None of these

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

KANIKA OMKAR answered • yesterday

Border Gateway protocol (BGP) is the current exterior gateway routing protocol (EGP).

The default subnet mask for a Class B network can be

- a)255.255.255.0
- b)255.255.0.0
- c)255.255.192.0
- d)255.0.0.0

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

SHILPA VERMA answered • yesterday

If IP address is AND with subnet mask result will network address.

Default subnet mask:

Class A = 255.0.0.0

Class B = 255.255.0.0

Class C = 255.255.255.0

Default subnet mask:

Class A = 255.0.0.0

Class B = 255.255.0.0

Class C = 255.255.255.0

Ayushi Sharma asked • 22 hours ago

Given the following expression grammar:

E -> E * F | F + E | F

F -> F - F | id

which of the following is true?

E -> E * F | F + E | F

F -> F - F | id

which of the following is true?

- a)* has higher precedence than +
- b)– has higher precedence than *
- c)+ and — have same precedence
- d)+ has higher precedence than *

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

Brouter

- a)Is a type of bridge
- b)Works at all the layers Of OS I model
- c)Is able to bridge those protocols that are not routable
- d)None of these

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

PUJA RANI answered • yesterday

Brouter is a device, which is combination of functionality of bridge and router. So, it works till network layer and is able to bridge those protocol that are not routable.

Which of the following error detection method consists of just one redundant bit per data unit?

- a)Checksum
- b)LRC
- c)CRC
- d)VRC

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

MANISHA DEVI answered • yesterday

Vertical redundancy check (VRC), often called a parity check. In this, a redundant bit, called parity bit, is appended to every data unit so that total number of 1 ’s in unit becomes even (including the parity bit).

Prashant Waghwase asked • 23 hours ago

Let q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"

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

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

Microinstruction length is determined by _____.

1. The maximum number of simultaneous micro operations that must be specified.

2. The way in which the control information is represented or encoded.

3. The way in which the next microinstruction address is specified.

1. The maximum number of simultaneous micro operations that must be specified.

2. The way in which the control information is represented or encoded.

3. The way in which the next microinstruction address is specified.

- a)1 and 2
- b)2 and 3
- c)1 and 3
- d)All of these

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

PUNAM GOPAL answered • yesterday

Format of micro instruction:

Which of the following affects processing power?

- a)Data bus capacity
- b)Addressing scheme
- c)Clockspeed
- d)All of these

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

LEKHA DEVI answered • yesterday

Processing power depends on clock speed, data bus capacity and addressing scheme.

NISHANT KUMAR asked • yesterday

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?

Which of the following is not a regular grammars?

- a)S →∈, A→ aS| b
- b)A→ abB |a B
- c)A→ Ba | Bab
- d)A → aB | a, B → Ab | b

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

POOJA DEVI answered • yesterday

Mixup notation of left linear and right linear grammar is not allowed in regular grammar.

ADITYA DATTATRAY asked • yesterday

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?

The gate shown in figure is:

- a)AND gate
- b)NAND gate
- c)NOT gate
- d)OR gate

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

PREETI DALEEP answered • yesterday

Represents the not gate.

Consider the following determinant:

Which of the following is a factor of Δ?

Which of the following is a factor of Δ?

- a)a + b
- b)a - b
- c)a + b + c
- d)abc

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

SHAKUNTLA DEVI answered • yesterday

The determinant of a matrix can’t be affected by elementary row operation

So,

So (a - b) is a factor of Δ.

So,

So (a - b) is a factor of Δ.

Virtual memory is

- a)An extremely large main memory
- b)An extremely large secondary memory
- c)An illusion of an extremely large memory
- d)A type of memory used in super computers

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

KAMLESH THAKUR answered • yesterday

Virtual memory does not exists physically in the memory system, it just gives an illusion of an extremely large memory.

Which of the following page replacement algorithms suffers from Belady’s anomaly?

- a)Shortest job first
- b)Round robin
- c)First-come-first-serve
- d)Elevator

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

KIRAN THAKUR answered • yesterday

There are two types of page replacement algorithm mainly stack based and non-stack based, it is observed that algorithms which follows the latter one suffers from Belady’s anomaly. FIFO suffers from Belady's anomaly.

Cache memory enhances

- a)Memory capacity

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

SUMAN KUMARI answered • yesterday

Cache memory is very small as compared to SM and MM. It stores the data according to principle of locality. As it is on the top most level in the memory hierarchy if data is found in cache the access time is negligible. Hence it enhances effective access time.

Luxmi Devi asked • yesterday

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?

The graph that shows the basic blocks and their successor relationship is called

- a)DAG
- b)Flow graph
- c)Control graph
- d)Hamiltonian graph

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

PUSHAPA KUMARI answered • yesterday

The graph that shows the basic blocks and their successor relationship is called control graph.

The difference between the compound and simple interest on a certain sum for 2 years at the rate of 8% per annum is Rs.80,What is the sum?

- a)11,880
- b)12,500
- c)13,250
- d)14,270

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

BINTA BALA answered • yesterday

Difference in simple and compound interest at the end of 2 years occurs because there is interest on first year interest. So Difference = P×(R100)2P×(R100)2

⇒ 80 = P×(8100)2P×(8100)2

⇒ P=80×(1008)2P=80×(1008)2 = 12,500

⇒ 80 = P×(8100)2P×(8100)2

⇒ P=80×(1008)2P=80×(1008)2 = 12,500

Teja Singh asked • yesterday

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?

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

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

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

CHANDNI DEVI answered • yesterday

Initially heap has 10, 8, 5, 3, 2

After insertion of 1

No need to heapify as 5 is greater than 1.

After insertion of 7

Heapify 5 as 7 is greater than 5

No need to heapify any further as 10 is greater than 7

Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set relations is.

- a)Zero
- b)More than zero but less than that of an equivalent 3NF decomposition
- c)Proportional to the size of F+
- d)Indeterminate

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

PUSHPA KUMARI answered • yesterday

If a relational schema is in BCNF then all redundancy based on functional dependency has been removed, although other types of redundancy may still exist.

Babu Ram asked • yesterday

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?

The information about an array that is used in a program wiil be stored in

- a)Symbol table
- b)Activation record
- c)System table
- d)Dope vector

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

SHWETA DEVI answered • yesterday

A dope vector is a data structure used to hold information about a data objects eg. an array, especially layout of array’s memory. It contain information such as rank of an array, type of elements of array etc.

Mahidar N asked • yesterday

Consider the following pseudo code, where x and y are positive integers.

begin

q := 0

r := x

while ?? ≥ ?? do

while ?? ≥ ?? do

begin

r := r – y

q := q + 1

end

end

The post condition that needs to be satisfied after the program terminates is

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

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

Pooja Daphal asked • yesterday

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

- a)11
- b)14
- c)16
- d)27

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

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?

Pooja Daphal asked • yesterday

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

- a)160 Kbits
- b)136 Kbits
- c)40 Kbits
- d)32 Kbits

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

MONIKA TEMPTA asked • yesterday

Protocols are

- a)Agreements on how communication components and DTE’s are to communicate,
- b)Logical communication channels used for transferring data.
- c)Physicai communication channels used for transferring data.
- d)None of the above

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

Rasazna Kls asked • yesterday

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?

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?

Madhu Arasi asked • yesterday

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?

Manan Athneriya asked • yesterday

A hard disk is connected to a 50 MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes 1000 clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires 500 clock cycles for the processor. The hard disk has a transfer rate of 2000 Kbytes/sec and average block transferred is 4 K

bytes. What fraction of the processor time is consumed by the disk, if the disk is actively transferring 100% of the time?

bytes. What fraction of the processor time is consumed by the disk, if the disk is actively transferring 100% of the time?

Correct answer is '30 us for initialisation and termination and 2 ms for data transferCpu time is consumed only for initialisation and termination % of cpu time consumed = 30us/ (30us +2ms)* 100 = 1.5%'. Can you explain this answer?

Apurva Patel asked • yesterday

Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.

- a)O(n)
- b)O(nLogn)
- c)O(Logn)
- d)O(n^2)

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

Sudhir Yadav asked • 2 days ago

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?

Meena Devi asked • 2 days ago

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?

Kalpa Devi asked • 2 days 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?

Fetching relevant content for you

Ask a question