Recent questions tagged data-structures / GATE Overflow for GATE CSE

1 votes

1 answer

1561

Quadratic probing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from $1$ to $6$. Which of the following locations will never be probed if a collision occurs at position $5$ ? A). $4$ B). $5$ C). $8$ D). $6$ Ans: $B$ Ans ... $ 6+1 = 3$ so the $5^{th}$ location is never probed Here why we are adding $1$ to find f(key)?

Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from $1$ to $6$. Which of the following locations will never...

Sara

6.3k views

Sara asked Jan 7, 2016

0 votes

1 answer

1562

data structure
describe in details

describe in details

resuscitate

674 views

resuscitate asked Jan 3, 2016

0 votes

1 answer

1563

"Max Heapify" algorithm
Consider the following "Max Heapify" algorithm. Array has atleast n and 1<=i<=n. After applying the Max-heapify rooted at A[i], the result will be subtree of A[1,....n] rooted at A[i] is max heap. [Assume that except root A[i], all its children satisfied heap property] Max ... 2p<=n, (2p+1)>=n, A[2p+1]<A[2p] d) p<=n, (2p+1)<=n, A[2p+1]<A[2p]

Consider the following "Max Heapify" algorithm. Array has atleast n and 1<=i<=n. After applying the Max-heapify rooted at A[i], the result will be subtree of A[1,....n] r...

piyushkr

974 views

piyushkr asked Dec 30, 2015

0 votes

2 answers

1564

Location of element using Row Major Order
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element. I know , this is pretty basic question. But , still got me wrong :)

My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element.I know , this is pret...

worst_engineer

3.8k views

worst_engineer asked Dec 29, 2015

1 votes

1 answer

1565

MadeEasy Test Series 2018: Programming & DS - Binary search Tree
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.

When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of d...

Sandeep Singh

1.1k views

Sandeep Singh asked Dec 27, 2015

0 votes

2 answers

1566

MadeEasy Test Series: Programming & DS - Linked Lists
Delete the duplicate node Delete the alternate duplicate node Delete the adjacent node None of these

Delete the duplicate nodeDelete the alternate duplicate nodeDelete the adjacent nodeNone of these

Sandeep Singh

613 views

Sandeep Singh asked Dec 27, 2015

0 votes

1 answer

1567

MadeEasy Test Series 2018: Programming & DS - Binary Tree
Consider the below code which run on any tree. In-order traversal Post-order traversal Pre-order traversal None of these

Consider the below code which run on any tree.In-order traversalPost-order traversalPre-order traversalNone of these

Sandeep Singh

494 views

Sandeep Singh asked Dec 27, 2015

0 votes

0 answers

1568

find the sum of values @the end of operations?

jagadeesha kanihal

338 views

jagadeesha kanihal asked Dec 26, 2015

0 votes

2 answers

1569

What will be the recurrence relation of the given below program for Preorder traversing technique?
Preorder(root) { Printf("root.data"); Preorder(root.leftsidetree); Preorder(root.rightside); }

Preorder(root){ Printf("root.data"); Preorder(root.leftsidetree); Preorder(root.rightside);}

piyushkr

979 views

piyushkr asked Dec 24, 2015

0 votes

2 answers

1570

how many threads are there.

venky.victory35

695 views

venky.victory35 asked Dec 20, 2015

0 votes

1 answer

1571

Is it possible to delete intermediate node/number in Heap?
Is it possible to delete intermediate node/number in Heap? Not a root or last.

Is it possible to delete intermediate node/number in Heap? Not a root or last.

Shashank Chavan

536 views

Shashank Chavan asked Dec 18, 2015

2 votes

2 answers

1572

#doubt on heaps and binary search
Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new leaf to the root to find the position for newly inserted element, the ... logn) as upon applying binary search we wud compare O(logn) elements(neighbours and its own root only) plz clr my confusion

Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new le...

ashandeep

840 views

ashandeep asked Dec 16, 2015

0 votes

2 answers

1573

Postfix evaluation
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$ Note that $\wedge$ is the exponential operator. What is the maximum height of the stack and the final value of post-fix evaluation respectively are a. $3,\;1$ b. $4,\;1$ c. $3,\;12$ d. $2,\;1$

The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$Note that $\wed...

tiger

5.4k views

tiger asked Dec 15, 2015

0 votes

2 answers

1574

Test Series QS - Algorithms
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.

When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of d...

mysticPrince

521 views

mysticPrince asked Dec 8, 2015

0 votes

3 answers

1575

how to construct BST by given preorder and postorder traversal
Given preorder and postorder traversal of binary search tree. Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92 Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, 65, 92, 93, 88, 50 The number of nodes present at level 3 are _________. Assume root is present at level 0.

Given preorder and postorder traversal of binary search tree.Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, ...

resuscitate

4.4k views

resuscitate asked Dec 8, 2015

1 votes

2 answers

1576

Implementing Queue with only one pointer
Which of the following statement is/are correct? 1. If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time. 2. If we use only Rear pointer in queue, then insertion is O(1) and deletion is not possible.

Which of the following statement is/are correct?1. If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time.2. If we use only Rea...

Tushar Shinde

2.4k views

Tushar Shinde asked Dec 7, 2015

16 votes

3 answers

1577

Find address of element in 3d array
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________.

A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________...

shikharV

15.6k views

shikharV asked Dec 4, 2015

1 votes

0 answers

1578

What is subarray and its example?
Whats is subarray ? Can you explain with example?!

