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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
1
answer
1
ISI2017PCBCS2(a)
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=12345$, then your program should print $s=15$, (2) if $ i=457$, then $s=16$.
answer selected
6 hours
ago
in
Programming

27
views
isi2017pcbcs
programming
programminginc
descriptive
6
answers
2
TIFR2010B32
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem. process P1 is begin loop Non_critical_section; while not (Turn=1) do skip od; Critical_section_1; Turn:=2; end loop end ∥ process P2 is begin loop Non_critical_section; ... (3), but does not satisfies the requirement (2). Satisfies all the requirement (1), (2), and (3).
commented
17 hours
ago
in
Operating System

1.1k
views
tifr2010
operatingsystem
processsynchronization
4
answers
3
GATE19882xii
Consider the following program skeleton and below figure which shows activation records of procedures involved in the calling sequence. $p \rightarrow s \rightarrow q \rightarrow r \rightarrow q.$Write the access links of the activation records to enable correct access and variables in the ... q; procedure r; begin q end r; begin r end q; procedure s; begin q end s; begin s end p;
commented
17 hours
ago
in
Compiler Design

1.2k
views
gate1988
normal
descriptive
runtimeenvironments
compilerdesign
1
answer
4
ISI2018DCG4
The number of terms with integral coefficients in the expansion of $\left(17^\frac{1}{3}+19^\frac{1}{2}x\right)^{600}$ is $99$ $100$ $101$ $102$
commented
19 hours
ago
in
Combinatory

33
views
isi2018dcg
permutationandcombination
binomialtheorem
coefficients
0
answers
5
COMPILERS_DESIGN
Consider the following grammar: E>E+T  T T>T*F  F F>(E)  id A string (id + id ∗ id) is parsed using above grammar. Which of the following statement is correct with respect to above parsing? a. “E+F ∗” is a viable prefix b. “E+F ∗” is a handle c. “T ∗ F” is a viable prefix d. “T ∗ F” is not a handle
closed
2 days
ago
in
Compiler Design

166
views
5
answers
6
GATE2007IT50
Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by $L(P)$ and $L(Q)$ respectively. The automation which recognizes the language $L(P) \cap L(Q)$ is :
answer edited
2 days
ago
in
Theory of Computation

3.4k
views
gate2007it
theoryofcomputation
finiteautomata
normal
3
answers
7
GATE201948
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
commented
2 days
ago
in
Theory of Computation

3.6k
views
gate2019
numericalanswers
theoryofcomputation
finiteautomata
minimalstateautomata
difficult
4
answers
8
GATE2015241
Consider the following routing table at an IP router: $\begin{array}{lll} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96.170.0} & \text{255.255.254.0} & \text{Interface $ ... a, iic, iiie, ivd ia, iid, iiib, ive ib, iic, iiid, ive ib, iic, iiie, ivd
answer selected
Nov 30
in
Computer Networks

3.4k
views
gate20152
computernetworks
subnetting
easy
1
answer
9
Michael Sipser exercise
For each of the following languages, give the minimum pumping length and justify your answer. a. 0001* b. 0*1* c. 001 ∪ 0* 1* d. 0*1$^+$0$^+$1* ∪ 10*1 e. (01)* f. ε g. 1*01*01* h. 10(11*0)*0 i. 1011 j. Σ*
answer edited
Nov 30
in
Theory of Computation

736
views
pumpinglemma
minimumpumpinglength
3
answers
10
ISRO201349
What is the least value of the function $f(x) = 2x^{2}8x3$ in the interval $[0, 5]$? $15$ $7$ $11$ $3$
answer selected
Nov 29
in
Calculus

1.9k
views
isro2013
maximaminima
1
answer
11
GATE2019 CE1: GA10
$P, Q, R, S$ and $T$ are related and belong to the same family. $P$ is the brother of $S, Q$ is the wife of $P$. $R$ and $T$ are the children of the siblings $P$ and $S$ respectively. Which one of the following statement is necessarily FALSE? $S$ is the aunt of $R$ $S$ is the aunt of $T$ $S$ is the sisterinlaw of $Q$ $S$ is the brother of $P$
commented
Nov 25
in
Numerical Ability

94
views
gate2019ce1
generalaptitude
logicalreasoning
familyrelationships
4
answers
12
GATE201851
A processor has $16$ integer registers $(R0, R1, \ldots , R15)$ and $64$ floating point registers $(F0, F1, \ldots , F63).$ It uses a $2 byte$ instruction format. There are four categories of instructions: $Type1, Type2, Type3,$ and $Type4.$ ... $Type4$ category consists of $N$ instructions, each with a floating point register operand $(1F).$ The maximum value of $N$ is _____
commented
Nov 25
in
CO and Architecture

6.6k
views
gate2018
coandarchitecture
machineinstructions
instructionformat
numericalanswers
4
answers
13
BCNF and 3NF
1) dependency preservation 2)lossless join a)If a relation is in 3NF , which of the above points is guaranteed. b)If a relation is in BCNF , which of the above points is guaranteed [ I am confused right now, can I say , if a relation ... using a particular algorithm, then only I can say that the decomposed relations is lossless/dependency preserving same goes for 3NF]. Please help!
commented
Nov 23
in
Databases

