Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions
0
votes
1
answer
1
Self Doubt : Number of CLK pulse
I have a 3 bit shift register SISO (serial in and serial out) I took 3 CLK (clock) pulse to insert 1 0 1 and now I need to retrive them serially How may CLK pulse I would need ?. I went online and check most of the answers says that for SISO shift registers its takes N-1 CLK pulses but there is no explanation given. Can some one explain me why . Thanks
I have a 3 bit shift register SISO (serial in and serial out) I took 3 CLK (clock) pulse to insert 1 0 1 and now I need to retrive them serially How may CLK pulse I would...
arpit.jha
26
views
arpit.jha
asked
17 hours
ago
Digital Logic
shift-registers
digital-logic
+
–
0
votes
0
answers
2
(Transactions and Schedules in Databases)
Q.3(a): You are given the following schedules involving three transactions (T1, T2, T3) performing operations on database items (A, B, C, D): Schedule S1: T1: R(A), R(B), W(C); T2: W(A), R(B), R(C); T3: ... + 1; write(X). Modify transactions T1 and T2 by adding appropriate lock and unlock instructions to ensure they adhere to the two-phase locking protocol.
Q.3(a): You are given the following schedules involving three transactions (T1, T2, T3) performing operations on database items (A, B, C, D): Schedu...
zdwew
17
views
zdwew
asked
18 hours
ago
Databases
databases
conflict-serializable
two-phase-locking-protocol
+
–
0
votes
0
answers
3
SELF
I am Passing out in 2024, i have given gate 2024 and got 7.5k rank, i did not get selected in placements, now i have no job , my score 456 GEN, now i have three option, take drop but i don't know if i can handle pressure without job, take nit ... am not getting any revert back from any company on off campus .? what should i do, is it good to prepare while studying ni NIT jalandhar??
I am Passing out in 2024, i have given gate 2024 and got 7.5k rank, i did not get selected in placements, now i have no job , my score 456 GEN, now i have three option, t...
WangJIan
20
views
WangJIan
asked
19 hours
ago
0
votes
0
answers
4
Test series
How can i see my result report and rsponse after attempting test of Gateoverflow test series ?
How can i see my result report and rsponse after attempting test of Gateoverflow test series ?
sainiaditya9896
24
views
sainiaditya9896
asked
2 days
ago
0
votes
1
answer
5
self doubt
How a^i b^j | i !=(2j+1) is dcfl?
How a^i b^j | i !=(2j+1) is dcfl?
Vignesh859
93
views
Vignesh859
asked
4 days
ago
Theory of Computation
theory-of-computation
dcfl
pushdown-automata
+
–
0
votes
0
answers
6
self doubt
what's the condition to draw PDA for a^(2j+1)b^j such that j>=1.Since the language L={aaab,aaaaabb,aaaaaaabbb,.......}. Is pda possible?
what's the condition to draw PDA for a^(2j+1)b^j such that j>=1.Since the language L={aaab,aaaaabb,aaaaaaabbb,.......}.Is pda possible?
Vignesh859
36
views
Vignesh859
asked
4 days
ago
Theory of Computation
pushdown-automata
npda
dpda
+
–
0
votes
1
answer
7
Indexing
consider a disk with block size 1024 bytes.A block pointer 6 bytes and record pointer 8 bytes.File has 10000 records.Every record is fixed length of 100 bytes. Its key is SSN which is of 2 bytes. The file is not ordered by the field SSN and want to construct secondary index on SSN.
consider a disk with block size 1024 bytes.A block pointer 6 bytes and record pointer 8 bytes.File has 10000 records.Every record is fixed length of 100 bytes. Its key is...
Reenadayal
45
views
Reenadayal
asked
4 days
ago
Databases
databases
indexing
+
–
1
votes
1
answer
8
Kenneth H. Rosen
Let P (x) be the statement x can speak Russian and let Q(x) be the statement x knows the computer language C++. Express each of these sentences in terms of P (x), Q(x), quantifiers, and logical connectives. The domain for quantifiers consists of ... Every student at your school either can speak Russian or knows C++. d) No student at your school can speak Russian or knows C++.
Let P (x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the computer language C++.” Express each of these sentences in terms of P ...
Tanay1
49
views
Tanay1
asked
4 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
0
votes
0
answers
9
Kenneth H. Rosen
Related to inhabitants of an island on which there are three kinds of people: knights who always tell the truth, knaves who always lie, and spies (called normals by Smullyan [Sm78]) who can either lie or tell the truth. You encounter three people, A, B, and C. ... B- Valid C- Valid YES Spy Knave Knight A- Valid B- Valid C- Valid YES Is my solution correct? Anyone please verify?
Related to inhabitants of an island on which there are three kinds of people: knights who always tellthe truth, knaves who always lie, and spies (called normals by Smully...
Bhaskar_Saini
35
views
Bhaskar_Saini
asked
5 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
self-doubt
+
–
0
votes
0
answers
10
Dbms indexing
Reenadayal
30
views
Reenadayal
asked
5 days
ago
Databases
databases
indexing
+
–
0
votes
1
answer
11
College exam
A person turns 6 times left, 7 times right and again turns 2 times left. If he finds himself in south direction, then find initial direction
A person turns 6 times left, 7 times right and again turns 2 times left. If he finds himself in south direction, then find initial direction
san132302
76
views
san132302
asked
5 days
ago
Analytical Aptitude
general-aptitude
direction-sense
+
–
0
votes
1
answer
12
gate zeal
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 in the set be n and ... correct if there are only n-1 processes instead of n. (d) The barrier implementation is correct for the set of n processes
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...
jugnu1337
61
views
jugnu1337
asked
5 days
ago
Operating System
operating-system
process-synchronization
zeal
+
–
2
votes
1
answer
13
Gate Wallah DPP
Consider the following function: int arc(int i, int j) { if(i<2) return j+2; else if(j<2) return arc(i-1, 1); else return arc(i-1, arc(i, j-2)); } The value returned by arc(2, 6) is _________
Consider the following function:int arc(int i, int j){if(i<2) return j+2;else if(j<2) return arc(i-1, 1);else return arc(i-1, arc(i, j-2));}The value returned by arc(2, 6...
Khushboo Solanki
81
views
Khushboo Solanki
asked
6 days
ago
Programming in C
programming-in-c
numerical-answers
+
–
0
votes
1
answer
14
Functions
Consider the following function: int arc(int i, int j) { if(i<2) return j+2; else if(j<2) return arc(i-1, 1); else return arc(i-1, arc(i, j-2)); } The value returned by arc(2, 6) is ____________
Consider the following function:int arc(int i, int j){if(i<2) return j+2;else if(j<2) return arc(i-1, 1);else return arc(i-1, arc(i, j-2));}The value returned by arc(2, 6...
Khushboo Solanki
51
views
Khushboo Solanki
asked
6 days
ago
Programming in C
functions
+
–
0
votes
2
answers
15
Kenneth H. Rosen - Propositional Logic
Explain, without using a truth table, why (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p) is true when p, q, and r have the same truth value and it is false otherwise.
Explain, without using a truth table, why (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p) is true when p, q, and r have the same truth value and it is false otherwise.
surya k
62
views
surya k
asked
6 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
2
votes
2
answers
16
Kenneth H. Rosen - Propositional Logic
Which of these sentences are propositions? What are the truth values of those that are propositions? a) Boston is the capital of Massachusetts. b) Miami is the capital of Florida. c) 2 + 3 = 5. d) 5 + 7 = 10. e) x + 2 = 11. f ) Answer this question.
Which of these sentences are propositions? What are the truth values of those that are propositions?a) Boston is the capital of Massachusetts.b) Miami is the capital of F...
Tanay1
49
views
Tanay1
asked
6 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
0
votes
1
answer
17
self doubt
For the system of linear equation Ax=0 where matrix A(mxn) , what can we say about the number of solutions for this equation : 1. if all n columns of A are linearly Independent. 2. if less than n columns of A are linearly Independent.
For the system of linear equation Ax=0 where matrix A(mxn) , what can we say about the number of solutions for this equation :1. if all n columns of A are linearly Indepe...
pr4sh4nt
78
views
pr4sh4nt
asked
6 days
ago
Linear Algebra
engineering-mathematics
linear-algebra
system-of-equations
self-doubt
+
–
0
votes
0
answers
18
Consider a 250mb data is transmitted over 25mbps bandwidth link. Suppose the data is divided into 6 frames through 0 to 5 have been transmitted. Now, imagine that 1. 3. 5 times out and acknowledgement for 2, 4 is lost. For this scenario, draw the timing window and find the outstanding packets in sender's and receiver's window using: Go-back-n ARQ Selective Repeat ARQ
Consider a 250mb data is transmitted over 25mbps bandwidth link. Suppose the data is divided into 6 frames through 0 to 5 have been transmitted. Now, imagine that 1. 3. 5...
Sandeep Attri
122
views
Sandeep Attri
asked
May 10
Computer Networks
computer-networks
go-back-n
selective-repeat
+
–
0
votes
0
answers
19
Regarding GO Classes test series
Actually I just recently bought a GO test series, but Iam not able to access it, every time I am trying to click on take a test for GO test series it is redirecting me to subscription site always. And the test I missed earlier, can I access it again?
Actually I just recently bought a GO test series, but Iam not able to access it, every time I am trying to click on take a test for GO test series it is redirecting me to...
suro1234
39
views
suro1234
asked
May 10
GATE
test-series
query
goclasses
+
–
0
votes
1
answer
20
Expression Evaluation
44. Evaluate each of these expressions. a) 1 1000 ∧ (0 1011 ∨ 1 1011) b) (0 1111 ∧ 1 0101) ∨ 0 1000 c) (0 1010 ⊕ 1 1011) ⊕ 0 1000 d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)
44. Evaluate each of these expressions. a) 1 1000 ∧ (0 1011 ∨ 1 1011) b) (0 1111 ∧ 1 0101) ∨ 0 1000 c) (0 1010 ⊕ 1 1011) ⊕ 0 1000 d) (1 1011 ∨ 0 1010) ∧ (...
Abubakar123
66
views
Abubakar123
asked
May 9
Digital Logic
digital-logic
expression-evaluation
+
–
Page:
1
2
3
4
5
6
...
3237
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register