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 a selected answer
1
votes
0
answers
31
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
47
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
ullman
+
–
0
votes
0
answers
32
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
66
views
aaryannn
asked
May 5
Digital Logic
digital-logic
digital-circuits
combinational-circuit
+
–
0
votes
0
answers
33
i am not able to give test
arjun1947
31
views
arjun1947
asked
May 5
0
votes
0
answers
34
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
35
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...
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
62
views
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
asked
May 5
0
votes
0
answers
36
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
37
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
87
views
rdrd44
asked
May 3
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
38
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
71
views
rdrd44
asked
May 3
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
0
answers
39
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
40
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
41
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
72
views
Cjsmwlq
asked
May 1
Databases
view-serializable
+
–
0
votes
0
answers
42
ISI PCB 2023 Q3
vbsurya
62
views
vbsurya
asked
Apr 30
Graph Theory
discrete-mathematics
graph-theory
vertex-cover
isi2023-pcb
+
–
0
votes
1
answer
43
ISI PCB 2023 Q1
Suppose there are three types of people in the world. A person is honest if the person always speaks the truth. A person is a liar if the person always lies. A person is normal if the person sometimes speaks the truth and sometimes lies. In a city ... . C: B is not normal. Based on the above, deduce with appropriate justifications who among A, B and C has committed the crime.
Suppose there are three types of people in the world.A person is “honest” if the person always speaks the truth. A person is a “liar” if the person always lies. A...
vbsurya
162
views
vbsurya
asked
Apr 30
Mathematical Logic
discrete-mathematics
mathematical-logic
isi2023-pcb
+
–
1
votes
0
answers
44
ISI PCB 2023 Q2
vbsurya
47
views
vbsurya
asked
Apr 30
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
isi2023-pcb
+
–
0
votes
1
answer
45
IIT Madras MS DSAI Written Test 2024
Given, that the eigen values of a 2 x 2 matrix are -1,1 and its singular values are 1,0. What is the rank of the matrix? a) rank is 0 b) rank is 1 c) Such a matrix can't exist d) rank is 2
Given, that the eigen values of a 2 x 2 matrix are -1,1 and its singular values are 1,0. What is the rank of the matrix?a) rank is 0b) rank is 1c) Such a matrix can't exi...
harshrajhrj
97
views
harshrajhrj
asked
Apr 30
Linear Algebra
iit-madras
written-test
admissions
linear-algebra
+
–
0
votes
0
answers
46
IIT Madras MS DSAI Written Test 2024
Two fair 6-face diced are tossed independently. Let X be the random variable of the sum of two numbers on dices and let Y be the absolute difference of two numbers on dices. What is the value of P( X $\geq$ 2Y)? a) 22/36 b) 24/36 c) 26/36 c) 28/36 d) 32/36
Two fair 6-face diced are tossed independently. Let X be the random variable of the sum of two numbers on dices and let Y be the absolute difference of two numbers on dic...
harshrajhrj
123
views
harshrajhrj
asked
Apr 30
Probability
iit-madras
written-test
admissions
probability
random-variable
+
–
0
votes
1
answer
47
Divide and conquer
In quick sort, n numbers the (n/10)th element is selected as pivot using n^2 sortimng time complexity what will be the time complexity of quick sort is..... a)O(nlogn) b)O(n^2) c)O(n^3) d)O(n)
In quick sort, n numbers the (n/10)th element is selected as pivot using n^2 sortimng time complexity what will be the time complexity of quick sort is.....a)O(nlogn)b)O(...
Emankashyap
115
views
Emankashyap
asked
Apr 30
Algorithms
divide-and-conquer
algorithms
time-complexity
recurrence-relation
sorting
+
–
0
votes
0
answers
48
exam 2011
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Mokoena
64
views
Mokoena
asked
Apr 29
Compiler Design
compiler-design
parsing
numerical-answers
+
–
0
votes
0
answers
49
Consider the following segment table: Segment Base Length 0 219 600 1 2300 14 2 90 100 3 1327 580 4 1952 96 What are the physical addresses for the following logical addresses? a. 0,430 b. 1,10 c. 2,500 d. 3,400 e. 4,112
Ovie
127
views
Ovie
asked
Apr 29
0
votes
0
answers
50
Memory Bottleneck
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
Ovie
45
views
Ovie
asked
Apr 29
Operating System
operating-system
cpu
main-memory
memory-bottleneck
+
–
1
votes
1
answer
51
David Stirzaker, Elementary Probability, Chapter 1, Example 1.9 Urn
An urn contains $n$ heliotrope and $n$ tangerine balls. A fair die with $n$ sides is rolled. If the $r^{th}$ face is shown, $r$ balls are removed from the urn and placed in a bag. What is the probability that a ball removed at random from the bag is tangerine?
An urn contains $n$ heliotrope and $n$ tangerine balls. A fair die with $n$ sides is rolled. If the $r^{th}$ face is shown, $r$ balls are removed from the urn and placed ...
Priyam Garg
118
views
Priyam Garg
asked
Apr 26
Probability
probability
+
–
1
votes
2
answers
52
Test series question of ace academy
#include<stdio.h> #define ADD(a,b)(a+b) #define SQUARE(x)(x*x) int main() { int x=2; int y=3; int z = ADD(SQUARE(x++),y); printf("%d\n",z); return 0; } What is the output of the above code snippet?
#include<stdio.h>#define ADD(a,b)(a+b)#define SQUARE(x)(x*x)int main(){int x=2;int y=3;int z = ADD(SQUARE(x++),y);printf("%d\n",z);return 0;}What is the output of the abo...
Ayush_Pal
189
views
Ayush_Pal
asked
Apr 26
Programming in C
ace-test-series
+
–
0
votes
1
answer
53
CPU Scheduling
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to know is there any faster way to get solutions . Please provide any resource if available. Thanks
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to kn...
arpit.jha
125
views
arpit.jha
asked
Apr 26
Operating System
operating-system
process-scheduling
cpu
scheduling
+
–
0
votes
1
answer
54
Kenneth H. Rosen, Chapter 1
When three professors are seated in a restaurant, the hostess asks them: Does everyone want coffee? The first professor says: I do not know. The second professor then says: I do not know. Finally, the third professor says: No, not ... wants coffee. The hostess comes back and gives coffee to the professors who want it. How did she figure out who wanted coffee?
When three professors are seated in a restaurant, the hostess asks them: “Does everyone want coffee?” The first professor says: “I do not know.” The second profe...
ENTJ007
92
views
ENTJ007
asked
Apr 26
Mathematical Logic
discrete-mathematics
mathematical-logic
kenneth-rosen
+
–
0
votes
0
answers
55
B- tree in DBMS
SandeepKumar147
103
views
SandeepKumar147
asked
Apr 25
Databases
databases
b-tree
+
–
1
votes
0
answers
56
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved?
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...
paressep28
104
views
paressep28
asked
Apr 25
Theory of Computation
theory-of-computation
regular-expression
minimal-state-automata
finite-automata
pushdown-automata
+
–
0
votes
0
answers
57
Memory management
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 requests 6 KB of memory. Process P3 requests 12 KB of memory. Process P4 requests 4 KB of ... requests 8 KB of memory. The system uses the following memory allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes:• Process P1 requests 10 KB of memory.• Process P2 r...
Sahun
98
views
Sahun
asked
Apr 25
Operating System
memory
memory-management
+
–
2
votes
1
answer
58
algorithms
for (i = 1; i <= N; i++){ for (j= 1;j <= i^2;j=j+i) { //some code} } how is this O(n^2)? explain in detail and simple terms
for (i = 1; i <= N; i++){ for (j= 1;j <= i^2;j=j+i){ //some code}} how is this O(n^2)? explain in detail and simple terms
SSR17
100
views
SSR17
asked
Apr 25
Algorithms
algorithms
time-complexity
+
–
0
votes
1
answer
59
B tree dbms
SandeepKumar147
50
views
SandeepKumar147
asked
Apr 25
Databases
binary-tree
+
–
0
votes
0
answers
60
IITM research aptitude paper 2024
In a wholesale shop, there are three brands of pens. Brand A comes in packs of $5$. Brand B comes in packs of $4$. Brand C comes in packs of $3$ . A customer wants to buy $122$ pens from these three brands buying at least $1$ from ... in a total of $30$ packs and he bought from each brand, as specified. In how many ways (combinations) can the customer buy this?
In a wholesale shop, there are three brands of pens. Brand A comes in packs of $5$. Brand B comes in packs of $4$.Brand C comes in packs of $3$. A customer wants to buy ...
Hira Thakur
87
views
Hira Thakur
asked
Apr 25
Page:
« prev
1
2
3
4
5
6
7
...
1541
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register