4k
views
databases
databasenormalization
3
answers
14
GATE20012.10
The $2's$ complement representation of (539)10 in hexadecimal is $ABE$ $DBC$ $DE5$ $9E7$
answer edited
Nov 19
in
Digital Logic

3.7k
views
gate2001
digitallogic
numberrepresentation
easy
1
answer
15
seek time
the seek time of a disk is 30ms.it rotates at the rate of 30 rotations/second.the capacity of each track is 300 words.the access time is (approximately) guys can any one solve this plzzzz...
commented
Nov 18
in
CO and Architecture

2.7k
views
disks
5
answers
16
TIFR2012A17
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away from the top with probability $2/3$, unless it is at the bottom in which case, it ... function of $n$? It will never reach the top. Linear in $n$. Polynomial in $n$. Exponential in $n$. Double exponential in $n$.
commented
Nov 17
in
Probability

604
views
tifr2012
probability
1
answer
17
ME test series
Consider relation R(A,B,C,D,E,F,G) with the following functional dependencies AB$\rightarrow$CD , D$\rightarrow$B, AF$\rightarrow$D, DE$\rightarrow$F, C$\rightarrow$G, F$\rightarrow$E, G$\rightarrow$A. What is the highest normal form.
commented
Nov 16
in
Databases

77
views
functionaldependencies
7
answers
18
GATE2007IT29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
answer edited
Nov 16
in
DS

12k
views
gate2007it
datastructure
binarysearchtree
normal
1
answer
19
ISI2015DCG48
$\underset{x \to 1}{\lim} \dfrac{x^{\frac{1}{3}}1}{x^{\frac{1}{4}}1}$ equals $\frac{4}{3}$ $\frac{3}{4}$ $1$ None of these
edited
Nov 16
in
Calculus

18
views
isi2015dcg
calculus
limits
4
answers
20
GATE20012.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
commented
Nov 16
in
Digital Logic

2.3k
views
gate2001
digitallogic
normal
multiplexer
0
answers
21
time complexity
what is the time complexity of the $pow(m,n)$ ?
commented
Nov 9
in
Algorithms

80
views
timecomplexity
algorithms
1
answer
22
Use quantifiers to express:>There is exactly one person whom everybody loves
Let L(x, y) be the statement "x loves y," where the do­main for both x and y consists of all people in the world. Use quantifiers to express: Q>There is exactly one person whom everybody ... z=x) ) Can anyone explain the answer and how to solve these questions i mean how to analyze these questions??
commented
Nov 9
in
Mathematical Logic

1.5k
views
2
answers
23
ISRO201738
What is WPA? wired protected access wifi protected access wired process access wifi process access
answer selected
Nov 9
in
Computer Networks

2.1k
views
isro2017
computernetworks
wifi
4
answers
24
ISRO201759
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
reopened
Nov 9
in
DS

2.5k
views
isro2017
datastructure
0
answers
25
Michael Sipser Edition 3 Exercise 5 Question 15 (Page No. 240)
Consider the problem of determining whether a Turing machine $M$ on an input w ever attempts to move its head left at any point during its computation on $w$. Formulate this problem as a language and show that it is decidable.
commented
Nov 8
in
Theory of Computation

37
views
michaelsipser
theoryofcomputation
turingmachine
decidability
proof
2
answers
26
GATE20011.13
A CPU has two modes  privileged and nonprivileged. In order to change the mode from privileged to nonprivileged a hardware interrupt is needed a software interrupt is needed a privileged instruction (which does not generate an interrupt) is needed a nonprivileged instruction (which does not generate an interrupt) is needed
answer reshown
Nov 8
in
Operating System

6.3k
views
gate2001
operatingsystem
normal
osprotection
5
answers
27
GATE2014 AG: GA5
The population of a new city is $5$ million and is growing at $20\%$ annually. How many years would it take to double at this growth rate? $34$ years $45$ years $56$ years $67$ years
answered
Nov 8
in
Numerical Ability

