Register

Webpage

Programming in C. Recursion.
Filter

Highest voted questions in Programming and DS

1 votes
1 answer
1981
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 12
If the values printed by the following C code are $a$ and $b,$ $a + b =$ _____ #include<stdio.h> int main() { int array[5] = {1, 2, 3, 4, 5}; int *p = array; printf("%ld\t%ld", p - array, p - (int*)&array); }
If the values printed by the following C code are $a$ and $b,$ $a + b =$ _____#include<stdio.h int main() { int array[5] = {1, 2, 3, 4, 5}; int *p = array; printf("%ld\t%...
User Avatar
1 votes
1 answer
1982
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 13
What will be the output of the following C code? #include<stdio.h> int main() { int array[4] = {1, 2, 3, 4}; printf("%d\n", *array + array[0] + *array+1 + array[array[1]]); }
What will be the output of the following C code?#include<stdio.h int main() { int array[4] = {1, 2, 3, 4}; printf("%d\n", *array + array[0] + *array+1 + array[array ]); }...
User Avatar
1 votes
1 answer
1984
GATE Overflow Test Series | Data Structures | Test 1 | Question: 3
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
User Avatar
1 votes
1 answer
1985
GATE Overflow Test Series | Data Structures | Test 1 | Question: 4
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are Stack and Queue Queue and Stack Stack and Stack Queue and Queue
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively areStack and QueueQueue and StackStack and StackQueue and Queu...
User Avatar
1 votes
1 answer
1986
GATE Overflow Test Series | Data Structures | Test 1 | Question: 5
The prefix form of $A/B- (C * D * E)$ is? $-/* * ABCDE$ $-/ABCD**DE$ $-/AB**CDE$ $-A/BC*DE*$
The prefix form of $A/B- (C * D * E)$ is?$-/* * ABCDE$$-/ABCD DE$$-/AB CDE$$-A/BC*DE*$
User Avatar
1 votes
1 answer
1988
GATE Overflow Test Series | Data Structures | Test 1 | Question: 9
What is the location of parent node for any arbitrary node $i$ in an array implementation of a complete binary tree in C language? floor$(i /2)$ floor$(i+1) /2$ floor$((i-1)/2)$ ceil$((i-1)/2)$
What is the location of parent node for any arbitrary node $i$ in an array implementation of a complete binary tree in C language?floor$(i /2)$floor$(i+1) /2$floor$((i-1)...
User Avatar
1 votes
1 answer
1990
GATE Overflow Test Series | Data Structures | Test 1 | Question: 17
Given an array of elements $5,7,9,1,3,10,8,4,$ which of the following is not a possible array implementation of min-heap of these elements? $1,3,4,7,5,8,9,10$ $1,4,3,8,9,5,7,10$ $1,3,4,5,8,7,9,10$ All are min-heaps
Given an array of elements $5,7,9,1,3,10,8,4,$ which of the following is not a possible array implementation of min-heap of these elements?$1,3,4,7,5,8,9,10$$1,4,3,8,9,5,...
User Avatar
1 votes
1 answer
1992
NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is$\Theta (\lo...
User Avatar
1 votes
2 answers
1994
NIELIT 2016 MAR Scientist C - Section C: 54
In a circularly linked list organization, insertion of a record involves the modification of no pointer $1$ pointer $2$ pointers $3$ pointers
In a circularly linked list organization, insertion of a record involves the modification ofno pointer$1$ pointer$2$ pointers$3$ pointers
User Avatar
1 votes
3 answers
1995
NIELIT 2016 MAR Scientist C - Section C: 59
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type int float char long int
In C programming language, if the first and the second operands of operator $+$ are of types int and float, respectively, the result will be of type intfloatcharlong int
User Avatar
1 votes
1 answer
1996
NIELIT 2016 MAR Scientist C - Section C: 60
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x; $5,-4$ $6,-5$ $6,-6$ $5,-5$
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x;$5,-4$$6,-5$$6,-6$$5,-5$
User Avatar
1 votes
2 answers
1998
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue
Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue
User Avatar
1 votes
2 answers
1999
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
User Avatar
Page: