# Questions by Himanshu Goyal

1
Gate 2018 Application Form Out visit GATE Online Application Processing System (GOAPS) @ https://appsgate.iitg.ac.in/
1 vote
2
Can anybody explain me access link and control link in activation record?I am confused what is different between them IF POSSIBLE GIVE EXAMPLE ALSO THANKS A LOT
1 vote
3
How is ans 15 for this question Please can anybody solve this
1 vote
4
#include <stdio.h> int main() { int i =258; int *iptr = &i; printf("%d%d",*((char*)iptr),*((char*)iptr+1)); return 0; } (a)2,1 (b)2,5 (c)1, 2 (d)5,2 I am getting (a) as output sh-4.2$gcc -o main *.c sh-4.2$ main 21 Can anybody explain that how we got that? Thanks :)
1 vote
5
We know Regular Union CFL is CFL as they are closed but a doubt came in my mind if Regular - (a+b)* CFL - anbn Isn't it regular (a+b)* U anbn = (a+b)* Then how come this statement Regular Union CFL is CFL as they are closed is true ?? Please correct me if i am wrong..
1 vote
6
Can Anyone explain me the difference between Static and Dynamic links in Activation Records With some illustration or eg ?
7
Can someone give me dfa of these Regular Expressions? 0*(1+0)* 0*(1++0)* Actually i am getting confused between both of them Thanks
8
GATE 2010 Question The grammar S→aSa∣bS∣c is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1) I have 2 small doubt First Doubt:-If a grammer is LL(1) then it is always LR(0) ? Is there any grammer which is LL(1) and cannot ... operator presedence,LL(1) LR(0) SLR(1) LALR(1) CLR(1).So what is the difference between LR(0) AND LR(1) and which one is more powerfull ?
9
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able to learn some complicated names ? Any video lectures or anything please help :)
10
What will be the time complexity of recurrence relation T(n)=c+T(n-1) using substitution method? c is a constant here.
1 vote
11
What is time complexity of following code : int count = 0; for (int i = N; i > 0; i /= 2) { for (int j = 0; j < i; j++) { count += 1; } } Please give ans with explanation ? Thankyou
1 vote
12
Guys i was trying to implement merge procedure of merge sort i found some interesting results.I don't know why it happened but if you know please comment and clear my doubt This is my code #include <iostream> using namespace std; void merge(void); int main() { ... am getting some garbage value don't know on second execution.When third time i executed i get correct Please help why its happening :)
13
Is call by address in C same to call by reference in C++? if not then whats basic difference ?? and why doesn't C have a refernce variable just like C++??
14
I was doing operating systems in which there was a topic of turn variable well there are two processes P0,P1 and int turn =0 For Process P0 For Process P1 Non Critical Section Non Critical Section while(turn!=0) while(turn!=1) //enter critical section //enter ... chance to enter first and then P1 got chance to enter Please somebody tell me correct ans to this problem.I am really stuck and confused
1 vote
15
Well i have a general query about gate well it is My college cgpa is 7.5/10 and if by luck i got gate rank between AIR 0-50 will i get a direct admission in IIT Delhi in CSE Department or i have to go for a written test again. and which IIT's gave direct admission at this CGPA I am giving gate in cse stream