Whats is subarray ? Can you explain with example?!

Shashank Chavan

475 views

Shashank Chavan asked Dec 3, 2015

1 votes

1 answer

1579

Data structure for controlling thrashing
Given answer: A Please explain.

Given answer: APlease explain.

shikharV

945 views

shikharV asked Nov 28, 2015

3 votes

0 answers

1580

Total running time of 'm' access operation in a Splay tree .. [GATEFORUM-TEST-DSA]

Vinay Yadav

550 views

Vinay Yadav asked Nov 26, 2015

10 votes

2 answers

1581

TIFR CSE 2014 | Part B | Question: 1
Let $T$ be a rooted binary tree whose vertices are labelled with symbols $a, b, c, d, e, f, g, h, i, j, k$. Suppose the in-order (visit left subtree, visit root, visit right subtree) and post-order (visit left subtree, visit right ... How many leaves does the tree have? THREE. FOUR. FIVE. SIX. Cannot be determined uniquely from the given information.

Let $T$ be a rooted binary tree whose vertices are labelled with symbols $a, b, c, d, e, f, g, h, i, j, k$. Suppose the in-order (visit left subtree, visit root, visit ri...

makhdoom ghaya

2.2k views

makhdoom ghaya asked Nov 19, 2015

2 votes

1 answer

1582

Finding the address of element in 2D array
Please solve the above problem. Given answer: D

Please solve the above problem. Given answer: D

shikharV

2.4k views

shikharV asked Nov 16, 2015

1 votes

1 answer

1583

Finding time complexity of Dynamic programming problem
The answer to the above problem is A but I am expecting it to be D as constant amount of work is required to solve each subproblem.

The answer to the above problem is A but I am expecting it to be D as constant amount of work is required to solve each subproblem.

shikharV

1.0k views

shikharV asked Nov 15, 2015

39 votes

2 answers

1584

TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.

Given a binary tree of the following form and having $n$ nodes, the height of the tree is$\Theta \left(\log n\right)$$\Theta \left(n\right)$$\Theta \left(\sqrt{n}\right)$...

makhdoom ghaya

3.5k views

makhdoom ghaya asked Nov 7, 2015

2 votes

1 answer

1585

Please Confirm the answers
Match List-I with List-II and select the correct answer using the codes given below the list: List-I List-II A.Evaluation of infix 1. 1 operand stack B.Evaluation of postfix 2. 1 operator stack C.Evaluation of prefix 3. 1 operator queue CODES: A B C (a) 1 2 3 (b ... sum of elements on right side of root, then the value of $[(Rd)-(Ld)+Root]$ is _______. 1. D 2. 1289 3. 95

Match List-I with List-II and select the correct answer using the codes given below the list: List-IList-IIA.Evaluation of infix1. 1 operand stackB.Evaluation of postfix2...

Aditya

423 views

Aditya asked Nov 6, 2015

29 votes

8 answers

1586

TIFR CSE 2012 | Part B | Question: 15
Let $T$ be a tree of $n$ nodes. Consider the following algorithm, that constructs a sequence of leaves $u_{1}, u_{2}...$. Let $u_{1}$ be some leaf of tree. Let $u_{2}$be a leaf that is farthest from $u_{1}$ ... . For the same tree, the distance between the last two vertices visited can be different, based on the choice of the first leaf $u_{1}$.

Let $T$ be a tree of $n$ nodes. Consider the following algorithm, that constructs a sequence of leaves $u_{1}, u_{2}...$. Let $u_{1}$ be some leaf of tree. Let $u_{2}$be ...

makhdoom ghaya

3.8k views

makhdoom ghaya asked Nov 2, 2015

26 votes

5 answers

1587

TIFR CSE 2011 | Part B | Question: 30
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the following is true? $B$ will be a sorted array. $B$ ... of array $A$. Doing the same transformation twice will not give the same array. $B$ is not a permutation of array $A$. None of the above.

Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the f...

makhdoom ghaya

4.9k views

makhdoom ghaya asked Oct 22, 2015

20 votes

3 answers

1588

TIFR CSE 2011 | Part B | Question: 29
You are given ten rings numbered from $1$ to $10$, and three pegs labeled $A$, $B$, and $C$. Initially all the rings are on peg $A$, arranged from top to bottom in ascending order of their numbers. The goal is to move all the rings to peg ... on top of another ring with a lower number. How many moves are required? $501$ $1023$ $2011$ $10079$ None of the above.

You are given ten rings numbered from $1$ to $10$, and three pegs labeled $A$, $B$, and $C$. Initially all the rings are on peg $A$, arranged from top to bottom in ascend...

makhdoom ghaya

2.9k views

makhdoom ghaya asked Oct 22, 2015

2 votes

1 answer

1589

evaluation of prefix expression takes O(n^2)....true?

admin

1.4k views

admin asked Oct 19, 2015

0 votes

2 answers

1590

What is the criteria for distinguishing data structure in terms of linear and non-linear ?
What is the criteria for distinguishing data structure in terms of linear and non-linear ? I am bit confused with the criteria for this. I have search and tried to clear this confusion but then i got more ... categorizing on the basis of storage in the memory and some place it is on the basis of traversal.

What is the criteria for distinguishing data structure in terms of linear and non-linear ?I am bit confused with the criteria for this. I have search and tried to clear t...

IgnitorSandeep

878 views

IgnitorSandeep asked Oct 10, 2015

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