2.2k
views
gate2014ag
numericalability
simplecompoundinterest
normal
6
answers
28
UGCNETJune2015II35
Which phase of compiler generates stream of atoms? Syntax Analysis Lexical Analysis Code Generation Code Optimization
answer edited
Nov 8
in
Compiler Design

1.5k
views
ugcnetjune2015ii
compilerdesign
compiler
1
answer
29
general doubt
MISSPELLING OF KEYWORDS CAUSE WHICH TYPE OF ERROR SYNTAX ERROR OR LEXICAL ERROR?? printf("%d") without any integer argument will cause which type of error??
commented
Nov 5
in
Compiler Design

637
views
compilerdesign
lexicalanalysis
2
answers
30
GATE2006IT39, ISRO200942
Which of the following statements about relative addressing mode is FALSE? It enables reduced instruction size It allows indexing of array element with same instruction It enables easy relocation of data It enables faster address calculation than absolute addressing
commented
Nov 5
in
CO and Architecture

4.7k
views
gate2006it
coandarchitecture
addressingmodes
normal
isro2009
7
answers
31
GATE200745
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
commented
Nov 5
in
Algorithms

7.4k
views
gate2007
algorithms
timecomplexity
normal
2
answers
32
CMI2019A6
Suppose you alternate between throwing a normal sixsided fair die and tossing a fair coin. You start by throwing the die. What is the probability that you will see a $5$ on the die before you see tails on the coin? $\frac{1}{12}$ $\frac{1}{6}$ $\frac{2}{9}$ $\frac{2}{7}$
commented
Nov 5
in
Probability

92
views
cmi2019
probability
fairdie
faircoin
2
answers
33
GATE201143
An $8KB$ directmapped writeback cache is organized as multiple blocks, each size of $32$$bytes$. The processor generates $32$$bit$ addresses. The cache controller contains the tag information for each cache block comprising of the following. $1$ valid bit $1$ modified bit ... controller to store metadata (tags) for the cache? $4864$ $bits$ $6144$ $bits$ $6656$ $bits$ $5376$ $bits$
commented
Nov 4
in
CO and Architecture

3.6k
views
gate2011
coandarchitecture
cachememory
normal
3
answers
34
GATE2015323
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $T$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set of all elements in $T$ which ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
commented
Nov 4
in
Set Theory & Algebra

3.5k
views
gate20153
settheory&algebra
sets
normal
2
answers
35
GATE199525b
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
answer edited
Nov 3
in
Set Theory & Algebra

316
views
gate1995
settheory&algebra
numericalanswers
sets
1
answer
36
GATE2017 CE2: GA3
Four cards lie on table. Each card has a number printed on one side and a colour on the other. The faces visible on the cards are $2,3,$ red, and blue. Proposition: If a card has an even value on one side, then its opposite face is red. The card which MUST be turned over to verify the above proposition are $2,$ red $2,3,$ red $2,$ blue $2,$ red, blue
answer edited
Nov 3
in
Numerical Ability

85
views
gate2017ce2
logicalreasoning
propositionallogic
2
answers
37
GATE200844
The subsetsum problem is defined as follows: Given a set $S$ of $n$ positive integers and a positive integer $W$, determine whether there is a subset of $S$ whose elements sum to $W$. An algorithm $Q$ solves this problem in $O(nW)$ time. ... problem in polynomial time when the input is encoded in binary The subset sum problem belongs to the class NP The subset sum problem is NPhard
commented
Oct 30
in
Algorithms

4.2k
views
gate2008
algorithms
pnpnpcnph
normal
1
answer
38
Time complexity?
We are given a sequence of n nos. a1, a2, a3,.......an, we will assume that all the nos. are distinct. We say two indices i < j form an inversion if ai > aj . How much time will it take to find total no. of inversions in the given array? a) O(n2) b) O(nlogn) c) O(n) d) none of these
answer edited
Oct 30
in
Algorithms

440
views
algorithms
timecomplexity
2
answers
39
GATE19962.22
Consider the circuit in figure. $f$ implements $\overline{A} \overline{B}C + \overline{A}B \overline{C} + ABC$ $A + B + C$ $A \oplus B \oplus C$ $AB + BC + CA$
edited
Oct 29
in
Digital Logic

2.8k
views
gate1996
digitallogic
circuitoutput
easy
multiplexer
2
answers
40
GATE201364
A tourist covers half of his journey by train at $60$ $km/h$, half of the remainder by bus at $30$ $km/h$ and the rest by cycle at $10$ $km/h$. The average speed of the tourist in $km/h$ during his entire journey is $36$ $30$ $24$ $18$
answer edited
Oct 22
in
Numerical Ability

1.8k
views
gate2013
numericalability
easy
speedtimedistance
50,645
questions
56,563
answers
195,732
comments
101,646
users