The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by Arjun
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
numerical ability
The number of 3 digit numbers which are neither multiples of 11 nor 13 are a) 456 b) 562 c) 662 d) 756
retagged
5 hours
ago
in
Numerical Ability

41
views
factors
1
answer
2
internet
consider the following program main() { int a=5; int*b=&a; printf("%p",b);// .................LINE 1 printf("%d",b);//...................LINE 2 printf("%u",b);//............... ... correct address. C)only line 1 and 3 will always print correct address. D)all the lines i.e line 1 line 2 line 3 will always print correct address.
retagged
5 hours
ago
in
Programming

22
views
programminginc
1
answer
3
What is difference between the following languages a*b*
retagged
5 hours
ago
in
Theory of Computation

32
views
regularexpressions
0
answers
4
Can epsilon be used as a tape alphabet in case of Turing Machine?
edited
5 hours
ago
in
Theory of Computation

29
views
turingmachine
1
answer
5
PRACTICE PAPER
1.Asynchronous mode of transmission is suitable for systems with multiple peripheral devices. a) True b) False 2.The asynhronous BUS mode of transmission allows for a faster mode of data transfer. a) True b) False PLEASE GIVE REASON FOR ANSWER
retagged
6 hours
ago
in
CO & Architecture

18
views
asynchronouscircuit
d
1
answer
6
Whether the following languages are same or not
retagged
6 hours
ago
in
Theory of Computation

23
views
regularexpressions
0
answers
7
dense index
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate until the final level of index has only one block? a) n/3^n b) log3n c) n/4^n d)log10n
retagged
7 hours
ago
in
Databases

26
views
indexing
1
answer
8
self doubt
min no. of tables ? (participation of dependent is total)
retagged
7 hours
ago
in
Databases

29
views
erdiagram
2
answers
9
Memory overhead in Multilevel paging with TLB
retagged
7 hours
ago
in
Operating System

47
views
multilevelpaging
paging
tlb
1
answer
10
self doubt
4th and 5th normal form are in gate syllabus?
retagged
9 hours
ago
in
Databases

31
views
databasenormalization
0
answers
11
self doubt
if a boolean function having cyclic prime implicants kmap then the function is having how many minimal form?? F(A,B,C)
retagged
9 hours
ago
in
Digital Logic

20
views
booleanexpressions
2
answers
12
self doubt
relation schema with no non trivial fd's then relation is always in bcnf. please someone explain this i am not able to get it.
retagged
9 hours
ago
in
Databases

20
views
functionaldependencies
0
answers
13
TAT Paging
Let Memory access time=20ns Disk Access time is=10ms No TLB is used. Page size=4KB and PTES=64 bytes. Assume that the processes are referenced such that each of its page is referenced only once. However the order of reference is not known. For a process of size 10MB, compute TAT using 2 level and 3 level Paging.
retagged
10 hours
ago
in
Operating System

21
views
virtualmemory
0
answers
14
self doubt dbms
Deletion in B+ tree, unable to get the underflow condition when we deal with http://home.iitj.ac.in/~ramana/ch10st How grouping is done during underflow in B+, IN B we see the most populous sibling and do grouping and merge it.
retagged
10 hours
ago
in
Databases

8
views
btree
2
answers
15
What is the output of following code:
commented
1 day
ago
in
Programming

412
views
1
answer
16
Use of macro instead of function is recommended.
answer selected
1 day
ago
in
Programming

39
views
programminginc
macros
functions
0
answers
17
GATECS2006
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window ... Then optimal Window size is 40 If the RTT=2*Tp then we get Ws = 41, what is the correct approach ?
closed
1 day
ago
in
Computer Networks

13
views
gate2006
computernetworks
slidingwindow
1
answer
18
GATE2017245
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: Cache Read access time (in nanoseconds) Hit ratio Icache 2 0.8 Dcache 2 0.9 L2cache 8 0.9 The read access time ... fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is _________
commented
1 day
ago
in
CO & Architecture

2.7k
views
gate20172
coandarchitecture
cachememory
numericalanswers
1
answer
19
google
main() { int a; scanf("%i"&a); printf("%i %d",a,a); scanf("%d",&a); printf("%i %d",a,a); } suppose user entered 0101 as input .what is printed by above program?
commented
2 days
ago
in
Programming

64
views
programminginc
nongate
1
answer
20
TLB tag bits
retagged
2 days
ago
in
Operating System

43
views
virtualmemory
0
answers
21
Synchronization
retagged
2 days
ago
in
Operating System

34
views
processsynchronization
0
answers
22
FIle system Maximum file size
retagged
2 days
ago
in
Operating System

34
views
filesystem
2
answers
23
Test series
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a timeout ... in msec). Assume window size at the start of slow start phase is 2 KB ans 70 msec ....explain if anyone can?
retagged
2 days
ago
in
Computer Networks

