GATE CSE
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
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.
Answers by mcjoshi
User mcjoshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User mcjoshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
1
const pointer
The output of below code is_______________. int main() { int i = 120; int *a = &i; foo(&a); printf("%d ", *a); printf("%d ", *a); } void foo(int **const a) { int j = 210; *a = &j; printf("%d ", **a);
answered
Jun 14
in
Programming

115
views
+12
votes
2
GATE2017224
Consider the quadratic equation $x^213x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b$= _____
answered
Feb 28
in
Set Theory & Algebra

1.3k
views
gate20172
polynomials
numericalanswers
+18
votes
3
GATE20172GA8
$X$ is a $30$ digit number starting with the digit $4$ followed by the digit $7$. Then the number $X^3$ will have $90$ digits $91$ digits $92$ digits $93$ digits
answered
Feb 14
in
Numerical Ability

1.4k
views
gate20172
numericalability
numericalcomputation
noofdigits
+16
votes
4
GATE20172GA9
The number of roots of $e^{x}+0.5x^{2}2=0$ in the range [5,5] is 0 1 2 3
answered
Feb 14
in
Numerical Ability

1.6k
views
gate20172
numericalability
normal
maximaminima
calculus
+15
votes
5
GATE2017222
Let $P = \begin{bmatrix}1 & 1 & 1 \\2 & 3 & 4 \\3 & 2 & 3\end{bmatrix}$ and $Q = \begin{bmatrix}1 & 2 &1 \\6 & 12 & 6 \\5 & 10 & 5\end{bmatrix}$ be two matrices. Then the rank of $ P+Q$ is ___________ .
answered
Feb 14
in
Linear Algebra

1.1k
views
gate20172
linearalgebra
eigenvalue
numericalanswers
+24
votes
6
GATE2017247
If the ordinary generating function of a sequence $\big \{a_n\big \}_{n=0}^\infty$ is $\large \frac{1+z}{(1z)^3}$, then $a_3a_0$ is equal to ___________ .
answered
Feb 14
in
Combinatory

1.4k
views
gate20172
permutationsandcombinations
generatingfunctions
numericalanswers
+16
votes
7
GATE2017252
If the characteristic polynomial of a 3 $\times$ 3 matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is 2, then the largest among the absolute values of the eigenvalues of $M$ is _______
answered
Feb 14
in
Linear Algebra

1.4k
views
gate20172
engineeringmathematics
linearalgebra
numericalanswers
eigenvalue
+11
votes
8
GATE2017253
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is _______
answered
Feb 14
in
CO & Architecture

1.5k
views
gate20172
co&architecture
cachememory
numericalanswers
+23
votes
9
GATE2017223
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
answered
Feb 14
in
Graph Theory

1.7k
views
gate20172
graphtheory
numericalanswers
degreeofgraph
+23
votes
10
GATE2017251
Consider the set of process with arrival time ( in milliseonds ) , CPU burst time ( in millisecods) and priority ( $0$ is the highest priority ) shown below . None of the process have I/O burst time Process Arival Time Burst ... P5 9 16 4 The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
answered
Feb 14
in
Operating System

1.9k
views
gate20172
operatingsystem
processschedule
numericalanswers
+4
votes
11
TesT series question
what is the remainder when 4^250 is divided by 14 2^500 /14 = 2^499 / 7 Applying fermats theorem 2^6 mod 7 =1 (2^498 * 2 ) / 7 = remainder should be 2 is it correct???
answered
Jan 31
in
Numerical Ability

168
views
computernetworks
easy
+1
vote
12
GATE2016Session3GA10
A wire of length $340$ mm is to be cut into two parts. One of the parts is to be made into a square and the other into a rectangle where sides are in the ratio of $1:2$. What is the length of the side of the square (in mm) such that the combined area of the square and the rectangle is a MINIMUM? $30$ $40$ $120$ $180$
answered
Jan 22
in
Numerical Ability

236
views
gate2016session3aptitude
+4
votes
13
Compiler Design
How to do this type of QUESTIONS? Consider following grammar : S → S1 + A  A A → D – A  D D → D1 * B  B B → num The number of internal nodes for the parse tree for 5 * 4 + 10 * 6 – 7 – 8
answered
Jan 18
in
Compiler Design

141
views
compilerdesign
+1
vote
14
Digital Logic
Realize (1) 0 (2) 1 (3) Z (4) XZ Your Answer: 3 Correct Answer: 4 Status: incorrect
answered
Jan 18
in
Digital Logic

70
views
digitallogic
multiplexer
+2
votes
15
Compiler Design #2
Consider translation rules : S → S1 * A {S. Val = S1. Val + A. Val} /A {S. Val = A. Val} A → A1  B {A. Val = A1. Val  B. Val} /B {A. Val = B. Val} B → C  B1 {B. Val = C. Val / B1. Val} /C {B. Val = C. Val} C → id { ... Id. Val} Let say output for input 8/4 * 2  6 * 4 is a1 and output for input 6 * 2 / 1  2 * 3 is a2, then a1  a2 is ___________.
answered
Jan 18
in
Compiler Design

77
views
compilerdesign
+3
votes
16
Gate 2016 AG
The sum of the digits of a two digit number is 12. If the new number formed by reversing the digits is greater than the original number by 54, find the original number. (A) 39 (B) 57 (C) 66 (D) 93
answered
Jan 18
in
Verbal Ability

124
views
+5
votes
17
No of Candidate key
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} Number of candidate key in the following relation have?
answered
Jan 18
in
Databases

156
views
databases
candidatekeys
+6
votes
18
Graph Theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
answered
Jan 18
in
Graph Theory

128
views
graphtheory
engineeringmathematics
discretemathematics
+2
votes
19
testbook
Q,R,S are true for sure but how p is true ???
answered
Jan 18
in
Digital Logic

