Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2012-paper3
1
votes
1
answer
61
UGC NET CSE | December 2012 | Part 3 | Question: 45
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*
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*
shivani2010
828
views
shivani2010
asked
Jun 18, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
1
votes
2
answers
62
UGC NET CSE | December 2012 | Part 3 | Question: 57
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
Given the following statements:Recursive enumerable sets are closed under complementation.Recursive sets are closed under complementation.Which is/are the correct stateme...
shivani2010
2.1k
views
shivani2010
asked
Jun 17, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
0
votes
2
answers
63
UGC NET CSE | December 2012 | Part 3 | Question: 25
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
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,24381514...
Sanjay Sharma
3.1k
views
Sanjay Sharma
asked
May 31, 2016
Combinatory
ugcnetcse-dec2012-paper3
+
–
7
votes
2
answers
64
ISRO-2013-69, UGCNET-Dec2012-III: 62
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$%
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$...
makhdoom ghaya
12.9k
views
makhdoom ghaya
asked
May 12, 2016
IS&Software Engineering
isro2013
is&software-engineering
software-testing
non-gate
ugcnetcse-dec2012-paper3
+
–
0
votes
1
answer
65
UGC NET CSE | December 2012 | Part 3 | Question: 11
The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? ($n$ and $m$ ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-ii, b-i, c-iii, d-iv}$
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)$\...
Sanjay Sharma
1.8k
views
Sanjay Sharma
asked
May 9, 2016
Algorithms
ugcnetcse-dec2012-paper3
algorithms
time-complexity
+
–
1
votes
2
answers
66
UGC NET CSE | December 2012 | Part 3 | Question: 53
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$
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 lengthno greater than $2^{i+1}$no greater th...
Sanjay Sharma
3.6k
views
Sanjay Sharma
asked
Apr 28, 2016
Compiler Design
chomsky-normal-form
ugcnetcse-dec2012-paper3
parsing
+
–
0
votes
0
answers
67
UGC NET CSE | December 2012 | Part 3 | Question: 64
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})$
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 ...
Sanjay Sharma
1.6k
views
Sanjay Sharma
asked
Apr 13, 2016
Digital Image Processing
ugcnetcse-dec2012-paper3
fourier-transform
digital-image-processing
+
–
0
votes
1
answer
68
UGC NET CSE | December 2012 | Part 3 | Question: 68
An example of a dictionary-based coding technique is Run-length coding Huffman coding Predictive coding LZW coding
An example of a dictionary-based coding technique isRun-length codingHuffman codingPredictive codingLZW coding
Sanjay Sharma
3.0k
views
Sanjay Sharma
asked
Apr 13, 2016
Computer Networks
ugcnetcse-dec2012-paper3
computer-networks
network-security
encoding
+
–
2
votes
1
answer
69
UGC NET CSE | December 2012 | Part 3 | Question: 27
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 ... used to take twice the time taken by the fixed point operation in original design? 1.62 1.55 1.85 1.285
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...
prathams
1.0k
views
prathams
asked
Dec 11, 2015
CO and Architecture
co-and-architecture
ugcnetcse-dec2012-paper3
+
–
10
votes
3
answers
70
ISRO2014-21, UGCNET-Dec2012-III: 23, UGCNET-Dec2013-III: 22
What are the final values of $\text{Q}_1$ and $\text{Q}_0$ after $4$ clock cycles, if initial values are $00$ in the sequential circuit shown below: $11$ $01$ $10$ $00$
What are the final values of $\text{Q}_1$ and $\text{Q}_0$ after $4$ clock cycles, if initial values are $00$ in the sequential circuit shown below:$11$$01$$10$$00$
focus _GATE
12.4k
views
focus _GATE
asked
Jul 17, 2015
Digital Logic
isro2014
digital-logic
circuit-output
ugcnetcse-dec2012-paper3
ugcnetcse-dec2013-paper3
+
–
0
votes
2
answers
71
UGC NET CSE | December 2012 | Part 3 | Question: 39
When a programming language has the capacity to produce new datatype, it is called as, Overloaded Language Extensible Language Encapsulated Language Abstraction Language
When a programming language has the capacity to produce new datatype, it is called as,Overloaded LanguageExtensible LanguageEncapsulated LanguageAbstraction Language
Shimpy Goyal
1.4k
views
Shimpy Goyal
asked
Jun 27, 2015
Programming in C
programming
ugcnetcse-dec2012-paper3
+
–
15
votes
3
answers
72
GATE IT 2007 | Question: 34, UGCNET-Dec2012-III: 52
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 ... . Then, $x$ and $y$ are: $x=10, y=20$ $x=20, y=10$ $x=10, y=10$ $x=20, y=20$
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; ...
Ishrat Jahan
7.5k
views
Ishrat Jahan
asked
Oct 29, 2014
Programming in C
gateit-2007
programming
variable-binding
easy
ugcnetcse-dec2012-paper3
+
–
23
votes
5
answers
73
GATE CSE 1993 | Question: 7.9, UGCNET-Dec2012-III: 41
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 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$ respective...
Kathleen
26.4k
views
Kathleen
asked
Sep 29, 2014
Operating System
gate1993
operating-system
resource-allocation
normal
ugcnetcse-dec2012-paper3
multiple-selects
+
–
89
votes
5
answers
74
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
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 ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
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 over...
Kathleen
21.7k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
42
votes
10
answers
75
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
Suppose a processor does not have any stack pointer registers, which of the following statements is true?It cannot have subroutine call instructionIt cannot have nested s...
Kathleen
17.8k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register