Answers by goxul - GATE Overflow

0 votes

1

GATE2019-25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________

answered Jul 4 in Algorithms | 3.3k views

0 votes

2

Cormen Edition 3 Exercise 6.1 Question 5 (Page No. 154)
Is an array that is in sorted order a min-heap ?

answered Apr 14 in Algorithms | 33 views

0 votes

3

Michael Sipser Edition 3 Exercise 0 Question 5 (Page No. 26)
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.

answered Apr 14 in Theory of Computation | 32 views

0 votes

4

Michael Sipser Edition 3 Exercise 0 Question 13 (Page No. 27)
Show that every graph with two or more nodes contains two nodes that have equal degrees.

answered Apr 14 in Theory of Computation | 25 views

0 votes

5

MOCK TEST
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other? a)N-1 b)N c)N+1 d) (N*(N-1))/2 answer given is a)

answered Mar 22 in Algorithms | 22 views

0 votes

6

Gateforum Test Series: Algorithms - Asymptotic Notations
Which of the following is not true in the function $f(n)=2^{n-4}$? $f(n)$=Θ($2^{n+3}$) $f(n)$=Ω($n^{1000}$) $f(n)$=Ο($2^{n-10}$) $f(n)$=$None$

answered Dec 7, 2018 in Algorithms | 129 views

+1 vote

7

Gateforum Test Series: Algorithms - Asymptotic Notations
Consider the following function $f(x)$ = $x^8$+6$x^7$-9$x^5$-$x^4$+2$x^2$-18. Which of the following is true if x is greater than 56? $f(x)$ = O($x^8$) $f(x)$ = Ω($x^8$) $f(x)$ = θ($x^8$) $f(x)$ = None of the above.

answered Dec 7, 2018 in Algorithms | 126 views

+1 vote

8

OS-Virtual Memory
A computer system has a page size of 1024 bytes and maintains page table for each process in the main memory.The overhead required for doing a lookup in the page table is $500ns$.To reduce this overhead, the computer has a TLB that caches 32 ... mappings.A TLB lookup requires $100ns$.What TLB hit-rate is required to ensure an average virtual address translation time of $200ns$?

answered Dec 2, 2018 in Operating System | 143 views

+2 votes

9

Doubt on probability
15 students among whom are A and B arranged randomly in a row. Obtain the probability that there will be 3 students between A and B?

answered Nov 30, 2018 in Probability | 59 views

+1 vote

10

Doubt : TC
How the limits are reduced. Please explain in simpler way.

answered Nov 29, 2018 in Algorithms | 51 views

+2 votes

11

Probability
The probability of a student passing an exam is 0.1. What is the probability that he passes the exam in the 3rd attempt? Please explain in details. I am confused about these two approaches: Approach 1: P(passing in 3rd attempt)=P(failed in 1st)*P(failed in 2nd ... pass rate will always remain constant no matter on which attempt he is trying. ie. Answer = 0.1 Which one is wrong and why?

answered Nov 28, 2018 in Probability | 41 views

0 votes

12

Time Complexity

answered Nov 28, 2018 in Algorithms | 49 views

0 votes

13

GATEBOOK_CN_20
Let M be a confidential email that Alice wants to send to Bob, $K_B$ be Bob's encryption public key, and $K_A^{-1}$ be Alice's private key for signing. Which of the following options would be the best choice for protecting confidential ... message, Alice should sign the encrypted message and then should send this signature along with the encrypted message to BOB. Please help.

answered Nov 27, 2018 in Computer Networks | 176 views

+1 vote

14

How to solve this series which is in both AP and GP?
how to solve this series:

answered Nov 24, 2018 in Set Theory & Algebra | 87 views

0 votes

15

Turing machine
what is co-turing recognizable language?

answered Nov 24, 2018 in Theory of Computation | 27 views

0 votes

16

Self-Doubt
Consider Main memory M and Cache C. 1.When we say acess time of main memory is T what parameters does it include.Is it . just obtaining data from M or .obt data from M and Transferring it to cache(I understood as this) or . Obt data from M , ... given which scenario do we take. Pls help me with these finer aspects. I understood the overall idea.In NATs Im missing by small margins.

answered Nov 24, 2018 in CO and Architecture | 25 views

+1 vote

17

answered Nov 22, 2018 in Algorithms | 75 views

0 votes

18

Probability - Gravner-33.a
An urn contains 10 black and 10 white balls. Draw 3 a) without replacement

answered Nov 22, 2018 in Probability | 50 views

0 votes

19

