Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

0 votes
0 answers
2941
Infix to postfix time complexity
Sir it is given everywhere that time complexity of infix to postfix is O(1) but according to algorithm for some operators we have to traverse back the stack until we find a operator with less precedence than this so is it always O(1 ) even if we do amortized analysis
Sir it is given everywhere that time complexity of infix to postfix is O(1) but according to algorithm for some operators we have to traverse back the stack until we find...
User Avatar
1 votes
1 answer
2942
Linked List
How D) could be answer here? I think for head->next=temp; will not work properly. Am I doing any mistake?
How D) could be answer here?I think for head->next=temp; will not work properly. Am I doing any mistake?
User Avatar
2 votes
1 answer
2944
gateforum test series
i'm getting 5 but the answer given is 4
i'm getting 5 but the answer given is 4
User Avatar
25 votes
3 answers
2945
GATE CSE 1995 | Question: 6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
User Avatar
0 votes
1 answer
2946
Data Structure and programing
If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 byte then the array has been stored in which order ? 1.row major 2.column major 3. matrix major Answer is row major explain how ?
If the address of A and A are 1000 and 1010 respectively and each element occupies 2 byte then the array has been stored in which order ?1.row major 2.column major 3....
User Avatar
1 votes
0 answers
2948
AVL tree
Can anyone please explain ?? What does R+1,L+1 or R+1,L-1 means ??
Can anyone please explain ?? What does R+1,L+1 or R+1,L-1 means ??
User Avatar
2 votes
0 answers
2949
Complexity of given program.
Consider the following C segment: main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) { sum *= j; } } } } The complexity of above program is ____________.
Consider the following C segment:main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) {...
User Avatar
0 votes
1 answer
2950
UGC NET CSE | December 2012 | Part 2 | Question: 26
A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79? 1 2 3 4
A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?1234
User Avatar
0 votes
0 answers
2951
Subject Topic- Programming & DS
char c = 'Z'; char a[] = "Hello world"; char *ptr1 = &c; char *ptr2 = a; char *ptr3 = &a[0]; char *ptr4 = &a[6]; char *ptr5 = a + 6; Can someone explain this...
char c = 'Z'; char a[] = "Hello world"; char *ptr1 = &c; char *ptr2 = a; char *ptr3 = &a[0]; char *ptr4 = &a[6]; char *ptr5 = a + 6;Can someone explain this...
User Avatar
0 votes
3 answers
2952
#Number of Elements in Circular Queues and Simple Queues #Doubt
How many elements a simple queue and a circular queue both of size N can accommodates ? ( A ) N and N respectively. ( B ) N-1 and N-1 respectively. ( C ) N and N-1 respectively. ( D ) N-1 and N respectively.
How many elements a simple queue and a circular queue both of size N can accommodates ?( A ) N and N respectively.( B ) N-1 and N-1 respectively.( C ) N and N-1 respec...
User Avatar
1 votes
0 answers
2954
AVL tree
Can anyone show stepwise procedure for insertion of nodes 3,2,1,4,5,6,7,16,15,14 (in this order) in AVL tree.
Can anyone show stepwise procedure for insertion of nodes 3,2,1,4,5,6,7,16,15,14 (in this order) in AVL tree.
User Avatar
0 votes
0 answers
2958
Algorithm
The minimum comparisons required to find minimum and maximum in an array of 100 elements is
The minimum comparisons required to find minimum and maximum in an array of 100 elements is
User Avatar
0 votes
1 answer
2959
Uttrakhand Asst. Professor Exam-10
Which of the following table implementation is based on the property of the locality of reference ? Hash table Search table Linear list Self organizing list
Which of the following table implementation is based on the property of the locality of reference ?Hash tableSearch tableLinear listSelf organizing list
User Avatar
1 votes
1 answer
2960
DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
User Avatar
Page: