# Recent questions tagged ugcnetjan2017iii

1
Which of the following is an interrupt according to temporal relationship with system clock? Maskable interrupt Periodic interrupt Division by zero Synchronous interrupt
2
Which of the following is incorrect for virtual memory? Large programs can be written More I/O is required More addressable memory available Faster and easy swapping of process
3
The general configuration of the microprogrammed control unit is given below: What are blocks B and C in the diagram respectively? Block address register and cache memory Control address register and control memory Branch register and cache memory Control address register and random access memory
4
Match the following ... a-iv, b-iii, c-i, d-ii a-iv, b-i, c-iii, d-ii a-iv, b-ii, c-i, d-iii a-iv, b-iii, c-ii, d-i
5
In $8085$ microprocessor, the digit $5$ indicates that the microprocessor needs $-5$ volts, $+5$ volts supply $+5$ volts supply only $-5$ volts supply only $5$ MHz clock
6
In $8085$, which of the following performs: load register pair immediate operation? LDAX rp LKLD addr LXI rp, data INX rp
1 vote
7
Consider following schedules involving two transactions: $S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X)$ $S_{2}: \: r_{1}(X);r_{2}(X);r_{2}(Y);w_{2}(Y);r_{1}(Y);w_{1}(X)$ Which of the ... . $S_1$ is conflict serializable and $S_2$ is not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are not conflict serializable
8
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
9
Let $pk(R)$ denotes primary key of relation $R$. A many-to-one relationship that exists between two relation $R_1$ and $R_2$ can be expressed as follows: $pk(R_2)\rightarrow pk(R_1)$ $pk(R_1)\rightarrow pk(R_2)$ $pk(R_2)\rightarrow R_1 \cap R_2$ $pk(R_1)\rightarrow R_1 \cap R_2$
10
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ The relation $R$ is in First ... well as in second normal form Second normal form but not in third normal form. Both in second normal form as well as in third normal form.
11
Consider the following relation: Works(emp_name, company_name,salary) Here,emp name is primary key. Consider the following SQL query Select emp name From works T where salary > (select avg(salary) from works S where T. company name = S. company name) The above ... salary of all employees all the companies. Find all employees who earn more than the average salary of all employees of their company.
12
If following sequence of keys are inserted in a $B+$ tree with $K(=3)$ pointers: $8,5,1,7,3,12,9,6$ Which of the following shall be correct $B+$ tree?
13
Which of the following statement(s) is/are correct? Persistence is the term used to describe the duration of phosphorescence. The control electrode is used to turn the electron beam on and off. The electron gun creates a source of electrons which are focused into a narrow beam directed at the face of CRT. All of the above
14
A segment is any object described by GKS commands and data that start with CREATE SEGMENT and Terminates with CLOSE SEGMENT command. What functions can be performed on these segments? Translation and Rotation Panning and Zooming Scaling and Shearing Translation, Rotation, Panning and Zooming
15
Match the following: ... a-i, b-ii, c-iii, d-iv a-i, b-iii, c-ii, d-iv a-iv, b-iii, c-ii, d-i, a-iv, b-ii, c-i, d-iii
16
Below are the few steps given for scan-converting a circle using Bresenham’s Algorithm. Which of the given steps is not correct? Compute $d= 3-2r$ (where $r$ is radius) Stop if $x>y$ If $d< 0$, then $d=4x+6$ and $x=x+1$ If $d\geq 0$, then $d=4 \ast(x-y)+10, \: x=x+1$ and $y=y+1$
17
Which of the following is/are side effects of scan conversion? Aliasing Unequal intensity of diagonal lines Overstriking in photographic applications Local or Global aliasing a and b a,b and c a,c and d a,b,c and d
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. $[(0,0),(1,1),(2,1),(3,2)]$ $[(0,0),(1,1.5),(2,2),(3,3)]$ $[(0,0),(1,1),(2,2.5),(3,3)]$ $[(0,0),(1,2),(2,2),(3,2)]$
19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (a) and (b) only (a), (b) and (c) only (b),(c) and (d) only (b) and (d) only
1 vote
20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
1 vote
21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is correct? Both (a) and (b) are false Both (a) and (b) are true (a) is true, (b) is false (a) is false, (b) is true
22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$
23
Given the following two languages : $L_{1}= \{a^{n}b^{n}, \mid n\geq 0,n \neq 100 \}$ $L_{2}= \{w \in \{a,b,c \} ^{\ast} \mid n_{a}(w)=n_{b}(w)=n_{c}(w) \}$ Which of the following options is correct? Both $L_{1}$ and $L_{2}$ ... are context free language $L_{1}$ is context free language, $L_{2}$ is not context free language $L_{1}$ is not context free language, $L_{2}$ is context free language
1 vote
24
A recursive function $h$, is defined as follows: $\begin{array} {} h(m) & =k, \text{if } m=0 \\ &=1, \text{if } m=1 \\ &= 2 h(m-1)+4h(m-2), \text{if } m \geq 2 \end{array}$ If the value of $h(4)$ is $88$ then the value of $k$ is: $0$ $1$ $2$ $-1$
1 vote
25
Suppose there are $n$ stations in a slotted $LAN$. Each station attempts to transmit with a probability $P$ in each time slot. The probability that only one station transmits in a given slot is $nP(1-P)^{n-1}$ $nP$ $P(1-P)^{n-1}$ $n^{P}(1-P)^{n-1}$
26
Station $A$ uses $32$ byte packets t transmit messages to station $B$ using sliding window protocol. The round trip delay between $A$ and $B$ is $40$ milliseconds and the bottleneck bandwidth on the path between $A$ and $B$ is $64$ kbps. The optimal window size of $A$ is $20$ $10$ $30$ $40$
27
Let $G(x)$ be generator polynomial used for CRC checking. The condition that should be satisfied by $G(x)$ to correct odd numbered error bits, will be: $(1+x)$ is factor of $G(x)$ $(1-x)$ is factor of $G(x)$ $(1+x^{2})$ is factor of $G(x)$ $x$ is factor of $G(x)$
In a packet switching network, if the message size is $48$ bytes and each packet contains a header of $3$ bytes. If $24$ packets are required to transmit the message, the packet size is $2$ bytes $1$ byte $4$ bytes $5$ bytes
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$ ... I and II I and III II and III I and IV
A node $X$ on a $10$ Mbps network is regulated by a token bucket. The token bucket is filled at a rate of $2$ Mbps. Token bucket is initially filled with $16$ megabits. The maximum duration taken by $X$ to transmit at full rate of $10$ Mbps is ______secs. $1$ $2$ $3$ $4$