Recent questions and answers in DS

0 votes

0 answers

self ___doubts
What is the meaning of ROOTED binary tree 1)2nCn / (n+1) , for the number unlabeled trees 2)2nCn / (n+1) ) * (n!) , for labeled trees 3)No of Labelled Trees => n pow n-2 4)Total No of rooted labeled trees => (n pow n-2) * n => n pow n-1 please diff b/w all 4

asked Oct 11 in DS by mohan123 (20 points) | 13 views

0 votes

0 answers

gatebook_graph
The edge graph of a graph G is the graph with vertex set E(G) in which two vertices are joined if and only if they are adjacent edges in G. if G is a simple graph with degree sequence , the no of edges in edge graph of G is?

asked Oct 10 in DS by mohan123 (20 points) | 5 views

0 votes

1 answer

Self doubt:GATE 2004 Data Structures
In below question, it can be done via both front and rear node as well, isn't it? A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both ... the nptel video below shows for front node. Please let me know if I'm missing something. https://youtu.be/PGWZUgzDMYI?t=31m32s

answered Oct 10 in DS by Abhinav993 (82 points) | 20 views

0 votes

0 answers

self doubt about tournament tree
Given an array, Find the 1st & 2nd largest element with min. no. of comparison?? answer is n-1 + logn – 1 = n + logn – 2 here tournament tree is used.Now I’m having doubt that after finding Largest element in (n-1) comparison, how can we find 2nd largest in (logn – 1) time??? anyone please explain. [closed]

asked Oct 9 in DS by MRINMOY_HALDER (32 points) | 14 views

0 votes

1 answer

Self Doubt - Time complexity doubly linked list
Suppose I have a doubly linked list in unsorted order : 1. What will be the best sorting algorithm that can be used? 2. What will be the time complexity of using binary search + insertion sort in this doubly linked list? 3. What will be the time ... operation will take 0(1) time. We are doing this for n elements. So it will be 0(nlogn). Am I correct?

answered Sep 25 in DS by GAITONDE (1.2k points) | 7 views

0 votes

1 answer

Self doubt- Linked list
In circular singly linked list, while insertion at the end takes O(n) time. Why don't we maintain an extra pointer pointing to last node each time. So while insertion it will reduce the time to O(1) time?

answered Sep 25 in DS by GAITONDE (1.2k points) | 33 views

0 votes

1 answer

max/min heap
Given a max and min heap consisting n elements, how much time required to merge them and creating : a min-heap a max heap note: temporary array size 2n is given. anyone please explain how to approach this??

answered Sep 19 in DS by Bikram (1.2k points) | 14 views

0 votes

0 answers

Self Doubt: Tree edge
According to the definition of tree edge → It is a edge which is present in tree obtained after applying DFS on the graph. All the edges marked in green are tree edges. My question is why isn’t $1-8$ also a tree edge? While doing DFS we can also take 1-8 edge right?

asked Sep 19 in DS by GAITONDE (1.2k points) | 6 views

0 votes

0 answers

Made Easy Programming and Data Structures test 2 GATE 2020

asked Sep 16 in DS by vg653 (14 points) | 24 views

0 votes

3 answers

Linked List Question
The number of operations and time complexity required for searching 36th element from end in an singly linked of size n is?

answered Sep 13 in DS by sujit upadhyay (20 points) | 41 views

0 votes

1 answer

Self Doubt on Programming
Suppose we are passing the address of an array as a parameter Then can we get different result for call by reference, call by name and call by value result?

answered Sep 1 in DS by Bikram (1.2k points) | 15 views

0 votes

0 answers

Self doubt on DS GATE question
In the code given in below question void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } If we. add this line node* q = m; ... A) will be more accurate, which was a confusion in 2017 question?? https://gateoverflow.in/118711/gate2017-1-08?fbclid=IwAR04hpURIaErTYt3mH_e8ta_NfUyP6RwXgpxvWDnN6RFHvcNZKWuOmMPviM right??

asked Aug 29 in DS by srestha (318 points) | 6 views

0 votes

0 answers

Self doubt on Linked List
What is meaning of this line in a linked list?? q = p ? p -> next : 0;

asked Aug 29 in DS by srestha (318 points) | 9 views

0 votes

1 answer

Please help me out that why there is need to differentiate between the addresses in threaded binary tree why?

answered Aug 28 in DS by Bikram (1.2k points) | 17 views

0 votes

3 answers

#DataStructures Linked List Self Doubt?
What does this statement means – Inverting a node after the node with given location in a Doubly LL of size n? Thank you!

answered Aug 26 in DS by Bikram (1.2k points) | 34 views

0 votes

0 answers

Self doubt on Heap
What is time to inserting an element in heap?? We know heap is left filled. Now, we need to insert a node , which must be in $logn$ to check if it last level node of height h of the heap. Now, go upto last node will take $O\left ( n \right )$ time. And there could ... $O\left ( n\log n \right )$ or $O\left ( \log n \right )$??

asked Aug 26 in DS by srestha (318 points) | 29 views

0 votes

2 answers

Is it necessary to study the programs of trees for gate

answered Aug 24 in DS by Bikram (1.2k points) | 40 views

0 votes

2 answers

Is every full tree also a complete binary tree?

answered Aug 24 in DS by Bikram (1.2k points) | 34 views

