Recent questions in DS

Question

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{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}&4&2&2&0&2&3&1&1&1&0&1.7&4
\\\hline\textbf{2 Marks Count}&1&0&3&2&0&0&1&3&3&0&1.2&3
\\\hline\textbf{Total Marks}&6&2&4&4&2&3&3&7&7&\bf{2}&\bf{4.2}&\bf{7}\\\hline
\end{array}}}$$

0 votes

0 answers

1

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 asked in DS 3 days ago

by qweas8671

57 views

0 votes

1 answer

2

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

GateOverflow04 asked in DS 6 days ago

by GateOverflow04

33 views

0 votes

1 answer

3

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

Arunava Samanta asked in DS Jun 28

by Arunava Samanta

28 views

0 votes

0 answers

4

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?

samarpita asked in DS May 21

by samarpita

107 views

0 votes

0 answers

5

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

Vallari Garg asked in DS May 17

by Vallari Garg

55 views

5 votes

2 answers

6

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 1
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as $\textit{prev}$ ... $6 \leftrightarrow 5 \leftrightarrow 4 \leftrightarrow 3 \leftrightarrow 1 \leftrightarrow 2$

GO Classes asked in DS May 5

by GO Classes

346 views

6 votes

2 answers

7

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 2
Consider the following function Merge() that takes the head of two linked lists. struct node { int value; struct node *next; }; typedef struct node Node; Node * Merge(Node * head1, Node * head2) { if (head1 == ... $\text{List}2: 2\rightarrow 4\rightarrow 6\rightarrow 8\rightarrow 10 \rightarrow 12\rightarrow \text{Null}$

GO Classes asked in DS May 5

by GO Classes

264 views

4 votes

1 answer

8

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 3
What is the run-time complexity of inserting a new element at the beginning of a circular, doubly-linked list with a head? $O(1)$ $O(\log \text{N})$ $O(\text{N})$ $O(\text{N}^2)$

GO Classes asked in DS May 5

by GO Classes

135 views

5 votes

1 answer

9

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 4
Given a circular, doubly-linked list whose contents are sorted in ascending order, what is the run-time complexity for inserting a new element into the list so that it remains correctly sorted? (Including the time required to search for the element’s correct position.) $O(1)$ $O(\log \text{N})$ $O(N)$ $O(\text{N}^{2})$

GO Classes asked in DS May 5

by GO Classes

187 views

4 votes

1 answer

10

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 5
Consider a function findCLL that takes a doubly circular linked list head and an integer value as input. One example of doubly circular linked list is given below - int findCLL(struct node * first, int n) { while (first -> value != n) ... $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.

GO Classes asked in DS May 5

by GO Classes

151 views

5 votes

2 answers

11

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 6
Consider the following Doubly Linked List: If head points to the first node of the linked list then what will be the output of the following node? head=head->next->next->next->prev; head->next->next->prev=head; printf("%d",head->next->next->prev->next->value); $1$ $3$ $5$ $7$

GO Classes asked in DS May 5

by GO Classes

127 views

6 votes

1 answer

12

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 7
Consider the following program. printlist() is a function that takes the head of a linked list and prints all nodes values separated by comma. Node is typedefed singly linked list type struct. void insert1(Node *head,int data) { Node *NewNode= (Node *) ... Line $\text{X}$ prints $1,2,3,4,5$ Line $\text{Y}$ prints $1,2,3,4,5$

GO Classes asked in DS May 5

by GO Classes

171 views

6 votes

1 answer

13

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 9
Consider the following function fun() that takes the head of a linked list. struct node { int value; struct node *next; }; typedef struct node Node; int fun(Node *head){ if(head== NULL) return 1; Node *p,*q; p = ... $0$ is length of the linked list is even Function may go to infinite loop if there is a loop in linked list

GO Classes asked in DS May 5

by GO Classes

176 views

5 votes

3 answers

14

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 10
Consider the following function foo() which takes the head pointer of two singly-linked lists. struct node *foo(struct node *head1, struct node *head2) { struct node *final, *temp; if (head1 == NULL) return head2; if (head2 == NULL) return head1; temp = foo ... $1,2,3,4,5,7,8,10,9,10$ $1,2,3,4,5,8,7,10,9,10$ None of these

GO Classes asked in DS May 5

by GO Classes

193 views

3 votes

2 answers

15

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 11
A doubly linked list is declared as: struct Node { int Value; struct Node *prev; struct Node *next; }; Which of the following segment of code deletes the node pointed to by $\text{X}$ from the doubly linked list, if it is ... $; \text{X} \rightarrow$ next $\rightarrow$ prev $= \text{X} \rightarrow$ next; free(X);

GO Classes asked in DS May 5

by GO Classes

127 views

0 votes

1 answer

16

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;

jugnu1337 asked in DS Apr 21

by jugnu1337

140 views

0 votes

0 answers

17

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??

Kartiksarvaiya asked in DS Mar 18

by Kartiksarvaiya

139 views

0 votes

0 answers

18

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.

rsansiya111 asked in DS Mar 12

by rsansiya111

132 views

0 votes

1 answer

19

CRT-2022
Kindly help

rsansiya111 asked in DS Feb 25

by rsansiya111

100 views

0 votes

1 answer

20

CRT-2022
Kindly Help

rsansiya111 asked in DS Feb 25

by rsansiya111

92 views

Page:

1
2
3
4
5
6
...
81
next »

Ask a Question

Follow @gateoverflow

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 questions in DS

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Categories

Network Sites

Recent questions in DS

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Recent Posts

Categories

Recent Blog Comments

Network Sites