search
Log In

Recent activity by Shreya Roy

5 answers
2
Let $F$ be the collection of all functions $f: \{1, 2, 3\} \to \{1, 2, 3\}$. If $f$ and $g \in F$, define an equivalence relation $\sim$ by $f\sim g$ if and only if $f(3) = g(3)$. Find the number of equivalence classes defined by $\sim$. Find the number of elements in each equivalence class.
comment reshown Jul 14, 2017 in Set Theory & Algebra 2.2k views
4 answers
3
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and minimum fragmentation seen in bytes? $25$ and $5$ $15$ and $5$ $15$ and $0$ $10$ and $5$
answer selected May 5, 2017 in Operating System 3.6k views
2 answers
4
Given below are two statements followed by two conclusions. Assuming these statements to be true, decide which one logically follows. Statements: All film stars are playback singers. All film directors are film stars. Conclusions: All film directors are playback singers ... Only conclusion I follows. Only conclusion II follows. Neither conclusion I nor II follows. Both conclusions I and II follow.
answered Apr 21, 2017 in Numerical Ability 945 views
1 answer
5
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
commented Apr 21, 2017 in Numerical Ability 3.6k views
6 answers
6
Three dice are rolled independently. What is the probability that the highest and the lowest value differ by $4$? $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{9}\right)$ $\left(\dfrac{5}{18}\right)$ $\left(\dfrac{2}{9}\right)$
answered Apr 11, 2017 in Probability 1.1k views
3 answers
7
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
commented Apr 6, 2017 in Graph Theory 1.1k views
2 answers
8
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ respectively. Besides, $T_{1}$ holds a lock on the ... , but not starvation-free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
comment edited Apr 2, 2017 in Databases 10.5k views
1 answer
9
A system has 4 processes and 5 allocatable resources. The current allocation and maximum needs are as follows: Allocated Maximum Available Process A 1 0 2 1 1 1 1 2 1 3 0 0 x 1 1 Process B 2 0 1 1 0 2 2 2 1 0 Process C 1 1 0 1 0 2 1 3 1 0 Process D 1 1 1 1 0 1 1 2 2 1 The smallest value of x for which the above system in safe state is 1 3 2 0
answer selected Mar 24, 2017 in Operating System 3.8k views
7 answers
10
Consider the following process and resource requirement of each process. Predict the state of this system, assuming that there are a total of $5$ instances of resource type $1$ and $4$ instances of resource type $2$. Can go to safe or unsafe state based on sequence Safe state Unsafe state Deadlock state
answer selected Mar 24, 2017 in Operating System 3.2k views
6 answers
11
The order of a leaf node in a B$^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K$ $bytes$, data record pointer is $7$ $bytes$ long, the value field is $9$ $bytes$ long and a block pointer is $6$ $bytes$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$
commented Mar 22, 2017 in Databases 11k views
7 answers
12
A pipeline $P$ operating at $400$ MHz has a speedup factor of $6$ and operating at $70$% efficiency. How many stages are there in the pipeline? $5$ $6$ $8$ $9$
commented Mar 21, 2017 in CO and Architecture 4.7k views
1 answer
13
1 answer
14
2 answers
15
Consider the following pseudo- code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo -code? 2 3 4 5
commented Mar 17, 2017 in IS&Software Engineering 4.4k views
2 answers
16
A program $P$ reads and processes $1000$ consecutive records from a sequential file $F$ stored on device $D$ without using any file system facilities. Given the following Size of each record $= 3200$ bytes Access time of $D = 10$ ... organized using a blocking factor of $2$ (i.e., each block on D contains two records of $F$) and $P$ uses one buffer?
comment edited Mar 14, 2017 in Operating System 3.3k views
2 answers
17
Specify the size of a ROM (number of words and number of bits per word) that will accommodate the truth table for the following combinational circuit : a code converter from a 4-digit BCD number to a binary number.
commented Mar 13, 2017 in Digital Logic 897 views
2 answers
18
What is the first order predicate calculus statement equivalent to the following? "Every teacher is liked by some student" $∀(x)\left[\text{teacher}\left(x\right) → ∃(y) \left[\text{student}\left(y\right) → \text{likes}\left(y,x\right)\right]\right]$ ...
commented Mar 8, 2017 in Mathematical Logic 4.2k views
4 answers
19
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first collision A draws k=0 and bdraws k=1.if jam signal is ignored and timeout is 1 RTT then at what time A's packet gets completely delivered to B...assume packet size 1000 bits. a)28 microsec b)16 microsec c)22 microsec d)38 microsec
answered Mar 3, 2017 in Computer Networks 1.1k views
1 answer
20
commented Mar 3, 2017 in Computer Networks 258 views
1 answer
21
If a graph has k-independent components, it it n-k+1 colorable
answered Feb 28, 2017 in Algorithms 162 views
1 answer
22
Number of distinct BFS, DFS trees in a complete graph ?
edited Feb 28, 2017 in Algorithms 757 views
3 answers
23
There are 16072016 users in Facebook. A graph is formed where an edge(u,v) is defined when a male is friend to a female and vice versa. Estimate the number of simple cycle of length 1607 formed in the graph?
answered Feb 28, 2017 in Algorithms 346 views
7 answers
24
The values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel = $1$ Mbps. Propagation delay from sender to receiver = $0.75$ ms. Time to process a frame = $0.25$ ms. Number of bytes in ... efficiency (expressed in percentage) of the Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
commented Feb 27, 2017 in Computer Networks 12.9k views
1 answer
25
The number of functions f from {1,2,...,20} into {1,2,....,20} such that f(k) is a multiple of 3 whenever k is a multiple of 4 is
answer selected Feb 26, 2017 in Combinatory 594 views
1 answer
26
consider the quadratic equation of the form x2+bx+c=0.The number of such equations that have real roots and coefficients b and c from the set{1,2,3,4,5} (b and c may be equal) is
answer selected Feb 26, 2017 in Combinatory 336 views
2 answers
27
Alpha and Beta testing are forms of Acceptance testing Integration testing System testing Unit testing
commented Feb 22, 2017 in IS&Software Engineering 2.7k views
3 answers
28
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ? 45 46 90 89
commented Feb 21, 2017 in Algorithms 804 views
5 answers
29
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... the names of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.
commented Feb 21, 2017 in Databases 11.9k views
1 answer
30
Which is greater root(n) or 2^root(logn)
answer selected Feb 16, 2017 in Interview Questions 143 views
...