Dark Mode

Recent activity by Rohan Mundhey

3 answers

1

GATE CSE 2017 Set 1 | Question: 15
A sender $S$ sends a message $m$ to receiver $R$, which is digitally signed by $S$ with its private key. In this scenario, one or more of the following security violations can take place. $S$ ... with a fraudulent message Which of the following are possible security violations? I and II only I only II only II and III only

answered in Computer Networks Feb 15, 2017

10.8k views

3 answers

2

GATE CSE 1999 | Question: 2.12
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.

commented in Operating System Nov 20, 2016

22.8k views

1 answer

3

Virtual Addressing
Suppose a process has only the following pages in its virtual address space; two contiguous code pages starting at virtual address 0x0000000, two contiguous data pages starting at virtual address 0x00400000, and a stack page starting at virtual address 0xFFFFF000. The amount of memory required for storing the page tables of this process is (A)8 KB (B) 12KB (C) 16 KB (D) 20KB

commented in Operating System Nov 18, 2016

402 views

1 answer

4

GATE CSE 1996 | Question: 1.21
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is $256 \times 16$ $64 K \times 8$ $4 K \times 16$ $64 K \times 16$

commented in Digital Logic Nov 17, 2016

16.3k views

1 answer

5

GATE CSE 1990 | Question: 4-iv
Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit to operate unit at its maximum speed.True/False.Explain.

commented in CO and Architecture Nov 17, 2016

3.5k views

1 answer

6

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

1 answer

7

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

answer selected in Databases Nov 13, 2016

458 views

1 answer

8

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.

commented in Databases Nov 13, 2016

192 views

0 answers

9

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)?

commented in Algorithms Nov 11, 2016

1.3k views

1 answer

10

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

927 views

1 answer

11

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

766 views

1 answer

12

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 answer

13

answer selected in Unknown Category Nov 11, 2016

237 views

2 answers

14

answer selected in Algorithms Nov 11, 2016

199 views

1 answer

15

Time Complexity

answer selected in Algorithms Nov 11, 2016

135 views

1 answer

16

Time Complexity

answer selected in Algorithms Nov 11, 2016

454 views

0 answers

17

asked in Algorithms Nov 10, 2016

115 views

10 answers

18

GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$

commented in Algorithms Nov 10, 2016

11.1k views

3 answers

19

Arrays
Consider an array of 19 elements, Find the minimum number of comparisons required to find minimum and maximum elements in an array

answer selected in Algorithms Nov 10, 2016

686 views

1 answer

20

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? 2)What is the expected number of slots that are being nonempty?

answer selected in Algorithms Nov 9, 2016

1.5k views

1 answer

21

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?

commented in Algorithms Nov 9, 2016

483 views

2 answers

22

Comparisons in a Binary Search
How many comparisons are needed for a binary search in a set of 64 elements?

commented in Algorithms Nov 9, 2016

4.6k views

1 answer

23

COMPLEXITY
Suppose that the votes of n people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes. What is the time complexity to find a candidate who receives majority of the votes using divide and conquer approach?

commented in Algorithms Nov 9, 2016

684 views

1 answer

24

qUICK sORT
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0) Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, E What is the position of pivot element after completion of first pass?

answer selected in Algorithms Nov 9, 2016

446 views

4 answers

25

ARRAYS
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?

asked in Algorithms Nov 9, 2016

1.3k views

1 answer

26

RADIX SORT
Consider an array of n integers ranges from 0, 1, ..., n5-1. What is the time complexity of RADIX-SORT when using base-10 representation?

answer selected in Algorithms Nov 9, 2016

3.6k views

1 answer

27

Arrays
Consider an array contains 2k distinct elements. How many comparisons are needed to find the smallest and the second smallest elements in the given array? 2k comparisons 2k-2 comparisons 2k + k -2 comparisons

answer selected in Algorithms Nov 9, 2016

2.0k views

2 answers

28

Binary Search Tree
Given a binary search tree and a number ‘x’. What is the best time complexity to find the sum of two numbers in an array is equal to given number x?

asked in DS Nov 9, 2016

295 views

1 answer

29

ARRAY
Consider an array contains n integers, each integer belongs to {-1, 0, 1}. What is the best case time complexity to sort an array?

asked in Algorithms Nov 9, 2016

333 views

1 answer

30

commented in Programming Nov 9, 2016

198 views