Dark Mode

Recent questions tagged data-structures

9 votes

2 answers

211

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, 2022

4.8k views

7 votes

2 answers

212

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, 2022

742 views

6 votes

2 answers

213

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, 2022

348 views

9 votes

1 answer

214

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, 2022

535 views

10 votes

2 answers

215

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, 2022

372 views

6 votes

2 answers

216

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, 2022

289 views

8 votes

1 answer

217

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, 2022

408 views

7 votes

1 answer

218

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, 2022

734 views

6 votes

3 answers

219

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, 2022

374 views

3 votes

2 answers

220

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, 2022

323 views

0 votes

1 answer

221

A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)? Assume one bit storage per pixel and starting pixel location is at 0. 1) 1016 2)1006 3) 610 4)616

viral8702 asked in Programming Apr 29, 2022

179 views

0 votes

0 answers

222

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, 2022

218 views

0 votes

1 answer

223

CRT-2022
Kindly Help

rsansiya111 asked in DS Feb 25, 2022

153 views

9 votes

3 answers

224

GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.

Arjun asked in DS Feb 15, 2022

by Arjun

3.5k views

13 votes

3 answers

225

GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .

Arjun asked in DS Feb 15, 2022

by Arjun

5.5k views

15 votes

7 answers

226

GATE CSE 2022 | Question: 52
Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on these two queues are $\textsf{Enqueue (Q, element)}$ ... $\textsf{Final State}$ in the figure) without using any additional storage is________________.

Arjun asked in DS Feb 15, 2022

by Arjun

8.0k views

0 votes

2 answers

227

ACE Test Series
A ) B ) C ) D )

ramakrushna asked in DS Jan 27, 2022

391 views

0 votes

1 answer

228

Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)

Sagar475 asked in DS Jan 21, 2022

341 views

0 votes

1 answer

229

max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.

atulcse asked in DS Jan 16, 2022

323 views

1 vote

2 answers

230

Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)

lalitver10 asked in Programming Jan 13, 2022

599 views

Page:

« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
54
next »

Recent questions tagged data-structures