search
Log In

Questions by Debasmita Bhoumik

0 votes
1 answer
1
Let P = {P1(x1, y1), P2(x2, y2), . . . , Pn(xn, yn)} be a set of n points located within a rectangle such that none of the points touches its boundary. The top-left corner of the rectangle is at the origin O(0, 0). A plane mirror is placed along the ... R2 at angle θ2 (denoted by a dashed line), passes through only 2 points. You will get full credit only if your algorithm takes O(n log n) time.
asked May 12, 2018 in Algorithms 103 views
1 vote
1 answer
2
Consider the Boolean function F(x1, x2, . . . , x10) realised by the following combinational circuit. Determine the number of input combinations for which the output function F realised by the circuit becomes true (logic 1).
asked May 12, 2018 in Digital Logic 132 views
1 vote
2 answers
3
Match the following w.r.t. Input/Output management: ... iii; b-iv; c-i; d-ii a-ii; b-i; c-iv; d-iii a-iv; b-i; c-ii; d-iii a-i; b-iii; c-iv; d-ii
asked Feb 11, 2017 in Operating System 1.6k views
0 votes
2 answers
4
In a paging system, it takes $30$ ns to search translation Look-aside Buffer (TLB) and $90$ ns to access the main memory. If the TLB hit ratio is $70\%,$ the effective memory access time is $48$ ns $147$ ns $120$ ns $84$ ns
asked Feb 11, 2017 in CO and Architecture 4.1k views
0 votes
3 answers
5
There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order: P2 needs to access ... P2 exits critical section Pi exits critical section The final value of semaphore will be: $0$ $1$ $-1$ $-2$
asked Feb 11, 2017 in Operating System 3.4k views
1 vote
2 answers
6
Which of the following statement(s) regarding a linker software is/are true? A function of a linker is to combine several object modules into a single load module. A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules. Only I Only II Both I and II Neither I nor II
asked Feb 11, 2017 in Others 2k views
1 vote
3 answers
7
Consider the following statements related to compiler construction: Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? Only I Only II Both I and II Neither I nor II
asked Feb 11, 2017 in Others 3.8k views
–1 vote
1 answer
8
Which of the following strings would match the regular expression: p+[3-5]*[xyz]? p443y p6y 3xyz p35z p353535x ppp5 I, III and Vl only IV, V and VI only II, IV and V only I, IV and V only
asked Feb 11, 2017 in Others 2.2k views
0 votes
1 answer
9
In link state routing algorithm after construction of link state packets, new routes are computed using: DES algorithm Dijkstra’s algorithm RSA algorithm Packets
asked Feb 4, 2017 in Others 2.6k views
0 votes
2 answers
10
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ______ automatically by server by exchanging information with neighbour nodes with back up database
asked Feb 4, 2017 in Others 1.8k views
0 votes
1 answer
11
Match the following Layers and Protocols for a user browsing with SSL: ... a-iv; b-i; c-ii; d-iii a-iii; b-ii; c-i; d-iv a-ii; b-iii; c-iv; d-i a-iii; b-i; c-iv; d-ii
asked Feb 4, 2017 in Others 874 views
0 votes
2 answers
12
If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m,$ where $n≤m,$ the expected number of collisions involving a particular key $x$ is less than _____ $1$ $1/n$ $1/m$ $n/m$
asked Feb 4, 2017 in Algorithms 723 views
0 votes
1 answer
13
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)
asked Feb 4, 2017 in Others 1.6k views
0 votes
2 answers
14
The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is _________ 16 63 64 65
asked Feb 4, 2017 in Others 3.4k views
0 votes
1 answer
15
Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationships between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are _______ 4 6 7 3
asked Feb 4, 2017 in Others 1.8k views
0 votes
1 answer
16
Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (are) true w.r.t. the examples of integrity constraints? An instructor Id. No. cannot be null, provided Instructor Id. No. being the ... , 2 and 3 are true 1 - false; 2 and 3 are true 1 and 2 are true; 3-false 1, 2 and 3 are false
asked Feb 4, 2017 in Others 1.7k views
1 vote
1 answer
17
A binary $3-bit$ down counter uses $J-K$ flip-flops, $FF_i$ with inputs $J_i, K_i$ and outputs $Q_i, i=0,1,2$ respectively. The minimized expression for the input from following is $J_0=K_0=0$ $J_0=K_0=1$ $J_1=K_1=Q_0$ $J_1=K_1=Q’_0$ $J_2=K_2=Q_1Q_0$ $J_2=K_2=Q’_1Q’_0$ I, III, V I, IV, VI II, III, V II, V, VI
asked Feb 4, 2017 in Digital Logic 3.3k views
2 votes
2 answers
18
In propositional logic, if $(P→Q)\wedge (R→S)$ and $(P\vee R)$ are two premises such that $Y$ is the premise: $\begin{array}{c}( P \rightarrow Q) \wedge ( R \rightarrow S) \\ P \vee R \\ \hline \\ Y \\ \hline \end{array}$ $P\vee R$ $P\vee S$ $Q\vee R$ $Q\vee S$
asked Feb 4, 2017 in Mathematical Logic 3.2k views
1 vote
3 answers
19
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $|V(G)|=n≥3.$ Then which of the following is true? $deg(v) ≥ n/2$ for each vertex $v$ $|E(G)| ≥ 1/2(n-1)(n-2)+2$ $deg(v)+deg(w) ≥ n$ whenever $v$ and $w$ are not connected by an edge All of the above
asked Feb 4, 2017 in Graph Theory 2.7k views
0 votes
2 answers
20
How many multiples of $6$ are there between the following pairs of numbers? $0$ and $100$ and $-6$ and $34$ $16$ and $6$ $17$ and $6$ $17$ and $7$ $16$ and $7$
asked Feb 4, 2017 in Set Theory & Algebra 1.6k views
...