Recent activity / GATE Overflow for GATE CSE

18 votes

6 answers

1

GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB

The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk bloc...

Vivek jangir

23.2k views

Vivek jangir answered 8 minutes ago

13 votes

2 answers

2

GO Classes CS 2025 | Weekly Quiz 4 | Set Theory | Question: 7
Power set of empty set has exactly _______ subsets. One Two Zero Three

Power set of empty set has exactly _______ subsets.OneTwoZeroThree

Himashis Biswas

324 views

Himashis Biswas answered 2 hours ago

12 votes

5 answers

3

GATE CSE 2023 | Question: 30
Consider the pushdown automaton $\text{(PDA)}\;P$ below, which runs on the input alphabet $\{a, b\}$, has stack alphabet $\{\perp, A\}$, and has three states $\{s, p, q\}$, with $s$ being the start state. A transition from state $u$ to state $v$ ... $\left.0 \leq n\right\}$ $\left\{a^{m} \mid 0 \leq m\right\} \cup\left\{b^{n} \mid 0 \leq n\right\}$

Consider the pushdown automaton $\text{(PDA)}\;P$ below, which runs on the input alphabet $\{a, b\}$, has stack alphabet $\{\perp, A\}$, and has three states $\{s, p, q\}...

Arjun

7.3k views

Arjun edited 2 hours ago

13 votes

2 answers

4

GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system: $R_2(Y), R_1(X), R_3(Z), R_1(Y)W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)$ Consider the statements $P$ and $Q$ below: $P$ ... Both $P$ and $Q$ are true $P$ is true and $Q$ is false $P$ is false and $Q$ is true Both $P$ and $Q$ are false

Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system:$$R_2(Y), R_1(X), R_3(Z), R_1(...

yuyutsu

7.3k views

yuyutsu comment edited 3 hours ago

46 votes

6 answers

5

GATE CSE 2011 | Question: 37
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1, f_2, f_3$ and $f_4$? $f_1(n) = 2^n$ $f_2(n) = n^{3/2}$ $f_3(n) = n \log_2 n$ $f_4(n) = n^{\log_2 n}$ $f_3, f_2, f_4, f_1$ $f_3, f_2, f_1, f_4$ $f_2, f_3, f_1, f_4$ $f_2, f_3, f_4, f_1$

Which of the given options provides the increasing order of asymptotic complexity of functions $f_1, f_2, f_3$ and $f_4$?$f_1(n) = 2^n$$f_2(n) = n^{3/2}$$f_3(n) = n \log_...

theradash

18.2k views

theradash answered 4 hours ago

9 votes

2 answers

6

Discrete MAthematics question

Bharadwaja1557

3.6k views

Bharadwaja1557 answered 5 hours ago

2 votes

1 answer

7

composition of function
Let f : A → B and g : B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof: A → C is an injection. S2 : If the function gof: A → C is surjection and g is an ... a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements are valid? please give explanation

Let f : A → B and g : B → C denote two functions. Consider the following two statements:S1 : If both f and g are injections then the composition function gof: A → C...

Deepak Poonia

947 views

Deepak Poonia commented 13 hours ago

0 votes

1 answer

8

Function Composition Question Oscar Levin Qn. 20
Let $f : X \rightarrow Y$ and $g : Y \rightarrow Z$ be functions. We can define the composition of $f$ and $g$ to be the function $g \circ f : X \rightarrow Z$ for which the image of each $x \in X$ is $g( f (x))$. That is, plug ... $f$ and $g$? Explain. (d) Suppose $g \circ f$ is surjective. What, if anything, can you say about $f$ and $g$? Explain.

Let $f : X \rightarrow Y$ and $g : Y \rightarrow Z$ be functions. We can define the composition of $f$ and $g$ to be the function $g \circ f : X \rightarrow Z$ for which ...

Deepak Poonia

20 views

Deepak Poonia answered 13 hours ago

1 votes

3 answers

9

UGC NET CSE | January 2017 | Part 2 | Question: 3
The functions mapping $R$ into $R$ are defined as : $f\left(x \right)=x^{3} - 4x, g\left(x \right)=\frac{1}{x^{2}+1}$ and $h\left(x \right)=x^{4}.$ Then find the value of the following composite functions : $h_{o}g\left(x \right)$ ... $\left ( x^{2}+1 \right )^{-4}$ and $\left [ \left ( x^{3}-4x \right )^{2}+1 \right ]^{-4}$

The functions mapping $R$ into $R$ are defined as :$f\left(x \right)=x^{3} - 4x, g\left(x \right)=\frac{1}{x^{2}+1}$ and $h\left(x \right)=x^{4}.$Then find the value of t...

Deepak Poonia

939 views

Deepak Poonia commented 16 hours ago

9 votes

1 answer

10

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 38
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y R z$. Which of the following ... is transitive. If $R$ is a GO relation then $R$ is reflexive. If $R$ is an equivalence relation then $R$ is a GO relation.

A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y ...

Deepak Poonia

607 views

Deepak Poonia answer edited 16 hours ago

28 votes

5 answers

11

GATE CSE 2021 Set 1 | Question: 43
A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$. Which of the following options is/are correct? If a relation $S$ is reflexive and symmetric, then $S$ is an equivalence relation ... and circular, then $S$ is an equivalence relation. If a relation $S$ is transitive and circular, then $S$ is an equivalence relation.

A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$.Which of the following options is/are correct?If a relation $S$ is refl...

Deepak Poonia

8.5k views

Deepak Poonia answer edited 16 hours ago

0 votes

0 answers

12

Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e)

