Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isi2012-pcb-cs
1
1 vote
0
0 answers
915
915 views
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...
go_editor
915
views
asked
Jun 3, 2016
Computer Networks
descriptive
isi2012-pcb-cs
computer-networks
throughput
+
–
1
1 vote
3
3 answers
1.4k
1.4k views
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,...
go_editor
1.4k
views
asked
Jun 3, 2016
Databases
descriptive
isi2012-pcb-cs
databases
relational-algebra
sql
+
–
2
2 votes
0
0 answers
594
594 views
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$,...
go_editor
594
views
asked
Jun 3, 2016
Data Structures
descriptive
isi2012-pcb-cs
data-structures
avl-tree
+
–
1
1 vote
0
0 answers
740
740 views
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 arr...
go_editor
740
views
asked
Jun 3, 2016
Algorithms
descriptive
isi2012-pcb-cs
algorithms
sorting
+
–
1
1 vote
0
0 answers
1.0k
1.0k views
ISI2012-PCB-CS-4
A fan of order $n$ is a graph on the vertices $\{0, 1, \dots, n\}$ with $2n − 1$ edges defined as follows: vertex $0$ is connected by an edge to each of the other $n$ ver...
go_editor
1.0k
views
asked
Jun 2, 2016
Graph Theory
descriptive
isi2012-pcb-cs
graph-theory
minimum-spanning-tree
generating-functions
+
–
3
3 votes
2
2 answers
1.8k
1.8k views
ISI2012-PCB-CS-3
Design a Turing machine that recognizes the unary language consisting of all strings of 0’s whose length is a power of 2, i.e., $L = \{0^{2n} \mid n \geq 0\}$
go_editor
1.8k
views
asked
Jun 2, 2016
Theory of Computation
descriptive
isi2012-pcb-cs
theory-of-computation
turing-machine
+
–
2
2 votes
1
1 answer
800
800 views
ISI2012-PCB-CS-2c
Add the following two floating point numbers $A$ and $B$ given in IEEE $754$ single precision format and show the sum $S$ in the same format.$A: 0000011000100 \: 0000 \: ...
go_editor
800
views
asked
Jun 2, 2016
Digital Logic
descriptive
isi2012-pcb-cs
digital-logic
number-representation
ieee-representation
+
–
1
1 vote
0
0 answers
880
880 views
ISI2012-PCB-CS-2b
The CPU of a computer has a ripple-carry implementation of a $2$’s complement adder that takes two $8$ – bit integers $A = a_7a_6 \dots a_0$ and $B = b_7b_6 \dots b_0$ as...
go_editor
880
views
asked
Jun 2, 2016
Digital Logic
descriptive
isi2012-pcb-cs
digital-logic
adder
+
–
18
18 votes
5
answers
5 answers
4.2k
4.2k views
ISI2012-PCB-CS-2a
A machine $\mathcal{M}$ has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses:$F$-stage — instructio...
go_editor
4.2k
views
asked
Jun 2, 2016
CO & Architecture
descriptive
isi2012-pcb-cs
co-and-architecture
pipelining
+
–
1
1 vote
1
1 answer
851
851 views
ISI2012-PCB-CS-1b
Two processes $P_1$ and $P_2$ have a common shared variable count. While $P_1$ increments it, $P_2$ decrements it. Given that $R_0$ is a register, the corresponding assem...
go_editor
851
views
asked
Jun 2, 2016
Operating System
descriptive
isi2012-pcb-cs
operating-system
process-synchronization
+
–
1
1 vote
1
1 answer
1.0k
1.0k views
ISI2012-PCB-CS-1a
In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of $2$ that is greater than or equal to the amount reques...
go_editor
1.0k
views
asked
Jun 2, 2016
Operating System
descriptive
isi2012-pcb-cs
operating-system
memory-management
+
–
To see more, click for the
full list of questions
or
popular tags
.