53
views
congestioncontrol
0
answers
24
Recursion
T(n) =$\log$n + T($\sqrt{n}$) How to solve this?
retagged
2 days
ago
in
Programming

30
views
recurrence
0
answers
25
theory of computation 2
how to reduce this type of expression
retagged
2 days
ago
in
Theory of Computation

33
views
theoryofcomputation
regularexpressions
0
answers
26
Functions
Consider the two functions F(x) = 2 logex G(x) = logex2 Both functions are identical or not??
retagged
2 days
ago
in
Set Theory & Algebra

52
views
functions
0
answers
27
Graph Theory
Hi All, For graph theory i have 2 sources, Rosen's Ebook and Narsingh Deo's Graph Theory which i issued from my college's library and I am confused what to refer? Deo's book has much more detailed explanations, but Rosen also seems decent, Which would be better?
retagged
2 days
ago
in
Mathematical Logic

18
views
studyresources
graphtheory
2
answers
28
number system 10's complement
The values of P,Q,R, if 47Q80 is the 10's c complement of RPRP0 are a)4, 3, 2 b) 5,4,4 c)3,4,5 d)2,4,5
retagged
2 days
ago
in
Digital Logic

29
views
numberrepresentation
1
answer
29
google
main() { int a; scanf("%i"&a); printf("%i %d",a,a); scanf("%d",&a); printf("%i %d",a,a); } suppose user entered 0x56 as input .what is printed by above program?
retagged
2 days
ago
in
Programming

25
views
programminginc
nongate
1
answer
30
#TestBook
Suppose in an array A[] , we exchange elements A[i] and A[i+k] , which were originally out of order A) at least 1 and at most 2k1 inversions are removed B) at least 2 and at most 2k inversions are removed C)at least 0 and at most k inversions are removed D) none
retagged
2 days
ago
in
Algorithms

33
views
algorithms
sorting
5
answers
31
GATE2004IT40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, \epsilon), (f, \ ... a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
edited
2 days
ago
in
Theory of Computation

2.3k
views
gate2004it
theoryofcomputation
pushdownautomata
normal
1
answer
32
GATE2005IT46
A line $L$ in a circuit is said to have a $stuckat0$ fault if the line permanently has a logic value $0$. Similarly a line $L$ in a circuit is said to have a $stuckat1$ fault if the line permanently has a logic value $1$. A circuit ... number of distinct multiple $stuckat$ faults possible in a circuit with $N$ lines is $3^N$ $3^N  1$ $2^N  1$ $2$
edited
2 days
ago
in
Combinatory

577
views
gate2005it
permutationsandcombinations
normal
2
answers
33
L= {<TM>  TM halts on every input}
commented
2 days
ago
in
Theory of Computation

700
views
theoryofcomputation
decidability
ricetheorem
2
answers
34
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b. How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choice.So how can i remove choice in this and make it deterministic?
commented
2 days
ago
in
Theory of Computation

39
views
theoryofcomputation
pushdownautomata
contextfreelanguage
deterministiccontextfreegrammars
1
answer
35
required information
In the gate overflow book i found only the previous questions of GATE,ISRO,TIFR etc.,can i get the pdf file of all questions under the RECENT tab i.e, the questions posted by the users for all the subjects.pls reply me.
commented
3 days
ago
in
Study Resources

19
views
gateoverflow
1
answer
36
Which of the following languages are Recursively Enumerable language?
commented
3 days
ago
in
Theory of Computation

969
views
turingmachine
recursiveandrecursivelyenumerablelanguages
theoryofcomputation
4
answers
37
GATE200867
A processor uses 36 bit physical address and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual address ... of the first, second and third level page tables are respectively 20,20,20 24,24,24 24,24,20 25,25,24
commented
3 days
ago
in
Operating System

9.6k
views
gate2008
operatingsystem
virtualmemory
normal
1
answer
38
GATE20022.12
A weightbalanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to ... by which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
3 days
ago
in
DS

2.4k
views
gate2002
datastructure
binarytree
normal
6
answers
39
GATE200750
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2nc$ ... are needed. At most $1.5n2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
commented
3 days
ago
in
Algorithms

2k
views
gate2007
algorithms
timecomplexity
easy
2
answers
40
++k + k++ + + k
class Codechef { public static void main (String[] args) { int k=1; System.out.println(++k + k++ + + k); } } I think the steps are like this ( increment postfix has precedence over prefix): 1. k++ returns 1 to use, then increments k, so k now is 2. ++ ... to the book, the expression is "parsed as ( (++k) + (k++) ) + (+k) which yields 2 + 2 + 3 = 7
commented
3 days
ago
in
Programming

180
views
29,154
questions
36,976
answers
92,136
comments
34,816
users