Dark Mode

Recent activity by Aakash_

1 answer

1

Self Doubt: CO & Architecture - Microprogramming
Difference between Horizontal Microprogramming and Vertical Microprogramming Plz explain in detail for GATE point of view only.

commented in CO and Architecture Sep 30, 2019

4.0k views

1 answer

2

# Heap sort
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.

commented in Algorithms Jun 3, 2019

1.0k views

1 answer

3

MadeEasy Test Series Tag,Set and Word field
Consider a computer system has a main memory consisting of 1M 16 bit words. It also has a 4 K-word cache organized in the block set associative manner, with 4 blocks per set and 64 words per block. What is the number of bits in each of the TAG, SET and WORD field of main memory address format 11, 4, 6 10, 5, 6 10, 4, 7 11, 4, 7

commented in CO and Architecture Feb 21, 2019

7.5k views

1 answer

4

Should I apply for IIIT H ? GATE 2019 Marks 60 OBC NCL
Rank Estimate 800 - 994 Current Rank 800 / 31715 Expected Score 707.52 My Marks 60 Category: OBC - NCL College Predictor says that i can get IIT G/R/H and Top NITs also, I just want to know should i apply for IIIT H also ? I don' ... don't know if my Rank is stable right now or it will further go down from here. Do i still have chance in IITs ?

edited in IISc/IITs Feb 20, 2019

1.8k views

1 answer

5

IIT Bombay
I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?

commented in Written Exam Feb 12, 2019

651 views

6 answers

6

GATE CSE 2005 | Question: 71
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process $P_i$ is $s_i$, where $s_i > 0$. Which one of the following is a sufficient condition for ensuring that deadlock ... $\displaystyle{\sum_{i=1}^n} \: s_i < (m \times n)$

commented in Operating System Jan 25, 2019

16.6k views

2 answers

7

Self Doubt Blind Write
Why having a Blind Write may help a schedule(which is not conflict serializable) to be view serializable ? I can see check the condition and verify this. but i don’t understand the concept, i hope i am able to frame my question properly. I read books but my doubt is still there. Please help me out guys. Thanks

asked in Databases Jan 10, 2019

1.5k views

8 answers

8

GATE CSE 2017 Set 2 | Question: 52
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is $2,$ then the largest among the absolute values of the eigenvalues of $M$ is _______

commented in Linear Algebra Jan 9, 2019

15.4k views

8 answers

9

GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$

commented in Linear Algebra Jan 9, 2019

37.1k views

1 answer

10

HEAP (MAX/MIN HEAP)
what is the time complexity of various problems such as: 1) Creating the heap 2) Getting maximum element in the max heap 3) Getting minimum element in the max heap 4) Getting maximum element in min heap 5) Getting minimum element in min heap 6) Heapify the ... of an element in the max heap 10) Insertion of an element in the max heap 11) Insertion of an element in min heap

commented in Programming in C Jan 6, 2019

594 views

2 answers

11

GATE CSE 2006 | Question: 31
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $|V|$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true? Both DHAM$_3$ ... NP-hard, but DHAM$_3$ is not DHAM$_3$ is NP-hard, but SHAM$_3$ is not Neither DHAM$_3$ nor SHAM$_3$ is NP-hard

commented in Theory of Computation Jan 4, 2019

4.5k views

1 answer

12

Why does Jamming signal not collide ?
Hi Guys, In Ethernet whenever collision happens station sends a Jamming signal. But why does these special signal not collide ? In many question i saw they also have TT and TP. So what does make them collision free ? PS: Refer Problem 2 on http://web.eecs.umich.edu/~zmao/eecs489/MT2/mt2reviewHints.pdf

commented in Computer Networks Jan 1, 2019

1.9k views

1 answer

13

Number of tokens in the C program
Given answer is 25, while my answer is 26, they have considered -10.0 as single token, which is wrong?

commented in Compiler Design Dec 29, 2018

4.6k views

1 answer

14

AVL tree
minimum no of nodes n AVL tree of height 11 is a)230 b)231 c)232 c)233

commented in Programming in C Dec 29, 2018

2.9k views

0 answers

15

Self Doubt Token Count - Character Literal
How many tokens are there ? int main() { char name={'A','A','K','A','S','H'}; return 0; } Please give any reference if possible, my doubt is about the characters in the braces, do we count them individually or like a string.

