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
Answers by aiyyar.aarushi
3
votes
1
ISI2014-DCG-38
Suppose that $A$ is a $3 \times 3$ real matrix such that for each $u=(u_1, u_2, u_3)’ \in \mathbb{R}^3, \: u’Au=0$ where $u’$ stands for the transpose of $u$. Then which one of the following is true? $A’=-A$ $A’=A$ $AA’=I$ None of these
Suppose that $A$ is a $3 \times 3$ real matrix such that for each $u=(u_1, u_2, u_3)’ \in \mathbb{R}^3, \: u’Au=0$ where $u’$ stands for the transpose of $u$. Then ...
548
views
answered
Dec 16, 2019
Linear Algebra
isi2014-dcg
linear-algebra
matrix
+
–
2
votes
2
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 14 (Page No. 82)
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?
1.7k
views
answered
Dec 10, 2019
CO and Architecture
tanenbaum
operating-system
machine-instruction
pipelining
descriptive
+
–
8
votes
3
GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...
7.6k
views
answered
Jan 5, 2019
Set Theory & Algebra
gatecse-2003
set-theory&algebra
functions
normal
+
–
3
votes
4
GATE CSE 2000 | Question: 2.12
The following arrangement of master-slave flip flops has the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respectively), $1, 0$ $1, 1$ $0, 0$ $0, 1$
The following arrangement of master-slave flip flopshas the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respect...
11.6k
views
answered
Nov 29, 2018
Digital Logic
gatecse-2000
digital-logic
circuit-output
normal
flip-flop
+
–
2
votes
5
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true
Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...
2.7k
views
answered
Nov 17, 2018
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
2
votes
6
Finite Automata
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state 1)64 2) 256 3) 1024 4)5832
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state1)64 2) 256 3) 1024 4)5832
3.2k
views
answered
Nov 16, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
7
UGC NET CSE | August 2016 | Part 2 | Question: 35
Which of the following is FALSE ? The grammar $S \rightarrow aS|aSbS|\in$, where $S$ is the only non-terminal symbol, and $\in$ is the null string, is ambiguous. An unambiguous grammar has same left most and right most derivation. An ambiguous grammar can never be $LR(k)$ for any $k$. Recursive descent parser is a top-down parser.
Which of the following is FALSE ?The grammar $S \rightarrow aS|aSbS|\in$, where $S$ is the only non-terminal symbol, and $\in$ is the null string, is ambiguous.An unambig...
2.6k
views
answered
Nov 15, 2018
Theory of Computation
ugcnetcse-aug2016-paper2
theory-of-computation
grammar
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register