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
21
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
73
views
Abubakar123
asked
May 9
Digital Logic
digital-logic
expression-evaluation
+
–
0
votes
0
answers
22
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
50
views
praneshk
asked
May 9
0
votes
1
answer
23
Testbook question
Consider a computer C1 has n CPUs and k processes. Which of the following statements are False? a). The maximum number of processes in ready state is K. b). The maximum number of processes in block state is K. c). The maximum number of processes in running state is K. d). The maximum number of processes in running state is n.
Consider a computer C1 has n CPUs and k processes. Which of the following statements are False?a). The maximum number of processes in ready state is K.b). The maximum num...
iMohitPant
102
views
iMohitPant
asked
May 9
Operating System
operating-system
process-scheduling
multiple-selects
testbook-test-series
+
–
0
votes
2
answers
24
virtual address translation
A paging system uses 16 bit address and 4K page. The following shows the page table of a process 1. Page No Frame No 0 6 1 3 2 0 3 2 Process I has a virtual address 16064 the physical address of the process is A) 4096 8) 3712 C) 8192 D) 11,968
A paging system uses 16 bit address and 4K page. The following shows the page table of a process 1.Page No Frame No0 ...
Reetu Chaudhary
138
views
Reetu Chaudhary
asked
May 8
Operating System
operating-system
paging
+
–
1
votes
1
answer
25
Kenneth H. Rosen -- Equivalence Realtion Doubt
Find the smallest equivalence relation on the set {a, b, c, d, e} containing the relation {(a, b), (a, c), (d, e)}.
Find the smallest equivalence relation on the set {a, b, c, d, e} containing the relation {(a, b), (a, c), (d, e)}.
Arun_Sharma
50
views
Arun_Sharma
asked
May 8
Study Resources
discrete-mathematics
kenneth-rosen
+
–
0
votes
0
answers
26
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
47
views
Vignesh859
asked
May 8
Theory of Computation
theory-of-computation
regular-language
regular-grammar
+
–
0
votes
0
answers
27
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
1
answer
28
DFA construction
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
Unnati Singh
87
views
Unnati Singh
asked
May 7
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
2
answers
29
DFA construction
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible by two.
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible ...
Unnati Singh
88
views
Unnati Singh
asked
May 7
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
30
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
74
views
srijankarak_123
asked
May 7
Programming in C
programming-in-c
array
+
–
0
votes
0
answers
31
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
82
views
blade
asked
May 6
1
votes
0
answers
32
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
60
views
Reetu Chaudhary
asked
May 6
Operating System
operating-system
demand-paging
page-replacement
least-recently-used
page-fault
+
–
0
votes
0
answers
33
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
61
views
Sarahcs
asked
May 6
Compiler Design
compiler-design
directed-acyclic-graph
+
–
1
votes
0
answers
34
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
80
views
Nini
asked
May 6
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
1
answer
35
Function Composition Question Oscar Levin Qn. 20
Let $f : X \rightarrow Y$ and $g : Y \rightarrow Z$ be functions. We can define the composition of $f$ and $g$ to be the function $g \circ f : X \rightarrow Z$ for which the image of each $x \in X$ is $g( f (x))$. That is, plug ... $f$ and $g$? Explain. (d) Suppose $g \circ f$ is surjective. What, if anything, can you say about $f$ and $g$? Explain.
Let $f : X \rightarrow Y$ and $g : Y \rightarrow Z$ be functions. We can define the composition of $f$ and $g$ to be the function $g \circ f : X \rightarrow Z$ for which ...
Deepak Poonia
80
views
Deepak Poonia
asked
May 5
Set Theory & Algebra
discrete-mathematics
functions
+
–
0
votes
0
answers
36
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
66
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
ullman
lexical-analysis
parsing
+
–
0
votes
0
answers
37
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
44
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
lexical-analysis
parsing
ullman
+
–
1
votes
0
answers
38
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
55
views
Ebrahim
asked
May 5
Compiler Design
compiler-design
syntax-directed-translation
ullman
+
–
0
votes
0
answers
39
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
78
views
aaryannn
asked
May 5
Digital Logic
digital-logic
digital-circuits
combinational-circuit
+
–
0
votes
0
answers
40
i am not able to give test
arjun1947
34
views
arjun1947
asked
May 5
Page:
« prev
1
2
3
4
5
6
7
...
3237
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register