The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged ugcnetdec2012iii
+1
vote
1
answer
1
UGCNETDec2012III45
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*
asked
Jun 18, 2016
in
Theory of Computation
by
shivani2010
Junior
(
545
points)

280
views
theoryofcomputation
ugcnetdec2012iii
+1
vote
2
answers
2
UGCNETDec2012III57
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
asked
Jun 17, 2016
in
Theory of Computation
by
shivani2010
Junior
(
545
points)

426
views
theoryofcomputation
ugcnetdec2012iii
0
votes
2
answers
3
UGCNETDec2012III25
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
asked
May 31, 2016
in
Combinatory
by
Sanjay Sharma
Boss
(
48.8k
points)

1.7k
views
ugcnetdec2012iii
+6
votes
2
answers
4
ISRO201369, UGCNETDec2012III62
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$%
asked
May 12, 2016
in
IS&Software Engineering
by
makhdoom ghaya
Boss
(
30.2k
points)

5.2k
views
isro2013
is&softwareengineering
softwaretesting
nongate
ugcnetdec2012iii
0
votes
1
answer
5
UGCNETDec2012III11
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
asked
May 9, 2016
in
Algorithms
by
Sanjay Sharma
Boss
(
48.8k
points)

542
views
ugcnetdec2012iii
algorithms
timecomplexity
+1
vote
2
answers
6
UGCNETDec2012III53
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^{i1}$ no greater than $i$
asked
Apr 28, 2016
in
Theory of Computation
by
Sanjay Sharma
Boss
(
48.8k
points)

990
views
chomskynormalform
ugcnetdec2012iii
0
votes
0
answers
7
UGCNETDec2012III64
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})$
asked
Apr 13, 2016
in
Digital Image Processing
by
Sanjay Sharma
Boss
(
48.8k
points)

672
views
ugcnetdec2012iii
fouriertransform
imageprocessing
0
votes
1
answer
8
UGCNETDec2012III68
An example of a dictionarybased coding technique is Runlength coding Huffman coding Predictive coding LZW coding
asked
Apr 13, 2016
in
Computer Networks
by
Sanjay Sharma
Boss
(
48.8k
points)

800
views
ugcnetdec2012iii
computernetworks
networksecurity
encoding
+2
votes
0
answers
9
UGCNETDec2012III27
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 ... 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
asked
Dec 11, 2015
in
CO and Architecture
by
prathams
Active
(
1.3k
points)

441
views
coandarchitecture
ugcnetdec2012iii
+6
votes
2
answers
10
ISRO201421, UGCNETDec2012III23, UGCNETDec2013III22
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
asked
Jul 17, 2015
in
Digital Logic
by
focus _GATE
Boss
(
20k
points)

4.9k
views
isro2014
digitallogic
circuitoutput
ugcnetdec2012iii
ugcnetdec2013iii
0
votes
2
answers
11
UGCNETDec2012III39
When a programming language has the capacity to produce new datatype, it is called as, Overloaded Language Extensible Language Encapsulated Language Abstraction Language
asked
Jun 27, 2015
in
Programming
by
Shimpy Goyal
Junior
(
937
points)

520
views
programming
ugcnetdec2012iii
+6
votes
3
answers
12
GATE2007IT34, UGCNETDec2012III52
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 ... under dynamic scoping. Then, x and y are: $x=10, y=20$ $x=20, y=10$ $x=10, y=10$ $x=20, y=20$
asked
Oct 30, 2014
in
Programming
by
Ishrat Jahan
Boss
(
16.3k
points)

2.1k
views
gate2007it
programming
variablebinding
normal
ugcnetdec2012iii
+15
votes
5
answers
13
GATE19937.9, UGCNETDec2012III41
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$
asked
Sep 30, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

8.5k
views
gate1993
operatingsystem
resourceallocation
normal
ugcnetdec2012iii
+44
votes
3
answers
14
GATE19982.17, UGCNETDec2012III43
Consider $n$ processes sharing the CPU in a roundrobin 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 ... $q \leq \frac{tns}{n+1}$ $q \geq \frac{tns}{n+1}$
asked
Sep 26, 2014
in
Operating System
by
Kathleen
Veteran
(
52.2k
points)

6.5k
views
gate1998
operatingsystem
processschedule
normal
ugcnetdec2012iii
+24
votes
5
answers
15
GATE20011.10, UGCNETDec2012III36
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
asked
Sep 14, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.2k
points)

4.4k
views
gate2001
coandarchitecture
normal
ugcnetdec2012iii
runtimeenvironments
Page:
« prev
1
2
3
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged ugcnetdec2012iii
Recent Blog Comments
@JashanAroraNo No. Don't directly say no.Think a...
@jeetYes, I am sorry for that.I saw ECIL Advt...
Congratulations man! A little question, please?...
Is IT eligible to apply in ECIL because they only...
@`JEET No brother, I don't have. These points I...
50,645
questions
56,580
answers
195,773
comments
101,779
users