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 nilanjandaw
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by nilanjandaw
7
answers
1
GATE CSE 2019 | Question: 40
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\Theta(n)$ time A binary search tree ... time Which of the above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
commented
in
DS
Jan 31, 2021
20.5k
views
gatecse-2019
data-structures
binary-heap
2-marks
5
answers
2
GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error
commented
in
Databases
Aug 26, 2020
18.2k
views
gateit-2008
databases
sql
normal
6
answers
3
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
commented
in
Databases
Aug 26, 2020
21.0k
views
gatecse-2006
databases
sql
normal
13
answers
4
GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
commented
in
DS
Aug 1, 2020
39.2k
views
gateit-2007
data-structures
binary-search-tree
normal
7
answers
5
GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only
commented
in
Theory of Computation
Jul 24, 2020
20.0k
views
gatecse-2020
theory-of-computation
identify-class-language
1-mark
3
answers
6
GATE CSE 1988 | Question: 16i
Assume that the matrix $A$ given below, has factorization of the form $LU=PA$, where $L$ is lower-triangular with all diagonal elements equal to $1, U$ is upper-triangular, and $P$ ... $L, U,$ and $P$ using Gaussian elimination with partial pivoting.
commented
in
Linear Algebra
Jun 18, 2020
3.3k
views
gate1988
normal
descriptive
linear-algebra
matrix
4
answers
7
GATE2011 AG: GA-9
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below. The distances covered during four laps of the journey are listed in the table below ... the given data, we can conclude that the fuel consumed per kilometre was least during the lap $P$ $Q$ $R$ $S$
commented
in
Quantitative Aptitude
May 16, 2020
3.9k
views
general-aptitude
quantitative-aptitude
gate2011-ag
data-interpretation
graphical-data
10
answers
8
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)$
commented
in
DS
Apr 20, 2020
31.9k
views
gatecse-2003
data-structures
binary-heap
2
answers
9
MadeEasy Subject Test 2019: Programming & DS - Heap
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
commented
in
DS
Apr 20, 2020
3.5k
views
made-easy-test-series
data-structures
binary-heap
5
answers
10
TIFR CSE 2010 | Part B | Question: 26
Suppose there is a balanced binary search tree with $n$ nodes, where at each node, in addition to the key, we store the number of elements in the sub tree rooted at that node. Now, given two elements $a$ and $b$, such that $a < b$ ... $O(n)$ comparisons and $O(n)$ additions, using depth-first- search.
commented
in
DS
Apr 9, 2020
8.8k
views
tifr2010
binary-search-tree
8
answers
11
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
commented
in
Combinatory
Mar 26, 2020
16.5k
views
gatecse-2020
numerical-answers
combinatory
2-marks
6
answers
12
GATE CSE 2016 Set 1 | Question: 53
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{bytes }$. Assume that the size of the IP header is $20$ $\text{bytes }.$ The number of fragments that the IP datagram will be divided into for transmission is________.
commented
in
Computer Networks
Jan 23, 2020
16.6k
views
gatecse-2016-set1
computer-networks
ip-packet
normal
numerical-answers
4
answers
13
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
commented
in
Operating System
Jan 16, 2020
21.5k
views
gatecse-2019
operating-system
virtual-memory
2-marks
3
answers
14
GATE CSE 2004 | Question: 56
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\text{TCP}$ layer prefixes $20$ byte header to the message. This passes ... $200$ $220$ $240$ $260$
commented
in
Computer Networks
Jul 27, 2019
23.0k
views
gatecse-2004
computer-networks
ip-addressing
tcp
normal
7
answers
15
GATE CSE 2017 Set 1 | Question: 45
The values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel $= 1$ Mbps. Propagation delay from sender to receiver $= 0.75$ ms. Time to process a frame $= 0.25$ ms. Number ... (expressed in percentage) of the Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
commented
in
Computer Networks
Jul 27, 2019
32.9k
views
gatecse-2017-set1
computer-networks
stop-and-wait
numerical-answers
normal
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:...