118
views
testbooktestseries
testseries
digitallogic
+4
votes
20
testbook test series
answered
Jan 15
in
Operating System

286
views
diskscheduling
+7
votes
21
test book test
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
answered
Jan 15
in
Operating System

216
views
+6
votes
22
Minimum states in DFA
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
answered
Jan 10
in
Theory of Computation

158
views
theoryofcomputation
minimalstateautomata
dfa
+1
vote
23
Languages
answered
Jan 8
in
Theory of Computation

59
views
theoryofcomputation
madeeasytestseries
+5
votes
24
Gate1993 ECE
A pulse train with a 1 MHz frequency is counted using a 1024 modulus ripple counter using JK flipflops. The maximum propagation delay for each flipflop is ________ nsec.
answered
Jan 8
in
Digital Logic

256
views
digitallogic
+4
votes
25
#digital#counter
I have read somewhere that JK flipflop used as divide by 2 frequency counter is it true ?? if not how to solve given problem??
answered
Jan 8
in
Digital Logic

95
views
+5
votes
26
MATCHING NUMBER
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
answered
Dec 31, 2016
in
Graph Theory

64
views
+18
votes
27
Find the number of integral solutions using generating function
answered
Dec 31, 2016
in
Combinatory

1.4k
views
permutationsandcombinations
combinational
generatingfunctions
+5
votes
28
Recurrance Relation  Recursion Tree
answered
Dec 31, 2016
in
Algorithms

169
views
timecomplexity
recursiontree
+1
vote
29
Mux output
answered
Dec 22, 2016
in
Digital Logic

91
views
digitallogic
+5
votes
30
Solve the Recurrence
Solve the Following Recurrence using Back Substitution Master Theorem $T(n)=T(\sqrt{n})+n+c$ Using Master Theorem Using Master Theorem, put n = $2^{m}$ $ T(n)=T(2^{m})= S(m)$ ie $T(\sqrt{n}) = S(\frac{m}{2})$ Hence the Recurrence Relation will be $S(m)=S( ... T(n^{\frac{1}{2^{k}}})+\sum_{i=1}^{k} n^{\frac{1}{2^{i}}} + kb$ How to proceed further... ?
answered
Dec 22, 2016
in
Algorithms

123
views
algorithms
recurrenceeqation
0
votes
31
Madeeasy test series
An EXOR gate with six variables is as follows Y=A⊕B⊕C⊕D⊕E⊕F The number of min terms in the Boolean expression is_____
answered
Dec 22, 2016
in
Digital Logic

75
views
digitallogic
+7
votes
32
Generating function
What is the coefficient of $\large\color{green}{x^{6}}$ in the following series expansion? $$\color{maroon}{\begin{align*} \frac{1}{1x}.\frac{1}{1x^2}.\frac{1}{1x^3}........ \end{align*}}$$
answered
Dec 22, 2016
in
Combinatory

247
views
generatingfunctions
permutationsandcombinations
+9
votes
33
TIFR2017A7
Consider the sequence $S_0, S_1, S_2, \dots$ defined as follows: $S_0=0, \: S_1=1 \: $ and $S_n=2S_{n1} + S_{n2}$ for $n \geq 2$. Which of the following statements is FALSE? for every $n \geq 1$, $S_{2n}$ is even for every $n \geq 1$, ... odd for every $n \geq 1$, $S_{3n}$ is multiple of 3 for every $n \geq 1$, $S_{4n}$ is multiple of 6 none of the above
answered
Dec 21, 2016
in
Combinatory

178
views
tifr2017
recurrence
+1
vote
34
which of the foll is correct
Consider the grammar G' given below: S → aSa  bSb  a  b  ϵ Which of the following option is incorrect? G is ambiguous G is unambiguous G generates palindrome strings There exists only one left most derivation for a ... am getting only on eparse tree for any string. but,if a grammar needs left factoring then grammar is ambigous..right??
answered
Dec 19, 2016
in
Compiler Design

84
views
compilerdesign
+5
votes
35
proposition Logic
Please explain
answered
Dec 19, 2016
in
Mathematical Logic

95
views
mathematicallogic
+4
votes
36
Half(L)
If L is Regular Language then half (L) = {u  ∃v :  v  =  u  and uv ∊ L} is also Regular Language. Can anyone plz explain this with simple example.
answered
Dec 18, 2016
in
Theory of Computation

426
views
regularlanguages
theoryofcomputation
+5
votes
37
Regular Expression
$$\begin{align*} & \color{blue}{\text{Find regular expression for the following language}} \\ \\ &L = \left \{ xwx \; \; x,w \in \left \{ a+b \right \}^{*} , x \leq 4 \right \} \\ \end{align*}$$
answered
Dec 18, 2016
in
Theory of Computation

163
views
theoryofcomputation
regularexpressions
regularlanguages
+7
votes
38
Regular Expression
Regular Expression for the following Language, $$\begin{align*} L = \left \{ a^{m}b^{n}\;  m \geq 1,n \geq 1,mn \geq 3 \right \} \end{align*}$$
answered
Dec 18, 2016
in
Theory of Computation

177
views
theoryofcomputation
regularexpressions
regularlanguages
+3
votes
39
maths solve
answered
Dec 17, 2016
in
Combinatory

72
views
engineeringmathematics
+4
votes
40
ip packet
a router is blasting out IP packets whose total length (data+header) is 1024 bytes.assume packet live for 10 sec ,what is the max line speed the router can operate at without danger of cycling through the IP DATAGRAM ID number space?
answered
Dec 17, 2016
in
Computer Networks

115
views
Page:
1
2
3
4
next »
27,290
questions
35,142
answers
83,926
comments
33,231
users