Dark Mode

Recent activity by gmrishikumar

1 answer

1

Difference between DAG and Multi-stage graph
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?

asked in Graph Theory Apr 28, 2019

822 views

0 answers

2

Practicing Algorithms and Data Structures for Interview
I have got a good GATE rank in 2019 and most probably I will get into IIT-B TA. I am thinking of working on algorithms and data structures before I join. I have gone through a lot of content regarding ... someone provide some pointers or any resources that help me improve my skills for competitive coding or interview preparation in general?

commented in DS Apr 21, 2019

695 views

1 answer

3

Courses in IISc and IIT-B
I have got rank 56 in GATE CS 2019. I have some doubts regarding admissions and college. Some of these questions may be trivial but please bear with me. I wish to work on ML for Masters. I am considering only IISc Bangalore and IIT-B for ... any other post-graduate degree I should know about while applying at the universities? And how does one apply for admission at IIT-B?

asked in IISc/IITs Mar 19, 2019

1.2k views

1 answer

4

GATE ADMISSIONS
Is it true that mtech seats in iits are increased this year? Please someone tell me this as it’ll be very helpful in deciding college for admission

answered in IISc/IITs Mar 19, 2019

738 views

1 answer

5

Direct Admission GATE 2019, Marks - 77
I have scored 77.67 in GATE 2019. The rank predictor predicts my rank around 48 - 51. How accurate is the rank predictor? And if the predicted rank is accurate, then from which IITs/IISc can I expect offers for direct admission?

commented in IISc/IITs Feb 16, 2019

1.7k views

2 answers

6

GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above

commented in Theory of Computation Feb 1, 2019

3.3k views

1 answer

7

GATE Overflow | Mock GATE | Test 1 | Question: 37
Consider the context switch of a CPU from the context of process $P1$ to that of process $P2$. Consider the following two events in the chronological order of the events during the context switch. (P) The Stack Pointer (SP) shifts ... via an atomic hardware instruction The relative ordering of $P$ and $Q$ varies from one context switch to the other

commented in Operating System Jan 30, 2019

1.1k views

1 answer

8

GATE Overflow | Mock GATE | Test 1 | Question: 35
Consider the following graph. How many paths of length $4$ exist from node $A$ to node $D$? (Note: The path may have repeated vertices. You can think of it as walks in general rather than path)

answered in Discrete Mathematics Jan 30, 2019

3.3k views

4 answers

9

GATE Overflow | Mock GATE | Test 1 | Question: 34
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected? $\frac{n}{2}$ $\lceil (n-1)/2 \rceil$ $\lfloor (n+1)/2 \rfloor$ $(n-1)/2$

answered in Graph Theory Jan 30, 2019

2.2k views

2 answers

10

GATE Overflow | Mock GATE | Test 1 | Question: 33
If $x=cy+bz, \: y=az+cx, \: z=bx+ay,$ where $x,y,z$ are not all zero, then $a^2+b^2+c^2=$ $1+2abc$ $1-2abc$ $1+abc$ $abc-1$

commented in Set Theory & Algebra Jan 30, 2019

875 views

1 answer

11

GATE Overflow | Mock GATE | Test 1 | Question: 30
Which of the following statements is not correct? (i) ICMP packet is not generated if an ICMP packet is discarded (ii) ICMP packets are always directed to the source IP address of the originating packet. (iii) In case of multiple fragments, only one ICMP is ... for an ICMP echo reply. (i) and (iv) (iii) and (iv) (ii) and (iv) None of the above

answered in Computer Networks Jan 30, 2019

2.7k views

1 answer

12

GATE Overflow | Mock GATE | Test 1 | Question: 27
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data ... repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees

answered in Databases Jan 30, 2019

4.6k views

1 answer

13

Turing Machines
What is the smallest number of states can a TM have?

answered in Theory of Computation Jan 30, 2019

1.6k views

3 answers

14

turing machine
can we have a turing machine which has only one state ? or the minimum number of state for a turing machine is 2?

answered in Theory of Computation Jan 30, 2019

2.1k views

1 answer

15

algorithm
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The minimum number of comparisons in order to get sorted list is a) n log n/2 b)n log n-n+1 c)n logn d)n logn +n

commented in Algorithms Jan 29, 2019

1.7k views

4 answers

16

Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n

commented in Algorithms Jan 29, 2019

2.6k views

2 answers

17

point to point link to the moon
Suppose you are designing the sliding window protocol for a 1 Mbps point to point link to the moon, which has one way latency(delay) of 1.25 seconds. assuming that each frame carries 1 KB of data, What is minimum number of bits you need for sequence number?

