Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User 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.
asked
in
CO and Architecture
Sep 30, 2018
374
views
interrupts
co-and-architecture
self-doubt
1
vote
0
answers
2
Algorithms
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
asked
in
Algorithms
Jul 27, 2018
692
views
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?
asked
in
Programming in C
Apr 30, 2018
9.8k
views
programming-in-c
programming
output
fork-system-call
1
vote
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
asked
in
Theory of Computation
Apr 25, 2018
5.9k
views
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
asked
in
Digital Logic
Apr 19, 2018
3.2k
views
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)
asked
in
Programming in C
Apr 10, 2018
5.1k
views
programming-in-c
programming
array
pointers
1
vote
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 :)
asked
in
Graph Theory
Apr 6, 2018
622
views
graph-theory
discrete-mathematics
graph-connectivity
1
vote
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
asked
in
Graph Theory
Apr 5, 2018
1.2k
views
graph-theory
discrete-mathematics
graph-connectivity
2
votes
1
answer
9
Algorithms time Complexity
What is the time complexity of this code?
asked
in
Algorithms
Apr 5, 2018
888
views
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
asked
in
Programming in C
Mar 26, 2018
304
views
programming-in-c
output
programming
1
vote
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 :/
asked
in
Graph Theory
Mar 26, 2018
3.0k
views
graph-theory
discrete-mathematics
engineering-mathematics
1
vote
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
asked
in
Operating System
Mar 24, 2018
735
views
operating-system
paging
memory-management
0
votes
1
answer
13
Databases
How to find number of conflict equivalent schedules possible :)
asked
in
Databases
Feb 1, 2018
568
views
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
asked
in
Digital Logic
Feb 1, 2018
327
views
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?
asked
in
Theory of Computation
Jan 30, 2018
2.1k
views
theory-of-computation
0
votes
1
answer
16
Regular Languages
Language {w | ww=www} is regular. How and what is this language?
asked
in
Theory of Computation
Jan 30, 2018
305
views
theory-of-computation
regular-language
0
votes
1
answer
17
Probability and COA
Can someone explain me these two qns and solution :)
asked
in
Probability
Jan 29, 2018
403
views
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?
asked
in
Theory of Computation
Jan 29, 2018
1.0k
views
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?
asked
in
DS
Jan 27, 2018
1.5k
views
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
asked
in
Digital Logic
Jan 27, 2018
1.3k
views
digital-logic
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...