Q4. Generate target code for the following source language statements : x = a + b + c * (d-e)

Ebrahim

12 views

Ebrahim asked 17 hours ago

0 votes

0 answers

13

Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation. a) Quadruple b) Triple c) Indirect Triple Solve the above Question like this example

Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation. a) Quadrupleb) Triple c) Indirect Triple Solve the abov...

Ebrahim

8 views

Ebrahim asked 18 hours ago

0 votes

0 answers

14

Compiler Design
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0) evensum=evensum+ else oddsum=oddsum+i;

1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;

Ebrahim

8 views

Ebrahim asked 18 hours ago

45 votes

6 answers

15

GATE CSE 2010 | Question: 23
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress

Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables...

Vivek jangir

18.1k views

Vivek jangir answered 18 hours ago

2 votes

3 answers

16

UGC NET CSE | June 2016 | Part 3 | Question: 56
Let $L=\{0^n1^n|n\ge 0\}$ be a context free language. Which of the following is correct? $\overline L$ is context free and $L^k$ is not context free for any $k\ge1$ $\overline L$ is not context free and $L^k$ ... $L^k$ for any $k\ge1$ are context free Both $\overline L$ and $L^k$ for any $k\ge1$ are not context free

Let $L=\{0^n1^n|n\ge 0\}$ be a context free language. Which of the following is correct?$\overline L$ is context free and $L^k$ is not context free for any $k\ge1$$\overl...

24aaaa23

655 views

24aaaa23 commented 18 hours ago

17 votes

1 answer

17

GO Classes 2024 | Weekly Quiz 7 | Linear Algebra | Question: 19
Suppose that we are solving $A x=\left(\begin{array}{l}1 \\ 2 \\ 3\end{array}\right)$ In each of the option below, a complete solution $x$ is proposed. Which of the following could possibly be the solution for above system of linear ... $\alpha \in \mathbb{R}$

Suppose that we are solving $A x=\left(\begin{array}{l}1 \\ 2 \\ 3\end{array}\right)$In each of the option below, a complete solution $x$ is proposed.Which of the followi...

visharma

1.1k views

visharma commented 23 hours ago

0 votes

