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 iarnav
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by iarnav
5
votes
1
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
answered
in
DS
Aug 16, 2019
27.0k
views
gatecse-2003
data-structures
heap
0
votes
2
#Algorithms Can Heapsort be applied on Min Heap Data Structure?
I've read and been told that Heapsort can only be applied on Max heap, but this article for G4G states otherwise - https://www.geeksforgeeks.org/heap-sort-for-decreasing-order-using-min-heap/ So, is it true that HS can be applied also on Min heap?
answered
in
Algorithms
Jun 21, 2018
626
views
heap
algorithms
binary-heap
1
vote
3
TIFR CSE 2014 | Part B | Question: 4
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? cost$(a, b) \geq 6$. cost$(b, e) \geq 5$. cost$(e, f) \geq 5$. cost$(a, d) \geq 4$. cost$(b, c) \geq 4$.
answered
in
Algorithms
Apr 29, 2018
4.2k
views
tifr2014
algorithms
graph-algorithms
minimum-spanning-tree
0
votes
4
Videos for Computer Architecture
The Gate Overflow Page for CO&A(https://gatecse.in/co-architecture/) has a broken YouTube link and I could not find any other good video lectures for Computer Organization. Kindly suggest any online video lectures that would be useful for GATE preparation
answered
in
CO and Architecture
Apr 5, 2018
1.2k
views
co-and-architecture
video-lectures
gate-preparation
0
votes
5
binary search space complexity
answered
in
Algorithms
Mar 2, 2018
1.8k
views
binary-search
recursion
space-complexity
test-series
1
vote
6
Required Artificial Intelligence resources for UGC NET
Hi I need some useful resources of AI for upcoming UGC NET exam. Currently, I am reading from Rich and Knight, Is it enough? Please let me know about any good quality books or video lectures.
answered
in
Artificial Intelligence
Mar 1, 2018
1.7k
views
artificial
intelligence
ugc-net
0
votes
7
UGC NET CSE | November 2017 | Part 2 | Question: 25
Post-order traversal of a given binary search tree $T$ produces following sequence of keys: $3,5,7,9,4,17,16,20,18,15,14$. Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$? $3,4,5,7,9,14,20,18,17,16,15$ $20,18,17,16,15,14,3,4,5,7,9$ $20,18,17,16,15,14,9,7,5,4,3$ $3,4,5,7,9,14,15,16,17,18,20$
answered
in
Unknown Category
Feb 8, 2018
1.4k
views
ugcnetcse-nov2017-paper2
3
votes
8
GATE CSE 2004 | Question: 39
Two matrices $M_1$ and $M_2$ are to be stored in arrays $A$ and $B$ ... column-major order best if both are in row-major order best if both are in column-major order independent of the storage scheme
answered
in
Algorithms
Jan 12, 2018
10.2k
views
gatecse-2004
algorithms
time-complexity
easy
0
votes
9
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
answered
in
DS
Jan 7, 2018
40.4k
views
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
0
votes
10
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
answered
in
DS
Jan 7, 2018
40.4k
views
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
1
vote
11
GATE CSE 2008 | Question: 54
Which of the following are true? A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation Multi-level access link (or display) arrangement is ... activation records II and V only I, III and IV only I, II and V only II, III and V only
answered
in
Compiler Design
Dec 28, 2017
14.9k
views
gatecse-2008
compiler-design
difficult
runtime-environment
3
votes
12
GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices
answered
in
Databases
Dec 9, 2017
10.6k
views
gatecse-2016-set2
databases
transaction-and-concurrency
normal
6
votes
13
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
answered
in
Databases
Dec 8, 2017
18.0k
views
gatecse-2016-set2
databases
transaction-and-concurrency
normal
3
votes
14
GATE CSE 2011 | Question: 26
Consider the languages $L1, \:L2 \:and \: L3$ ... (PDA) can be used to recognize $L1$ and $L2$ $L1$ is a regular language All the three languages are context free Turing machines can be used to recognize all the languages
answered
in
Theory of Computation
Nov 3, 2017
7.5k
views
gatecse-2011
theory-of-computation
identify-class-language
normal
0
votes
15
REGULAR LANGUAGES
wHICH ARE REGULAR
answered
in
Theory of Computation
Sep 19, 2017
449
views
theory-of-computation
regular-language
regular-expression
context-free-language
1
vote
16
DCFL and NDCFL
How to identify whether given CFL is either Deterministic or Non-Deterministic? I am getting confused here. I have analysed the above problem like this, DCFL - DPDA - If we are sure about when to push an input alphabet to stack and pop from a stack. NDCFL - NPDA - We are ... pop from the stack. If my understanding is wrong, please correct me. Is L = {a^n | n>=1 } is NPDA or PDA?
answered
in
Theory of Computation
Sep 19, 2017
1.2k
views
theory-of-computation
context-free-language
dcfl
1
vote
17
GATE CSE 2015 Set 2 | Question: 53
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
answered
in
Theory of Computation
Aug 23, 2017
13.3k
views
gatecse-2015-set2
theory-of-computation
finite-automata
normal
numerical-answers
minimal-state-automata
0
votes
18
cpu scheduling -SRTF with I/O example
Pno. AT BT1 I/O BT2 1 0 3 2 2 2 0 2 4 1 3 2 1 3 2 4 5 2 2 1 We are using SRTF scheduling algorithm with I/O. Please give me the gantt chart.
answered
in
Operating System
May 7, 2017
3.1k
views
process-scheduling
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
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
BARC RECRUITMENT 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.7k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.4k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent Blog Comments
Left with 10days, nothing heard back from them,...
I have updated the blog. Thanks for mentioning it.
Mtech(RA) CSE IIT Bombay Project 14 ?
Thanks man @ijnuhb because of u i cleared...
Yes : 720 General