Recent activity by Yashdeep2000 / GATE Overflow for GATE CSE

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 ?

Going through the concept of LBA (Limited Broadcasting) and DBA (Directed Broadcast Address), if i consider two casesCase 1 : when host A (10.1.2.3) want to send the pack...

138 views

edited Mar 2

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$.

Consider the syntax directed translation scheme $\textsf{(SDTS)}$ given in the following. Assume attribute evaluation with bottom-up parsing, i.e., attributes are evaluat...

8.2k views

commented Jan 30

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)$

Consider two binary operators $\text{‘} \uparrow \text{’}$ and $\text{‘} \downarrow \text{’}$ with the precedence of operator $\downarrow$ being lower than that ...

7.2k views

commented Oct 7, 2023

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

Consider the following parse tree for the expression a#b$\$$c$\$$d#e#f, involving two binary operators $\$$ and #.Which one of the following is correct for the given par...

9.4k views

commented Oct 7, 2023

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

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 fin...

15.6k views

commented Aug 21, 2023

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

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 Undecid...

239 views

commented Aug 21, 2023

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"?

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 top...

340 views

commented Aug 20, 2023

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

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 ...

13.5k views

commented Aug 18, 2023

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

Consider the following two statements about regular languages:$S_1$: Every infinite regular language contains an undecidable language as a subset.$S_2$:...

12.0k views

commented Aug 18, 2023

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$

A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...

27.3k views

commented Aug 14, 2022

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$

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 rig...

23.5k views

commented Jul 26, 2022

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)$

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)$ ...

33.2k views

commented Jul 19, 2022

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 ______.

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$...

31.6k views

answered Jul 18, 2022

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)$

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 ...

22.0k views

commented Jul 18, 2022

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$

What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$

7.1k views

commented May 24, 2022

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!

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!

709 views

commented Mar 6, 2022

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!

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!

731 views

commented Mar 6, 2022

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