Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by s_dr_13
5
answers
1
GATE CSE 2022 | Question: 35
Consider solving the following system of simultaneous equations using $\text{LU}$ decomposition. $x_{1} + x_{2} - 2x_{3} = 4$ $x_{1} + 3x_{2} - x_{3} = 7$ $2x_{1} + x_{2} - 5x_{3} = 7$ where $\textit{L}$ and $\textit{U}$ ... $\textit{L}_{32}= - \frac{1}{2}, \textit{U}_{33}= - \frac{1}{2}, x_{1}= 0$
Consider solving the following system of simultaneous equations using $\text{LU}$ decomposition.$$x_{1} + x_{2} – 2x_{3} = 4$$$$x_{1} + 3x_{2} – x_{3} = 7$$$$2x_{1} +...
11.5k
views
commented
Nov 18, 2022
Linear Algebra
gatecse-2022
linear-algebra
matrix
system-of-equations
2-marks
+
–
1
answer
2
CMI2015-A-04a
A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time, and courses in different slots have disjoint timings. Course registration has been completed and the administration now knows ... a spanning tree with minimum number of edges Find a minimal coloring Find a minimum size vertex cover Find a maximum size independent
A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time, and courses in different slots have disjoint tim...
845
views
answered
May 17, 2022
Graph Theory
cmi2015
descriptive
graph-theory
spanning-tree
+
–
6
answers
3
CMI2013-A-06
A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one edge. Let $G$ be a simple graph on $8$ vertices such that there is a vertex of degree $1$, a vertex of degree $2$, a vertex of degree $3$, a vertex ... degree $6$ and a vertex of degree $7$. Which of the following can be the degree of the last vertex? $3$ $0$ $5$ $4$
A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one edge. Let $G$ be a simple graph on $8$ vertices such...
5.3k
views
commented
May 17, 2022
Graph Theory
cmi2013
graph-theory
normal
degree-of-graph
+
–
1
answer
4
GATE CSE 2022 | Question: 43
Which of the following is/are the eigenvector(s) for the matrix given below? $\begin{pmatrix} - 9 & - 6 & - 2 & - 4 \\ - 8 & - 6 & - 3 & - 1 \\ 20 & 15 & 8 & 5 \\ 32 & 21 & 7 & 12 \end{pmatrix}$ ... $\begin{pmatrix} - 1 \\ 0 \\ 2 \\ 2 \end{pmatrix}$ $\begin{pmatrix} 0 \\ 1 \\ - 3 \\ 0 \end{pmatrix}$
Which of the following is/are the eigenvector(s) for the matrix given below?$$\begin{pmatrix} – 9 & – 6 & – 2 & – 4 \\ – 8 & – 6 & – 3 & – ...
10.5k
views
commented
May 15, 2022
Linear Algebra
gatecse-2022
linear-algebra
eigen-value
multiple-selects
2-marks
+
–
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 ...
14.6k
views
commented
May 6, 2022
Databases
gate1990
normal
databases
database-normalization
multiple-selects
+
–
3
answers
6
ISI2019-MMA-11
How many triplets of real numbers $(x,y,z)$ are simultaneous solutions of the equations $x+y=2$ and $xy-z^2=1$? $0$ $1$ $2$ infinitely many
How many triplets of real numbers $(x,y,z)$ are simultaneous solutions of the equations $x+y=2$ and $xy-z^2=1$?$0$$1$$2$infinitely many
1.8k
views
answered
May 4, 2022
Quantitative Aptitude
isi2019-mma
general-aptitude
quantitative-aptitude
+
–
5
answers
7
GATE CSE 2022 | Question: 51
A processor $\text{X}_{1}$ operating at $2 \; \text{GHz}$ has a standard $5-$stage $\text{RISC}$ instruction pipeline having a base $\text{CPI (cycles per instruction)}$ of one without any pipeline hazards. For a given program $\text{P}$ ... $\text{X}_{2}$ over $\text{X}_{1}$ in executing $\text{P}$ is _______________.
A processor $\text{X}_{1}$ operating at $2 \; \text{GHz}$ has a standard $5-$stage $\text{RISC}$ instruction pipeline having a base $\text{CPI (cycles per instruction)}$ ...
10.1k
views
commented
May 4, 2022
CO and Architecture
gatecse-2022
numerical-answers
co-and-architecture
pipelining
stall
2-marks
+
–
8
answers
8
GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...
25.8k
views
commented
May 3, 2022
Computer Networks
gatecse-2012
computer-networks
communication
normal
+
–
2
answers
9
ISI2018-PCB-CS7
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps: Step I:saving the context of $P_{old}$; Step II: running the scheduling algorithm to pick $P_{new}$; Step III: restoring the saved context of $P_{new}$. Suppose Steps ... in the order $P_1, P_2, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps:Step I:saving the context of $P_{old}$;Step II: running the scheduling al...
1.2k
views
commented
Apr 30, 2022
Operating System
isi2018-pcb-cs
operating-system
process-scheduling
descriptive
+
–
1
answer
10
ISI2017-PCB-CS-7-b
Define a Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables such that $\\ \begin{array}{llll} F & = & 1, & \text{when three or more input variables are at logic 1} \\ { } & = & 0, & \text{otherwise} \end{array} $ How many essential prime implicants does $F$ have? Justify they are essential.
Define a Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables such that$\\ \begin{array}{llll} F & = & 1, & \text{when three or more input variables are a...
646
views
answered
Apr 29, 2022
Digital Logic
isi2017-pcb-cs
digital-logic
prime-implicants
descriptive
+
–
8
answers
11
ISI2017-MMA-29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
Suppose the rank of the matrix$$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$is $2$ for some real numbers $a$ and $b$. Then $b$ equals$1$$3$$1/2$$1/3$
2.8k
views
commented
Apr 27, 2022
Linear Algebra
isi2017-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
3
answers
12
ISI2017-MMA-26
Let $n$ be the number of ways in which $5$ men and $7$ women can stand in a queue such that all the women stand consecutively. Let $m$ be the number of ways in which the same $12$ persons can stand in a queue such that exactly $6$ women stand consecutively. Then the value of $\frac{m}{n}$ is $5$ $7$ $\frac{5}{7}$ $\frac{7}{5}$
Let $n$ be the number of ways in which $5$ men and $7$ women can stand in a queue such that all the women stand consecutively. Let $m$ be the number of ways in which the ...
1.4k
views
answered
Apr 26, 2022
Combinatory
isi2017-mma
engineering-mathematics
discrete-mathematics
combinatory
+
–
3
answers
13
GATE CSE 2021 Set 2 | Question: 11
Consider the following sets, where $n \geq 2$: $S_1$: Set of all $n \times n$ matrices with entries from the set $\{ a, b, c\}$ $S_2$: Set of all functions from the set $\{0,1,2, \dots, n^2-1\}$ ... There exists a surjection from $S_1$ to $S_2$ There exists a bijection from $S_1$ to $S_2$ There does not exist an injection from $S_1$ to $S_2$
Consider the following sets, where $n \geq 2$:$S_1$: Set of all $n \times n$ matrices with entries from the set $\{ a, b, c\}$$S_2$: Set of all functions from the set $\{...
6.5k
views
answered
Apr 23, 2022
Set Theory & Algebra
gatecse-2021-set2
multiple-selects
set-theory&algebra
functions
1-mark
+
–
9
answers
14
GATE CSE 1996 | Question: 2.1
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is given by $f^{-1} (x,y) = \left( \frac {1}{x+y}, \frac{1}{x-y}\right)$ ... $f^{-1}(x,y)=\left [ 2\left(x-y\right),2\left(x+y\right) \right ]$
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is ...
9.9k
views
commented
Apr 23, 2022
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
3
answers
15
ISI2004-MIII: 13
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then $X< 1$ $X>\frac{3}{2}$ $1< X< \frac{3}{2}$ none of the above
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then$X< 1$$X>\frac{3}{2}$$1< X< \frac{3}{2}$none of the above
2.6k
views
commented
Apr 22, 2022
Calculus
isi2004
engineering-mathematics
integration
+
–
7
answers
16
TIFR CSE 2010 | Part A | Question: 12
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is. $2^{14}$ $31$ $\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) + 2\left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) \left ( \frac{10}{1} \right ) 2^{9}$
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is.$2^{14}$$31$$\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$$\left ( \frac{...
3.3k
views
commented
Apr 19, 2022
Combinatory
tifr2010
generating-functions
+
–
4
answers
17
GATE CSE 2022 | Question: 10
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times n}.$ Statement $1: tr \text{(AB)} = tr \text{(BA)}$ ... $2$ is correct. Both Statement $1$ and Statement $2$ are correct. Both Statement $1$ and Statement $2$ are wrong.
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times ...
10.9k
views
answered
Apr 9, 2022
Linear Algebra
gatecse-2022
linear-algebra
matrix
1-mark
+
–
2
answers
18
GATE IT 2005 | Question: 66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence ... $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction centerA first level arc...
4.7k
views
commented
Apr 9, 2022
IS&Software Engineering
gateit-2005
data-flow-diagram
normal
non-gate
+
–
1
answer
19
GATE CSE 2011 | Question: 7
A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO ... factor is given as 1.20. What is the estimated effort in person-months? 234.25 932.50 287.80 122.40
A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs ...
5.3k
views
commented
Apr 9, 2022
IS&Software Engineering
gatecse-2011
is&software-engineering
cocomo-model
normal
+
–
4
answers
20
ISI2015-PCB-CS-2a
You are given two strings $S$ and $T$, each of length $\alpha$, consisting only of lower case English letters $(a,b, \dots ,z)$. Propose an $O(\alpha)$-time algorithm to decide whether $S$ can be obtained by permuting the symbols of $T$ ... $\text{YES}$; but if $S \: = \text{ trainee}$, $T\: = \text{ retinaa}$, your algorithm should return $\text{NO}$.
You are given two strings $S$ and $T$, each of length $\alpha$, consisting only of lower case English letters $(a,b, \dots ,z)$. Propose an $O(\alpha)$-time algorithm to ...
1.1k
views
answered
Apr 7, 2022
Algorithms
descriptive
isi2015-pcb-cs
algorithms
algorithm-design
+
–
6
answers
21
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above
10.7k
views
answer edited
Apr 7, 2022
Operating System
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
2
answers
22
ISI2017-PCB-CS-2(a)
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=12345$, then your program should print $s=15$, (2) if $ i=457$, then $s=16$.
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=123...
409
views
answered
Apr 7, 2022
Programming in C
isi2017-pcb-cs
programming
programming-in-c
descriptive
+
–
3
answers
23
CMI2012-A-01
Let $L \subseteq \{0,1\}^*$. Which of the following is true? If $L$ is regular, all subsets of $L$ are regular. If all proper subsets of $L$ are regular, then $L$ is regular. If all finite subsets of $L$ are regular, then $L$ is regular. If a proper subset of $L$ is not regular, then $L$ is not regular.
Let $L \subseteq \{0,1\}^*$. Which of the following is true?If $L$ is regular, all subsets of $L$ are regular.If all proper subsets of $L$ are regular, then $L$ is regula...
5.8k
views
commented
Apr 6, 2022
Theory of Computation
cmi2012
theory-of-computation
regular-language
+
–
4
answers
24
ISI2015-PCB-CS-5a
Construct two nonregular languages $L_1$ and $L_2$ such that $L_1 \cup L_2$ is regular. Prove that the languages $L_1$ and $L_2$ constructed above are nonregular and $L_1 \cup L_2$ is regular.
Construct two nonregular languages $L_1$ and $L_2$ such that $L_1 \cup L_2$ is regular.Prove that the languages $L_1$ and $L_2$ constructed above are nonregular and $L_1 ...
1.8k
views
answered
Apr 6, 2022
Theory of Computation
descriptive
isi2015-pcb-cs
theory-of-computation
regular-language
+
–
3
answers
25
CMI2019-A-1
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$ The language $L_{1}\cup L_{2}$ is: regular, but not context-free context-free, but not regular both regular and context-free neither regular nor context-free
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$The language $L_{1}\cup L_{2}$ is:regular...
902
views
answered
Apr 6, 2022
Theory of Computation
cmi2019
regular-language
context-free-language
closure-property
+
–
7
answers
26
GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...
13.9k
views
answered
Apr 5, 2022
Operating System
gatecse-2017-set2
operating-system
resource-allocation
normal
+
–
2
answers
27
CMI2019-B-6
Let $A$ be an $n\times n $ matrix of integers such that each row and each column is arranged in ascending order. We want to check whether a number $k$ appears in $A.$ If $k$ is present, we should report its position - that is, the row $i$ and ... $A.$ Justify the complexity of your algorithm. For both algorithms, describe a worst-case input where $k$ is present in $A.$
Let $A$ be an $n\times n $ matrix of integers such that each row and each column is arranged in ascending order. We want to check whether a number $k$ appears in $A.$ If ...
702
views
commented
Apr 4, 2022
Algorithms
cmi2019
algorithms
algorithm-design
descriptive
+
–
1
answer
28
NIELIT 2017 July Scientist B (CS) - Section B: 52
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have $40000$ lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic ... $234.25$ $932.50$ $287.80$ $122.40$
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have $40000$ lines of code. The company needs ...
1.1k
views
commented
Apr 1, 2022
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
1
answer
29
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 36
Table employees has $10$ records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statement SELECT COUNT(*) FROM EMPLOYEE WHERE SALARY > ALL (SELECT SALARY FROM EMPLOYEE); $10$ $9$ $5$ $0$
Table employees has $10$ records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statementSELECT COUNT(*)FROM EMPLOYEEWHERE SALARY ALL (SELECT SALARY FROM...
1.6k
views
commented
Apr 1, 2022
Databases
nielit2017oct-assistanta-cs
databases
sql
+
–
1
answer
30
NIELIT 2017 July Scientist B (IT) - Section B: 57
If an SQL query involves NOT,AND,OR with no parenthesis NOT will be evaluated first; AND will be evaluated second; OR will be evaluated last. NOT will be evaluated first; OR will be evaluated second; AND will be evaluated ... first; OR will be evaluated second;NOT will be evaluated last. The order of occurrence determines the order of evaluation.
If an SQL query involves NOT,AND,OR with no parenthesisNOT will be evaluated first; AND will be evaluated second; OR will be evaluated last.NOT will be evaluated first; O...
2.1k
views
commented
Apr 1, 2022
Databases
nielit2017july-scientistb-it
databases
sql
operator-precedence
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register