Recent activity / GATE Overflow for GATE CSE

0 votes

0 answers

1

Finite Automata Combined with Relation
Let DFA , M = (Q, ∑, δ, q$_0$, F) and Relation R is defined on Q as R:Q$\rightarrow$Q such that pRq iff $\forall$ w ∈ $\Sigma$* [ δ*(p,w) ∈ F $\leftrightarrow$ δ*(p,w) ∈ F OR δ* (p, w) ∉ F $\leftrightarrow$ δ* (q, w) ∉ F] then ____________ A) R is Reflexive B) R is Symmetric C) R is transitive D) None

Let DFA , M = (Q, ∑, δ, q$_0$, F) and Relation R is defined on Q as R:Q$\rightarrow$Q such that pRq iff $\forall$ w ∈ $\Sigma$* [ δ*(p,w) ∈ F $\leftrightarrow$ δ...

jaydip74

4 views

jaydip74 asked 26 minutes ago

2 votes

2 answers

2

CMI2016-A-10
Which of the following relationships holds in general between the $\text{scope}$ of a variable and the $\text{lifetime}$ of a variable (in a language like C or Java)? The scope of a variable is contained in the lifetime of the variable The scope of a variable is same as the lifetime of the variable The lifetime of a variable is disjoint from the scope of the variable None of the above

Which of the following relationships holds in general between the $\text{scope}$ of a variable and the $\text{lifetime}$ of a variable (in a language like C or Java)?The ...

halfcodeblood

1.2k views

halfcodeblood commented 59 minutes ago

2 votes

3 answers

3

CMI2016-A-6
In the code fragment given below, $\mathsf{start}$ and $\mathsf{end}$ are integer values and $\mathsf{prime(x)}$ is a function that returns $\mathsf{true}$ if $\mathsf{x}$ is a prime number and $\mathsf{false}$ otherwise. i:=0; j:=0; k:=0; from (m := start; m <= end; m := m ... At the end of the loop: $k == i-j.$ $k == j-i.$ $k == -j-i.$ Depends on $\mathsf{start}$ and $\mathsf{end}$

In the code fragment given below, $\mathsf{start}$ and $\mathsf{end}$ are integer values and $\mathsf{prime(x)}$ is a function that returns $\mathsf{true}$ if $\mathsf{x}...

halfcodeblood

621 views

halfcodeblood commented 2 hours ago

1 votes

1 answer

4

GATE CSE 2024 | Set 2 | Question: 29
You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values ... determined from $V$ Preorder traversal of $T$ can be determined from $V$ Postorder traversal of $T$ can be determined from $V$

You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tr...

Meet_2008

1.9k views

Meet_2008 commented 12 hours ago

35 votes

5 answers

5

GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.

Indicate which of the following statements are true:A relational database which is in $3$NF may still have undesirable data redundancy because there may exist:Transitive ...

Psy Duck

14.5k views

Psy Duck commented 13 hours ago

30 votes

4 answers

6

GATE IT 2008 | Question: 49
What is the output printed by the following C code? # include <stdio.h> int main () { char a [6] = "world"; int i, j; for (i = 0, j = 5; i < j; a [i++] = a [j--]); printf ("%s\n", a); } dlrow Null string dlrld worow

What is the output printed by the following C code?# include <stdio.h int main () { char a [6] = "world"; int i, j; for (i = 0, j = 5; i < j; a [i++] = a [j ]); printf ("...

shyzn

9.6k views

shyzn commented 13 hours ago

10 votes

2 answers

7

GATE CSE 2023 | Question: 41
Let $X$ be a set and $2^{X}$ denote the powerset of $X$. Define a binary operation $\Delta$ on $2^{X}$ as follows: \[ A \Delta B=(A-B) \cup(B-A) \text {. } \] Let $H=\left(2^{X}, \Delta\right)$. Which of the following statements about $H$ is/are correct? ... $A \in 2^{X},$ the inverse of $A$ is the complement of $A$. For every $A \in 2^{X},$ the inverse of $A$ is $A$.

Let $X$ be a set and $2^{X}$ denote the powerset of $X$.Define a binary operation $\Delta$ on $2^{X}$ as follows:\[A \Delta B=(A-B) \cup(B-A) \text {. }\]Let $H=\left(2^{...

halfcodeblood

5.6k views

halfcodeblood commented 13 hours ago

3 votes

2 answers

8

GATE Overflow | Algorithms | Test 1 | Question: 2
The best known algorithm for binary to decimal conversion runs in $(n$ is the number of bits in the input number, assume MUL and ADD operations to take constant time) $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$ $\Theta\left(n^2\right)$

The best known algorithm for binary to decimal conversion runs in $(n$ is the number of bits in the input number, assume MUL and ADD operations to take constant time)$\Th...

ritiksri8

775 views

ritiksri8 commented 15 hours ago

38 votes

7 answers

9

GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$

If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct?S1: Each row of $M$ can be represented as a linear combination of...

Siddhartha_26

9.6k views

Siddhartha_26 commented 17 hours ago

3 votes

1 answer

10

GATE CSE 2024 | Set 2 | Question: 40
Consider $4$-variable functions $f 1, f 2, f 3, f 4$ expressed in sum-of-minterms form as given below. \[ \begin{array}{l} f 1=\sum(0,2,3,5,7,8,11,13) \\ f 2=\sum(1,3,5,7,11,13,15) \\ f 3=\sum(0,1,4,11) \\ f 4=\sum(0,2,6,13) \end{array} \] With ... $\boldsymbol{Y}=\sum(0,1,2,3,4,5,6,7)$ $\boldsymbol{Y}=\Pi(8,9,10,11,12,13,14,15)$

Consider $4$-variable functions $f 1, f 2, f 3, f 4$ expressed in sum-of-minterms form as given below.\[\begin{array}{l}f 1=\sum(0,2,3,5,7,8,11,13) \\f 2=\sum(1,3,5,7,11,...

Silver_Reaper

1.8k views

Silver_Reaper commented 17 hours ago

0 votes

1 answer

11

FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =

S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =

AagamS_0109

38 views

AagamS_0109 commented 17 hours ago

1 votes

2 answers

12

DRDO CSE 2022 Paper 1 | Question: 29
Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inserted into a queue. Next, two items are deleted from the queue, ... deleted items are pushed back onto the stack. Now, one item is popped from the stack. Which item is at the top of the stack.

Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inse...

soumya24

524 views

soumya24 answered 17 hours ago

3 votes

1 answer

13

Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is

Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is

soumya24

632 views

soumya24 answered 17 hours ago

12 votes

1 answer

14

GO Classes CS 2025 | Weekly Quiz 4 | Set Theory | Question: 10
Which of the following statements is /are False? $\{2,3,4\} \in A$ and $\{2,3\} \in B$ implies that $\{4\} \subseteq A-B$. $A \cap B \supseteq\{2,3,4\}$ implies that $\{2,3,4\} \subseteq A$ and $\{2,3,4\} \subseteq B$ ... $\{2,3\} \subseteq A \cup B$ implies that if $\{2,3\} \cap A=\emptyset$ then $\{2,3\} \subseteq B$.

Which of the following statements is /are False?$\{2,3,4\} \in A$ and $\{2,3\} \in B$ implies that $\{4\} \subseteq A-B$.$A \cap B \supseteq\{2,3,4\}$ implies that $\{2,3...

Srken

284 views

Srken commented 18 hours ago

20 votes

2 answers

15

GO Classes CS 2025 | Weekly Quiz 4 | Set Theory | Question: 8
Which of the following is/are true? If $S$ is a set and $|S| = 103$, then $S$ is not the power set of any set (that is, there is no set $T$ where $S = \mathcal{P}(T))$. If $S$ is a set and $|S| = 103$, then $S$ is a power set ... $S$ is not the power set of any set (that is, there is no set $T$ where $S = \mathcal{P}(T))$.

Which of the following is/are true?If $S$ is a set and $|S| = 103$, then $S$ is not the power set of any set (that is, there is no set $T$ where $S = \mathcal{P}(T))$.If ...

Srken

276 views

Srken commented 18 hours ago

0 votes

1 answer

16

Is counting sort and bucket sort present in gate syllabus?
I have seen questions about Radix Sort but not about bucket sort and Counting sort and hence my doubt

I have seen questions about Radix Sort but not about bucket sort and Counting sort and hence my doubt

Shubham Sharma 2

1.8k views

Shubham Sharma 2 commented 19 hours ago

12 votes

3 answers

17

GATE CSE 2024 | Set 1 | Question: 39
Let $A$ be any $n \times m$ matrix, where $m>n$. Which of the following statements is/are TRUE about the system of linear equations $Ax=0$? There exist at least $m-n$ linearly independent solutions to this system There exist $m-n$ ... solution in which at least $m-n$ variables are $0$ There exists a solution in which at least $n$ variables are non-zero

Let $A$ be any $n \times m$ matrix, where $m>n$. Which of the following statements is/are TRUE about the system of linear equations $Ax=0$?There exist at least $m-n...

Lakshmi Narayana404

3.3k views

Lakshmi Narayana404 commented 19 hours ago

3 votes

2 answers

18

GATE CSE 2024 | Set 2 | Question: 16
Which of the following file organizations is/are $\text{I/O}$ efficient for the scan operation in $\text{DBMS}$? Sorted Heap Unclustered tree index Unclustered hash index

Which of the following file organizations is/are $\text{I/O}$ efficient for the scan operation in $\text{DBMS}$?SortedHeapUnclustered tree indexUnclustered...

SarthakShastri

2.4k views

SarthakShastri commented 1 day ago

12 votes

2 answers

19

GATE CSE 2022 | Question: 4
In a relational data model, which one of the following statements is $\text{TRUE}?$ A relation with only two attributes is always in $\text{BCNF}.$ If all attributes of a relation are prime attributes, then the relation is in $\text{BCNF}.$ Every relation has at least one non-prime attribute. $\text{BCNF}$ decompositions preserve functional dependencies.

In a relational data model, which one of the following statements is $\text{TRUE}?$A relation with only two attributes is always in $\text{BCNF}.$If all attributes of a r...

SarthakShastri

10.1k views

SarthakShastri commented 1 day ago

2 votes

3 answers

20

GATE CSE 2024 | Set 2 | Question: 45
Consider an Ethernet segment with a transmission speed of $10^{8} \mathrm{bits} / \mathrm{sec}$ and a maximum segment length of $500$ meters. If the speed of propagation of the signal in the medium is $2 \times 10^{8} \mathrm{~meters} / \mathrm{sec}$, then the minimum frame size (in bits) required for collision detection is ___________.

Consider an Ethernet segment with a transmission speed of $10^{8} \mathrm{bits} / \mathrm{sec}$ and a maximum segment length of $500$ meters. If the speed of propagation ...

SarthakShastri

1.6k views

SarthakShastri answered 1 day ago

1 votes

1 answer

21

How to Prepare for Quantitative Aptitude for CAT Type 3 Q-25
Assume that the rate of consumption of coal by a locomotive varies as the square of the speed and is 1000 kg per hour when the speed is 60 km per hour. If the coal costs the railway company ` 15 per 100 kg and if the other ... train be ` 12 per hour, find a formula for the cost in paise per kilometre when the speed is S km per hour.

Assume that the rate of consumption of coal by a locomotive varies as the square of the speed and is 1000 kg per hour when the speed is 60 km per hour. If the coal costs ...

Shardul3

28 views

Shardul3 answer selected 1 day ago

0 votes

2 answers

22

Regular language
Can anyone explain how we can write this regular language for the following diagram ?(in depth)

Can anyone explain how we can write this regular language for the following diagram ?(in depth)

Shubham Sharma 2

100 views

Shubham Sharma 2 edited 1 day ago

0 votes

1 answer

23

#unacademyDPP

Shubham Sharma 2

50 views

Shubham Sharma 2 retagged 1 day ago

1 votes

0 answers

24

Charles C Pinter Abstract Algebra
If G is a group, G=(F(R), +), F(R) set of all real valued functions. H={f€F(R) ; f(-x)=-f(x)} Is H a subgroup of G? My solution.(Click on link..I have not shown th associative prt coz addition is always associative) please let me know if iam correct. https://ibb.co/sPzHg6m https://ibb.co/sPzHg6m

If G is a group, G=(F(R), +), F(R) set of all real valued functions.H={f€F(R) ; f(-x)=-f(x)}Is H a subgroup of G?My solution.(Click on link..I have not shown th associa...

Shubham Sharma 2

38 views

Shubham Sharma 2 retagged 1 day ago

2 votes

2 answers

25

GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?

Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?

CJ_2024

6.4k views

CJ_2024 answered 1 day ago

1 votes

1 answer

26

#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem

what will be the regular expression of this DFA using Arden's theorem

manishankarkanrar

46 views

manishankarkanrar answered 1 day ago

3 votes

2 answers

27

Poset
Consider the poset ({3,5,9,15,24,45},|). Which of the following is correct for the given poset? A. There exists a least element but not a greatest element B. There exists a greatest element but not a least element C. There exists a greatest element and a least element D. There does not exist a greatest element and a least element

Consider the poset ({3,5,9,15,24,45},|). Which of the following is correct for the given poset? A. There exists a least element but not a greatest elementB. There exists ...

Shubham Sharma 2

100 views

Shubham Sharma 2 edited 1 day ago

0 votes

1 answer

28

Question on Quotient set
What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?

What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?

Shubham Sharma 2

85 views

Shubham Sharma 2 retagged 1 day ago

38 votes

2 answers

29

GATE CSE 1993 | Question: 6.4, ISRO2008-14
Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate, and with two stop bits is $109$ $216$ $218$ $219$

Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate,...

mohit jain

10.9k views

mohit jain commented 1 day ago

51 votes

12 answers

30

GATE CSE 2014 Set 1 | Question: 53
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE? $(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge \sim r)$ $( \sim (p \leftrightarrow q) \wedge r)\vee (p \wedge q \wedge \sim r)$ ... $(\sim (p \leftrightarrow q) \wedge r) \wedge (p \wedge q \wedge \sim r) $

Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?$(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge...

ritiksri8

13.8k views

ritiksri8 commented 1 day ago

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