Register
Filter

Answers by mcjoshi

6 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); }
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; ...
80 votes
2
GATE CSE 2017 Set 2 | Question: 24
Consider the quadratic equation $x^2-13x+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=$ _____
Consider the quadratic equation $x^2-13x+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=$ _____
101 votes
3
GATE CSE 2017 Set 2 | Question: GA-8
$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
$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
53 votes
5
GATE CSE 2017 Set 2 | Question: 22
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 ___________ .
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.Th...
96 votes
6
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
75 votes
9
GATE CSE 2017 Set 2 | Question: 23
$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 _________ .
$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 _________ .
5 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???
what is the remainder when 4^250 is divided by 142^500 /14 = 2^499 / 7 Applying fermats theorem 2^6 mod 7 =1 (2^498 * 2 ) / 7 = remainder should be 2 is i...
5 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
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 tre...
2 votes
14
Digital Logic
Realize (1) 0 (2) 1 (3) Z (4) XZ Your Answer: 3 Correct Answer: 4 Status: incorrect
Realize(1)0(2)1(3)Z(4)XZ Your Answer:3Correct Answer: 4 Status: incorrect
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
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...
6 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?
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 relatio...
7 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!
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) 25P.S. Explain wit...
4 votes
20
testbook test series
8 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
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 associat...
8 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\}$
Number of final states in minimal DFA where $\sum = \{ a,b \}$$L = \{ w| n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
5 votes
24
Gate1993 ECE
A pulse train with a 1 MHz frequency is counted using a 1024 modulus ripple counter using JK flip-flops. The maximum propagation delay for each flip-flop is ________ nsec.
A pulse train with a 1 MHz frequency is counted using a 1024 modulus ripple counter using JK flip-flops. The maximum propagation delay for each flip-flop is ________ nsec...
6 votes
25
#digital#counter
I have read somewhere that J-K flip-flop used as divide by 2 frequency counter is it true ?? if not how to solve given problem??
I have read somewhere that J-K flip-flop used as divide by 2 frequency counter is it true ??if not how to solve given problem??
6 votes
26
MATCHING NUMBER
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
5 votes
28
Recurrance Relation - Recursion Tree
On solving the Recurance T(n) = 3T(n/4) + cn2 I was stuck at summation $\sum_{i=0}^{log_4 n} (\frac{3}{16})^{i} cn^{2}$ Can someone could help ?
On solving the RecuranceT(n) = 3T(n/4) + cn2I was stuck at summation$\sum_{i=0}^{log_4 n} (\frac{3}{16})^{i} cn^{2}$Can someone could help ?
2 votes
29
Mux output
6 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})$ ... How to proceed further... ?
Solve the Following Recurrence usingBack SubstitutionMaster Theorem$T(n)=T(\sqrt{n})+n+c$ Using Master TheoremUsing Master Theorem,put n = $2^{m}$$ T(n)=T(2^{m})= S(m)$ i...
Page: