Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Musa
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Musa
1
vote
61
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
answered
in
Algorithms
Aug 21, 2020
23.8k
views
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
3
votes
62
GATE CSE 2005 | Question: 5
A program $P$ reads in $500$ integers in the range $[0, 100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50$. What would be the best way for $P$ to store the frequencies? An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers
answered
in
DS
Aug 19, 2020
20.7k
views
gatecse-2005
data-structures
array
easy
0
votes
63
build heap
how to merge two binary max heaps ? size of first heap is m+n and size of second heap is n and also find the complexity.
answered
in
DS
Aug 19, 2020
831
views
data-structures
binary-heap
time-complexity
0
votes
64
ISRO2018-80
If $\text{Tree-1}$ and $\text{Tree-2}$ are the trees indicated below: Which traversals of $\text{Tree-1}$ and $\text{Tree-2}$, respectively, will produce the same sequence? Preorder, postorder Postorder, inorder Postorder, preorder Inorder, preorder
answered
in
DS
Aug 19, 2020
6.4k
views
isro2018
data-structures
tree-traversal
1
vote
65
ISRO2011-26
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result in FGBDECA ABFGCDE BFGCDEA AFGBDEC
answered
in
DS
Aug 19, 2020
7.5k
views
isro2011
data-structures
tree-traversal
3
votes
66
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
answered
in
DS
Aug 18, 2020
13.4k
views
gateit-2005
data-structures
normal
binary-search-tree
1
vote
67
GATE CSE 2011 | Question: 27
Consider two binary operators $\text{ } \uparrow \text{'}$ and $\text{ } \downarrow \text{'}$ with the precedence of operator $\downarrow$ being lower than that of the operator $\uparrow$. Operator $\uparrow$ is right associative while operator ... Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$
answered
in
Compiler Design
Aug 18, 2020
7.1k
views
gatecse-2011
compiler-design
parsing
normal
1
vote
68
GATE CSE 2015 Set 3 | Question: 13
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is $65$ $67$ $69$ $83$
answered
in
DS
Aug 18, 2020
7.3k
views
gatecse-2015-set3
data-structures
binary-search-tree
easy
1
vote
69
number of comparision in searching in BST
Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of the keys present in above BST, what would be the expected number of comparisons? (A) 2.75 (B) 2.25 (C) 2.57 (D) 3.25
answered
in
DS
Aug 17, 2020
18.4k
views
data-structures
binary-tree
0
votes
70
UGC NET CSE | July 2018 | Part 2 | Question: 26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
answered
in
DS
Aug 17, 2020
3.5k
views
ugcnetcse-july2018-paper2
data-structures
binary-search-tree
0
votes
71
ISRO2009-31
A full binary tree with $n$ leaves contains $n$ nodes $\log_2 n$ nodes $2n-1$ $2^n$ nodes
answered
in
DS
Aug 17, 2020
5.8k
views
isro2009
data-structures
binary-tree
0
votes
72
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
answered
in
DS
Aug 17, 2020
6.2k
views
isro2013
binary-tree
easy
1
vote
73
GATE CSE 2007 | Question: 39, UGCNET-June2015-II: 22
The inorder and preorder traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectively The postorder traversal of the binary tree is: $\text{d e b f g c a}$ $\text{e d b g f c a}$ $\text{e d b f g c a}$ $\text{d e f g b c a}$
answered
in
DS
Aug 17, 2020
7.6k
views
gatecse-2007
data-structures
binary-tree
normal
ugcnetcse-june2015-paper2
0
votes
74
GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$
answered
in
DS
Aug 10, 2020
26.0k
views
gateit-2006
data-structures
binary-tree
normal
0
votes
75
GATE CSE 2007 | Question: 12
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is: $2^h -1$ $2^{h-1} -1$ $2^{h+1} -1$ $2^{h+1}$
answered
in
DS
Jul 7, 2020
25.7k
views
gatecse-2007
data-structures
binary-tree
easy
0
votes
76
The maximum number of nodes on level i of a binary tree
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is In the following answers, the operator '^' indicates power a) 2^i-1 b)2^i c)2^i+1 d)2^(i+1/2)
answered
in
DS
Jun 25, 2020
101k
views
binary-tree
data-structures
0
votes
77
GeeksForGeeks Question
If arity of operators is fixed, then which of the following notations can be used to parse expressions without parentheses? a) Infix Notation (Inorder traversal of a expression tree) b) Postfix Notation (Postorder traversal of a expression tree) c) Prefix Notation (Preorder traversal of a expression tree) A b and c B Only b C a, b and c D None of them What arity of operators?
answered
in
DS
Jun 25, 2020
3.4k
views
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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 Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...