Questions by Debasmita Bhoumik

0 votes

1 answer

1

ISI CSB 2017 C6
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 ... 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 | 47 views

+1 vote

1 answer

2

ISI CSB C5 B
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 | 55 views

+1 vote

2 answers

3

UGCNET-DEC2016-II-38
Match the following w.r.t. Input/Output management: List-I List-II a. Device controller i. Extracts information from the controller register and store it in data buffer b. Device driver ii. I/O scheduling c. Interrupt handler iii. Performs data transfer d. Kernel I/O subsystem iv. Processing of I/O ... 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 CBSE/UGC NET | 1.2k views

0 votes

2 answers

4

UGCNET-DEC2016-II-37
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 CBSE/UGC NET | 2.7k views

0 votes

3 answers

5

UGCNET-DEC2016-II-36
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: ... 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 CBSE/UGC NET | 2.1k views

0 votes

2 answers

6

UGCNET-DEC2016-II-35
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 | 1.2k views

+1 vote

3 answers

7

UGCNET-DEC2016-II-33
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 | 1.6k views

–1 vote

1 answer

8

UGCNET-DEC2016-II-31
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 | 1.5k views

0 votes

1 answer

9

UGCNET-DEC2016-II-30
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 | 1.4k views

0 votes

2 answers

10

UGCNET-DEC2016-II-29
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 | 824 views

0 votes

1 answer

11

UGCNET-DEC2016-II-26
Match the following Layers and Protocols for a user browsing with SSL: a. Application of layer i. TCP b. Transport layer ii. IP c. Network layer iii. PPP d. Datalink layer iv. HTTP 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 | 588 views

0 votes

2 answers

12

UGCNET-DEC2016-II-24
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 CBSE/UGC NET | 631 views

0 votes

1 answer

13

UGCNET-DEC2016-II-21
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 | 974 views

0 votes

2 answers

14

UGCNET-DEC2016-II-20
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 | 2.4k views

0 votes

1 answer

15

UGCNET-DEC2016-II-18
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 | 947 views

0 votes

1 answer

16

UGCNET-DEC2016-II-17
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. ... 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 | 853 views

+1 vote

1 answer

17

UGCNET-DEC2016-II-8
A binary 3-bit down counter uses J-K flip-flops, FFi with inputs Ji, Ki and outputs Qi, i=0,1,2 respectively. The minimized expression for the input from following is J0=K0=0 J0=K0=1 J1=K1=Q0 J1=K1=Q’0 J2=K2=Q1Q0 J2=K2=Q’1Q’0 I, III, V I, IV, VI Il, III, V Il, IV, Vl

asked Feb 4, 2017 in CBSE/UGC NET | 2.5k views

+2 votes

2 answers

18

UGCNET-DEC2016-II-6
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 CBSE/UGC NET | 2.3k views

+1 vote

3 answers

19

UGCNET-DEC2016-II-5
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 CBSE/UGC NET | 1.4k views

0 votes

2 answers

20

UGCNET-DEC2016-II-4
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 CBSE/UGC NET | 1.3k views

0 votes

2 answers

21

UGCNET-DEC2016-II-3
The functions mapping R into R are defined as: f(x) = x3-4x, g(x)=1/(x2+1) and h(x)=x4 Then find the value of the following composite functions: hog(x) and hogof(x) (x2+1)4 and [(x3-4x)2+1]4 (x2+1)4 and [(x3-4x)2+1]-4 (x2+1)-4 and [(x3-4x)2+1]4 (x2+1)-4 and [(x3-4x)2+1]-4

asked Feb 4, 2017 in CBSE/UGC NET | 1.3k views

0 votes

1 answer

22

UGCNET-DEC2016-II-2
Match the following: List-I List-II a. Absurd i. Clearly impossible being contrary to some evident truth b. Ambiguous ii. Capable of more than one interpretation or meaning c. Axiom iii. An assertion that is accepted and used without a proof d. Conjecture iv. An opinion Preferably based on some experience ... a-i; b-iii; c-iv; d-ii a-ii; b-iii; c-iv; d-i a-ii; b-i; c-iii; d-iv

asked Feb 4, 2017 in CBSE/UGC NET | 672 views

0 votes

2 answers

23

UGCNET-DEC2016-II-1
Consider a sequence $F_{00}$ defined as: $F_{00} (0) = 1, \: F_{00}(1)=1$ $F_{00}(n) = \frac{10*F_{00}(n-1)+100}{F_{00}(n-2)} \text{ for } n \geq 2$ Then what shall be the set of values of the sequence $F_{00}$? (1, 110, 1200) (1, 110, 600, 1200) (1, 2, 55, 110, 600, 1200) (1, 55, 110, 600, 1200)

asked Feb 4, 2017 in CBSE/UGC NET | 1.3k views

0 votes

2 answers

24

ugc net jan 2017 paper 3 q -20
20. Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents L1* U L2* L1* ? (1) {ε} (2) {ε,1} (3) ϕ (4) 1*

asked Jan 28, 2017 in CBSE/UGC NET | 1.2k views

0 votes

2 answers

25

ugc net jan 2017 paper 3 q-18
18. Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

asked Jan 28, 2017 in CBSE/UGC NET | 2.6k views

0 votes

2 answers

26

ugc net jan 2017 paper 3 q -17
17. Which of the following is/are side effects of scan conversion? a. Aliasing b. Unequal intensity of diagonal lines c. Over striking in photographic applications d. Local or Global aliasing (1) a and b (2) a, b and c (3) a, c and d (4) a, b, c and d

asked Jan 28, 2017 in CBSE/UGC NET | 1.1k views

0 votes

1 answer

27

ugc net jan 2017 paper 3 q -17
Below are the few steps given for scan-converting a circle using Bresenham’s Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x > y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

asked Jan 28, 2017 in CBSE/UGC NET | 924 views

+1 vote

1 answer

28

ugc net jan 2017 paper 3 q-7
Consider following schedules involving two transactions: S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X) S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X) Which of the following statement is true? A. Both S1 and S2 ... and S2 is not conflict serializable. C. S1 is not conflict serializable and S2 is conflict serializable. D. Both S1 and S2 are not conflict serializable.

asked Jan 28, 2017 in CBSE/UGC NET | 1.9k views

+1 vote

1 answer

29

UGC NET JAN 2017 PAPER 3 Q -4
Match the following: Addressing Mode Location of operand a. Implied i. Registers which are in CPU b. Immediate ii. Register specifies the address of the operand c. Register iii. Specified in the register d. Register Indirect iv. Specified implicitly in the definition of instruction Codes: a b c d (1) iv iii i ii (2) iv i iii ii (3) iv ii i iii (4) iv iii ii i

asked Jan 27, 2017 in CBSE/UGC NET | 576 views

0 votes

1 answer

30

UGC NET JAN 2017 PAPER 3 Q -3
The general configuration of the microprogrammed control unit is given below: What are blocks B and C in the diagram respectively? (1) Block address register and cache memory (2) Control address register and control memory (3) Branch register and cache memory (4) Control address register and random access memory

asked Jan 27, 2017 in CBSE/UGC NET | 814 views