0 votes

0 answers

Self Doubt: BST and Heap
What is the time required to Deletion of the smallest element from a balanced binary search tree Insertion an element in heap Will it be O(log n) or O(1) for 1st one and O(n) or O(logn) for 2nd one??

asked Aug 22 in DS by srestha (318 points) | 34 views

0 votes

1 answer

DATA STRUCTURE DOUBT
Which permutations can be obtained in the output(in the same order)using stack assuming the input is in the sequence 5,7,8,4,6 in that order? 6,8,4,7,5 6,4,5,7,8 6,4,7,8,5 7,8,4,6,5

answered Aug 20 in DS by Satbir (2.5k points) | 15 views

0 votes

0 answers

Time complexity to search and add all the elements between two elements in a given BST.

asked Aug 19 in DS by Rishav_Bhatt (8 points) | 8 views

0 votes

0 answers

Operations in Circular Linked List
Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? Insertion at the front of the linked list Insertion at the end of the ... of the linked list (a) I and II (b) I and III (c) I, II, III and IV (d) None

asked Aug 19 in DS by DukeThunders (197 points) | 8 views

0 votes

0 answers

Self-Doubt:Linked list
Can simply putting pririty in the queue elements, we can get a priority queue? If stack can implement with a priority queue, why linked list cannot implement with priority queue? Even linked list cannot implement with stack or queue. right??

asked Aug 16 in DS by srestha (318 points) | 11 views

0 votes

0 answers

Self-doubt-Priority queue
Can we implement linked-list with priority queue??

asked Aug 15 in DS by srestha (318 points) | 22 views

0 votes

0 answers

GATE 2020 syllabus Data Structure
Is hashing topic in data structures has been removed because on the official website of gate iitd I am not seeing the hashing topic listed in the syllabus? Sorry, I know this isn't the type of question that people ask here but I just wanted to know. [closed]

asked Aug 8 in DS by setu bhaskar (7 points) | 19 views

0 votes

1 answer

How to prove Avl tree of height h contain at least 2^h nodes?

answered Jul 28 in DS by Rudr Pawan (577 points) | 21 views

0 votes

0 answers

GateForum: DS
In the following graph, the number of BFS traversals possible are?

asked Jul 26 in DS by Sambhrant Maurya (271 points) | 23 views

0 votes

0 answers

In a Binary tree, given Leaf nodes = 200 then how many nodes will be of degree 1?

asked Jul 25 in DS by iarnav (65 points) | 11 views

0 votes

0 answers

Upper triangular matrix
What is the formula for column major order of upper triangular matrix.

asked Jul 24 in DS by Risi (6 points) | 6 views

0 votes

1 answer

CLL self doubt.

answered Jul 20 in DS by Debargha Bhattacharj (1.5k points) | 12 views

0 votes

1 answer

Made Easy- Theory Book - Chapter 2-Arrays
Consider a 2D array, A[-8...12, -4...16]. Calculate the address of A[1, 3]. Assume that it is stored in row major order. Each element occupies 4-bytes and starting address of array is 2000.

answered Jul 13 in DS by Hirak (1.2k points) | 9 views

0 votes

0 answers

Self doubt on Addressing of Two dimensional Array
Please explain me row major and column major in lower and upper triangular matrix.

asked Jul 7 in DS by Ketkijoshi79 (6 points) | 5 views

0 votes

1 answer

Which of the following is true for AVL tree?
Which of the following is true for AVL tree? A=Difference of heights of left and right subtrees is 0 B=Difference of heights of left and right subtrees is 1 C=Difference of heights of left and right subtrees is <= 1 D=None of the above

answered Jul 5 in DS by user2525 (1.5k points) | 8 views

0 votes

1 answer

The number of edges in a Minimum Spanning Tree of a connected Graph G with n vertices is

answered Jul 4 in DS by Hirak (1.2k points) | 9 views

0 votes

1 answer

A sorted array in ascending order is
A sorted array in ascending order is A=MAX Heap B=MIN Heap C= Not a Heap Tree D= None of these

answered Jul 4 in DS by Hirak (1.2k points) | 14 views

0 votes

1 answer

An hash table with chaining as a collision resolution technique degenerates to a

answered Jul 4 in DS by toxicdesire (94 points) | 11 views

0 votes

0 answers

Following is a NP Problem related to Graph
Following is a NP Problem related to Graph A= To find Longest Path B= To find Shortest Path C= To find Minimum Spanning Tree D= To find a Cycle

asked Jul 4 in DS by Dmmodi (50 points) | 6 views

0 votes

1 answer

MADE EASY Test Series TOPICWISE : PROGRAMMING AND DATA STRUCTURES-2 (GATE - 2020)

answered Jun 25 in DS by Nishi Agarwal (17 points) | 30 views

0 votes

1 answer

Self Doubt Data Structure and Programming
If we have a singly (A) and a doubly linked list(B) containing same number of nodes and with same content, consider a scenario where the pointer to the node that has to be deleted is given. And delete operations is performed on both A and B. In both cases time complexity to perform the operations will be same. State true or false:____

answered Jun 25 in DS by Nishi Agarwal (17 points) | 19 views

0 votes

0 answers

Que on Array doubt

asked Jun 20 in DS by Pradeep A (7 points) | 60 views