Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sudharshan
6
answers
1
GATE CSE 2019 | Question: GA-6
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
The police arrested four criminals – $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements:$P$ says “Q committed the crime.”$Q$ says ...
12.4k
views
commented
Feb 12, 2019
Verbal Aptitude
gatecse-2019
verbal-aptitude
verbal-reasoning
2-marks
+
–
1
answer
2
Find the no. of tokens
Find no of tokens in below program. #include<stdio.h> main() { int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5); }
Find no of tokens in below program.#include<stdio.h>main(){ int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5);}
5.3k
views
answered
Feb 1, 2019
Compiler Design
compiler-tokenization
lexical-analysis
+
–
5
answers
3
GATE IT 2006 | Question: 79
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX ... is used. The number of clock cycles required to complete the sequence of instructions is $10$ $12$ $14$ $16$
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The...
17.3k
views
commented
Jan 30, 2019
CO and Architecture
gateit-2006
co-and-architecture
pipelining
normal
+
–
3
answers
4
GATE CSE 2010 | Question: 33
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ... $13$ $15$ $17$ $19$
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID,...
22.1k
views
commented
Jan 26, 2019
CO and Architecture
gatecse-2010
co-and-architecture
pipelining
normal
+
–
4
answers
5
TIFR CSE 2017 | Part A | Question: 5
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins? $3^{35}$ $3^{50}-2^{50}$ $\binom{35}{2}$ $\binom{50}{15} \cdot 3^{35}$ $\binom{37}{2}$
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins?$3^{35}$$3^{50}-2^{50}$$\binom{35}{2}$$\bino...
4.1k
views
commented
Jan 25, 2019
Combinatory
tifr2017
combinatory
discrete-mathematics
normal
balls-in-bins
+
–
1
answer
6
Virtual Gate Test Series: Algorithms - Time Complexity
An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$ either $\{A[i] > max{A[i − 1], A[i + 1]}\},$ or $\{A[i] < min{A[i − 1], A[i + 1]}\}.$ What is the time-complexity of the fastest ... $O( \sqrt{n})$ $(C) O( \sqrt{n})$ but not $O(log n)$ $(D) O(log n)$ but not $O(1)$
An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$either $\{A[i] max{A[i − 1], A[i + 1]}\},$ or $\{A[i]...
380
views
commented
Jan 25, 2019
Algorithms
algorithms
time-complexity
virtual-gate-test-series
+
–
2
answers
7
Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex...
835
views
asked
Jan 24, 2019
Graph Theory
discrete-mathematics
graph-theory
test-series
+
–
1
answer
8
class of the languages
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy | x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? (A) L is regular, but not context-free. (B) L is context-free, but not regular. (C) L is Σ*. (D) None of these.
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy...
678
views
commented
Jan 24, 2019
Theory of Computation
identify-class-language
theory-of-computation
context-free-language
+
–
7
answers
9
Number of conflict
Consider the grammar given below S⟶ SS | a | ∈ The number of inadequate states in the DFA of LR(1) items is (a) 1 (b) 2 (c) 3 (d) 4
Consider the grammar given belowS⟶ SS | a | ∈The number of inadequate states in the DFA of LR(1) items is(a) 1 (b) 2 (c) 3 (d) 4
7.3k
views
commented
Jan 24, 2019
Compiler Design
compiler-design
grammar
parsing
lr-parser
+
–
1
answer
10
Analysis OF Kruskal's Algorithm
I have seen many varients of complexities using diferent data structures in implementing Kruskal Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
I have seen many varients of complexities using diferent data structures in implementing Kruskal Agorithm. Can you pls post standard algorithm and tells me in details ho...
4.7k
views
commented
Jan 15, 2019
Algorithms
algorithms
kruskals-algorithm
+
–
0
answers
11
General
What is the difference between wheel and cycle in GRAPH THEORY
What is the difference between wheel and cycle in GRAPH THEORY
162
views
commented
Jan 9, 2019
6
answers
12
GATE CSE 2003 | Question: 33
Consider the following formula and its two interpretations \(I_1\) and \(I_2\). \(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg Q_{yy} \right]\right] \Rightarrow (\forall x)\left[\neg P_x\right]\) \(I_1\) : Domain: ... I_1\) does not Neither \(I_1\) nor \(I_2\) satisfies \(\alpha\) Both \(I_1\) and \(I_2\) satisfies \(\alpha\)
Consider the following formula and its two interpretations \(I_1\) and \(I_2\).\(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg...
15.9k
views
commented
Dec 20, 2018
Mathematical Logic
gatecse-2003
mathematical-logic
difficult
first-order-logic
+
–
0
answers
13
own doubt
can we say that every regular language is a DCFL?
can we say that every regular language is a DCFL?
389
views
asked
Oct 27, 2018
Theory of Computation
theory-of-computation
dcfl
regular-language
+
–
1
answer
14
#sorting
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array and find the minimum of the remaining elements, remove this element and so on until array become empty. In the best case, how many comparisons are needed? A.O(n) B.O(n2) C.O(nlogn) D.None of the above
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array an...
968
views
commented
Sep 21, 2018
Algorithms
algorithms
sorting
time-complexity
+
–
5
answers
15
GATE IT 2007 | Question: 41
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result. ... to execute the above code segment assuming each instruction takes one cycle to execute? $7$ $10$ $13$ $14$
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result.$$\begin{array}{|l|l|c|} \hline \textb...
25.0k
views
commented
Sep 6, 2018
CO and Architecture
gateit-2007
co-and-architecture
machine-instruction
normal
+
–
2
answers
16
GATE2005
Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one 4 byte word is ready it is sent to memory ... DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is____________
Consider a disk drive with the following specifications:16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in ...
1.6k
views
commented
Sep 6, 2018
CO and Architecture
co-and-architecture
io-organization
dma
+
–
1
answer
17
GATE CSE 2002 | Question: 8
Consider the following circuit. $A = a_2a_1a_0$ and $B=b_2b_1b_0$ are three bit binary numbers input to the circuit. The output is $Z=z_3z_2z_1z_0$. R0, R1 and R2 are registers with loading clock shown. The registers are loaded with their input data with the falling ... b. What does the circuit implement?
Consider the following circuit. $A = a_2a_1a_0$ and $B=b_2b_1b_0$ are three bit binary numbers input to the circuit. The output is $Z=z_3z_2z_1z_0$. R0, R1 and R2 are reg...
3.1k
views
commented
Sep 5, 2018
Digital Logic
gatecse-2002
digital-logic
normal
descriptive
digital-counter
+
–
1
answer
18
Floating point
What is the result of evaluating the following two expressions using three digit floating point arithmetic using three digit floating point arithmetic with rounding (113. + -111. ) + 7.51 113. + (-111. + 7.51) a) 9.51 and 10.0 respectively b)10.0 and 9.51 respectively c) 9.51 and 9.51 respectively d) 10.0 and 10.0 respectively
What is the result of evaluating the following two expressions using three digit floating point arithmetic using three digit floating point arithmetic with rounding(113. ...
602
views
commented
Sep 4, 2018
1
answer
19
CMI2011-A-10
Consider the following functions $f$ and $g$: f(){ x = x+1; x = y*y; x = x-y; } g(){ y = y+1; y = x*x; y = y-x; } Suppose we start with initial values of $1$ for $x$ and $2$ for $y$ and then execute $f$ and $g$ in parallel-that is, at each step we either execute one ... of the following is not a possible final state? $x = 2, y = 2$ $x = 5, y = -1$ $x = -63, y = 72$ $x = 32, y = 5$
Consider the following functions $f$ and $g$:f(){ x = x+1; x = y*y; x = x-y; }g(){ y = y+1; y = x*x; y = y-x; }Suppose we start with initial values of $1$ for $x$ and $2$...
533
views
answered
May 3, 2017
Operating System
cmi2011
operating-system
concurrency
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register