Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
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
18
views
arpit.jha
asked
13 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: W ... + 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
12
views
zdwew
asked
15 hours
ago
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
16
views
WangJIan
asked
15 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
23
views
sainiaditya9896
asked
2 days
ago
0
votes
0
answers
5
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
0
answers
6
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
4 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
self-doubt
+
–
0
votes
0
answers
7
Dbms indexing
Reenadayal
30
views
Reenadayal
asked
5 days
ago
Databases
databases
indexing
+
–
0
votes
0
answers
8
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
121
views
Sandeep Attri
asked
May 10
Computer Networks
computer-networks
go-back-n
selective-repeat
+
–
0
votes
0
answers
9
IISC CSA Ph.D Test/Interview
Got call letter for IISC CSA Ph.D interview. Requesting you to share preparation tips or sample interview/test questions. Thank you
Got call letter for IISC CSA Ph.D interview. Requesting you to share preparation tips or sample interview/test questions. Thank you
praneshk
45
views
praneshk
asked
May 9
0
votes
0
answers
10
Ardens's theorem
I have a doubt in ardens theorem problem A=Ba+Ab B=Aa+Bb Assume B is final state Hence By ardens theorem A becomes A=Bab* . Hence B=Aa+Bb => Bab*a+Bb Therefore B=B(ab*a+b) is the final answer I get . But B is not in form of R=R+ST(ie. B=B(ab*a+b)) what to do? Here S=B,T=ab*a+b, Then what is R?
I have a doubt in ardens theorem problem A=Ba+AbB=Aa+BbAssume B is final state Hence By ardens theorem A becomes A=Bab* .Hence B=Aa+Bb = Bab*a+BbTherefore B=B(ab*a+b) is ...
Vignesh859
44
views
Vignesh859
asked
May 8
Theory of Computation
theory-of-computation
regular-language
regular-grammar
+
–
0
votes
0
answers
11
I have obtained AIR-1433 in GATE CS 2024 with 657 GATE SCORE and OBC-NCL category. Which 2nd get IITs can I get?
shivansh_kr._
55
views
shivansh_kr._
asked
May 7
0
votes
0
answers
12
self doubt
let suppose address of first index of array is n and size of each block of array is u. then the index of second element is a+u. let suppose the array has m elements. what will be the address of the third element of another array of same size, if it's address of second last element is (n - u).
let suppose address of first index of array is n and size of each block of array is u. then the index of second element is a+u.let suppose the array has m elements.what w...
srijankarak_123
70
views
srijankarak_123
asked
May 7
Programming in C
programming-in-c
array
+
–
0
votes
0
answers
13
Does 12th marks matter during admission in IISC, IIT, NIT and IIIT ?
My 12th marks are around 50%, and my PCM marks is even lower. However, my B.Tech CSE has an overall CGPA of around 8 (up to the 7th semester). If I achieve a good rank in exams like GATE or PGEE for IIIT, will there be any issues with my admission?
My 12th marks are around 50%, and my PCM marks is even lower. However, my B.Tech CSE has an overall CGPA of around 8 (up to the 7th semester). If I achieve a good rank in...
blade
76
views
blade
asked
May 6
1
votes
0
answers
14
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be: (a) 9 and 7 (b) 7 and 9 (c) 10 and 12 (d) 6 and 7
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when ...
Reetu Chaudhary
56
views
Reetu Chaudhary
asked
May 6
Operating System
operating-system
demand-paging
page-replacement
least-recently-used
page-fault
+
–
0
votes
0
answers
15
Compiler design
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
Sarahcs
58
views
Sarahcs
asked
May 6
Compiler Design
compiler-design
directed-acyclic-graph
+
–
1
votes
0
answers
16
Counting
Suppose that there are nine students in a discrete mathematics class at a small college. a) Show that the class must have at least five male students or at least five female students. b) Show that the class must have at least three male students or at least seven female students.
Suppose that there are nine students in a discrete mathematics class at a smallcollege.a) Show that the class must have at least five male students or at least five femal...
Nini
70
views
Nini
asked
May 6
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
0
answers
17
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e)
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e)
Ebrahim
60
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
ullman
lexical-analysis
parsing
+
–
0
votes
0
answers
18
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation. a) Quadruple b) Triple c) Indirect Triple Solve the above Question like this example
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation. a) Quadrupleb) Triple c) Indirect Triple Solve the abov...
Ebrahim
42
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
lexical-analysis
parsing
ullman
+
–
1
votes
0
answers
19
Compiler Design
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0) evensum=evensum+ else oddsum=oddsum+i;
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
Ebrahim
48
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
ullman
+
–
0
votes
0
answers
20
Circuit Design
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.
aaryannn
69
views
aaryannn
asked
May 5
Digital Logic
digital-logic
digital-circuits
combinational-circuit
+
–
0
votes
0
answers
21
i am not able to give test
arjun1947
34
views
arjun1947
asked
May 5
0
votes
0
answers
22
OS | File Management | Made Easy Q105
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes of a file that can be accessed by quadruple pointer is 4TB using the ... Answer: 32bits i'm bit confused in the difference between I-Node disk block size and the given disk block size.
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes...
RahulVerma3
41
views
RahulVerma3
asked
May 5
Operating System
operating-system
file-system
+
–
0
votes
0
answers
23
university assignment question
The array-based stack throws an exception when the array's capacity has been reached. Consider the following alternative : create a larger array, using the resize method. The cost of a resize that makes the array larger is proportional to the new size. 1. Suppose we ... and 2 for queues.Note that after the resize, elements may Solutions = O(N^2) O(N) O(N^2) O(N)
The array-based stack throws an exception when the array’s capacity has been reached. Consider the following alternative : create a larger array, using the resize metho...
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
63
views
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
asked
May 5
0
votes
0
answers
24
I am not able to find the link for giving the test
Abhishikta Saha
36
views
Abhishikta Saha
asked
May 4
0
votes
0
answers
25
DFA construction
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w -> {a, b}* | every a in w is immediately followed by bb}
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w - {a, b}* | every a in w is immediately followed by bb}
rdrd44
88
views
rdrd44
asked
May 3
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
26
Regular Expresssion And NFA
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C must begin with ( and end with *) but have no intervening *) . For simplicity, assume the ... b, (, *)}. (a) Provide an NFA that recognizes language C . (b) Present a regular expression that generates C.
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C...
rdrd44
72
views
rdrd44
asked
May 3
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
0
answers
27
Gate 2024
I recently qualified gate with low score of 320. As per last year cutoff I may get CS in NIT goa or NIT puducherry or IIIT tirichy Is it worth if i join in any one of these or are there any options? Please clarify me stuck here for a long time
I recently qualified gate with low score of 320. As per last year cutoff I may get CS in NIT goa or NIT puducherry or IIIT tirichyIs it worth if i join in any one of thes...
Hemchand
57
views
Hemchand
asked
May 3
0
votes
0
answers
28
I just purchased pgee test series, and right after that the PGEE Section of your website is not opening, please help
I am not able to access the pgee test links it shows me "currently unable to handle this request" Please help
babawick6
62
views
babawick6
asked
May 2
0
votes
0
answers
29
View serializable
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y) Please help
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y)Please help
Cjsmwlq
73
views
Cjsmwlq
asked
May 1
Databases
view-serializable
+
–
0
votes
0
answers
30
ISI PCB 2023 Q3
vbsurya
62
views
vbsurya
asked
Apr 30
Graph Theory
discrete-mathematics
graph-theory
vertex-cover
isi2023-pcb
+
–
Page:
1
2
3
4
5
6
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register