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 Yashdeep2000
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Yashdeep2000
0
answers
1
Computer Networks : Using DBA instead of LBA
Going through the concept of LBA (Limited Broadcasting) and DBA (Directed Broadcast Address), if i consider two cases Case 1 : when host A (10.1.2.3) want to send the packet to all the nodes of a DIFFERENT Network (say 11.0.0.0), in ... .255.255) in Case 2, why can't i just use DBA (Directed Broadcasting), making the Destination IP 10.255.255.255 ?
edited
in
Computer Networks
Mar 2
112
views
computer-networks
3
answers
2
GATE CSE 2000 | Question: 19
Consider the syntax directed translation scheme $\textsf{(SDTS)}$ ... given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.
commented
in
Compiler Design
Jan 30
7.9k
views
gatecse-2000
compiler-design
syntax-directed-translation
normal
descriptive
4
answers
3
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)$
commented
in
Compiler Design
Oct 7, 2023
7.1k
views
gatecse-2011
compiler-design
parsing
normal
4
answers
4
GATE CSE 2018 | Question: 38
Consider the following parse tree for the expression a#b$\$c$\$d#e#f, involving two binary operators $\$ ... has higher precedence and is right associative; # is left associative
commented
in
Compiler Design
Oct 7, 2023
9.3k
views
gatecse-2018
compiler-design
parsing
normal
2-marks
4
answers
5
GATE CSE 2003 | Question: 15
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free
commented
in
Theory of Computation
Aug 21, 2023
15.6k
views
theory-of-computation
gatecse-2003
normal
recursive-and-recursively-enumerable-languages
1
answer
6
Personal doubt
So, i have started preparation from 1st of August with TOC and planned to complete it by 15th of August. Everything was going according to planned, until i got hit Undecidability, whole planning went down to drain, its 20th and i still didn't manage ... are they doing it? Please help me understand what i might be doing wrong, would love your suggestion. Thank you for reading through
commented
in
GATE
Aug 21, 2023
245
views
gate-preparation
preparation
1
answer
7
Personal doubt
People say that "we should have our basics clear and we should have conceptual clearity" in any particular topic, what is the meaning of "conceptual clearity"? What do topper mean when they say that you should have "conceptual clearity"?
commented
in
GATE
Aug 20, 2023
334
views
1
answer
8
GATE CSE 2001 | Question: 2.7
Consider the following problem $X$. Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of $M$ on $w$ visit the state of $q$? Which of the ... ? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem
commented
in
Theory of Computation
Aug 18, 2023
13.4k
views
gatecse-2001
theory-of-computation
decidability
normal
1
answer
9
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
commented
in
Theory of Computation
Aug 18, 2023
11.9k
views
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
10
answers
10
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
commented
in
DS
Aug 14, 2022
27.0k
views
data-structures
hashing
normal
gatecse-2010
7
answers
11
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
in
DS
Jul 26, 2022
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
11
answers
12
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
commented
in
DS
Jul 19, 2022
31.4k
views
gatecse-2004
binary-search-tree
normal
data-structures
8
answers
13
GATE CSE 2014 Set 3 | Question: 39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
answered
in
DS
Jul 18, 2022
31.5k
views
gatecse-2014-set3
data-structures
binary-search-tree
numerical-answers
normal
4
answers
14
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
commented
in
DS
Jul 18, 2022
21.9k
views
gatecse-2020
data-structures
binary-search-tree
2-marks
8
answers
15
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
commented
in
Graph Theory
May 24, 2022
7.0k
views
gateit-2004
graph-theory
graph-connectivity
normal
1
answer
16
ZEAL test-series : Cardinality of relation!
I know that the number of equivalence relation is bell no. i.e 7th bell no. i.e. 877, but i am not able to find the cardinality of R! Please help!
commented
in
Set Theory & Algebra
Mar 6, 2022
674
views
equivalence-class
relations
1
answer
17
Finding complement of an element in lattice!
I am struggling to find complement of ‘b’ clearly ‘c’ and ‘d’ are not, also ‘g’ can also not be complement since (g join b = g). Please help me with this!
commented
in
Set Theory & Algebra
Mar 6, 2022
720
views
lattice
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:...