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
0
votes
0
answers
31
Memory Based GATE DA 2024 | Question: 21
What does the following Python code do? \begin{verbatim} def fun(D, S_1, S_2): if S_1 < S_2: D[S_1], D[S_2] = D[S_2], D[S_1] fun(D, S_1 + 1, S_2 - 1) \end{verbatim}
GO Classes
asked
in
Programming
Feb 4
by
GO Classes
95
views
gate2024-da-memory-based
goclasses
programming
programming-in-python
2
votes
2
answers
32
Memory Based GATE DA 2024 | Question: 23
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree? Inorder + Preorder Preorder + Postorder Only Inorder Inorder + Postorder
GO Classes
asked
in
DS
Feb 4
by
GO Classes
282
views
gate2024-da-memory-based
goclasses
data-structures
binary-tree
tree-traversal
0
votes
1
answer
33
Memory Based GATE DA 2024 | Question: 24
Consider a doubly linked list with the following operations: - Insert First (\texttt{InsertFirst}) \\ - Insert Last (\texttt{InsertLast}) \\ - Remove First (\texttt{RemoveFirst}) \\ - Remove Last (\texttt{RemoveLast}) The following operations are ... \ & a = \text{RemoveLast} \end{aligned} \] What is the value of \(a\) after these operations?
GO Classes
asked
in
DS
Feb 4
by
GO Classes
166
views
gate2024-da-memory-based
goclasses
data-structures
linked-list
numerical-answers
0
votes
1
answer
34
Memory Based GATE DA 2024 | Question: 40
Match the following: $ \begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & (ii) Queue \\ \hline Look Up & (i) Hash Table\\ \hline LIFO & (iii) Stack \\ \hline \end{array} $
GO Classes
asked
in
DS
Feb 4
by
GO Classes
164
views
gate2024-da-memory-based
goclasses
data-structures
stack
0
votes
0
answers
35
Memory Based GATE DA 2024 | Question: 49
Consider the following Python code: def countchildren(l, i): Some code Given lists if i > 2: return 1 ans = 1 for i in l.keys(): ans = ans + countchildren(l,i) return ans Example usage l = dict() l[1] = [2, 3] l[2] = [3, 4, 5] l[3] = [6, 7, 8] result = countchildren(l,1) print(result)
GO Classes
asked
in
Programming
Feb 4
by
GO Classes
97
views
gate2024-da-memory-based
goclasses
programming
programming-in-python
0
votes
0
answers
36
Memory Based GATE DA 2024 | Question: 55
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.
GO Classes
asked
in
DS
Feb 4
by
GO Classes
191
views
gate2024-da-memory-based
goclasses
data-structures
binary-tree
1
vote
1
answer
37
Array, Memory Allocation
In what cases does an uninitialized array have values = 0 and for which cases does it have values = garbage values. How to differentiate?
Mrityudoot
asked
in
Programming in C
Feb 2
by
Mrityudoot
247
views
memory-management
programming-in-c
array
1
vote
1
answer
38
Array
Does C support fractional Indices? float x = some fraction; Is float a[x] valid declaration?
Mrityudoot
asked
in
Programming in C
Feb 2
by
Mrityudoot
138
views
array
programming-in-c
6
votes
1
answer
39
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 16
Suppose we constructed the binary search tree shown by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in ... $29$ came before $42.$ $3$ came before $14$ and $16$ came before $28.$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
404
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-search-tree
1-mark
3
votes
1
answer
40
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 17
Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero)
GO Classes
asked
in
DS
Jan 28
by
GO Classes
441
views
goclasses2024-mockgate-13
goclasses
numerical-answers
data-structures
binary-heap
1-mark
5
votes
1
answer
41
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 18
What will be output printed by the following program? #include<stdio.h> main() { int c=4; switch(c) { c=c-1; case 4: printf("IITB "); break; default: printf("IISc "); case 3: printf("IITM "); case ... ;IITD"); } } $\text{IITB IITM}$ $\text{IITB IISc IITM}$ $\text{IITB}$ $\text{IITB IITM IITD}$
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
349
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
output
1-mark
4
votes
0
answers
42
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 19
What will be the output of the following program? #include <stdio.h> int main() { int a[2][2] = { {1, 2}, {3, 4} }; int (*p)[2][2]; p = &a; printf("%d", (*p)[0][1]); return 0; } $1$ $2$ $3$ $4$
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
297
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
array-of-pointers
1-mark
3
votes
1
answer
43
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 36
Let $\mathrm{T}$ be the smallest AVL tree of height $h$. How many nodes does it have, if the smallest AVL tree of height $h-2$ has $m$ nodes and the smallest AVL tree of height $h-3$ has $k$ nodes? $m+k+2$ $m+2 k$ $2 m+k$ $2 m+k+2$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
342
views
goclasses2024-mockgate-13
goclasses
data-structures
avl-tree
2-marks
4
votes
2
answers
44
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 37
Consider the null-terminated linked list of four integers $\textsf{1->2->3->4->NULL},$ and the variable 'list' points to the head of the linked list. Upon running the provided code, the linked list gets divided ... X:list->next->next>next = list->next>next; LINE Y: list = list->next->next;
GO Classes
asked
in
DS
Jan 28
by
GO Classes
397
views
goclasses2024-mockgate-13
goclasses
data-structures
linked-list
2-marks
7
votes
3
answers
45
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 40
You are given a complete binary tree (each level must be full except the last) on $n$ vertices. Each vertex $v$ is labeled by an integer value $x_v$. Say that a vertex is a local minimum if its label is less than the labels of each of its ... minimum in the tree? $\theta(n)$ $\theta(\sqrt{n})$ $\theta(\log n)$ $\theta(n \log n)$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
735
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-tree
time-complexity
2-marks
3
votes
1
answer
46
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 47
#include<stdio.h> #include<string.h> char upstr[50]; void putStar (int n,char str[]){ upstr[n] = str[n]; if(n == strlen(str)) return; else upstr[n+1] = '*'; putStar(n+1,str); } int main() { char str[] = " ... , upstr); } What will be the output of the given program? h*e*l*l*o h*e*l*l*o* h*e*l*l* hello
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
303
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
array
2-marks
8
votes
2
answers
47
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 48
#include <stdio.h> int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); } What will be the output of the above program in little-endian and big-endian, respectively? $(65280\text{ is } 255\times2^8)$ $255,\; 0$ $65280,\; 0$ $0,\;0$ $0,\; 65280$
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
535
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
little-endian-big-endian
output
2-marks
3
votes
1
answer
48
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 3
The Euclidean algorithm is used to find the greatest common divisor $(\mathrm{gcd})$ of two positive integers $\mathrm{a}$ and $\mathrm{b}$. input(a) input(b) while b>0 begin r:= a mod b a:= b b:= r end gcd:= a output(gcd) When the algorithm ... is the sequence of computed values for $r?$ $2,53,1,0$ $53,2,1,0$ $53,4,1,0$ $53,5,1,0$
GO Classes
asked
in
DS
Jan 21
by
GO Classes
351
views
goclasses2024-mockgate-12
goclasses
data-structures
linked-list
1-mark
2
votes
1
answer
49
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 4
What are the sequence of popped-out values if the sequence of operations - $\textsf{push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop}$ are performed on a stack? $2, 2, 1, 1, 2$ $2, 2, 1, 1, 1$ $2, 1, 2, 2, 1$ $2, 1, 2, 2, 2$
GO Classes
asked
in
DS
Jan 21
by
GO Classes
299
views
goclasses2024-mockgate-12
goclasses
data-structures
stack
1-mark
easy
2
votes
1
answer
50
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 12
Consider the following two declarations for $\textsf{arr1}$ and $\textsf{arr2}:$ int arr1[2][3]; int r1[3]; int r2[3]; int * arr2[2] = {r1, r2}; Assume that the size of the integer is $4$ Bytes and the ... $\operatorname{sizeof}(\operatorname{arr}1)=48$ bytes and sizeof $(\operatorname{arr}2)=32$ bytes
GO Classes
asked
in
Programming in C
Jan 21
by
GO Classes
409
views
goclasses2024-mockgate-12
goclasses
programming
programming-in-c
array-of-pointers
1-mark
Page:
« prev
1
2
3
4
5
6
7
...
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