Dark Mode

Recent activity by Gokulnath

0 answers

1

Can Merge Sort Time Complexity be O(n^2) in any condition?

commented in Algorithms Jan 31, 2019

1.4k views

7 answers

2

GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true

commented in Linear Algebra Jan 16, 2019

27.2k views

3 answers

3

GATE CSE 1988 | Question: 2-ii
Using an expanding opcode encoding for instructions, is it possible to encode all of the following in an instruction format shown in the below figure. Justify your answer. ...

commented in CO and Architecture Jan 12, 2019

4.0k views

11 answers

4

GATE CSE 2005 | Question: 52
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1 - \frac{1}{n}$ $\frac{1}{n!}$ $1 - \frac{1}{2^n}$

commented in Probability Jan 12, 2019

8.5k views

6 answers

5

GATE CSE 2015 Set 1 | Question: 1‏6
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only

commented in Set Theory & Algebra Jan 11, 2019

15.5k views

5 answers

6

GATE IT 2006 | Question: 6
Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true? $f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x_2, \ldots, x_n)$ ... $f (x_1, x_2, \ldots , x_n) = f(0, x_2, , x_n) + f(1, x_2, \ldots, x_n)$

commented in Set Theory & Algebra Jan 11, 2019

6.3k views

0 answers

7

Verbal ability doubt
I have a query Regarding Verbal Ability, Till Now i didn’t touch this part should i study it or leave it ?

commented in Others Jan 10, 2019

353 views

8 answers

8

GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$

commented in Combinatory Jan 10, 2019

8.2k views

0 answers

9

APPLIED-COURSE-mocktest-2
for whole number n, consider the following recurrence relation defined as $a_{n+2}=(n+3)a_{n+1}-(n+2)a_n$ and $a_1=1,a_2=3$ find $( \sum_{k=1}^{2015}a_k)(mod\; 100)$ is _

commented in Combinatory Jan 9, 2019

185 views

1 answer

10

Test by Bikram | Mock GATE | Test 3 | Question: 28
Two $CSMA/CD$ stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-off algorithm. The probability that the contention ends in round $3$ is _____ (up to 3 decimal points).

commented in GATE Jan 9, 2019

765 views

3 answers

11

Test by Bikram | Mock GATE | Test 3 | Question: 23
Partitioning and Merging are the two main parts of $Quick Sort$. Which of the following is TRUE? Partitioning is the key step while Merging is trivial. Partitioning is trivial while Merging is the key step. Both Partitioning and Merging are trivial. Both Partitioning and Merging are key steps.

commented in GATE Jan 9, 2019

422 views

0 answers

12

ace academy test series

commented in Programming in C Jan 5, 2019

387 views

2 answers

13

MadeEasy Test Series: Algorithms - Graph Algorithms
Which of the following statement is true? For a directed graph, the absence of back edges in a DFS tree can have cycle. If all edge in a graph have distinct weight then the shortest path between two vertices is unique. The depth of any DFS ( ... tree rooted at a vertex is atleast as depth of any BFS tree rooted at the same vertex. Both (a) and (c)

commented in Algorithms Jan 4, 2019

2.5k views

2 answers

14

Expanding opcode technique
A CPU is designed to have 58 three-address instructions and 25 two-address instructions. The CPU is able to address a maximum of 16 memory locations. The length of machine code is the same for all instructions. If the list of the ... of twoaddress instructions iv) Determine the length of the machine code v) List the machine codes Detailed explanation would be helpful

commented in CO and Architecture Jan 3, 2019

10.8k views

0 answers

15

MadeEasy Test Series: Computer Networks - Sliding Window
Assume 2 computers are connected via a network, The networks use GoBack7 SW protocol for maintaining flow control. It is observed that every $5^{th}$ packet that has been sent through the network is lost. The number of extra packets needs to resend for transmitting 10 such packet through the network is______________________.

commented in Computer Networks Jan 1, 2019

853 views

11 answers

16

GATE CSE 2014 Set 3 | Question: 27
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?

commented in Computer Networks Dec 30, 2018

21.7k views

0 answers

17

ACE TEST SERIES QUESTION

commented in Compiler Design Dec 28, 2018

259 views

1 answer

18

Aptitude and Ratio
Please Explain it

commented in Quantitative Aptitude Dec 28, 2018

385 views

0 answers

19

Madeeasy DBMS- 2PL-2019- what is to be checked to ensure allowance under 2PL?
What exactly is to be checked for test for 2PL? is a schedule being SERIALIZABLE sufficent to declare its allowed under 2PL?

commented in Databases Dec 25, 2018

309 views

1 answer

20

Ace Test Series: DBMS - Correlated Sql Query
According to me it should be – “Retrieve the names of all students with a lower rank, than all students with age < 18 ”

commented in Databases Dec 24, 2018

1.3k views

0 answers

21

MadeEasy Test Series: CO & Architecture - Cache Memory
As write through strategy is mentioned shouldnt we take SIMUALTANEOUS access formula for both read as well as write? when we will use read as parallel access formula?

commented in CO and Architecture Dec 23, 2018

771 views

1 answer

22

Solve the recurrence $T(n) = 2 T \left ( \sqrt n \right ) + n$

commented in Algorithms Dec 21, 2018

1.6k views

1 answer

23

MadeEasy Test Series: Operating System - Process Synchronization
The definition of progress is: When no process is in the critical section and another process wants to enter the critical section, then it should be allowed without any delay Suppose we do a context switch from 1 ... critical section, the second process is unable to enter the critical section. How does this achieve progress then?

asked in Operating System Dec 21, 2018

547 views

0 answers

24

CO madeeasy 2019 Multi level cache
please explain how hit ratio of L2 is taken as 0.5? instead of 0.9 as 10 misses are mentioned is it like as 20 misses at levle 1 out of which only 10 missed at level 2, so 10 out of 20 (and not 100) hence 0.5?

commented in CO and Architecture Dec 21, 2018

518 views

1 answer

25

Graph Theory Doubt
If there are exactly 2 vertices x and y of odd degree in a graph G, then there must be a path between x and y, Is this true? Please explain with valid reasons.

answered in Graph Theory Dec 21, 2018

779 views

1 answer

26

Computability and decidability
Do I need to study computability and decidability for gate 2019? Please suggest

commented in Theory of Computation Dec 20, 2018

531 views

1 answer

27

#pipeline
Consider execution of 100 instructions on a 5 stage pipeline. let P be the probability of an instruction being branch. The value of P such that speed up is atleast 4 is_____(assume each stage takes 1 cycle to perform its task and branch is predicted on forth stage of the pipeline)

commented in CO and Architecture Dec 19, 2018

2.6k views

6 answers

28

TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$

commented in Algorithms Dec 18, 2018

4.4k views

3 answers

29

gatebook COA test
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining program has a speed up of 80 and 40% of the remaining part of the program performs poorer ... by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:-

commented in CO and Architecture Dec 18, 2018

619 views

1 answer

30

TIFR CSE 2019 | Part B | Question: 3
A graph is $d$ – regular if every vertex has degree $d$. For a $d$ – regular graph on $n$ vertices, which of the following must be TRUE? $d$ divides $n$ Both $d$ and $n$ are even Both $d$ and $n$ are odd At least one of $d$ and $n$ is odd At least one of $d$ and $n$ is even

answered in Graph Theory Dec 18, 2018

1.6k views