Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
gauravkc
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by gauravkc
0
votes
0
answers
1
Gate questions
https://gateoverflow.in/1657/gate1998-1-20 https://gateoverflow.in/1300/gate2009-8-ugcnet-june2012-iii-58 The answer assumes execution means the execute phase in a pipelined system while in the other answer, execution means the execution of an entire instruction. How ... assume what? Option C is considered as wrong in the first link while it is the correct answer in the second link.
https://gateoverflow.in/1657/gate1998-1-20https://gateoverflow.in/1300/gate2009-8-ugcnet-june2012-iii-58The answer assumes execution means the execute phase in a pipeline...
370
views
asked
Sep 30, 2018
CO and Architecture
interrupts
co-and-architecture
self-doubt
+
–
1
votes
0
answers
2
Algorithms
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
657
views
asked
Jul 27, 2018
Algorithms
algorithms
asymptotic-notation
time-complexity
+
–
2
votes
2
answers
3
C Programming
main() { if(fork()>0) sleep(100); } The given code results in the creation of: I) an orphan process II) a zombie process III) a process that executes forever IV) None of these Can someone explain this?
main(){if(fork()>0)sleep(100);}The given code results in the creation of:I) an orphan processII) a zombie processIII) a process that executes foreverIV) None of these Ca...
9.8k
views
asked
Apr 30, 2018
Programming in C
programming-in-c
programming
output
fork-system-call
+
–
1
votes
1
answer
4
TOC Decidability Theory
Which of the following problems is solvable? a) Writing a universal Turing machine b) Determining if an arbitrary Turing machine is a Universal Turing Machine c) Determining if a universal Turing Machine can be written in fewer than k instructions for some k d) Determining if a universal Turing Machine and some input will halt
Which of the following problems is solvable?a) Writing a universal Turing machineb) Determining if an arbitrary Turing machine is a Universal Turing Machinec) Determining...
5.9k
views
asked
Apr 25, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
+
–
0
votes
1
answer
5
PGEE sample paper
Choose the digital building blocks from the following list using which we can realize any boolean function. (A) 2-to-1 Multiplexer (B) 4-to-1 Multiplexer (C) 8-to-1 Multiplexer (D) 16-to-1 Multiplexer (E) None of the above
Choose the digital building blocks from the following list using which we can realize any boolean function.(A) 2-to-1 Multiplexer(B) 4-to-1 Multiplexer(C) 8-to-1 Multiple...
3.2k
views
asked
Apr 19, 2018
Digital Logic
iiith-pgee
boolean-algebra
multiplexer
+
–
0
votes
1
answer
6
C Programming
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]? A. ((((a+i)+j)+k)+l) B. *(*(*(*(a+i)+j)+k)+l) C. (((a+i)+j)+k+l) D. ((a+i)+j+k+l)
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]?A. ((((a+i)+j)+k)+l)B. *(*(*(*(a+i)+j)+k)+l)C. (((a+i)+j)+k+l)D. ...
5.1k
views
asked
Apr 10, 2018
Programming in C
programming-in-c
programming
array
pointers
+
–
1
votes
1
answer
7
Graph Theory
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? $cost(a,b)\geq 6$. $cost(b,e)\geq 5$. $cost(e,f)\geq 5$. $cost(a,d)\geq 4$. $cost(b,c)\geq 4$. Please someone solve and explain :)
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
612
views
asked
Apr 6, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
1
votes
2
answers
8
Graph Theory
Can someone solve this? Also please attempt this question on Algorithms time complexity if interested :) https://gateoverflow.in/210836/algorithms-time-complexity
Can someone solve this?Also please attempt this question on Algorithms time complexity if interested :)https://gateoverflow.in/210836/algorithms-time-complexity
1.2k
views
asked
Apr 5, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
2
votes
1
answer
9
Algorithms time Complexity
What is the time complexity of this code?
What is the time complexity of this code?
859
views
asked
Apr 5, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
test-series
+
–
0
votes
1
answer
10
C Programming
#include<stdio.h> typedef int ARRAY[10][10]; int main() { ARRAY arr[2]; printf("Size is %d",sizeof(arr)); } The program on running produces output Size is $800$ I know typedef is used for providing alternate names to existing datatypes. Can someone explain what's happening? Or correct me
#include<stdio.h typedef int ARRAY[10][10]; int main() { ARRAY arr ; printf("Size is %d",sizeof(arr)); } The program on running produces output Size is $800$I know typede...
289
views
asked
Mar 26, 2018
Programming in C
programming-in-c
output
programming
+
–
1
votes
1
answer
11
Graph Theory
Walk : Vertices may repeat. Edges may repeat (Closed or Open) Trail : Vertices may repeat. Edges cannot repeat (Open) Circuit : Vertices may repeat. Edges cannot repeat (Closed) Path : Vertices cannot repeat. Edges cannot repeat (Open) Cycle : Vertices cannot repeat. Edges cannot repeat (Closed) Can someone verify these terminologies? They are pretty confusing :/
Walk : Vertices may repeat. Edges may repeat (Closed or Open)Trail : Vertices may repeat. Edges cannot repeat (Open)Circuit : Vertices may repeat. Edges cannot rep...
3.0k
views
asked
Mar 26, 2018
Graph Theory
graph-theory
discrete-mathematics
engineering-mathematics
+
–
1
votes
1
answer
12
Operating Systems Paging
Using the page table shown below, translate the physical address $25$ to virtual address. The address length is $16$ bits and page size is $2048$ words while the size of the physical memory is four frames. Page Present (1-In, 0-out) Frame $0$ $1$ $3$ $1$ $1$ $2$ $2$ $1$ $0$ $3$ $0$ - $25$ $6169$ $2073$ $4121$ How to solve this
Using the page table shown below, translate the physical address $25$ to virtual address. The address length is $16$ bits and page size is $2048$ words while the size of ...
687
views
asked
Mar 24, 2018
Operating System
operating-system
paging
memory-management
+
–
0
votes
1
answer
13
Databases
How to find number of conflict equivalent schedules possible :)
How to find number of conflict equivalent schedules possible :)
539
views
asked
Feb 1, 2018
Databases
databases
conflict-serializable
+
–
0
votes
0
answers
14
Digital Logic
Please help me with this How to find minimum number of NAND/ NOR gates for some given expression
Please help me with this How to find minimum number of NAND/ NOR gates for some given expression
320
views
asked
Feb 1, 2018
Digital Logic
digital-logic
+
–
4
votes
1
answer
15
Theory of computation
The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo 5 has ___ states. What is this language?
The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo ...
2.1k
views
asked
Jan 30, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
16
Regular Languages
Language {w | ww=www} is regular. How and what is this language?
Language {w | ww=www} is regular.How and what is this language?
298
views
asked
Jan 30, 2018
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
17
Probability and COA
Can someone explain me these two qns and solution :)
Can someone explain me these two qns and solution :)
384
views
asked
Jan 29, 2018
Probability
co-and-architecture
+
–
2
votes
0
answers
18
Theory of Computation
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)* a) The resulting set is empty b) The resulting set is 00* c) The resulting set is infinite d) None of the above How to solve this?
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)*a) The resulting set is emptyb) The resulting set is 00*c)...
993
views
asked
Jan 29, 2018
Theory of Computation
theory-of-computation
homomorphism
+
–
2
votes
3
answers
19
AVL Tree
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then :- S1: If we insert an element in the tree, maximum 2 Rotations are required to make the Tree AVL again. S2: If we delete an element from the tree, maximum 2 Rotations are required to make tree AVL again Which are correct statements?
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then :-S1: If we insert an element in the tree, maximum 2 Rotations are r...
1.5k
views
asked
Jan 27, 2018
DS
avl-tree
data-structures
tree
+
–
2
votes
1
answer
20
Digital Logic
The total number of comparisons performed in a 8-bit magnitude comparator consist of inputs A[A4, A3, A2, A1] and B[B4, B3, B2, B1] then condition for A>B is : A 255 x 26 B 255 x 27 C 255 x 28 D 255 x 29
The total number of comparisons performed in a 8-bit magnitude comparator consist of inputs A[A4, A3, A2, A1] and B[B4, B3, B2, B1] then condition for A>B is :A 255 x 26B...
1.3k
views
asked
Jan 27, 2018
Digital Logic
digital-logic
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register