Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Nithish
3
answers
1
GATE CSE 1987 | Question: 4a
Find out the width of the control memory of a horizontal microprogrammed control unit, given the following specifications: $16$ control lines for the processor consisting of ALU and $7$ registers. Conditional branching facility by checking $4$ status bits. Provision to hold $128$ words in the control memory.
commented
in
CO and Architecture
Sep 11, 2020
4.5k
views
gate1987
co-and-architecture
microprogramming
descriptive
3
answers
2
GATE CSE 1999 | Question: 17
Consider the following program fragment in the assembly language of a certain hypothetical processor. The processor has three general purpose registers $R1, R2$and $R3$. The meanings of the instructions are shown by comments (starting with ;) after the instructions. ... the values n, 0, and 0 respectively. What is the final value of $R3$ when control reaches $Z$?
answered
in
CO and Architecture
Sep 10, 2020
4.7k
views
gate1999
co-and-architecture
machine-instructions
normal
descriptive
1
answer
3
digital signature
can we use a secret symmetric key to both sign and verify a signature?
answered
in
Computer Networks
Apr 29, 2017
223
views
3
answers
4
Suppose that 100 people enter a contest and that different winners are selected at random for first, second, and third prizes. What is the probability that Michelle wins one of these prizes if she is one of the contestants?
commented
in
Probability
Apr 26, 2017
2.6k
views
1
answer
5
Addressing Mode
comment edited
in
CO and Architecture
Feb 9, 2017
501
views
5
answers
6
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
commented
in
Operating System
Feb 7, 2017
11.2k
views
gateit-2006
operating-system
process-synchronization
normal
3
answers
7
GATE CSE 2008 | Question: 28
How many of the following matrices have an eigenvalue 1? $\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] \left[\begin{array}{cc}1 & -1 \\1 & 1 \end{array} \right]$ and $\left[\begin{array}{cc}-1 & 0 \\1 & -1 \end{array} \right]$ one two three four
commented
in
Linear Algebra
Feb 7, 2017
6.7k
views
gatecse-2008
eigen-value
linear-algebra
1
answer
8
GATE CSE 1998 | Question: 13
Let $M=(\{q_0, q_1\}, \{0, 1\}, \{z_0, X\}, \delta, q_0, z_0, \phi)$ be a Pushdown automation where $\delta$ is given by $\delta(q_0, 1, z_0) = \{(q_0, Xz_0)\}$ $\delta(q_0, \epsilon, z_0) = \{(q_0, \epsilon)\}$ ... $\delta(q_0, 0, z_0) = \{(q_0, z_0)\}$ What is the language accepted by this PDA by empty stack? Describe informally the working of the PDA
commented
in
Theory of Computation
Feb 4, 2017
5.0k
views
gate1998
theory-of-computation
pushdown-automata
descriptive
4
answers
9
GATE CSE 2015 Set 2 | Question: 24
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.
commented
in
CO and Architecture
Jan 31, 2017
11.8k
views
gatecse-2015-set2
co-and-architecture
cache-memory
easy
numerical-answers
3
answers
10
GATE CSE 1993 | Question: 8.5
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
commented
in
Set Theory & Algebra
Jan 30, 2017
7.9k
views
gate1993
set-theory&algebra
partial-order
easy
6
answers
11
GATE CSE 1997 | Question: 3.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above
commented
in
Set Theory & Algebra
Jan 29, 2017
10.8k
views
gate1997
set-theory&algebra
group-theory
normal
5
answers
12
GATE CSE 2014 Set 3 | Question: 44
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write ... cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
commented
in
CO and Architecture
Jan 26, 2017
19.6k
views
gatecse-2014-set3
co-and-architecture
cache-memory
numerical-answers
normal
11
answers
13
GATE CSE 1994 | Question: 1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$
commented
in
DS
Jan 26, 2017
23.4k
views
gate1994
data-structures
array
normal
20
answers
14
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
commented
in
Computer Networks
Jan 25, 2017
34.5k
views
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
5
answers
15
GATE CSE 2006 | Question: 82
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
commented
in
Computer Networks
Jan 23, 2017
19.2k
views
gatecse-2006
computer-networks
bridges
normal
1
answer
16
ravula test series
Which of the following statements is/are TRUE? S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt on an infinite number of strings. S2: The language A'TM={⟨M,w⟩ | M does not accept w} is Turing recognizable.
commented
in
Theory of Computation
Jan 17, 2017
641
views
1
answer
17
Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure: void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$
commented
in
GATE
Jan 17, 2017
688
views
tbb-mockgate-1
data-structures
priority-queue
13
answers
18
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
commented
in
Operating System
Jan 17, 2017
19.9k
views
gate1997
operating-system
process-synchronization
normal
1
answer
19
turing machine
Consider the following languages: Lne={〈M〉│L(M)≠ф } Le={〈M〉│L(M)=ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.
commented
in
Theory of Computation
Jan 15, 2017
381
views
theory-of-computation
6
answers
20
GATE CSE 1992 | Question: 12-b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ ... at time $t=-2$. Determine the total number of page faults and the average number of page frames used by computing the working set at each reference.
commented
in
Operating System
Jan 15, 2017
8.9k
views
gate1992
operating-system
memory-management
normal
descriptive
2
answers
21
binary heap
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ? According to my understanding the largest element has to be a leaf and since leafs can be on two levels last and second last therefore the probability should be 1/2
commented
in
DS
Jan 15, 2017
1.6k
views
data-structures
binary-heap
geeksforgeeks-test-series
0
answers
22
Which of the following is CSL?
commented
in
Theory of Computation
Jan 15, 2017
509
views
1
answer
23
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
commented
in
Operating System
Jan 14, 2017
10.6k
views
gatecse-2011
operating-system
process-scheduling
normal
1
answer
24
TOC Decidability
Are the following problems decidable? 1.{⟨M⟩∣M is a TM and there exist an input whose length is less than 100, on which M halts} I think we can simulate all the combinations of strings whose length is less than 100,and if the machine halts for any of them ... these words are not accepted by machine,Can it hang the machine?Is it also RE but NOT REC Please correct if I am going wrong
answered
in
Theory of Computation
Jan 14, 2017
458
views
decidability
theory-of-computation
2
answers
25
DS-CLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
commented
in
DS
Jan 13, 2017
2.5k
views
data-structures
time-complexity
algorithms
linked-list
2
answers
26
the number of generators of the group { 0,1,2........... 14} under the group operation addition modulu 15 is
commented
in
Set Theory & Algebra
Jan 12, 2017
2.7k
views
set-theory&algebra
group-theory
generators
2
answers
27
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
commented
in
Programming
Jan 12, 2017
1.9k
views
binary-search-tree
data-structures
time-complexity
2
answers
28
NCFL,CFL,PDA
L1={wlwR∣w∈{a,b}∗,l∈{a,b} } which type of language is this DCFL or NDCFL? (note that l∈{a,b} not {a,b}*) I feel its NDCFL can you also tell how PDA will look like?
comment reshown
in
Theory of Computation
Jan 12, 2017
1.2k
views
1
answer
29
Decidable/Undecidable
Let A = {<M>|M is a TM and L(M) is regular}. Then A is _________ a) Decidable language and regular language b) Undecidable but partially decidable c) Totally not decidable d) Decidable language but not regular language
answered
in
Theory of Computation
Jan 12, 2017
559
views
theory-of-computation
decidability
2
answers
30
DS-BST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
answered
in
DS
Jan 12, 2017
619
views
data-structures
tree
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.8k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.5k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent Blog Comments
This story is same like my tier 3 college btech...
@Nikhil_dhamaHi , now i am in 2nd semester...
You can attempt now:...
where is the free test link ? how i can attempt...
Left with 10days, nothing heard back from them,...