Questions by Rohan Mundhey

0 votes

1 answer

1

TABLE
Agency called immediate cover supplies part time 1 temporary staff to hotels throughout India. The table shown below lists the time speed by agency staff working at two hotels. In the process of normalizing the above table into 3NF, how many tables will be formed? (Assume FD’s based on given table)

asked in Databases Nov 14, 2016

153 views

0 votes

1 answer

2

true ?
Which of the following statement(s) is/are true? I.Every existence dependency results in a weak entity. II.Role names are technically not necessary in relationships types when all the participating entity types are distinct. III.The relationship between owner entity and the weak entity is one to many.

asked in Databases Nov 13, 2016

192 views

0 votes

1 answer

3

correct ?
Which of the following statement(s) is/are correct? I.A constraint showing the maximum number of entities to which another entity can be associated via a relationship set is called participation constraint. II.The number of entity sets participating in the relationship is known as the degree of that relationship

asked in Databases Nov 13, 2016

458 views

3 votes

1 answer

4

Spanning Trees
Consider the following adjacency matrix representation of connected graph then find the number of spanning trees are possible for the given graph $\begin{bmatrix} 0&1&1&1&0 \\ 1&0&1&1&0 \\1&1&0&0&1 \\ 1&1&0&0&1 \\0&0&1&1&0 \end{bmatrix}$

asked in Algorithms Nov 11, 2016

929 views

1 vote

1 answer

5

Dijikstra
Consider a Graph G which contains a negative weight edges but not negative cycles then which of the following statements is TRUE when we run Dijkstra’s algorithm? It may not terminate It terminates but may produce incorrect results. It never terminates due to cycles in graph None of these

asked in Algorithms Nov 11, 2016

773 views

0 votes

1 answer

6

Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6

asked in Algorithms Nov 11, 2016

1.0k views

1 vote

0 answers

7

recurssion
Let T(n) be a function which takes an integer n having k digits as input. The function T(n) finds the maximum number of perfect squares possible by removing either least significant digit or the most significant digit. For example, consider the number 32492, T(32492) = ... perfect square or not. If the time complexity for IS_SQUARE(a) is O(1), what is the time complexity to compute T(n)?

asked in Algorithms Nov 11, 2016

1.3k views

2 votes

1 answer

8

Time Complexity

asked in Algorithms Nov 10, 2016

454 views

3 votes

1 answer

9

Time Complexity

asked in Algorithms Nov 10, 2016

135 views

1 vote

0 answers

10

Toom & Cook

asked in Algorithms Nov 10, 2016

115 views

3 votes

2 answers

11

Recurrence

asked in Algorithms Nov 10, 2016

199 views

1 vote

1 answer

12

Array Heap

asked in Unknown Category Nov 10, 2016

237 views

0 votes

1 answer

13

Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty?