Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Hot questions in Programming and DS
3
votes
1
answer
1891
GATE CSE 1989 | Question: 4-xi
Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
Express the following list in terms of a linked list structure suitable for internal representation.$(((ab)c)d((e)))$
makhdoom ghaya
796
views
makhdoom ghaya
asked
Nov 30, 2016
DS
gate1989
descriptive
data-structures
linked-list
unsolved
+
–
0
votes
0
answers
1892
Testbook
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is: (A) O(1) (B) O(logn) (C) O(n) (D) O((logn)$^{2}$)
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is:(A) O(1)(B) O(logn)(C) O(n)(D) O((logn)$^{2}$)
Rajat Agrawal007
361
views
Rajat Agrawal007
asked
Dec 19, 2018
0
votes
2
answers
1893
Yashavant Kanetkar Understanding Pointers in C, chapter 1, question number 1
Can you write another expression which does the same job as ++*ptr ?
Can you write another expression which does the same job as ++*ptr ?
ermp888
1.7k
views
ermp888
asked
Jun 27, 2018
0
votes
0
answers
1894
ME Test Series
I don”t think 3rd statement is correct.
I don”t think 3rd statement is correct.
Shadan Karim
228
views
Shadan Karim
asked
Dec 23, 2018
2
votes
1
answer
1895
ISRO2008-71
The time required to search an element in a linked list of length n is $O(\log_2 n)$ $O(n)$ $O(1)$ $O(n^2)$
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$
go_editor
17.9k
views
go_editor
asked
Jun 13, 2016
DS
isro2008
data-structures
linked-list
time-complexity
+
–
0
votes
1
answer
1896
Pointers
Which of the following is the proper declaration of a pointer? A. int x; B. int &x; C. ptr x; D. int *x;
Which of the following is the proper declaration of a pointer?A. int x;B. int &x;C. ptr x;D. int *x;
IITB2020
547
views
IITB2020
asked
Nov 24, 2018
0
votes
1
answer
1897
Doubt :ACE OTS
Ans : Option D But array size is 14 then how 15 is printed ? ptr size is 2 but precise answer given was 2.29 , how ?
Ans : Option D But array size is 14 then how 15 is printed ?ptr size is 2 but precise answer given was 2.29 , how ?
HeadShot
254
views
HeadShot
asked
Dec 11, 2018
1
votes
1
answer
1898
Cost of Binary search tree
atul_21
1.2k
views
atul_21
asked
Jan 2, 2018
DS
data-structures
binary-search-tree
numerical-answers
ace-test-series
+
–
0
votes
1
answer
1899
Bookies
Which of the following algorithm is best suitable for sorting of linked list? A) Quick B) Merge C) Heap D) None
Which of the following algorithm is best suitable for sorting of linked list?A) QuickB) MergeC) HeapD) None
G4TE Hunter
199
views
G4TE Hunter
asked
Dec 18, 2018
0
votes
1
answer
1900
GATE OVERFLOW
A single array A[1 .. MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top 2 (top < top 2) point to the location of the topmost element in each of the stacks. If the space is to be used ... array and hence the condition must be top1 = top2 - 1; HERE OPTION B ALSO SATISFING SAME REASON..WHY CANT ANSWER NOT B..?????
A single array A[1 .. MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array.Variables top1 and top 2 (top < top 2) point to the lo...
Naveen Nallanti
2.2k
views
Naveen Nallanti
asked
Jul 17, 2018
5
votes
5
answers
1901
Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16)Answer given: $2^{16}$ ...
shikharV
3.2k
views
shikharV
asked
Nov 15, 2015
DS
algorithms
programming
recursion
+
–
0
votes
0
answers
1902
NOTE_C/DS_1_31
Consider the integer array A[1…...100, 1…...100] in which the elements are stored in Z representation. If the base address of A is starting from 1000 onwards, size of each element is 1 byte and A is stored in Row Major Order, then the address corresponding to A[100][55] is ________.
Consider the integer array A[1…...100, 1…...100] in which the elements are stored in Z representation. If the base address of A is starting from 1000 onwards, size of...
BOB
330
views
BOB
asked
Dec 17, 2018
0
votes
0
answers
1903
Self doubt- why isn't -ve int converted to 2's complement when storing in unsigned int.
How is the output still -4? when we are storing it in an unsigned int here shouldn’t it be converted to 2’s complement and then the absolute value of it be the result? int main() { unsigned int num = -4; printf("%d", num); return 0; }
How is the output still -4? when we are storing it in an unsigned int here shouldn’t it be converted to 2’s complement and then the absolute value of it be the resul...
shaz
326
views
shaz
asked
Dec 13, 2018
Programming in C
number-representation
programming-in-c
+
–
1
votes
2
answers
1904
switch case
int main() { int a =50; switch(a) { default: a=45; case 49: a++; case 50: a--; case 51: a =a+1; } printf("%d",a); } my doubt is the default case is not executed here why??, what is a value of a the end??
int main() { int a =50; switch(a) { default: a=45; case 49: a++; case 50: a ; case 51: a =a+1; } printf("%d",a); }my doubt is the default case is not executed here why??,...
Hira Thakur
1.5k
views
Hira Thakur
asked
Sep 14, 2018
Programming in C
switch-case
programming-in-c
+
–
0
votes
0
answers
1905
Depth First Search
Na462
993
views
Na462
asked
Nov 7, 2018
Programming in C
depth-first-search
data-structures
graph-algorithms
+
–
0
votes
0
answers
1906
Allocation
Deepalitrapti
249
views
Deepalitrapti
asked
Dec 18, 2018
0
votes
0
answers
1907
Self Doubt [Sequence point]
from Dennis Ritchie “a[i] = i++ The question is whether the subscript is the old value of i or the new value “ My doubt: we already know ‘ ++ ’ has higher precedence than ‘ = ’.S as it is post increment value of i will be incremented after use hence it should be like a[i] = i; i++; How it creates ambiguity...i iran it on compiler and ran as i mentioned
from Dennis Ritchie“a[i] = i++ The question is whether the subscript is the old value of i or the new value “My doubt:we already know ‘ ++ ’ has higher precedence...
jatin khachane 1
234
views
jatin khachane 1
asked
Dec 16, 2018
Programming in C
programming-in-c
undefined-behaviour
+
–
22
votes
3
answers
1908
GATE IT 2004 | Question: 60
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character. #include <stdio.h> void wrt_it (void); int main (void) { printf("Enter Text"); ... $putchar(c);$ $?1$ is $(c = getchar()) ! =$ '\n' $?2$ is $putchar(c);$
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line ...
Ishrat Jahan
5.8k
views
Ishrat Jahan
asked
Nov 2, 2014
Programming in C
gateit-2004
programming
programming-in-c
normal
+
–
0
votes
1
answer
1909
Made-easy-test-series
shweta sah
225
views
shweta sah
asked
Dec 13, 2018
1
votes
1
answer
1910
ME Test Series
Shadan Karim
343
views
Shadan Karim
asked
Dec 1, 2018
Page:
« prev
1
...
90
91
92
93
94
95
96
97
98
99
100
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register