Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged descriptive
0
votes
1
answer
2221
Compiler Translation Phase
What exactly a translation Process is ? in compiler Design .Can someone explain Briefly .
What exactly a translation Process is ? in compiler Design .Can someone explain Briefly .
Amit Sharma
1.6k
views
Amit Sharma
asked
Jun 7, 2016
Compiler Design
compiler-design
compilation-phases
descriptive
+
–
0
votes
0
answers
2222
Kenneth Rosen Edition 6th Exercise 2.3 Question 77 (Page No. 149)
Show that the polynomial f: Z+X Z+ $\rightarrow$ Z+ with f(m,n) = (m+n-2)(m+n-1)/2 + m is one to one and onto .
Show that the polynomial f: Z+X Z+ $\rightarrow$ Z+ with f(m,n) = (m+n-2)(m+n-1)/2 + m is one to one and onto .
khushtak
254
views
khushtak
asked
Jun 6, 2016
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
descriptive
functions
+
–
0
votes
1
answer
2223
Why is LALR preferred over SLR?
Adhishri Kothiyal
1.6k
views
Adhishri Kothiyal
asked
Jun 5, 2016
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
0
votes
1
answer
2224
median of 5 elements
how to find median of 5 distinct values with only 6 comparisons?
how to find median of 5 distinct values with only 6 comparisons?
debanjan sarkar
1.6k
views
debanjan sarkar
asked
Jun 4, 2016
Algorithms
algorithms
divide-and-conquer
time-complexity
descriptive
+
–
4
votes
0
answers
2225
ISI2011-PCB-CS-6b
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produces the simplest two-level AND-OR realization. Assume both uncomplemented and complemented inputs are available.
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produce...
go_editor
733
views
go_editor
asked
Jun 3, 2016
Digital Logic
digital-logic
descriptive
isi2011-pcb-cs
k-map
+
–
9
votes
2
answers
2226
ISI2011-PCB-CS-6a
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set. $\text{LOAD}$ and $\text{STORE}$ are indirect memory operations that load and store, using the address stored in the given register operand ... . Design an instruction encoding scheme that allows each of the above instructions (along with operands) to be encoded in $8$ bits.
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set.$\text{LOAD}$ and $\text{STORE}$ are indirect memory operations...
go_editor
1.3k
views
go_editor
asked
Jun 3, 2016
CO and Architecture
co-and-architecture
descriptive
isi2011-pcb-cs
machine-instruction
+
–
15
votes
2
answers
2227
ISI2011-PCB-CS-5c
One of your classmates has suggested the following modified version of a standard scheme for solving the $2$-process critical section problem (CSP). shared char want[2] = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = j; ... instructions executed by two processes $P_0$ and $P_1$. Modify the above scheme so that it becomes a correct solution to the $2$-process CSP.
One of your classmates has suggested the following modified version of a standard scheme for solving the $2$-process critical section problem (CSP).shared char want = {0...
go_editor
1.2k
views
go_editor
asked
Jun 3, 2016
Operating System
isi2011-pcb-cs
descriptive
operating-system
process-synchronization
normal
+
–
17
votes
4
answers
2228
ISI2011-PCB-CS-5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies:$A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$.If we project $R$ and...
go_editor
2.0k
views
go_editor
asked
Jun 3, 2016
Databases
descriptive
isi2011-pcb-cs
databases
database-normalization
+
–
2
votes
2
answers
2229
ISI2011-PCB-CS-5a
Consider relations $R(A, B)$ and $S(B, C)$. Find a propositional formula $\phi$ such that the following two relational algebra expressions produce the same answer. $\pi_{A,B}(\sigma_\phi(R \bowtie S))$ $R \cap ({\rho_T(A)}(\pi_C(S)) \times \pi_B(S))$
Consider relations $R(A, B)$ and $S(B, C)$. Find a propositional formula $\phi$ such that the following two relational algebra expressions produce the same answer.$\pi_{A...
go_editor
723
views
go_editor
asked
Jun 3, 2016
Databases
descriptive
isi2011-pcb-cs
databases
relational-algebra
+
–
2
votes
0
answers
2230
ISI2011-PCB-CS-4c
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a hostname and a domain name. This is followed by an optional path specifier. Some example URLs are ... are the only characters that can be used in a host / domain / file / directory name, write a regular expression for URLs.
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a hostname and a d...
go_editor
369
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
regular-expression
+
–
7
votes
2
answers
2231
ISI2011-CS-4b
Suppose $M = (Q, \Sigma, \delta, q_0, F)$ is a deterministic finite automaton, and suppose there exists a state $q \in Q$, a string $z \in \Sigma$, and integers $i, j > 0$ such that $\delta(q, z^i) = \delta(q, z^j) = q$. Prove that $\delta(q, z^{\gcd(i,j)}) = q.$
Suppose $M = (Q, \Sigma, \delta, q_0, F)$ is a deterministic finite automaton, and suppose there exists a state $q \in Q$, a string $z \in \Sigma$, and integers $i, j 0$...
go_editor
830
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
jsi2011
theory-of-computation
finite-automata
+
–
6
votes
2
answers
2232
ISI2011-PCB-CS-4a
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that $L$ is not regular. $L^2$ is regular.
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that$L$ is not regular.$L^2$ is regular.
go_editor
926
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
theory-of-computation
regular-language
+
–
1
votes
2
answers
2233
ISI2011-PCB-CS-3c
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linea...
go_editor
581
views
go_editor
asked
Jun 3, 2016
Graph Theory
descriptive
isi2011-pcb-cs
graph-theory
vertex-cover
+
–
2
votes
0
answers
2234
ISI2011-PCB-CS-3b
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$. The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$. The $\text{centre } C$ of $T$ is the set of vertices which have minimum eccentricity among all ... centre and centroid, each having two vertices (i.e. $C \cap \mathcal{C} = \not{O}$ and $|C| = |\mathcal{C}| = 2)$.
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$.The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$.The $\text...
go_editor
588
views
go_editor
asked
Jun 3, 2016
Graph Theory
descriptive
isi2011-pcb-cs
graph-theory
graph-connectivity
+
–
3
votes
4
answers
2235
ISI2011-PCB-CS-3a
Solve the following recurrence ($n$ is a natural number): $T(n) = \begin{cases} 7T(n\div3)+n^2 & ;n>2 \\ 1 & ;n \leq 2. \end{cases}$
Solve the following recurrence ($n$ is a natural number):$$T(n) = \begin{cases} 7T(n\div3)+n^2 & ;n>2 \\ 1 & ;n \leq 2. \end{cases}$$
go_editor
718
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011-pcb-cs
algorithms
recurrence-relation
+
–
2
votes
2
answers
2236
ISI2011-PCB-CS-2
You are given $k$ sorted lists, each containing $m$ integers in ascending order. Assume that (i) the lists are stored as singly-linked lists with one integer in each node, and (ii) the head pointers of these lists are stored in an array. ... if you were permitted to use only constant additional storage? Analyse the time complexity of your algorithm for each of the above two cases.
You are given $k$ sorted lists, each containing $m$ integers in ascending order. Assume that (i) the lists are stored as singly-linked lists with one integer in each node...
go_editor
825
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011-pcb-cs
algorithms
sorting
+
–
0
votes
1
answer
2237
Compiler
While evaluating the semantic action which of the following parser is more efficient ? Top Down Parser Bottom Up Parser Explain with the example ?
While evaluating the semantic action which of the following parser is more efficient ?Top Down ParserBottom Up ParserExplain with the example ?
ManojK
493
views
ManojK
asked
Jun 3, 2016
Compiler Design
compiler-design
parsing
descriptive
+
–
3
votes
2
answers
2238
ISI2011-PCB-CS-1b
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of the line must be accomplished only by successively swapping pairs of adjacent students ... the number of swaps required. Derive an expression for the number of swaps needed by your algorithm in the worst case.
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of...
go_editor
772
views
go_editor
asked
Jun 3, 2016
Algorithms
isi2011-pcb-cs
descriptive
algorithms
sorting
+
–
1
votes
0
answers
2239
ISI2011-PCB-CS-1a
The function $divby3$ given below is intended to check whether a given number is divisible by 3. It assumes that the argument $(number)$ is a string containing the decimal representation of a positive integer, and returns 1 or 0 depending on whether the ... for all positive integers. note: The smaller the number of ALU operations used by your function, the more marks you will get.
The function $divby3$ given below is intended to check whether a given number is divisible by 3. It assumes that the argument $(number)$ is a string containing the decima...
go_editor
440
views
go_editor
asked
Jun 3, 2016
Digital Logic
descriptive
isi2011-pcb-cs
number-representation
+
–
2
votes
0
answers
2240
ISI2011-PCB-A-4b
Consider the following intervals on the real line: $A_1 = (13.3, 18.3) \: A_3 = (8.3, 23.3) − A_1 \cup A_2$ $A_2 = (10.8, 20.8) − A_1 \: A_4 = (5.8, 25.8) − A_1 \cup A_2 \cup A_3$ where $(a, b) = \{x : a < x < b\}$. Write pseudo-code that ... given input $x \in (5.8, 25.8)$ belongs to, i.e., your pseudo-code should calculate $i \in \{1, 2, 3, 4\}$ such that $x \in A_i$.
Consider the following intervals on the real line: $A_1 = (13.3, 18.3) \: A_3 = (8.3, 23.3) − A_1 \cup A_2$ $A_2 = (10.8, 20.8) − A_1 \: A_4 = (5.8, 25.8) − A_1 \cu...
go_editor
438
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011
algorithms
algorithm-design
+
–
2
votes
0
answers
2241
ISI2011-PCB-A-4a
Consider six distinct points in a plane. Let $m$ and $M$ denote the minimum and maximum distance between any pair of points. Show that $M/m \geq \sqrt{3}$.
Consider six distinct points in a plane. Let $m$ and $M$ denote the minimum and maximum distance between any pair of points. Show that $M/m \geq \sqrt{3}$.
go_editor
352
views
go_editor
asked
Jun 3, 2016
Quantitative Aptitude
descriptive
isi2011
cartesian-coordinates
+
–
2
votes
1
answer
2242
ISI2011-PCB-A-3b
The numbers $1, 2, \dots , 10$ are arranged in a circle in some order. Show that it is always possible to find three adjacent numbers whose sum is at least $17$, irrespective of the ordering.
The numbers $1, 2, \dots , 10$ are arranged in a circle in some order. Show that it is always possible to find three adjacent numbers whose sum is at least $17$, irrespec...
go_editor
744
views
go_editor
asked
Jun 3, 2016
Combinatory
descriptive
isi2011
pigeonhole-principle
+
–
1
votes
0
answers
2243
ISI2011-PCB-A-3a
Consider an $m \times n$ integer lattice. A path from $(0, 0)$ to $(m, n)$ can use steps of $(1, 0)$, $(0, 1)$ or diagonal steps $(1, 1)$. Let $D_{m,n}$ be the number of such distinct paths. Prove that $D_{m,n} = \Sigma_k \begin{pmatrix} m \\ k \end{pmatrix} \begin{pmatrix} n+k \\ m \end{pmatrix}$
Consider an $m \times n$ integer lattice. A path from $(0, 0)$ to $(m, n)$ can use steps of $(1, 0)$, $(0, 1)$ or diagonal steps $(1, 1)$. Let $D_{m,n}$ be the number of ...
go_editor
527
views
go_editor
asked
Jun 3, 2016
Combinatory
descriptive
isi2011
combinatory
proof
+
–
1
votes
2
answers
2244
ISI2011-PCB-A-2b
An $n \times n$ matrix is said to be tridiagonal if its entries $a_{ij}$ are zero except when $|i−j| \leq 1$ for $1 \leq i, \: j \leq n$. Note that only $3n − 2$ entries of a tridiagonal matrix are non-zero. Thus, an array $L$ of size ... matrix. Given $i, j$, write pseudo-code to store $a_{ij}$ in $L$, and get the value of $a_{ij}$ stored earlier in $L$.
An $n \times n$ matrix is said to be tridiagonal if its entries $a_{ij}$ are zero except when $|i−j| \leq 1$ for $1 \leq i, \: j \leq n$. Note that only $3n −...
go_editor
770
views
go_editor
asked
Jun 3, 2016
Linear Algebra
descriptive
isi2011
linear-algebra
matrix
+
–
10
votes
2
answers
2245
ISI2011-PCB-A-2a
Give a strategy to sort four given distinct integers $a, b, c, d$ in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of $a, b, c, d$.
Give a strategy to sort four given distinct integers $a, b, c, d$ in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of ...
go_editor
1.4k
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011
algorithms
sorting
+
–
2
votes
0
answers
2246
ISI2011-PCB-A-1
Let $D = \{d_1, d_2, \dots, d_k\}$ be the set of distinct divisors of a positive integer $n$ ($D$ includes 1 and $n$). Then show that $\Sigma_{i=1}^k \sin^{-1} \sqrt{\log_nd_i}=\frac{\pi}{4} \times k$. hint: $\sin^{−1} x + \sin^{−1} \sqrt{1-x^2} = \frac{\pi}{2}$
Let $D = \{d_1, d_2, \dots, d_k\}$ be the set of distinct divisors of a positive integer $n$ ($D$ includes 1 and $n$). Then show that$\Sigma_{i=1}^k \sin^{-1} \sqrt{\log_...
go_editor
297
views
go_editor
asked
Jun 3, 2016
Geometry
isi2011
descriptive
proof
trigonometry
non-gate
+
–
1
votes
0
answers
2247
ISI2012-PCB-CS-6b
A network has $125$ stations attached by a dedicated pair of lines to a hub in a star topology. The distance from each station to the hub is $25$ meters, the speed of the transmission lines is $10$ Mbps, all frames are of length $12500$ bytes, and ... time. Assume that each station can transmit up to a maximum of $k = 2$ frames/token. Find the maximum throughput of the network.
A network has $125$ stations attached by a dedicated pair of lines to a hub in a star topology. The distance from each station to the hub is $25$ meters, the speed of the...
go_editor
641
views
go_editor
asked
Jun 3, 2016
Computer Networks
descriptive
isi2012-pcb-cs
computer-networks
throughput
+
–
1
votes
3
answers
2248
ISI2012-PCB-CS-6a
Consider a LIBRARY database consisting of the following entity sets: Book (bookid, title, publishername) Book authors (bookid, authorname) Publisher (publishername, address, phonenumber) Bookcopies (bookid, accessionnumber) Book loans (bookid, cardnumber, issuedate, ... the borrowers who do not have any book issued. Hence write an equivalent SQL statement for the above query.
Consider a LIBRARY database consisting of the following entity sets:Book (bookid, title, publishername)Book authors (bookid, authorname)Publisher (publishername, address,...
go_editor
759
views
go_editor
asked
Jun 3, 2016
Databases
descriptive
isi2012-pcb-cs
databases
relational-algebra
sql
+
–
2
votes
0
answers
2249
ISI2012-PCB-CS-5b
Let $T$ be an AVL tree for storing a set of $n$ integers. Insertions and deletions in $T$ can hence be done in $O(\log n)$ time. Given two integers $a$ and $b, \: a < b$, you have to output nab, the number of integers in T whose ... $T$ and its insertion algorithm are required? Give a pseudo-code for computing $n_{ab}$.
Let $T$ be an AVL tree for storing a set of $n$ integers. Insertions and deletions in $T$ can hence be done in $O(\log n)$ time. Given two integers $a$ and $b, \: a < b$,...
go_editor
379
views
go_editor
asked
Jun 3, 2016
DS
descriptive
isi2012-pcb-cs
data-structures
avl-tree
+
–
1
votes
0
answers
2250
ISI2012-PCB-CS-5a
Suppose you have the following three subroutines: $\text{max}(A, i, j)$: returns the index of the maximum among the set of consecutive elements $A[i, \dots, j]$ of the array $A$. $\text{min}(A, i, j)$: returns the index of the minimum among the set of ... time complexity of the first two subroutines is $O(k)$, where $k = j − i$, and that for the third subroutine is $O(1)$.
Suppose you have the following three subroutines:$\text{max}(A, i, j)$: returns the index of the maximum among the set of consecutive elements $A[i, \dots, j]$ of the arr...
go_editor
461
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2012-pcb-cs
algorithms
sorting
+
–
Page:
« prev
1
...
70
71
72
73
74
75
76
77
78
79
80
...
91
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register