Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ਜਗਮੀਤ
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ਜਗਮੀਤ
0
answers
1
Previous Gate year score degrades?
Does previous year gate score degrade for next year. Like if I have say 700 score in 2017. When I apply to some college using 2017 score will it remain 700 or it is reduced this year? what is the criteria?
Does previous year gate score degrade for next year. Like if I have say 700 score in 2017. When I apply to some college using 2017 score will it remain 700 or it is reduc...
517
views
commented
Apr 9, 2018
Written Exam
gatecse-2018
+
–
7
answers
2
GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame?$10,000...
15.9k
views
commented
Sep 2, 2017
Computer Networks
gateit-2008
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
+
–
17
answers
3
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
32.2k
views
commented
Sep 2, 2017
Digital Logic
gatecse-2004
digital-logic
normal
adder
+
–
7
answers
4
GATE CSE 2005 | Question: 83a
Statement for Linked Answer Questions 83a & 83b: Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... a reduce action It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action
Statement for Linked Answer Questions 83a & 83b:Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar pr...
20.1k
views
commented
Feb 7, 2017
Compiler Design
gatecse-2005
compiler-design
parsing
difficult
+
–
1
answer
5
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
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...
6.0k
views
commented
Feb 6, 2017
Theory of Computation
gate1998
theory-of-computation
pushdown-automata
descriptive
+
–
3
answers
6
GATE CSE 1997 | Question: 5.3
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is: $9$ $5$ $8$ None of the above
A micro instruction is to be designed to specify:none or one of the three micro operations of one kind andnone or upto six micro operations of another kindThe minimum num...
11.3k
views
commented
Feb 2, 2017
CO and Architecture
gate1997
co-and-architecture
microprogramming
normal
+
–
1
answer
7
Solve the following Recurrence using any method just help in solving
T(n) = T(n-1) + n
T(n) = T(n-1) + n
648
views
commented
Feb 1, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
4
answers
8
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
21.3k
views
commented
Feb 1, 2017
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
normal
+
–
4
answers
9
GATE CSE 1996 | Question: 10
Let $A = \begin{bmatrix} a_{11} && a_{12} \\ a_{21} && a_{22} \end{bmatrix} \text { and } B = \begin{bmatrix} b_{11} && b_{12} \\ b_{21} && b_{22} \end{bmatrix}$ be two matrices such that $AB=I$ ... $CD =I$. Express the elements of $D$ in terms of the elements of $B$.
Let $A = \begin{bmatrix} a_{11} && a_{12} \\ a_{21} && a_{22} \end{bmatrix} \text { and } B = \begin{bmatrix} b_{11} && b_{12} \\ b_{21} && b_{22} \end{bmatrix}$ be two m...
4.0k
views
commented
Jan 28, 2017
Linear Algebra
gate1996
linear-algebra
matrix
normal
descriptive
+
–
7
answers
10
GATE CSE 1993 | Question: 01.1
The eigen vector $(s)$ of the matrix $\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$ is (are) $(0,0,\alpha)$ $(\alpha,0,0)$ $(0,0,1)$ $(0,\alpha,0)$
The eigen vector $(s)$ of the matrix $$\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$$ is (are)$(0,0,\alpha)$$(\alpha,0,0)$$(0,0,1)$$(0,\al...
11.4k
views
commented
Jan 28, 2017
Linear Algebra
gate1993
eigen-value
linear-algebra
easy
multiple-selects
+
–
4
answers
11
TIFR2010-Maths-A-8
Let $f(x)= |x|^{3/2}, x \in \mathbb{R}$. Then $f$ is uniformly continuous. $f$ is continuous, but not differentiable at $x=0$. $f$ is differentiable and $f ' $ is continuous. $f$ is differentiable, but $f ' $ is discontinuous at $x=0$.
Let $f(x)= |x|^{3/2}, x \in \mathbb{R}$. Then$f$ is uniformly continuous.$f$ is continuous, but not differentiable at $x=0$.$f$ is differentiable and $f ' $ is continuous...
1.4k
views
commented
Jan 28, 2017
Calculus
tifrmaths2010
calculus
differentiation
continuity
+
–
6
answers
12
GATE CSE 2015 Set 3 | Question: 9
The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is $0$ $\frac{1}{2}$ $1$ $\infty$
The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is$0$$\frac{1}{2}$$1$$\infty$
13.1k
views
commented
Jan 27, 2017
Calculus
gatecse-2015-set3
calculus
limits
normal
+
–
1
answer
13
GATE CSE 1995 | Question: 7(B)
Compute without using power series expansion $\displaystyle \lim_{x \to 0} \frac{\sin x}{x}.$
Compute without using power series expansion $\displaystyle \lim_{x \to 0} \frac{\sin x}{x}.$
1.4k
views
commented
Jan 26, 2017
Calculus
gate1995
calculus
limits
numerical-answers
+
–
1
answer
14
Compound automata
Construct the dfa that accepts all the strings of a's and b's where no of a's is even OR no of b's is odd.
Construct the dfa that accepts all the strings of a's and b's where no of a's is even OR no of b's is odd.
1.4k
views
answered
Jan 26, 2017
Theory of Computation
theory-of-computation
compound-automata
+
–
5
answers
15
GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move...
9.3k
views
commented
Jan 26, 2017
Combinatory
gatecse-2007
combinatory
normal
discrete-mathematics
+
–
2
answers
16
GATE2015 EC-1: GA-3
Choose the word most similar in meaning to the given word: Educe Exert Educate Extract Extend
Choose the word most similar in meaning to the given word:EduceExertEducateExtractExtend
1.4k
views
answered
Jan 24, 2017
Verbal Aptitude
gate2015-ec-1
meaning
most-appropriate-alternative
+
–
2
answers
17
Operating System Concepts, 7th Edition, Q12.2
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is: 86,1470, 913 ... , what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for C-SCAN?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. Thedrive is currently serving a request at cylinder 143, and the previousrequest was at cylinder 125. T...
5.6k
views
commented
Jan 24, 2017
Operating System
operating-system
disk-scheduling
disk
normal
+
–
2
answers
18
MST..
Let G(V, E) be an undirected graph with positive edge weights. What is the worst case time complexity to find minimum spanning tree using Kruskal algorithm is implemented using array data structure ? a) O(|E|+|V log V|) b) O(|V| |log V|) c) O(|V2|) d) O(|V| |log2V|)
Let G(V, E) be an undirected graph with positive edge weights. What is the worst case time complexity to find minimum spanning tree using Kruskal algorithm is implemented...
488
views
commented
Jan 24, 2017
Algorithms
minimum-spanning-tree
algorithms
+
–
5
answers
19
GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given:$45, 20, 90, 10, 50, 60, 80, 25, 70.$Assume that the initial position of...
23.4k
views
commented
Jan 23, 2017
Operating System
gatecse-2015-set1
operating-system
disk-scheduling
normal
numerical-answers
+
–
6
answers
20
TIFR CSE 2010 | Part B | Question: 32
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem. process P1 is begin loop Non_critical_section; while not (Turn=1) do skip od; Critical_section_1; Turn:=2; end loop end process P2 is begin ... ), but does not satisfies the requirement (2). Satisfies all the requirement (1), (2), and (3).
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem.process P1 is begin loop Non_critical_section; while no...
4.6k
views
commented
Jan 23, 2017
Operating System
tifr2010
operating-system
process-synchronization
+
–
5
answers
21
GATE CSE 2010 | Question: 23
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables...
17.6k
views
commented
Jan 23, 2017
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
0
answers
22
Evaluation order in return statement
//Consider the following C program #include <stdio.h> int f(int *a,int *b,int c) { if(c == 0) return 1; else { *b = *b-1; *a = *a+1; c = c - 1; return *a + f(a,b,c) + *b; } } int main() { int ... ,c)); return 0; } Doubts : Is there any undefined behaviour according to C language? if NO, then what will be the output ? Please explain with proper explanation.
//Consider the following C program #include <stdio.h int f(int *a,int *b,int c) { if(c == 0) return 1; else { *b = *b-1; *a = *a+1; c = c - 1; return *a + f(a,b,c) + *b; ...
1.5k
views
commented
Jan 23, 2017
Programming in C
programming-in-c
+
–
3
answers
23
GATE CSE 2015 Set 1 | Question: GA-5
Which one of the following combinations is incorrect? Acquiescence - Submission Wheedle - Roundabout Flippancy - Lightness Profligate - Extravagant
Which one of the following combinations is incorrect?Acquiescence - SubmissionWheedle - RoundaboutFlippancy - LightnessProfligate - Extravagant
5.0k
views
commented
Jan 23, 2017
Verbal Aptitude
gatecse-2015-set1
verbal-aptitude
difficult
word-pairs
+
–
4
answers
24
GATE CSE 2006 | Question: 79
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...
8.2k
views
commented
Jan 23, 2017
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
3
answers
25
GATE CSE 1998 | Question: 1.23
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
14.4k
views
comment edited
Jan 22, 2017
Combinatory
gate1998
combinatory
normal
+
–
6
answers
26
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...
23.6k
views
commented
Jan 21, 2017
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
1
answer
27
TOC-NULL Production
TRUE / FALSE All ∈-productions can be removed from any context free grammar.
TRUE / FALSEAll ∈-productions can be removed from any context free grammar.
538
views
answered
Jan 21, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
28
C Program
#include <stdio.h> char *str[]={"FirstSring","Is","Already","Written"}; char **strp[]={str+3,str+2,str+1,str}; char ***strpp=strp; int main(void) { printf("%s",**++strpp); printf("%s",*--*++strpp+3); return 0; } Output of this, and the interpretation?
#include <stdio.h char *str[]={"FirstSring","Is","Already","Written"}; char strp[]={str+3,str+2,str+1,str}; char *strpp=strp; int main(void) { printf("%s", ++strpp); pr...
761
views
commented
Jan 21, 2017
4
answers
29
GATE CSE 2014 Set 1 | Question: 33
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using the optimal replacement policy is__________.
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using ...
7.3k
views
commented
Jan 21, 2017
Operating System
gatecse-2014-set1
operating-system
page-replacement
numerical-answers
+
–
2
answers
30
GATE CSE 1993 | Question: 21
The following page addresses, in the given sequence, were generated by a program: $\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$ This program is run on a demand paged virtual memory system, with main memory size equal to $4$ ... the page references for which page faults occur for the following page replacement algorithms. LRU FIFO Assume that the main memory is initially empty.
The following page addresses, in the given sequence, were generated by a program:$\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$This program is run on a demand paged virtual memory ...
6.5k
views
commented
Jan 21, 2017
Operating System
gate1993
operating-system
page-replacement
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register