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 ravee_rocks
2
answers
1
pointer airthmatic
we can subtract 2 pointer address then why we can't perform operations like addition, multiplication or division on pointer address??? any specific reason?
we can subtract 2 pointer address then why we can't perform operations like addition, multiplication or division on pointer address???any specific reason?
909
views
commented
Jul 9, 2019
Programming in C
pointers
+
–
2
answers
2
How Self-Referential Structure works?
I have learnt that self-referential structure is one which contains a structure of same type in it as an element. But I have a doubt regarding how that line is compiled successfully (i.e, how compiler knows how much space should be allocated and ... not yet finished? struct node { int data; struct node *next; }; correct me If I am wrong in understanding this.
I have learnt that self-referential structure is one which contains a structure of same type in it as an element. But I have a doubt regarding how that line is compiled s...
1.3k
views
answered
Jul 5, 2019
Programming in C
programming-in-c
pointers
+
–
4
answers
3
GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...
17.8k
views
commented
Jan 11, 2019
Theory of Computation
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
+
–
2
answers
4
GATE IT 2005 | Question: 49
An instruction set of a processor has $125$ signals which can be divided into $5$ groups of mutually exclusive signals as follows: Group $1$ $:$ $20$ signals, Group $2$ $:$ $70$ signals, Group $3$ $:$ $2$ signals, Group $4$ ... signals. How many bits of the control words can be saved by using vertical microprogramming over horizontal microprogramming? $0$ $103$ $22$ $55$
An instruction set of a processor has $125$ signals which can be divided into $5$ groups of mutually exclusive signals as follows:Group $1$ $:$ $20$ signals, Group $2$ $:...
9.5k
views
commented
Nov 29, 2018
CO and Architecture
gateit-2005
co-and-architecture
microprogramming
normal
+
–
9
answers
5
GATE CSE 2018 | Question: 2
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'
Consider the following C program:#include<stdio.h struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c",...
20.8k
views
commented
Feb 15, 2018
Programming in C
gatecse-2018
programming-in-c
programming
structure
normal
1-mark
+
–
2
answers
6
GATE CSE 2008 | Question: 83
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set for one of the tables for the minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$? ${M1, M2, M3, P1}$ ${M1, P1, N1, N2}$ ${M1, P1, N1}$ ${M1, P1}$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set ...
11.1k
views
commented
Nov 26, 2017
Databases
gatecse-2008
databases
er-diagram
normal
+
–
5
answers
7
GATE CSE 1998 | Question: 1.24
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and...
17.3k
views
commented
Sep 18, 2017
DS
gate1998
data-structures
tree
multiple-selects
normal
+
–
4
answers
8
How space will be stored in 1-D array
char * a[] = "red shoes"; How the space in string constant "red shoes" will be stored in 1-D array in memory?
char * a[] = "red shoes";How the space in string constant "red shoes" will be stored in 1-D array in memory?
2.6k
views
commented
Sep 13, 2017
Programming in C
array
data-structures
programming-in-c
+
–
1
answer
9
how multi dimensional array is stored in the memory how to visualize 4 d and above dimensional array?
413
views
answered
Sep 13, 2017
2
answers
10
L={<M> : M is a TM that accepts all even numbers }
L={<M> : M is a TM that accepts all even numbers } is it recursive/R.E??
L={<M : M is a TM that accepts all even numbers }is it recursive/R.E??
3.6k
views
commented
Jan 15, 2017
Theory of Computation
theory-of-computation
decidability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register