Recent questions tagged isi2012

+1 vote

0 answers

1

ISI2012-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 ... Assume that each station can transmit up to a maximum of k = 2 frames/token. Find the maximum throughput of the network.

asked Jun 3, 2016 in Computer Networks by jothee Veteran (92.5k points) | 89 views

+1 vote

2 answers

2

ISI2012-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, ... borrowers who do not have any book issued. Hence write an equivalent SQL statement for the above query.

asked Jun 3, 2016 in Databases by jothee Veteran (92.5k points) | 138 views

+1 vote

0 answers

3

ISI2012-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 ... time. For this purpose, what modification of $T$ and its insertion algorithm are required? Give a pseudo-code for computing $n_{ab}$.

asked Jun 3, 2016 in DS by jothee Veteran (92.5k points) | 56 views

+1 vote

0 answers

4

ISI2012-CS-5a
Suppose you have the following three subroutines: $max(A, i, j)$: returns the index of the maximum among the set of consecutive elements $A[i, \dots, j]$ of the array $A$. $min(A, i, j)$: returns the index of the minimum among the set of ... the first two subroutines is $O(k)$, where $k = j − i$, and that for the third subroutine is $O(1)$.

asked Jun 3, 2016 in Algorithms by jothee Veteran (92.5k points) | 77 views

+1 vote

0 answers

5

ISI2012-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$ vertices, and vertex $i$ is connected by ... of spanning trees of the fan of order $n$. Calculate $f_4$. Write a recurrence for $f_n$. Solve for fn using ordinary generating fuctions.

asked Jun 2, 2016 in Graph Theory by jothee Veteran (92.5k points) | 118 views

+2 votes

1 answer

6

ISI2012-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\}$

asked Jun 2, 2016 in Theory of Computation by jothee Veteran (92.5k points) | 102 views

+2 votes

1 answer

7

ISI2012-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 000000000000001 $B$: 1000011000100 0000 000000000000001

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.5k points) | 94 views

+1 vote

0 answers

8

ISI2012-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 inputs, and produces a sum $S = s_7s_6 \dots s_0$, where $a_i, b_i, c_i ... $B$ = 1000 0110. What will be the output $S$ of the adder? How will the value of $S$ be interpreted by the machine?

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.5k points) | 56 views

+2 votes

4 answers

9

ISI2012-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 — instruction fetch (9 ns), $D$-stage — instruction decode ... 3rd instruction needs a 1-cycle stall before the $X$-stage. Calculate the CPU time in seconds for completing $P$.

asked Jun 2, 2016 in CO & Architecture by jothee Veteran (92.5k points) | 207 views

+1 vote

1 answer

10

ISI2012-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 assembly language codes are: $P_1$ count++ $P_2$ count-- MOV ... $R_0$ $count$ Give an example to justify whether a race condition may occur if $P_1$ and $P_2$ are executed simultaneously.

asked Jun 2, 2016 in Operating System by jothee Veteran (92.5k points) | 96 views

+1 vote

0 answers

11

ISI2012-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 requested by the process. A system using buddy memory allocation ... of the above sequence. Calculate the total memory wasted due to fragmentation in your memory allocation by the above scheme.

asked Jun 2, 2016 in Operating System by jothee Veteran (92.5k points) | 65 views

+1 vote

1 answer

12

ISI2012-A-3
Given an array $A = \{a_1, a_2, \dots, a_n\}$ of unsorted distinct integers, write a program in pseudo-code for the following problem: given an integer $u$, arrange the elements of the array $A$ such that all the elements in A which are less ... are greater than $u$ are at the end of the array. You may use at most 5 extra variables apart from the array $A$.

asked Jun 2, 2016 in Algorithms by jothee Veteran (92.5k points) | 40 views

+1 vote

0 answers

13

ISI2012-A-2b
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of 30; the two binary operators ’+ ... the LCM (least common multiple) and GCD (greatest common divisor) of two integer operands. Which are the identity elements for $\mathcal{B}$?

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.5k points) | 30 views

+1 vote

0 answers

14

ISI2012-A-2a
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of 30; the two binary ... ) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.

asked Jun 2, 2016 in Digital Logic by jothee Veteran (92.5k points) | 26 views

+1 vote

3 answers

15

ISI2012-A-1b
How many 0’s are there at the end of $50!$?

asked Jun 2, 2016 in Numerical Ability by jothee Veteran (92.5k points) | 95 views

+1 vote

1 answer

16

ISI2012-A-1a
A group of 15 boys plucked a total of 100 apples. Prove that two of those boys plucked the same number of apples.

asked Jun 2, 2016 in Numerical Ability by jothee Veteran (92.5k points) | 114 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged isi2012

Recent Posts

Recent Blog Comments

Recent Badges