0 answers

18

question
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.

Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.

aaryannn

12 views

aaryannn asked 23 hours ago

39 votes

8 answers

19

GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$

Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r...

u_t_k_a_r_s_h

15.7k views

u_t_k_a_r_s_h commented 23 hours ago

0 votes

0 answers

20

i am not able to give test

arjun1947

10 views

arjun1947 asked 23 hours ago

0 votes

0 answers

21

OS | File Management | Made Easy Q105
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes of a file that can be accessed by quadruple pointer is 4TB using the ... Answer: 32bits i'm bit confused in the difference between I-Node disk block size and the given disk block size.

A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes...

RahulVerma3

13 views

RahulVerma3 asked 1 day ago

12 votes

1 answer

22

GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1| Question: 12
We define a new quantifier, uniqueness quantifier, the symbol of which is $\exists!.$ For any predicate $\text{P}$ and universe $\text{U}, \exists! x \text{P}(x)$ ... I, II, IV I, III II, III, IV IV only

We define a new quantifier, uniqueness quantifier, the symbol of which is $\exists!.$For any predicate $\text{P}$ and universe $\text{U}, \exists! x \text{P}(x)$ means th...

Deepak Poonia

598 views

Deepak Poonia commented 1 day ago

0 votes

0 answers

23

university assignment question
The array-based stack throws an exception when the array's capacity has been reached. Consider the following alternative : create a larger array, using the resize method. The cost of a resize that makes the array larger is proportional to the new size. 1. Suppose we ... and 2 for queues.Note that after the resize, elements may Solutions = O(N^2) O(N) O(N^2) O(N)

The array-based stack throws an exception when the array’s capacity has been reached. Consider the following alternative : create a larger array, using the resize metho...

꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂

32 views

꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ asked 1 day ago

6 votes

1 answer

24

GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 8
Let $P(x), Q(x), R(x)$ and $S(x)$ denote the following predicates with domain $\mathbb{Z}$ ... $\forall x \in \mathbb{Z}, \quad S(x) \rightarrow(Q(x) \wedge S(x))$

Let $P(x), Q(x), R(x)$ and $S(x)$ denote the following predicates with domain $\mathbb{Z}$ :$$\begin{aligned}& P(x): x^2-x-12=0, \\& Q(x): x \text { is odd, } \\& R(x): x...

Deepak Poonia

308 views

Deepak Poonia commented 1 day ago

67 votes

10 answers

25

GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....

Thadymademe

34.6k views

Thadymademe comment edited 1 day ago

0 votes

1 answer

26

CMI2022-B: 4
You are organizing a party involving $2n$ diplomats. Each pair of diplomats are either friends or enemies. You have managed to invite an excellent set of guests, each of whom has more friends than enemies (among the other guests). Can you now seat ... as their neighbours. (Hint: Model this situation as an appropriate graph so that the desired seating arrangement is a Hamiltonian path.)

You are organizing a party involving $2n$ diplomats. Each pair of diplomats are either friends or enemies. You have managed to invite an excellent set of guests, each of ...

Priyam Garg

199 views

Priyam Garg answered 1 day ago

46 votes

12 answers

27

GATE CSE 2016 Set 2 | Question: 05
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is $0.7$, and given that it is of Type $2$ is $0.4$. The probability that an LED bulb chosen uniformly at random lasts more than $100$ hours is _________.

Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is ...

ananya_23

9.7k views

ananya_23 answered 1 day ago

25 votes

2 answers

28

GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support

Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...

Thadymademe

10.7k views

Thadymademe comment reshown 1 day ago

64 votes

15 answers

29

GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$

Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...

꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂

37.6k views

꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ comment edited 1 day ago

3 votes

2 answers

30

#linear algebra
why Eigen Vectors can not be zero ?

why Eigen Vectors can not be zero ?

Shubham Sharma 2

165 views

Shubham Sharma 2 retagged 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