Register

Webpage

Programming in C. Recursion.
Filter

Most viewed questions in Programming and DS

2 votes
5 answers
101
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
The minimum number of fields with each node of doubly linked list is1234
User Avatar
44 votes
5 answers
102
GATE CSE 1997 | Question: 1.4
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used?Singly linked listDoubly linked listCirc...
User Avatar
43 votes
8 answers
104
GATE CSE 2005 | Question: 2
An Abstract Data Type (ADT) is: same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used, but none else all of the above
An Abstract Data Type (ADT) is:same as an abstract classa data type that cannot be instantiateda data type for which only the operations defined on it can be used, but no...
User Avatar
59 votes
4 answers
107
GATE CSE 2014 Set 2 | Question: 40
Consider the following function. double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value $q$ (to $2$ decimals) such that $f(q)$ will return $q$:_____.
Consider the following function.double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); }Give a value $q$ (to $2$ decimals) such that $f(q)$ wi...
User Avatar
1 votes
1 answer
109
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
User Avatar
7 votes
4 answers
110
number of ordered trees
The number of possible ordered trees with 3 nodes A, B, C is: (a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
The number of possible ordered trees with 3 nodes A, B, C is:(a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
User Avatar
38 votes
7 answers
111
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
User Avatar
8 votes
5 answers
112
GATE CSE 2020 | Question: 5
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree?$10,11,12,15,16,18,1...
User Avatar
2 votes
4 answers
113
ISRO2020-23
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is $\text{A B C D E F G H I}$ $\text{F B A D C E G I H}$ $\text{F A B C D E G H I}$ $\text{A B D C E F G I H}$
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
User Avatar
6 votes
1 answer
115
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList
User Avatar
1 votes
2 answers
118
bubble sort
a machine took 200 sec to sort 200 names using bubble sort . in 800 sec it can approx sort how many names a)400 b)800 c)750 d)850
a machine took 200 sec to sort 200 names using bubble sort . in 800 sec it can approx sort how many namesa)400 b)800 c)750 d)850
User Avatar
5 votes
2 answers
119
Find output of the following C program
#include <stdio.h> int main() { int y = 2; int z = y +(y = 10); printf("%d\n", z); }
#include <stdio.h int main() { int y = 2; int z = y +(y = 10); printf("%d\n", z); }
User Avatar
Page: