# Recent questions tagged ugcnetdec2012iii

1
Which level of abstraction describes what data are stored in the database? Physical level View level Abstraction level Logical level
1 vote
2
Which of the following regular expression identifies are true? (r+s)*=r*s* (r+s)*=r*+s* (r+s)*=(r*s*)* r*s*=r*+s*
1 vote
3
Given the following statements: Recursive enumerable sets are closed under complementation. Recursive sets are closed under complementation. Which is/are the correct statement? only I only II both I and II neither I nor II
4
The number of distinct bracelets of five beads made up of red, blue and green beads (two bracelets are indistinguishable if the rotation of one yield another) is, 243 81 51 47
5
If a program $P$ calls two subprograms $P1$ and $P2$ and $P1$ can fail $50$% of the time and $P2$ can fail $40$% of the time, what is the failure rate of program $P$? $50$% $60$% $70$% $10$%
6
The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively) a. Bellman Ford algorithm 1. $O (m \log n)$ b. Kruskals algorithm 2. $O (n^3)$ c. Floyd Warshall algorithm 3. $O(mn)$ d. Topological sorting 4. $O(n + m)$ a b c d A 3 1 2 4 B 2 4 3 1 C 3 4 1 2 D 2 1 3 4
1 vote
7
If the parse tree of a word w generated by a Chomsky form grammar has no path of length greater than i, then the word w is of length no greater than $2^{i+1}$ no greater than $2^i$ no greater than $2^{i-1}$ no greater than $i$
8
If the Fourier transform of the function f(x,y) is F(m,n), then the Fourier transform of the function f(2x,2y) is $\frac{1}{4} F (\frac{m}{2}, \frac{n}{2})$ $\frac{1}{4} F (2m, 2n)$ $\frac{1}{4} F (m,n)$ $\frac{1}{4} F (\frac{m}{4}, \frac{n}{4})$
9
An example of a dictionary-based coding technique is Run-length coding Huffman coding Predictive coding LZW coding
10
In an enhancement of a CPU design, the speed of a floating point unit has been increased by 20% and the speed of a fixed point unit has been increased by 10%. What is the overall speed achieved if the ratio of the number of floating point operations to the number of ... floating point operation used to take twice the time taken by the fixed point operation in original design? 1.62 1.55 1.85 1.285
11
What are the final values of $Q_1$ and $Q_0$ after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: 11 01 10 00
12
When a programming language has the capacity to produce new datatype, it is called as, Overloaded Language Extensible Language Encapsulated Language Abstraction Language
13
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping. int i ; program main () { i = 10; call f(); } procedure f() { int i = 20; call g (); } procedure g () { print i; } Let x be the value printed under ... value printed under dynamic scoping. Then, x and y are: $x=10, y=20$ $x=20, y=10$ $x=10, y=10$ $x=20, y=20$
Consider a system having m resources of the same type. These resources are shared by $3$ processes $A$,$B$, and $C$ which have peak demands of $3$, $4$ and $6$ respectively. For what value of m deadlock will not occur? $7$ $9$ $10$ $13$ $15$
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every $t$ ... $q \geq \frac{t-ns}{n-1}$ $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$