Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &4&2&3&0&2&3&1&1&1&0&1.9&4
\\\hline\textbf{2 Marks Count} & 1 &1&0&2&2&0&0&1&3&3&0&1.3&3
\\\hline\textbf{Total Marks} & 4&6&2&7&4&2&3&3&7&7&\bf{2}&\bf{4.5}&\bf{7}\\\hline
\end{array}}}$$

Recent questions in DS

0 votes

3 answers

Made Easy Test Series
In a max heap of n elements, the time complexity to find 10th largest element is: a)Θ(n log n) b)Θ(n) c)Θ(1) d)Θ(log n) I personally think it should be Θ(n), as the 10th largest element can be anywhere in the heap, all the elements need to be traversed once to decide that.

In a max heap of n elements, the time complexity to find 10th largest element is:a)Θ(n log n)b)Θ(n)c)Θ(1)d)Θ(log n) I personally think it should be Θ(n), as the 10th...

Mrityudoot

255 views

Mrityudoot asked Jan 20

6 votes

0 answers

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$

Consider the following binary heap –Suppose the last operation you performed in the binary heap above was inserting the key $x$.What are the possible values of $x?$$20$...

GO Classes

526 views

GO Classes asked Jan 13

2 votes

1 answer

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 53
Consider the linked list initially having values $1, 2, 2, 8, 6, 2, 2,$ and let the head be the pointer to the first node of the linked list. Which of the following options correctly represents the final linked list after the function call ... LinkedList will be $1, 8, 6$ Final LinkedList will be $1, 8, 6, 2, 2$ None of the above

Consider the linked list initially having values $1, 2, 2, 8, 6, 2, 2,$ and let the head be the pointer to the first node of the linked list.Which of the following option...

GO Classes

348 views

GO Classes asked Jan 13

0 votes

1 answer

ISRO 2024
From a character string of lenth $m$, the number of sub-strings of all lengths that can be formed are: $m^2$ $m$ $m(m+1)/2$ $m(\log m)$

From a character string of lenth $m$, the number of sub-strings of all lengths that can be formed are:$m^2$$m$$m(m+1)/2$$m(\log m)$

Ramayya

182 views

Ramayya asked Jan 7

1 votes

3 answers

ISRO 2024
In a priority queue, insertion and deletion can be done at Front back Middle Any position

In a priority queue, insertion and deletion can be done atFrontbackMiddleAny position

Ramayya

461 views

Ramayya asked Jan 7

0 votes

2 answers

ISRO 2024
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number? 120 180 210 360

What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number?120180210360

Ramayya

484 views

Ramayya asked Jan 7

0 votes

0 answers

ISRO 2024
In Reeverse Polish notation, expression A*B+C*D is written as AB*CD*+ A*BCD*+ AB*CD+* A*B*CD+ A request to the approver.!! This question is asked in ISRO 2024. Due to insufficient points, couldn’t add ‘isro2024’ tag, Please add it.

In Reeverse Polish notation, expression A*B+C*D is written asAB*CD*+A*BCD*+AB*CD+*A*B*CD+A request to the approver.!!This question is asked in ISRO 2024. Due to insuffici...

Ramayya

139 views

Ramayya asked Jan 7

0 votes

1 answer

#Number of Minheaps Possible?
No of min heaps possible for the keys {1,1,1,2,3,4,5,6}

No of min heaps possible for the keys {1,1,1,2,3,4,5,6}

gendrone

119 views

gendrone asked Dec 24, 2023

0 votes

1 answer

Made easy Data structures
Consider the following array of elements <96,42,50,17,15,5,7,11,39,23,6,9,19,100,12> The minimum number of interchanges using buildheap needed to convert it into a max heap is

Consider the following array of elements<96,42,50,17,15,5,7,11,39,23,6,9,19,100,12>The minimum number of interchanges using buildheap needed to convert it into a max heap...

amitarp818

611 views

amitarp818 asked Nov 28, 2023

0 votes

1 answer

What is the infix to postfix evaluation of (A+B)*(C*D - E)*F / G
According to my knowledge, it should be AB+CD*E-*F*G/ And, here is the step-wise explanation of it Converting the bracket of (A+B) - AB+ There is operator but the next operand is entire bracket term, it has to be ... Please confirm if my logic and answer is correct or not. Note Mind the space around / operator. It is there on purpose.

According to my knowledge, it should be AB+CD*E-*F*G/And, here is the step-wise explanation of itConverting the bracket of (A+B) – AB+There is operator but the next ope...

tbhaxor

850 views

tbhaxor asked Nov 24, 2023

1 votes

1 answer

Self doubt
#include <stdio.h> void SSort(int [], int); void swap(int *,int*); int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(int i = 0; i < n; i++) { printf("%d\t", arr[i]); } return 0; } void SSort( ... = *x; *x = *y; *y = tmp; } This is a selection sort algorithm. But the output of the algo is: 0 0 0 0 0 0. Where is the problem ?

#include <stdio.h>void SSort(int [], int);void swap(int *,int*);int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(...

Gopal6854

336 views

Gopal6854 asked Sep 13, 2023

0 votes

1 answer

UGC NET CSE | June 2023 | Part 2: 9
Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is the content of the table when the sequence $1,3,8,10,5$, is inserted into the table using closed hashing? Here " denotes ... $3,8,1,$_,$10,5$ _,$3,8,1$,_,$10,5$ _$1,3,8,10,5$,_

Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is ...

admin

705 views

admin asked Jul 28, 2023

0 votes

1 answer

Self Doubt
I have a doubt on simple Queue Implementation by an array Assume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last element If we dequeue the element then front's element will get deleted, Now do we have to ... space is empty) I am not talking about circular queue concept,I am just talking about simple queue implementation using array(Not circular).

I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last elementIf we dequ...

viral8702

323 views

viral8702 asked Jul 22, 2023

0 votes

1 answer

self-doubt Data structure Linked list. Inserting a node at the beginning of a linked list
How to Visualize this code ? #include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ struct node *newNode =malloc(sizeof(struct node ... ); addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }

How to Visualize this code ?#include<stdio.h #include<stdlib.h struct node{ int data; struct node *next; }; void addFirst(struct node head,int val){ struct node *newNode...

gagan55

950 views

gagan55 asked Jul 13, 2023

0 votes

1 answer

what is load factor

Gaurav Kadyan

178 views

Gaurav Kadyan asked Jul 13, 2023

1 votes

1 answer

made easy workbook

Anmol pratap singh

598 views

Anmol pratap singh asked Jul 8, 2023

0 votes

1 answer

Go Class data structure asymptotic notation practice video question 21
I have specific doubt on this question and I’ve tried to explain that in the picture , If anyone can explain it then it’ll be of great help. according to sachin sir the answer should be false( fyi).

I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir th...

kickassakash

421 views

kickassakash asked Jul 4, 2023

0 votes

0 answers

Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 2186

What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ?255 and 6560127 and 2186 6561 and 255255 and 2186

none30

439 views

none30 asked Jun 11, 2023

0 votes

0 answers

testbook question
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2

The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2

jugnu1337

369 views

jugnu1337 asked May 16, 2023

0 votes

1 answer

Data Structure | Set | IIT Kanpur Interview question
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible? $n^{2}$ nlogn n logn

There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn

Souvik33

429 views

Souvik33 asked Apr 2, 2023

Page:

« prev
1
2
3
4
5
6
7
...
102
next »

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