Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Programming and DS
1
vote
1
answer
141
GO Classes 2023 | IIITH Mock Test 1 | Question: 15
In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the array starts from $1.$ $4i + 3$ $2i + 1$ $4i + 1$ $2i + 2$
GO Classes
asked
in
DS
Mar 26, 2023
by
GO Classes
821
views
goclasses2023-iiith-mock-1
goclasses
data-structures
array
heap
binary-heap
1-mark
1
vote
1
answer
142
GO Classes 2023 | IIITH Mock Test 1 | Question: 31
Suppose numbers from $1$ to $1000$ are saved in a binary search tree and we want to find $363.$ Which of the following sequences cannot be the order of elements while reaching the searched value? $925,202,911,240,912,245,363$ $924,220,911,244,898,258,362,363$ $2,252,401,398,330,344,397,363$ $2,399,387,219,266,382,381,278,363$
GO Classes
asked
in
DS
Mar 26, 2023
by
GO Classes
491
views
goclasses2023-iiith-mock-1
goclasses
data-structures
binary-search-tree
1-mark
1
vote
2
answers
143
GO Classes 2023 | IIITH Mock Test 1 | Question: 32
Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element? $2$ $3$ $4$ $5$
GO Classes
asked
in
DS
Mar 26, 2023
by
GO Classes
604
views
goclasses2023-iiith-mock-1
goclasses
data-structures
binary-heap
1-mark
1
vote
1
answer
144
GO Classes 2023 | IIITH Mock Test 1 | Question: 44
Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list. Which of the following(s) is/are true? Asymptotic time complexity of finding the smallest element in the list is $O(1)$ Asymptotic ... complexity of deleting a given element e in the list (not including the cost of finding it) is $O(1)$
GO Classes
asked
in
DS
Mar 26, 2023
by
GO Classes
811
views
goclasses2023-iiith-mock-1
goclasses
data-structures
linked-list
multiple-selects
1-mark
3
votes
2
answers
145
C: Test Your Aptitude
#include<stdio.h> void main() { char arr[]=”\0”; if(printf(“%s\n”,arr)) printf(“Nothing\n”); else printf(“Something\n”); } What is the output of the following code?
MeeraUdasi
asked
in
Programming in C
Mar 22, 2023
by
MeeraUdasi
875
views
programming-in-c
0
votes
1
answer
146
physics wallah dpp
_Harshit
asked
in
Programming in C
Mar 18, 2023
by
_Harshit
686
views
programming-in-c
pointers
physicswallah
0
votes
1
answer
147
Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.
Ujjaval251
asked
in
Programming in C
Mar 14, 2023
by
Ujjaval251
935
views
data-structures
avl-tree
3
votes
1
answer
148
TIFR CSE 2023 | Part B | Question: 8
Let $U$ be a finite set and let $h$ be a function mapping $U \times U$ to $U$. Consider the following process that assigns values to all nodes of a complete binary tree with $128$ leaves. Initially, the leaf nodes are assigned arbitrary values from $U$ ... algorithm need to recompute $h$ in order to obtain the correct value of the tree? $7$ $8$ $53$ $127$ $255$
admin
asked
in
DS
Mar 14, 2023
by
admin
513
views
tifr2023
data-structures
tree
0
votes
1
answer
149
binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?
someshawasthi
asked
in
DS
Feb 27, 2023
by
someshawasthi
427
views
data-structures
binary-search-tree
0
votes
1
answer
150
TOPIC - Infix to postfix and prefix conversion
Convert the following infix expression to postfix and prefix A^B^C^D
akash28
asked
in
DS
Feb 23, 2023
by
akash28
769
views
infix-prefix
14
votes
3
answers
151
GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$
admin
asked
in
DS
Feb 15, 2023
by
admin
6.5k
views
gatecse-2023
data-structures
binary-heap
1-mark
8
votes
2
answers
152
GATE CSE 2023 | Question: 3
Let $\textsf{SLLdel}$ be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let $\textsf{DLLdel}$ be another function that deletes a node in a doubly-linked list given a pointer to the node ... $\textsf{DLLdel}$ are $O(1)$ $\textsf{SLLdel}$ is $O(n)$ and $\textsf{DLLdel}$ is $O(1)$
admin
asked
in
DS
Feb 15, 2023
by
admin
10.3k
views
gatecse-2023
data-structures
linked-list
1-mark
18
votes
3
answers
153
GATE CSE 2023 | Question: 25
The integer value printed by the $\textsf{ANSI-C}$ program given below is _______________ #include<stdio.h> int funcp(){ static int x = 1; x++; return x; } int main(){ int x,y; x = funcp(); y = funcp()+x; printf("%d\n", (x+y)); return 0; }
admin
asked
in
Programming in C
Feb 15, 2023
by
admin
10.6k
views
gatecse-2023
programming
programming-in-c
output
numerical-answers
1-mark
7
votes
3
answers
154
GATE CSE 2023 | Question: 36
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts and deletes the maximum element from $A$. The operation $\operatorname{INSERT}(A, key )$ inserts a new ... $O(1)$ whereas $\operatorname{INSERT}(A, k e y)$ runs in $O(\log (n))$.
admin
asked
in
DS
Feb 15, 2023
by
admin
6.1k
views
gatecse-2023
data-structures
priority-queue
time-complexity
heap
2-marks
8
votes
2
answers
155
GATE CSE 2023 | Question: 37
Consider the $\text{C}$ function $\text{foo}$ and the binary tree shown. typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int retval; if (p == NULL) return 0; else { retval = p->val + foo(p->left) + foo(p->right); printf("%d ", ... $3 \;5\; 8\; 10\; 11\; 13$ $3 \;8 \;16 \;13\; 24\; 50$ $3\; 16\; 8\; 50\; 24\; 13$
admin
asked
in
DS
Feb 15, 2023
by
admin
6.6k
views
gatecse-2023
data-structures
binary-tree
2-marks
6
votes
3
answers
156
GATE CSE 2023 | Question: 49
Consider a sequence $a$ of elements $a_{0}=1, a_{1}=5, a_{2}=7, a_{3}=8, a_{4}=9$, and $a_{5}=2$. The following operations are performed on a stack $S$ and a queue $Q,$ both of which are initially empty. $\textsf{push}$ the ... $S$. $\textsf{pop}$ an element from $S$. The top element of $S$ after executing the above operations is ______________.
admin
asked
in
DS
Feb 15, 2023
by
admin
6.6k
views
gatecse-2023
data-structures
stack
numerical-answers
2-marks
easy
2
votes
1
answer
157
GATE CSE 2023 | Memory Based Question: 41
Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap? $23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$ $23 \;14 \;19 \;1 \;10 \;13 \;16 \;12 \;7 \;5$ $23 \;17\; 14\; 6\; 13\; 10\; 1\; 5\; 7\; 15$ $23 \;17\; 14\; 7\; 13\; 10\; 1\; 5\; 6\; 12$
closed
GO Classes
asked
in
DS
Feb 5, 2023
by
GO Classes
4.8k
views
memorybased-gatecse2023
goclasses
data-structures
binary-heap
1
vote
1
answer
158
ISRO CS 2018
#include <stdio.h> int main() { int i,j,x; scanf("%d ",x); i=1; j=1; while(i<10){ j=j*i; i=i+1; if(i==x) break; } return 0; }
Rakshita Jadoun
asked
in
Programming in C
Feb 4, 2023
by
Rakshita Jadoun
610
views
isro2018
programming-in-c
0
votes
1
answer
159
#madeeasy
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
Dknights
asked
in
Programming in C
Feb 1, 2023
by
Dknights
394
views
programming-in-c
made-easy-test-series
query
3
votes
1
answer
160
Made Easy test series
answer given is 33
TusharKumar
asked
in
Programming in C
Jan 31, 2023
by
TusharKumar
525
views
programming-in-c
output
made-easy-test-series
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
309
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Programming
(4.1k)
DS
(2.0k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions in Programming and DS
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow