Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions and answers
0
votes
0
answers
1
Does 12th marks matter during admission in IISC, IIT, NIT and IIIT ?
My 12th marks are around 50%, and my PCM marks is even lower. However, my B.Tech CSE has an overall CGPA of around 8 (up to the 7th semester). If I achieve a good rank in exams like GATE or PGEE for IIIT, will there be any issues with my admission?
My 12th marks are around 50%, and my PCM marks is even lower. However, my B.Tech CSE has an overall CGPA of around 8 (up to the 7th semester). If I achieve a good rank in...
blade
15
views
blade
asked
2 hours
ago
0
votes
0
answers
2
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be: (a) 9 and 7 (b) 7 and 9 (c) 10 and 12 (d) 6 and 7
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when ...
Reetu Chaudhary
8
views
Reetu Chaudhary
asked
4 hours
ago
Operating System
operating-system
demand-paging
page-replacement
least-recently-used
page-fault
+
–
0
votes
0
answers
3
Compiler design
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
Sarahcs
12
views
Sarahcs
asked
5 hours
ago
Compiler Design
compiler-design
directed-acyclic-graph
+
–
0
votes
0
answers
4
Counting
Suppose that there are nine students in a discrete mathematics class at a small college. a) Show that the class must have at least five male students or at least five female students. b) Show that the class must have at least three male students or at least seven female students.
Suppose that there are nine students in a discrete mathematics class at a smallcollege.a) Show that the class must have at least five male students or at least five femal...
Nini
12
views
Nini
asked
5 hours
ago
Combinatory
discrete-mathematics
combinatory
+
–
19
votes
5
answers
5
GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.
Consider the problem of reversing a singly linked list. To take an example, given the linked list below,the reversed linked list should look likeWhich one of the followin...
yudhistar
9.4k
views
yudhistar
answered
6 hours
ago
DS
gatecse-2022
data-structures
linked-list
1-mark
+
–
18
votes
6
answers
6
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
10 hours
ago
Operating System
gatecse-2019
numerical-answers
operating-system
file-system
2-marks
+
–
13
votes
2
answers
7
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
332
views
Himashis Biswas
answered
13 hours
ago
Set Theory & Algebra
goclasses2025_cs_wq4
goclasses
set-theory&algebra
set-theory
2-marks
+
–
46
votes
6
answers
8
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
15 hours
ago
Algorithms
gatecse-2011
algorithms
asymptotic-notation
normal
+
–
9
votes
2
answers
9
Discrete Mathematics question
Bharadwaja1557
3.6k
views
Bharadwaja1557
answered
15 hours
ago
Set Theory & Algebra
lattice
partial-order
+
–
0
votes
1
answer
10
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
27
views
Deepak Poonia
answered
23 hours
ago
Set Theory & Algebra
discrete-mathematics
functions
+
–
0
votes
0
answers
11
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
18
views
Ebrahim
asked
1 day
ago
Compiler Design
compiler-design
syntax-directed-translation
ullman
lexical-analysis
parsing
+
–
0
votes
0
answers
12
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
10
views
Ebrahim
asked
1 day
ago
Compiler Design
compiler-design
syntax-directed-translation
lexical-analysis
parsing
ullman
+
–
0
votes
0
answers
13
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
10
views
Ebrahim
asked
1 day
ago
Compiler Design
compiler-design
syntax-directed-translation
ullman
+
–
45
votes
6
answers
14
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
1 day
ago
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
0
votes
0
answers
15
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
17
views
aaryannn
asked
1 day
ago
0
votes
0
answers
16
i am not able to give test
arjun1947
15
views
arjun1947
asked
1 day
ago
0
votes
0
answers
17
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
16
views
RahulVerma3
asked
1 day
ago
Operating System
operating-system
file-system
+
–
0
votes
0
answers
18
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...
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
35
views
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
asked
1 day
ago
0
votes
1
answer
19
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
200
views
Priyam Garg
answered
1 day
ago
Others
cmi2022
+
–
46
votes
12
answers
20
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.8k
views
ananya_23
answered
1 day
ago
Probability
gatecse-2016-set2
probability
conditional-probability
normal
numerical-answers
+
–
0
votes
0
answers
21
I am not able to find the link for giving the test
Abhishikta Saha
23
views
Abhishikta Saha
asked
2 days
ago
13
votes
4
answers
22
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...
Just.Prathmesh
3.7k
views
Just.Prathmesh
answered
2 days
ago
Linear Algebra
gatecse2024-set1
multiple-selects
linear-algebra
system-of-equations
+
–
36
votes
5
answers
23
GATE CSE 1999 | Question: 2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically has fewer instructions has fewer addressing modes has more registers is easier to implement using hard-wired logic
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typicallyhas fewer instructionshas fewer addressing modeshas more registersis easi...
Swarup kotal
9.2k
views
Swarup kotal
answered
2 days
ago
CO and Architecture
gate1999
co-and-architecture
normal
cisc-risc-architecture
multiple-selects
+
–
6
votes
6
answers
24
ISRO2014-15
Consider the logic circuit given below: $\text{Q =}$ __________? $\overline{\text{A}} \text{C} + \text{B} \overline{\text{C}} +\text{CD}$ $\text{ABC} + \overline{\text{C}} \text{D}$ $\text{AB + B} \overline{\text{C}} + \text{B} \overline{\text{D}}$ $\text{A} \overline{\text{B}} + \text{A} \overline{\text{C}} + \overline{\text{C}} \text{D}$
Consider the logic circuit given below:$\text{Q =}$ __________?$\overline{\text{A}} \text{C} + \text{B} \overline{\text{C}} +\text{CD}$$\text{ABC} + \overline{\text{C}} \...
mnuAbhi
4.0k
views
mnuAbhi
answered
2 days
ago
Digital Logic
isro2014
digital-logic
circuit-output
+
–
11
votes
3
answers
25
GATE CSE 2016 Set 1 | Question: GA07
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is. Which of the following can be logically inferred from the above ... notes have sufficient space for all the Indian languages. Linguistic pluralism is strong evidence of India's diversity.
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is.Which of th...
kunal_9826438
3.3k
views
kunal_9826438
answered
2 days
ago
Verbal Aptitude
gatecse-2016-set1
verbal-aptitude
verbal-reasoning
normal
+
–
1
votes
2
answers
26
GATE CSE 2024 | Set 2 | Question: 46
A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions: $\text{X}$ is not the empty set. $\text{Y}$ is not the empty set. Intersection ... set. For a relation $\text{R}$ with $4$ attributes, the total number of possible useful functional dependencies is __________.
A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions:$\text{X}$ is not ...
ashwinsuthar1
2.0k
views
ashwinsuthar1
answered
2 days
ago
Databases
gatecse2024-set2
numerical-answers
databases
database-normalization
+
–
23
votes
5
answers
27
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
Vivek jangir
5.3k
views
Vivek jangir
answered
2 days
ago
Digital Logic
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
+
–
5
votes
2
answers
28
GATE CSE 2024 | Set 2 | Question: 6
Let $f(x)$ be a continuous function from $\mathbb{R}$ to $\mathbb{R}$ such that \[ f(x)=1-f(2-x) \] Which one of the following options is the CORRECT value of $\int_{0}^{2} f(x) d x$ ? $0$ $1$ $2$ $-1$
Let $f(x)$ be a continuous function from $\mathbb{R}$ to $\mathbb{R}$ such that\[f(x)=1-f(2-x)\]Which one of the following options is the CORRECT value of ...
skypaul101
2.5k
views
skypaul101
answered
3 days
ago
Calculus
gatecse2024-set2
calculus
definite-integral
+
–
9
votes
2
answers
29
ISRO2016-7
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to $0$ (Zero) $1$ $4$ $7$
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to$0$ (Zero)$1$$4$$7$
mnuAbhi
7.2k
views
mnuAbhi
answered
3 days
ago
Digital Logic
digital-logic
min-no-gates
isro2016
+
–
0
votes
0
answers
30
DFA construction
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w -> {a, b}* | every a in w is immediately followed by bb}
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w - {a, b}* | every a in w is immediately followed by bb}
rdrd44
44
views
rdrd44
asked
3 days
ago
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
31
Regular Expresssion And NFA
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C must begin with ( and end with *) but have no intervening *) . For simplicity, assume the ... b, (, *)}. (a) Provide an NFA that recognizes language C . (b) Present a regular expression that generates C.
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C...
rdrd44
42
views
rdrd44
asked
3 days
ago
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
67
votes
5
answers
32
GATE CSE 2006 | Question: 13
A scheme for storing binary trees in an array $X$ is as follows. Indexing of $X$ starts at $1$ instead of $0$. the root is stored at $X[1]$. For a node stored at $X[i]$, the left child, if any, is stored in $X[2i]$ and the right child, if any, in $X[2i+1]$. To be able to store any binary tree on n vertices the minimum size of $X$ should be $\log_2 n$ $n$ $2n+1$ $2^n-1$
A scheme for storing binary trees in an array $X$ is as follows. Indexing of $X$ starts at $1$ instead of $0$. the root is stored at $X $. For a node stored at $X[i]$, th...
snehasish
17.4k
views
snehasish
answered
3 days
ago
DS
gatecse-2006
data-structures
binary-tree
normal
+
–
0
votes
0
answers
33
Gate 2024
I recently qualified gate with low score of 320. As per last year cutoff I may get CS in NIT goa or NIT puducherry or IIIT tirichy Is it worth if i join in any one of these or are there any options? Please clarify me stuck here for a long time
I recently qualified gate with low score of 320. As per last year cutoff I may get CS in NIT goa or NIT puducherry or IIIT tirichyIs it worth if i join in any one of thes...
Hemchand
27
views
Hemchand
asked
3 days
ago
12
votes
3
answers
34
GATE CSE 2022 | Question: 16
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where each resource has more than one instance, a cycle in its wait-for graph ... the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks?Circular wait is a necessary condition for the formation of deadlock.In a system where ea...
https_guru
12.7k
views
https_guru
answered
3 days
ago
Operating System
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
+
–
4
votes
1
answer
35
GO Classes CS 2025 | Weekly Quiz 5 | Set Theory | Question: 9
Which of the following statements is $\textbf{TRUE}$? For all sets $A, B$, and $C, A-(B-C)=(A-B)-C$. For all sets $A, B$, and $C,(A-B) \cap(C-B)=(A \cap C)-B$. For all sets $A, B$, and $C,(A-B) \cap(C-B)=A-(B \cup C)$. For all sets $A, B$, and $C$, if $A \cap C=B \cap C$ then $A=B$.
Which of the following statements is $\textbf{TRUE}$?For all sets $A, B$, and $C, A-(B-C)=(A-B)-C$.For all sets $A, B$, and $C,(A-B) \cap(C-B)=(A \cap C)-B$.For all sets ...
Srken
119
views
Srken
answered
3 days
ago
Set Theory & Algebra
goclasses2025_cs_wq5
goclasses
discrete-mathematics
set-theory&algebra
set-theory
2-marks
+
–
0
votes
1
answer
36
ISI 2019 | PCB CS | Question: 3
When we add a pair of two-bit binary numbers, say $a b$ and $c d$, we get a number of at most three bits, say $p q r$. Using standard operators of Boolean algebra, namely $\operatorname{AND}\;(\wedge), \operatorname{OR}\; (\vee)$ and $\operatorname{NOT}\;(\neg)$, derive the Boolean expressions of $p, q$ and $r$ in terms of $a, b, c$ and $d$.
When we add a pair of two-bit binary numbers, say $a b$ and $c d$, we get a number of at most three bits, say $p q r$. Using standard operators of Boolean algebra, namely...
J_Juhi
121
views
J_Juhi
answered
4 days
ago
Others
isi2019-pcb-cs
descriptive
+
–
0
votes
0
answers
37
I just purchased pgee test series, and right after that the PGEE Section of your website is not opening, please help
I am not able to access the pgee test links it shows me "currently unable to handle this request" Please help
babawick6
47
views
babawick6
asked
4 days
ago
0
votes
0
answers
38
View serializable
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y) Please help
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y)Please help
Cjsmwlq
44
views
Cjsmwlq
asked
5 days
ago
Databases
view-serializable
+
–
2
votes
2
answers
39
GATE Electrical 2023 | GA Question: 9
The digit in the unit's place of the product $3^{999} \times 7^{1000}$ is _________. $7$ $1$ $3$ $9$
The digit in the unit's place of the product $3^{999} \times 7^{1000}$ is _________.$7$$1$$3$$9$
SaiKo
988
views
SaiKo
answered
5 days
ago
Quantitative Aptitude
gate2023-ee
quantitative-aptitude
modular-arithmetic
+
–
0
votes
1
answer
40
UGC NET CSE | June 2010 | Part 2 | Question: 33
Consider the following left associative operators in decreasing order of precedence : - subtraction (highest precedence) * multiplication $ exponentiation (lowest precedence) What is the result of the following expression ? 3 – 2 * 4 $ | * 2** 3 $-61$ $64$ $512$ $4096$
Consider the following left associative operators in decreasing order of precedence :- subtraction (highest precedence)* multiplication$ exponentiation (lowest precedence...
Vivek kadam
1.4k
views
Vivek kadam
answered
5 days
ago
Programming in C
ugcnetcse-june2010-paper2
programming
operator-precedence
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register