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

2 votes

1 answer

TIFR CSE 2022 | Part B | Question: 5
There is an unsorted list of $n$ integers. You are given $3$ distinct integers and you have to check if all $3$ integers are present in the list or not. The only operation that you are allowed to perform is a comparison. Let $A$ be an algorithm for this task that performs the least number ... $c=3 n$ $c=2 n+5$ $c \geq 3 n-1$ $c \leq n$ $c \leq 2 n+3 $

There is an unsorted list of $n$ integers. You are given $3$ distinct integers and you have to check if all $3$ integers are present in the list or not. The only operatio...

admin

617 views

admin asked Sep 1, 2022

2 votes

1 answer

Algorithm which uses Max heap to find i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinct Please use max heap to explain the working input : n distinct elements output : i smallest elements

Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinctPlease use max heap to explain the working input : n distinct e...

Thor-o-s

423 views

Thor-o-s asked Sep 1, 2022

0 votes

1 answer

Trees
In GATE if questions just mention a tree then should we assume it to be a directed or undirected tree? Also, if we are having an undirected tree then does the child node contains a pointer to the parent node?

In GATE if questions just mention a tree then should we assume it to be a directed or undirected tree?Also, if we are having an undirected tree then does the child node c...

Chaitanya Kale

442 views

Chaitanya Kale asked Aug 31, 2022

3 votes

1 answer

Data Structures,Algorithms&Applications In c++ page-249 Q-34
In an n x n C-matrix, all terms other than those in row 1, row n, and column 1 are zero. A C-matrix has at most 3n-2 nonzero terms. A C-matrix may be compactly stored in one-dimensional array by first storing row 1, then row n, and then the remaining column 1 elements. Calculate the location of an element A(i, j)?

In an n x n C-matrix, all terms other than those in row 1, row n, and column 1 are zero. A C-matrix has at most 3n-2 nonzero terms. A C-matrix may be compactly stored in ...

Abhi_1o1

655 views

Abhi_1o1 asked Aug 26, 2022

1 votes

1 answer

data structure
Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[1], q[2], ……, q[10]. The front and rear pointer are initialized to point at q[2]. In which position will the ninth element be added?

Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are...

jugnu1337

540 views

jugnu1337 asked Jul 17, 2022

0 votes

2 answers

MadeEasy Test Series
There are 15 vertices and 15 edges in some graph. Now, these edges are arranged in such a way that maximum number of connected components are created in the graph. Find the connected components created. (A) 8 (B) 9 (C) 10 (D) 11 Please explain your answer.

There are 15 vertices and 15 edges in some graph. Now, these edges are arranged in such a way that maximum number of connected components are created in the graph. Find t...

anupamsworld

922 views

anupamsworld asked Jul 8, 2022

0 votes

1 answer

For which of the following does there exist a tree satisfying the specified constraints? (a) A binary tree with 65 leaves and height 6. (b) A binary tree with 33 leaves and height 5.

qweas8671

681 views

qweas8671 asked Jul 2, 2022

0 votes

1 answer

Number of max heaps
Someone please explain the login behind the explanation.

Someone please explain the login behind the explanation.

Overflow04

2.2k views

Overflow04 asked Jun 29, 2022

0 votes

1 answer

Introduction to Alogrithm
Number of max heap possible with n distinct keys.

Number of max heap possible with n distinct keys.

Overflow04

369 views

Overflow04 asked Jun 29, 2022

0 votes

1 answer

The expression in postfix notation corresponding to the prefix notation ++A*B+CD*+EFG is

Arunava Samanta

717 views

Arunava Samanta asked Jun 28, 2022

5 votes

2 answers

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 6
Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue is at the head of the list. What is the best possible worst-case ... $O(n)$ for dequeue. $O(n)$ for enqueue and $O(1)$ for dequeue. $O(n)$ for both functions.

Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue ...

GO Classes

627 views

GO Classes asked May 22, 2022

4 votes

2 answers

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 7
Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$ Which of the following statements is true for the number of elements or size of the queue ... S1 is true but S2 is false S1 is false but S2 is true Both statements are true Both statements are false

Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$Which of the following statements is ...

GO Classes

501 views

GO Classes asked May 22, 2022

3 votes

2 answers

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 8
Which of the following is/are correct about implementation of stack and queue. If stack is implemented as an array, all the push and pop operations can be performed in constant time. If stack is implemented as a ... queue is implemented as a linked list, all the enqueue and dequeue operations can be performed in constant time.

Which of the following is/are correct about implementation of stack and queue.If stack is implemented as an array, all the push and pop operations can be performed in con...

GO Classes

492 views

GO Classes asked May 22, 2022

0 votes

0 answers

how to Implement arrays using linked lists (and vice versa)?
how to Implement arrays using linked lists (and vice versa)? Like if we implement a linked list using an array .then we can maintain two arrays. In one array we will maintain the data and in another array, we will store ... it accordingly, whether this is correct? Also how to implement an array using a linked list..is this even possible?

how to Implement arrays using linked lists (and vice versa)?Like if we implement a linked list using an array….then we can maintain two arrays.In one array we will main...

samarpita

488 views

samarpita asked May 21, 2022

0 votes

0 answers

Self Doubt - BFT Applications
Can we use BFT for finding no. of connected components in a directed as well as undirected graph?

Can we use BFT for finding no. of connected components in a directed as well as undirected graph?

Vallari Garg

347 views

Vallari Garg asked May 16, 2022

1 votes

1 answer

time complexity
what is T.C. of this code: for(i=1;i<=n;i++) for(j=1;j<=n;j=j+i) x=x+1;

what is T.C. of this code: for(i=1;i<=n;i++) for(j=1;j<=n;j=j+i) x=x+1;

jugnu1337

490 views

jugnu1337 asked Apr 20, 2022

0 votes

0 answers

Self Doubt
problem : You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Q.here i am not understanding why these problem is following fibonacci series??

problem : You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?...

Kartiksarvaiya

490 views

Kartiksarvaiya asked Mar 18, 2022

0 votes

0 answers

NPTEL Assignment of Hashing Techniques
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal code for the University of Waterloo is N2L 3G1. Devise a suitable hash function for this system.

Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal ...

rsansiya111

378 views

rsansiya111 asked Mar 12, 2022

0 votes

1 answer

CRT-2022
Kindly help

Kindly help

rsansiya111

374 views

rsansiya111 asked Feb 25, 2022

0 votes

1 answer

100

CRT-2022
Kindly Help

Kindly Help

rsansiya111

348 views

rsansiya111 asked Feb 25, 2022

Page:

« prev
1
2
3
4
5
6
7
8
9
10
...
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