Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ankit3009
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ankit3009
0
answers
1
quantifiers to express each of these statements.
Let P(x) be the statement x has a cell phone and M(x,y) be the statement x and y have texted over the cell phone, where the domain for the variables x and y consists of all students in your class. Use quantifiers to ... other student in your class. c) Someone in your class has a cell phone but has not texted with anyone else in your class.
Let P(x) be the statement “x has a cell phone” and M(x,y) be the statement “x and y have texted over the cell phone,” where the domain for the variables x and y c...
462
views
commented
Jul 8, 2022
Mathematical Logic
quantifiers
mathematical-logic
first-order-logic
+
–
8
answers
2
GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). T...
18.9k
views
commented
Mar 27, 2022
CO and Architecture
gatecse-2017-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
1
answer
3
BCD Correction | Made Easy Test Series
why is C incorrect? addition of any two nibbles such as 1000 1000 --------- 0000 Will generate a final carry as 1 0000, which will require the addition of 0110 as 1 0110 to make it correct.
why is C incorrect?addition of any two nibbles such as10001000 -0000Will generate a final carry as 1 0000, which will require the addition of 0110 as 1 0110 to make it...
765
views
comment edited
Jan 31, 2022
Digital Logic
bcd
digital-logic
made-easy-test-series
+
–
1
answer
4
GATE CSE 1987 | Question: 1-III
The above circuit produces the output sequence: $1111\quad 1111\quad0000\quad0000$ $1111 \quad 0000\quad1111\quad0000$ $1111 \quad 0001\quad0011\quad0101$ $1010\quad1010\quad1010\quad1010$
The above circuit produces the output sequence:$1111\quad 1111\quad0000\quad0000$$1111 \quad 0000\quad1111\quad0000$$1111 \quad 0001\quad0011\quad0101$$1010\quad1010\quad...
4.9k
views
commented
Jan 30, 2022
Digital Logic
gate1987
digital-logic
sequential-circuit
flip-flop
digital-counter
+
–
5
answers
5
GATE CSE 2015 Set 2 | Question: 25
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...
21.4k
views
commented
Jan 29, 2022
Operating System
gatecse-2015-set2
operating-system
virtual-memory
easy
numerical-answers
+
–
3
answers
6
GATE CSE 1999 | Question: 1.5
Context-free languages are closed under: Union, intersection Union, Kleene closure Intersection, complement Complement, Kleene closure
Context-free languages are closed under:Union, intersectionUnion, Kleene closureIntersection, complementComplement, Kleene closure
7.4k
views
comment edited
Jan 25, 2022
Theory of Computation
gate1999
theory-of-computation
context-free-language
easy
+
–
2
answers
7
GATE CSE 2021 Set 2 | Question: 12
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free? $L_1 \cap \overline{L_2} \\$ $\overline{\overline{L_1} \cup \overline{L_2}} \\$ $L_1 \cup (L_2 \cup \overline{L_2}) \\$ $(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?$L_1 \cap \overline{L_2} \\$$\overline{\overlin...
9.7k
views
commented
Jan 24, 2022
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
identify-class-language
1-mark
+
–
2
answers
8
Gate CSE Mock Test Series | Unacademy 2022
A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of an acknowledgement is 10 bytes and the transmission rate at the receiver is 8 Kbps. The ... data meaning 1msec → $\frac{100}{70}$ Bytes of data hence 1sec → $\frac{10}{7}X1000$ = 1428.57
A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of...
682
views
commented
Jan 24, 2022
Computer Networks
computer-networks
stop-and-wait
throughput
+
–
1
answer
9
Gate applied test series: Discrete Maths
Anyone with detailed solution?
Anyone with detailed solution?
514
views
commented
Jan 23, 2022
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
+
–
3
answers
10
GATE CSE 2014 Set 2 | Question: 31
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while( ... the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlock-free operation.
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1;void producer() { while(true) { produce(); semWait(...
13.6k
views
commented
Jan 22, 2022
Operating System
gatecse-2014-set2
operating-system
process-synchronization
normal
+
–
1
answer
11
parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
830
views
commented
Jan 21, 2022
Theory of Computation
context-free-language
theory-of-computation
compiler-design
finite-automata
+
–
1
answer
12
2 Phase Locking | Made Easy Test Series
Given Problem : S1 can be shown allowed under 2PL. However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer given is incorrect?
Given Problem : S1 can be shown allowed under 2PL.However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer give...
968
views
commented
Jan 17, 2022
Databases
databases
transaction-and-concurrency
2phaselocking
serializability
+
–
2
answers
13
GATE CSE 2011 | Question: 24
Let $P$ be a regular language and $Q$ be a context-free language such that $Q \subseteq P$. (For example, let $P$ be the language represented by the regular expression $p^*q^*$ and $Q$ be $\{p^nq^n \mid n \in N\})$. Then which of the following is ALWAYS regular? $P \cap Q$ $P-Q$ $\Sigma^*-P$ $\Sigma^*-Q$
Let $P$ be a regular language and $Q$ be a context-free language such that $Q \subseteq P$. (For example, let $P$ be the language represented by the regular expression $p...
9.8k
views
commented
Jan 17, 2022
Theory of Computation
gatecse-2011
theory-of-computation
easy
regular-language
+
–
1
answer
14
2PL | Made Easy Full Syllabus Test
Given problem and solution. It is true that the given schedule is not serializable, what I don't understand is how it is not allowed by the 2PL protocol? Given Schedule : T1 T2 T3 R(A) R(A) R(B) W(B) W(A) R(A) Under 2PL : T1 T3 T3 S(A) R(A) S(A) R(A) S(B) R(B) X(B) W(B) Lock Point U(B) X(A) W(A) Lock Point U(A) S(A) Lock Point U(A)
Given problem and solution. It is true that the given schedule is not serializable, what I don't understand is how it is not allowed by the 2PL protocol?Given Schedule : ...
750
views
commented
Jan 14, 2022
Databases
2phaselocking
made-easy-test-series
+
–
0
answers
15
OS-Multi-Level Paging
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits. The page table is divided into 512 pages each of size 1KB.Page table entry size at $1^{st}$ level is 2 Bytes and at second level is 4 Bytes each. What is ... of 1 page of second level PT=1KB. So, the total required memory overhead=8+1=9KB. Is my analysis and answer both correct?
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits. The page table is divided into 512 pages each of size 1KB.Page table en...
2.0k
views
commented
Jan 12, 2022
Operating System
operating-system
multilevel-paging
+
–
0
answers
16
Multi-level Paging
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?
377
views
commented
Jan 12, 2022
7
answers
17
GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...
14.3k
views
commented
Jan 12, 2022
Theory of Computation
gatecse-2020
theory-of-computation
decidability
2-marks
+
–
6
answers
18
GATE CSE 2005 | Question: 55
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language
Consider the languages:$L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m 0\right\}$Which one of the following statements is FALSE?$L_1...
8.6k
views
commented
Jan 11, 2022
Theory of Computation
gatecse-2005
theory-of-computation
identify-class-language
normal
+
–
1
answer
19
Applied Test Series: Live Mock
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexing starts at 0 what would be the address of element with index (25,25)), ... integer takes up two bytes of memory.___ Need help in this one. Didn't get the solution properly provided by them. Anyone!
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexin...
717
views
commented
Jan 10, 2022
DS
test-series
data-structures
array
+
–
1
answer
20
Cyclic prime implicant/Minterm and maxterm
1.How many minterms are there in 3 variable boolean operation? is it 2^n?If yes then how https://gateoverflow.in/26487/how-many-minterms-are-present-in-8-input-exor-gate is true? 2.How many prime implicants are in cyclic prime implicant ... was:- Number of minterms Is it number of minterms or no. of minterms which are 1?In either case ,ways please explain
1.How many minterms are there in 3 variable boolean operation?is it 2^n?If yes then how https://gateoverflow.in/26487/how-many-minterms-are-present-in-8-input-exor-gate i...
2.9k
views
commented
Jan 7, 2022
Digital Logic
digital-logic
k-map
prime-implicants
+
–
1
answer
21
GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,int a[10] [3...
8.8k
views
commented
Jan 7, 2022
Compiler Design
gatecse-2016-set2
compiler-design
grammar
normal
+
–
0
answers
22
ToC Test series doubt(ACE)
I am getting A,C and D but the answer given is A,C.
I am getting A,C and D but the answer given is A,C.
265
views
comment reshown
Jan 5, 2022
Theory of Computation
theory-of-computation
+
–
2
answers
23
#Gate CS Applied Course Mock Test
Is this Language a CFL? If yes, Can you please explain the implementation.
Is this Language a CFL?If yes, Can you please explain the implementation.
581
views
commented
Jan 4, 2022
Theory of Computation
theory-of-computation
context-free-language
context-free-grammar
+
–
2
answers
24
Self doubt in CLR(1)
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
470
views
commented
Jan 4, 2022
Compiler Design
compiler-design
parsing
+
–
4
answers
25
GATE CSE 2021 Set 2 | Question: 38
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined: $\text{USE}(S)$ : the set of variables used in $S$ $\text{IN}(S)$ : the set of variables that are live at the entry of $S$ $\text{OUT}(S)$ : the set of variables ... S_2$) }\cup \text{ OUT ($S_2$)}$ $\text{OUT ($S_1$)} = \text{USE ($S_1$)} \cup \text{IN ($S_2$)}$
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined:$\text{USE}(S)$ : the set of variables used in $S$$\text{IN}(S)$ : t...
6.7k
views
commented
Dec 29, 2021
Compiler Design
gatecse-2021-set2
code-optimization
live-variable-analysis
compiler-design
2-marks
+
–
2
answers
26
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements ifa)n=1 b) n=2 c) n=3
46.5k
views
commented
Dec 29, 2021
1
answer
27
#aktu #aktu 2016-17
please provide the solution
please provide the solution
585
views
commented
Dec 29, 2021
Algorithms
algorithms
knapsack-problem
+
–
1
answer
28
Self doubt
How many ‘n’ state FA are possible with ‘m’ symbols with – (i) Designated initial state (ii) With designated initial and final state (iii) With no designated initial and final state How can I approach this?
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
755
views
commented
Dec 28, 2021
Theory of Computation
self-doubt
theory-of-computation
finite-automata
+
–
1
answer
29
Made Easy Test Series
532
views
commented
Dec 27, 2021
Databases
made-easy-test-series
databases
+
–
1
answer
30
APPLIED ROOTS Multisubject test
Consider a 32-bit microprocessor that has an on-chip 16-KByte four-way set-associative cache. Assume that the cache has a line size of four 32-bit words.Where in the cache (Set number in decimal) is the word from memory location ABCDE888 mapped?
Consider a 32-bit microprocessor that has an on-chip 16-KByte four-way set-associative cache. Assume that the cache has a line size of four 32-bit words.Where in the cach...
434
views
commented
Dec 26, 2021
CO and Architecture
computer-architecture
cache-memory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register