edited in Compiler Design Dec 28, 2018

1.0k views

1 answer

16

Inode Questions
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 14 direct indexes, one indirect index, two double indexes, and three triple indexes. If the system contains the 10485 files, size of disk is 1 PB ... be addressed by the double indirect block alone?____MB 4. What is the maximum file size possible in this allocation scheme?____GB

commented in Operating System Dec 27, 2018

3.0k views

2 answers

17

GATE CSE 2015 Set 3 | Question: 32
Which of the following languages are context-free? $L_1: \left\{a^mb^na^nb^m \mid m, n \geq 1\right\}$ $L_2: \left\{a^mb^na^mb^n \mid m, n \geq 1\right\}$ $L_3: \left\{a^mb^n \mid m = 2n +1 \right\}$ $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_3$ only

commented in Theory of Computation Dec 19, 2018

15.0k views

9 answers

18

GATE IT 2006 | Question: 69
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no applications listening at the corresponding ports on $Y$ and $Z$. An $ICMP$ Port Unreachable error will be generated by $Y$ but not $Z$ $Z$ but not $Y$ Neither $Y$ nor $Z$ Both $Y$ and $Z$

commented in Computer Networks Dec 18, 2018

14.0k views

3 answers

19

Routing Table
We know routing table looks something like this . Network ID Subnet Mask Interface Question : We go with larger subnet mask in case of two matches. !! Why ? I know that's fact and called https://en.wikipedia.org/wiki/Longest_prefix_match !! What is ... some relation with the previous one. If i have to divide a network in 5 unequal subnets. then which is the correct method ?

commented in Computer Networks Dec 15, 2018

1.2k views

2 answers

20

Ace test series
Guys, I am not getting C as the ans..Can someone help.

commented in Computer Networks Dec 14, 2018

583 views

9 answers

21

GATE CSE 2008 | Question: 58
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $16\text{Megabits}$. What is the maximum duration for which the computer can transmit at the full $10\text{Mbps}$? $1.6$ seconds $2$ seconds $5$ seconds $8$ seconds

commented in Computer Networks Dec 13, 2018

24.7k views

1 answer

22

Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.

answered in Others Dec 12, 2018

960 views

6 answers

23

Deadlock
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________. Given answer is 6. I am getting 12.

commented in Operating System Dec 4, 2018

5.7k views

3 answers

24

Consider two processes, P and Q, each need three records,
Consider two processes, P and Q, each need three records, R1, R2. and R3, in a database. If P asks for them in any order R1, R2, R3, and Q asks for them in any order, What fraction of all the combinations are guaranteed to be deadlock free? $\frac{1}{3}$ $\frac{2}{3}$ $\frac{1}{6}$

commented in Operating System Dec 4, 2018

4.4k views

4 answers

25

GATE CSE 2006 | Question: 06, ISRO2009-14
Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $1$ $2$ $3$ $4$

commented in Operating System Dec 2, 2018

15.8k views

1 answer

26

Made easy test series

answered in Programming in C Dec 1, 2018

341 views

0 answers

27

Program Flow Graph
i think line number 3,4,5 will make a basic block. but in the solution given line number 5 is a separate block

commented in Compiler Design Dec 1, 2018

1.2k views

4 answers

28

Handle in a grammar
Consider the following Grammar : $S \rightarrow ZZ$ $Z \rightarrow xZ|y$ Which of the following represents a handle in the generation of the string "xxxyxy" ? A. $ZxZ$ B. $Zxy$ C. $xZxy$ D. $xZ$ Please explain a little about handles too I have a little doubt about it. And do explain the difference between viable prefix and Handle Please :)

commented in Compiler Design Dec 1, 2018

7.8k views

5 answers

29

MadeEasy Subject Test 2019: Compiler Design - Lexical Analysis

commented in Compiler Design Dec 1, 2018

2.7k views

1 answer

30

Compiler Design #Made_Easy_Test_Series
Let G be any grammar with the following productions: X → X + Y | Y Y → Y * Z | Z Z → (X) Z → id If LR(!) parser is used to parse the above grammar, then total how many look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________. Please explain your answer.

commented in Compiler Design Dec 1, 2018

2.2k views