Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by DKY123
3
answers
1
GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found
Which of the following describes a handle (as applicable to LR-parsing) appropriately?It is the position in a sentential form where the next shift or reduce operation wil...
13.5k
views
commented
Dec 22, 2023
Compiler Design
gatecse-2008
compiler-design
parsing
normal
+
–
14
answers
2
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
39.1k
views
commented
Oct 8, 2023
DS
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
+
–
11
answers
3
GATE CSE 1994 | Question: 1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero eleme...
28.2k
views
comment edited
Oct 2, 2023
DS
gate1994
data-structures
array
normal
+
–
5
answers
4
GATE CSE 2015 Set 1 | Question: 43
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only ... which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E...
17.7k
views
commented
Aug 13, 2021
Algorithms
gatecse-2015-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
1
answer
5
K H Rosen Ex
15. a) How many cards must be chosen from a standard deck of 52 cards to guarantee that at least two of the four aces are chosen? b) How many cards must be chosen from a standard deck of 52 cards to guarantee that at least two of the four aces and ... cards must be chosen from a standard deck of 52 cards to guarantee that there are at least two cards of each of two different kinds?
15. a) How many cards must be chosen from a standard deckof 52 cards to guarantee that at least two of the fouraces are chosen?b) How many cards must be chosen from a sta...
774
views
commented
Jul 28, 2020
1
answer
6
NIELIT 2017 July Scientist B (IT) - Section B: 35
Assume that float takes $4$ bytes, predict the output of following program. #include<stdio.h> int main() { float arr[5]={12.5,10.0,13.5,90.5,0.5}; float *ptr1=&arr[0]; float *ptr2=ptr1+3; printf("%f",*ptr2); printf("%d",ptr2-ptr1); return 0; } $90.500000\:\:3$ $90.500000\:\:12$ $10.000000\:\:12$ $0.500000\:\:3$
Assume that float takes $4$ bytes, predict the output of following program.#include<stdio.h int main() { float arr[5]={12.5,10.0,13.5,90.5,0.5}; float *ptr1=&arr[0]; floa...
2.7k
views
commented
Jun 1, 2020
Programming in C
nielit2017july-scientistb-it
programming-in-c
pointers
array-of-pointers
+
–
2
answers
7
NIELIT 2017 July Scientist B (IT) - Section B: 32
Output of following program #include<stdio.h> int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; } $7\:6\:5$ $5\:6\:7$ $7\:7\:7$ Compiler Dependent
Output of following program#include<stdio.h int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; }$7\:6\:5$$5\:6\:7$$7\:7\:7$Compiler Dependent
1.1k
views
answered
Jun 1, 2020
Programming in C
nielit2017july-scientistb-it
programming-in-c
output
+
–
6
answers
8
ISRO2020-18
Consider a $2$-dimensional array $x$ with $10$ rows and $4$ columns, with each element storing a value equivalent to the product of row number and column number. The array is stored in row-major format. If the first element $x[0][0]$ occupies the memory location ... , which all locations (in decimal) will be holding a value of $10$? $1018,1019$ $1022,1041$ $1013,1014$ $1000,1399$
Consider a $2$-dimensional array $x$ with $10$ rows and $4$ columns, with each element storing a value equivalent to the product of row number and column number. The arra...
9.7k
views
answered
Mar 3, 2020
Programming in C
isro-2020
programming
array
normal
+
–
2
answers
9
mad easy cbt 1
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
673
views
commented
Feb 25, 2020
3
answers
10
Made Easy Test Series:Programming-String
#include<stdio.h> #include<string.h> int main(void) { char *a="MADEEASY"; char *b="GATECSIT2019"; char *r=a; char *s=b; printf("%d",(int)strlen(b+3[r]-1[s])); return 0; } Ans is given $8.$ I know basic thing, but couldnot getting what strlen(b+3[r]-1[s]) returning?? Plz explain.
#include<stdio.h #include<string.h int main(void) { char *a="MADEEASY"; char *b="GATECSIT2019"; char *r=a; char *s=b; printf("%d",(int)strlen(b+3[r]-1[s])); return 0; }An...
1.6k
views
answered
Jan 23, 2020
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
3
answers
11
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
Question:$T(1)=1$$T(n) = 2 T(n - 1) + n$evaluates to?Can anyone solve it by substitution method?Given answer $T(n) = 2^{n+1} - (n+2)$How?
6.0k
views
answered
Jan 12, 2020
Algorithms
time-complexity
algorithms
recurrence-relation
made-easy-booklet
+
–
3
answers
12
UGC NET CSE | December 2019 | Part 2 | Question: 14
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
What is the output of the following $C$ program?# include <stdio.h main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”...
1.5k
views
commented
Jan 5, 2020
Others
ugcnetcse-dec2019-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register