commented in Computer Networks Jan 28, 2019

8.2k views

1 answer

18

Operating System - File System
Consider a file system with 4096 byte blocks and 32-bit disk and file block pointers. Each file has 13 direct pointers, 4 singly-indirect pointers, a doubly-indirect pointer, and a triply-indirect pointer. The maximum disk size and the number of i-nodes that can fit in single block are........... and ........... respectively.

answered in Operating System Jan 26, 2019

3.2k views

5 answers

19

GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.

commented in Calculus Jan 26, 2019

10.4k views

1 answer

20

gatebook
someone explain

commented in DS Jan 25, 2019

454 views

1 answer

21

Applied Course | Mock GATE | Test 1 | Question: 63
Suppose there are $4$ routers connected between two systems $S_1$ and $S_2$. $S_1$ wants to send a python file of size $8 \:KB$ to $S_2$ ... the time to transfer $1$ bit from $S_1$ to $S_2$ is $32$ sec and there is no traffic between these two systems)

commented in Computer Networks Jan 24, 2019

664 views

1 answer

22

Applied Course | Mock GATE | Test 1 | Question: 58
Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the total weight is $\leq W$ which is a given limit and the total ... subproblems is $O(nW)$. Which of the above statements is/are correct? I only II only Both I and II None of these

commented in Algorithms Jan 24, 2019

577 views

1 answer

23

Applied Course | Mock GATE | Test 1 | Question: 56
$\text{O}, \Omega,$ and $\Theta$ denote Big-Oh, Big-Omega and Big-Theta notations respectively. Which of the following statement is not correct? $n \: \log a = \Omega (\log ^2 (n)), \text{ where a is a constant >1}$ ... $4(n+k)^m = \text{O} (n^m), \text{ where m is a constant >1}$ $n+\log (n) = \Theta (n)$

commented in Algorithms Jan 24, 2019

570 views

1 answer

24

Applied Course | Mock GATE | Test 1 | Question: 52
Which of the following languages are not CFLs $L=\{ 0^n 1^n0^n 1^n \mid n \geq 0\}$ $L=\{0 \# 0^{2n} \# 0^{3n} \mid n \geq 0\}$ $L=\{a^n b^m c^m d^n \mid m,n \geq 0\}$ $L=\{ x \# y \mid x,y \in \{0, 1\}^* \text{ and } x \neq y\}$ II and III only III and IV only I and II only I, II and IV only

commented in Theory of Computation Jan 24, 2019

693 views

2 answers

25

Applied Course | Mock GATE | Test 1 | Question: 49
How much memory is used for page tables, when there are $10$ process running in the system with the below details? Virtual Address space: $1GB$ Page size: $1KB$ Each page table entry contains a valid bit, dirty bit and the resulting frame number. And the system has a maximum of $2^{14}$ physical pages. $10$ MB $20$ MB $30$ MB None of these

answered in Operating System Jan 24, 2019

728 views

1 answer

26

Applied Course | Mock GATE | Test 1 | Question: 44
Minimum number of states in a deterministic Finite automata that accepts the given language is ______ $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$

commented in Theory of Computation Jan 24, 2019

656 views

1 answer

27

Applied Course | Mock GATE | Test 1 | Question: 37
The project of building $20$ roads connecting $9$ cities is under way, as outlined above. So far, only some of the $20$ roads are constructed, and the digit on each city indicates the number of constructed roads to other cities. How many complete roads are there among these cities ________

commented in Graph Theory Jan 24, 2019

813 views

1 answer

28

Partially Functional Complete
In GATE, I have seen a lot of questions where we are asked to check whether a set of operations is functionally complete or not. I know Functionally Complete and Partially Functionally Complete are two different things, but while marking answers in GATE, will we say a set is functionally complete even when it is partially functionally complete?

answer selected in Digital Logic Jan 23, 2019

834 views

1 answer

29

Probablity Question
The given table shows the result of the class of 30. Find the probability that a given student who is passed in exam is a girl?

answered in Mathematical Logic Jan 23, 2019

467 views

2 answers

30

A Different Kind of Question on Longest Common Subsequence
Consider two strings A = "anandarmy" and B = "algorithms". Let ‘y’ be the length of the longest common subsequence (not necessarily contiguous) between A and B and let ‘x’ be the number of such longest common subsequences between A and B. Then 2x+3y = _________.

answered in Algorithms Jan 22, 2019

2.3k views