Recent activity by Scion_of_fire / GATE Overflow for GATE CSE

2 answers

1

DS AVL Trees
Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the minimum number of nodes possible in Avl tree of height 6.What will be total number of nodes in T? Edit:- I am getting 75.5 as answer.Now i am not sure whether to pick 75 ot 76

Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the mini...

1.2k views

answered Aug 24, 2020

6 answers

2

GATE CSE 2014 Set 2 | Question: 14
Consider the tree arcs of a BFS traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing the shortest path between every pair of vertices. the shortest path ... graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.

Consider the tree arcs of a BFS traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure f...

11.1k views

commented Aug 24, 2020

3 answers

3

GATE CSE 1988 | Question: 9i
The following program fragment was written in an assembly language for a single address computer with one accumulator register: LOAD B MULT C STORE T1 ADD A STORE T2 MULT T2 ADD T1 STORE Z Give the arithmetic expression implemented by the fragment.

The following program fragment was written in an assembly language for a single address computer with one accumulator register:LOAD B MULT C STORE T1 ADD A STORE T2 MULT ...

1.7k views

answered Jul 7, 2020

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