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
Answers by IgnitorSandeep
1
votes
1
true or false?
T1(n)=O(f(n)) T2(n)=O(f(n)) then check T/F? .T1(n)+T2(n)=O(f(n)) .T1(n)=O(T2(n)) .T1(n)=$\omega$(T2(n)) .T1(n)=${\color{Red} \Theta }$(T2(n))
T1(n)=O(f(n))T2(n)=O(f(n))then check T/F?.T1(n)+T2(n)=O(f(n)).T1(n)=O(T2(n)).T1(n)=$\omega$(T2(n)).T1(n)=${\color{Red} \Theta }$(T2(n))
533
views
answered
Sep 29, 2015
Algorithms
asymptotic-notation
+
–
1
votes
2
why can't we access the node of a structure by simply incrementing the pointer variable ?
int main() { int a; struct node *new=(struct node*) malloc(sizeof(struct node)); //printf("%p",new->link); new->i=1; new->link=NULL; struct node *new1=(struct node*) malloc(sizeof(struct node) ... ; return 0; } I am not getting that why is the op not 2 ,why is it showing some garbage value ?
int main() { int a; struct node *new=(struct node*) malloc(sizeof(struct node)); //printf("%p",new->link); new->i=1; new->link=NULL; struct node *new1=(struct node*) mall...
493
views
answered
Sep 24, 2015
Programming in C
programming-in-c
+
–
0
votes
3
how many process created?
Consider the following Pseudo code main() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } } Find the total number of processes that will be created by the above program execution.
Consider the following Pseudo codemain() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } }Find the total number of processes that will b...
9.3k
views
answered
Sep 24, 2015
Operating System
operating-system
fork-system-call
+
–
0
votes
4
How is 2D array passed to a function having formal parameter as a pointer to a array of elements ?
when I am passing a 2D array and function is declared like func(int a[][6]) //This implies that a is going to an array of 6 columns ,rght now we don't know the rows fine ,but it is pointing to a 2D ... I am unable to get the exact way in this pointer a would be pointing to the 2D array .
when I am passing a 2D array and function is declared likefunc(int a[][6]) //This implies that a is going to an array of 6 columns ,rght now we don't know the rows fine ,...
765
views
answered
Sep 24, 2015
Programming in C
programming-in-c
+
–
67
votes
5
GATE CSE 2004 | Question: 38, ISRO2009-27
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times, +, -$ ... $-+a\times bc \ \ \hat{} \ \ \ \hat{} \ \ def$
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times,...
12.9k
views
answered
Sep 24, 2015
DS
gatecse-2004
stack
isro2009
infix-prefix
+
–
4
votes
6
This is previous year Stack question but i have doubt in infix to postfix conversion .plz tell
Assume that the operators +,−, are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, ,+,−. The postfix expression corresponding to the infix expression a+b c−d^e ... giving ^^ at a time then because of same precedeence I put ^ first ....where am i wrong?
Assume that the operators +,−,× are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^,×,+,−. The postfix expression...
1.4k
views
answered
Sep 24, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
