search
Log In

Recent activity by Arjun

2 answers
1
A Boolean expression is an expression made out of propositional letters (such as $p, q, r$) and operators $\wedge$, $\vee$ and $\neg$; e.g. $p\wedge \neg (q \vee \neg r)$. An expression is said to be in sum of product form ... operator. Every Boolean expression is equivalent to an expression without $\wedge$ operator. Every Boolean expression is equivalent to an expression without $\neg$ operator.
answer selected 15 minutes ago in Digital Logic 1.2k views
4 answers
2
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
answer edited 55 minutes ago in Compiler Design 2.2k views
3 answers
3
The less-than relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
answer edited 1 hour ago in Set Theory & Algebra 5.6k views
1 answer
4
Primary index vs Secondary Index Primary index is done on the primary key of the database.Secondary indexing is done on the candidate key..and clusterd index on non key field. Which indexing required dense and sparse indexing and why ? WHy cant secondary indices be done based on sparse indexing as it is order on candidate key and which also orders the file?
answer selected 1 hour ago in Databases 5k views
1 answer
5
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $x$, denoted by $r(x)$ and $w(x)$respectively. Which one of them is conflict serializable? $r_1(x);r_2(x);w_1(x);r_3(x);w_2(x)$ $r_2(x);r_1(x);w_2(x);r_3(x);w_1(x)$ $r_3(x);r_2(x);r_1(x);w_2(x);w_1(x)$ $r_2(x);w_2(x);r_3(x);r_1(x);w_1(x)$ $1$ $2$ $3$ $4$
commented 2 hours ago in Databases 252 views
3 answers
6
A $3-\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3-\text{ary}$ tree with $n$ internal nodes is $2(n+1)$.
answer selected 2 hours ago in DS 3.9k views
5 answers
7
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language such that it should be ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
answered 2 hours ago in Programming 4.1k views
3 answers
8
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct. if $A \rightarrow \rightarrow B$ and $A \rightarrow \rightarrow C$ then $A \rightarrow BC$ if $A \rightarrow B$ and $A \rightarrow C$ ... $A \rightarrow \rightarrow C$ Exactly how many of the above implications are valid? $0$ $1$ $2$ $3$
edited 22 hours ago in Databases 6.7k views
2 answers
9
Consider the parse tree Assume that $*$ has higher precedence than $+$, $-$ and operators associate right to left (i.e $(a + b + c= (a + (b + c)))$. Consider $2 + a - b$ $2 + a - b * a + b$ $(2 + ((a - b) * (a + b)))$ $2 + (a - b) * (a + b)$ The parse tree corresponds to Expression (i) Expression (ii) Expression (iv) only Expression (ii), (iii), and (iv) Expression (iii) and (iv) only
answer edited 22 hours ago in Compiler Design 1.4k views
3 answers
10
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team has $2$ skilled, $6$ semi-skilled and $5$ unskilled workers, how long it will take to build the wall? $20$ days $18$ days $16$ days $15$ days
answer edited 22 hours ago in Quantitative Aptitude 3.8k views
2 answers
11
A logic network has two data inputs $A$ and $B$, and two control inputs $C_0$ and $C_1$. It implements the function $F$ according to the following table. ${\begin{array}{|cc|c|}\hline \textbf{$C_1$}& \textbf{$C_0$}& \textbf{F}\\\hline 0&0&\text{$ ... using one $4$ to $1$ Multiplexer, one $2-$input Exclusive OR gate, one $2-$input AND gate, one $2-$input OR gate and one Inverter.
edited 22 hours ago in Digital Logic 2.1k views
1 answer
12
Let the attribute ‘$val$’ give the value of a binary number generated by $S$ in the following grammar: $S \rightarrow L.L \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ For example, an input $101.101$ gives $S.val = 5.625$ Construct a syntax directed translation scheme using only synthesized attributes, to determine $S.val$.
answer edited 23 hours ago in Compiler Design 6.2k views
8 answers
13
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ T1 M old $=0$ ... redo log records $2$ and $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
edited 23 hours ago in Databases 17k views
6 answers
14
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: $\rho$ is the rename ... student names of girl students with marks not less than some boy student names of girl students with more marks than all the boy students
answer edited 23 hours ago in Databases 9.3k views
3 answers
15
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ $\begin{array}{|l|l|c|} \hline \text {Instruction} & \text{Operation }& \text{Instruction size} \\&& \text{(in words)} \\\hline \text{MOV $R_1, ... has been halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$
edited 23 hours ago in CO and Architecture 16.7k views
8 answers
16
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation speed of the media is $4 \times 10^6$ $\text{meters}$ per second. It needs to ... full capacity. Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.
answer edited 23 hours ago in Computer Networks 7.9k views
6 answers
17
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be the minimum number of ... wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
answer edited 1 day ago in Computer Networks 17.9k views
2 answers
18
Consider the following "C" program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ____________; // call to f() } Which one of the following expressions , when placed in the blank above, will NOT result in a type checking error? $f(s, *s)$ $i = f(i,s)$ $f(i, *s)$ $f(i, *p)$
answer edited 1 day ago in Programming 7.3k views
3 answers
19
A tiger is $50$ leaps of its own behind a deer. The tiger takes $5$ leaps per minute to the deer's $4.$ If the tiger and the deer cover $8$ meter and $5$ meter per leap respectively, what distance in meters will the tiger have to run before it catches the deer$?$
edited 1 day ago in Quantitative Aptitude 3k views
1 answer
21
Draw the space time diagram for a 6-segment pipeline showing the time it takes to process 8 no of tasks.Determine the no of clock cycle that it takes to process 200 tasks.
answer edited 1 day ago in CO and Architecture 7.5k views
3 answers
23
Which of the following encryption algorithms is based on the Feistal structure? Advanced Encryption Standard RSA public key cryptographic algorithm Data Encryption standard RC4
answer edited 1 day ago in Computer Networks 2.7k views
2 answers
24
Big-O estimate for $f(x)=(x+1) \log(x^2 +1) + 3x^2 $ is given as $O(x \log x)$ $O(x^2)$ $O(x^3)$ $O(x^2 \log x)$
answer edited 1 day ago in Algorithms 1.7k views
1 answer
25
Derive a recurrence relation for the size of the smallest AVL tree with height $h$. What is the size of the smallest AVL tree with height $8$?
comment edited 1 day ago in DS 2.3k views
10 answers
26
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
answer edited 1 day ago in Theory of Computation 9k views
2 answers
28
A computer has 170 different instructions.Word size is 4B and one word instruction has 2 address fields.One adress for register and one address for memory.If there are 37 registers,then memory size in KB is?
answer edited 1 day ago in CO and Architecture 424 views
0 answers
29
Let l={ (ap )* | p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language. This is a question from a test series,I just want to know if the question is valid as I feel raised to prime number will not be regular,correct me if I am wrong.Not asking for solution to the question but if the question is valid.
reopened 1 day ago in Theory of Computation 1.3k views
3 answers
30
The number of divisors of $6000$, where $1$ and $6000$ are also considered as divisors of $6000$ is $40$ $50$ $60$ $30$
answer edited 1 day ago in Quantitative Aptitude 455 views
...