Probability - Gravner-15.a
A tennis tournament has $2n$ participants, $n$ Swedes and n Norwegians. First, $n$ people are chosen at random from the $2n$ (with no regard to nationality) and then paired randomly with the other $n$ people. Each pair proceeds to play one match. An ... $n$ (ordered) pairs, giving the winner and the loser in each of the $n$ matches. (a) Determine the number of outcomes.

answered Nov 22, 2018 in Probability | 21 views

+1 vote

20

T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?

answered Nov 22, 2018 in Algorithms | 699 views

+1 vote

21

METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.

answered Nov 18, 2018 in Algorithms | 53 views

+2 votes

22

GATE2006-44
Station $A$ uses $32$ $\text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80$ $\text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128$ $\text{kbps}$ . What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$

answered Nov 17, 2018 in Computer Networks | 8.8k views

0 votes

23

Self Doubt
A polygon has 12 edges , How many diagonals does it have? How to find the number of diagonals?

answered Nov 16, 2018 in Numerical Ability | 50 views

0 votes

24

ibps2014
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is 1. o (n log n) 2. o (n) 3. o(sqrt(n)) 4. o (log n)

answered Nov 16, 2018 in Programming | 26 views

+1 vote

25

compiler design
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers. eleborate this ??

answered Nov 15, 2018 in Compiler Design | 32 views

+2 votes

26

Made easy test series
What is the difference between (ii) and (iv). I understood (ii) as "All the engineers like at least some doctor" What will be the translation for (iv) ?

answered Nov 15, 2018 in Mathematical Logic | 66 views

+1 vote

27

CN-Doubt
Which classful subnet mask is useful for need of subnet a network that has 5 subnet each with at least 20 hosts. A.255.255.255.192 B.255.255.255.248 C.255.255.255.240 D.255.255.255.224

answered Nov 12, 2018 in Computer Networks | 51 views

+2 votes

28

CN-DOUBT
A network that is 172.28.0.0 and would like to support 650 hosts per subnet.The subnet mask should we use is 255.255.____ and____?

answered Nov 12, 2018 in Computer Networks | 47 views

+1 vote

29

Algorithm questions on graphs

answered Nov 12, 2018 in Algorithms | 77 views

0 votes

30

Self Doubt
What is order of T(n) ? T(n) = T(n-1) + 2$^{n}$ , n>1 T(n) = 1 , n=1 A) O(2$^{n}$) B) O(n.2$^{n}$) C) O(2$^{2n}$)

answered Nov 12, 2018 in Algorithms | 32 views

+1 vote

31

why do we need O(n), we can do directy check if index is present or not in O(1) time. Please explain..

answered Nov 10, 2018 in Algorithms | 33 views

+2 votes

32

States in DFA
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true. As per my understanding every DFA is NFA then how no of states can be more in DFA than nfa Please suggest Thanks

answered Nov 10, 2018 in Theory of Computation | 87 views

+1 vote

33

adressing modes
Given 2 machine instructions, LW R4 #400 LW R1, 0,(R4) IN second instruction what will be loaded in R1,is it the operand at memory location 400?or some random memory location operand..I want to clarify weather value stored in register is same as adress that register points.

answered Nov 9, 2018 in CO and Architecture | 101 views

+1 vote

34

Zeal Test Series: Mathematical Logic - First Order Logic
1)How to do question no. 34,36

answered Nov 9, 2018 in Mathematical Logic | 70 views

0 votes

35

Zeal Workbook: Mathematical Logic - First Order Logic
How to write the last line of Qno. 19 - irrespective of whether the system has been armed the alarm should go off when there is fire For Qno 20 I am getting iii) and iv) as true but answer is a) please check the 5th one

answered Nov 9, 2018 in Mathematical Logic | 60 views

0 votes

36

made easy 2019
I AM GETTING 28% WITH TLB= 140ns WITHOUT TLB= 500ns i havent considered memory access time, just address translation time is cosidered! am i right??

answered Nov 9, 2018 in Operating System | 35 views

0 votes

37

SELF DOUBT
https://gateoverflow.in/83993/gate1990-2-viii WHAT IS CORRECT ANSWER FOR HEAP?

answered Nov 9, 2018 in DS | 24 views

0 votes

38

answered Nov 4, 2018 in Algorithms | 106 views

0 votes

39

recurrence equation:
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n HOW TO EVALUATES USING MASTER THEOREM

answered Nov 2, 2018 in Algorithms | 43 views

Page:

1
2
3
next »

50,645 questions

56,563 answers

195,730 comments

101,650 users