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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions and answers in Non GATE
0
votes
1
answer
1
UGC NETPaperIII Nov2017(46)
46.Consider the method mcq(): Int mcq(Boolean a,Boolean b,boolean c,Boolean d) { int ans=1; if (a) {ans=2;} else if (b){ans=3;} else if (c){ if(d) {ans=4;} } return ans; } If M1=Number of tests to exhaustively test mcq(); M2=Minimum number of tests to achieve full statement coverage for ... ; Then (M1,M2,M3)=. (1)(16,3,5) (2)(8,5,3) (3)(8,3,5) (4)(16,4,4)
answered
1 hour
ago
in
IS&Software Engineering
by
praveena4ajith
(
11
points)

1.2k
views
is&softwareengineering
softwaretesting
+2
votes
2
answers
2
UGCNETDec2014III56
An $A^{*}$ algorithm is a heuristic search technique which Is like a depthfirst search where most promising child is selected for expansion Generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node ... path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above
answered
3 days
ago
in
Others
by
Nurzamal Islam
(
25
points)

393
views
ugcnetdec2014iii
artificialintelligence
search
a
0
votes
1
answer
3
UGCNETJuly2018II53
In a multiuser operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ______ $e^{15}$ $1e^{15}$ $1e^{20}$ $e^{20}$
answered
4 days
ago
in
Others
by
kmittal1908
(
25
points)

16
views
ugcnetjuly2018ii
0
votes
1
answer
4
UGCNETJuly2018II16
Coupling is a measure of the strength of the interconnections between software modules. Which of the following are correct statements with respect to module coupling? P: Common coupling occurs when one module controls the flow of another module by passing it information on what to do Q: In ... only parts of it. Code: P and Q only P and R only Q and R only All of P, Q and R
answered
6 days
ago
in
Others
by
Pratikshadoshi
(
11
points)

27
views
ugcnetjuly2018ii
0
votes
1
answer
5
GATE SELF
Hello every one . I am preparing for GATE 19 and want to get a good RAnk . what should be best strategy to follow to get rank under max two digit. I gave GATE 18 but cant able to secure good rank. please give yr suggestion Thanks in advance.
answered
Sep 8
in
Others
by
Shubham Aggarwal
Junior
(
619
points)

49
views
gate2018analysis
+1
vote
2
answers
6
UGCNETJune2016III17
Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further Sh$_x$ and Sh$_y$ are shearing factors in x and y directions. If we perform the y direction shear relative to x=s$_{ref}$ then the transformed point is given by $x’=x+Sh_x.(yy_{ref}); y’=y$ $x’=x; y’=y.Sh_x$ $x’=x; y’=Sh_y(xx_{ref})+y$ $x’=Sh_y.y; y’=y.(xx_{ref})$
answered
Sep 6
in
Computer Graphics
by
Mayank Malik
(
17
points)

665
views
ugcnetjune2016iii
computergraphics
+1
vote
1
answer
7
UGCNETJan2017III16
Below are the few steps given for scanconverting 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$
answered
Sep 6
in
Computer Graphics
by
Mayank Malik
(
17
points)

109
views
+1
vote
1
answer
8
UGCNETNov2017iii74
answered
Sep 4
in
Others
by
mohit jain
(
27
points)

89
views
ugcnetnov2017iii
0
votes
1
answer
9
UGCNETJuly2018II65
Consider the 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 one of the following statements is correct with respect to ... and $S_2$ is not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable
answered
Aug 31
in
Others
by
yuviabhi
(
231
points)

10
views
ugcnetjuly2018ii
0
votes
1
answer
10
UGCNETJuly2018II99
Simplify the following using Kmap: $F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$ $d(A, B, C, D) = \Sigma (10, 11, 14, 15)$ d stands for don't care condition $A+\bar{B} \bar{D} +BC$ $A+\bar{B} \bar{D} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$
answered
Aug 31
in
Others
by
yuviabhi
(
231
points)

17
views
ugcnetjuly2018ii
0
votes
1
answer
11
UGCNETJuly2018II96
Perform the following operation for the binary equivalent of the decimal numbers $(14)_{10}+(15)_{10}$. The solution in 8 bit representation is 11100011 00011101 10011101 11110011
answered
Aug 31
in
Others
by
yuviabhi
(
231
points)

19
views
ugcnetjuly2018ii
0
votes
2
answers
12
UGCNETJuly2018II92
In RS flipflop, the output of the flipflop at time (t+1) same as the output at time t, after the occurance of a clock pulse if S=R=1 S=0, R=1 S=2, R=0 S=R=0
answered
Aug 31
in
Others
by
yuviabhi
(
231
points)

47
views
ugcnetjuly2018ii
0
votes
1
answer
13
UGCNETJuly2018II93
Match the terms in ListI with the options given in ListII List  I List  II a Decoder i 1 line to $2^n$ lines b Multiplexer ii n lines to $2^n$ lines c De multiplexer iii $2^n$ lines to 1 line iv $2^n$ lines to $2^{n1}$ lines aii; bi; ciii aii; biii; ci aii; bi; civ aiv; bii; ci
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

16
views
ugcnetjuly2018ii
0
votes
1
answer
14
UGCNETJuly2018II91
CMOS is a computer chip on the motherboard, which is RAM ROM EPROM Auxillary storage
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

14
views
ugcnetjuly2018ii
0
votes
2
answers
15
UGCNETJuly2018II86
If $A_i = \{i, \dots , 2, 1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^x A_i$ is Z Q R C
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

25
views
ugcnetjuly2018ii
0
votes
1
answer
16
UGCNETJuly2018II77
Consider the following English sentence: "Agra and Gwalior are both in India". A sudent has written a logical sentence for the above English sentence in FirstOrder Logic using predicate IN(x, y), which means x is in y, as ... but expresses the meaning of the English sentence It is syntactically invalid and does not express the meaning of the English sentence
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

17
views
ugcnetjuly2018ii
0
votes
1
answer
17
UGCNETJuly2018II68
Database systems that store each relation in a separate operating system file may use the operating system's authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false? The administrator ... file Operations on the database are speeded up as the authorization procedure is carried out at the operating system level
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

30
views
ugcnetjuly2018ii
0
votes
2
answers
18
UGCNETJuly2018II64
Relations produced from ER Model will always be in _____ 1 NF 2 NF 3 NF 4 NF
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

10
views
ugcnetjuly2018ii
0
votes
1
answer
19
UGCNETJuly2018II63
In a Hierarchical database, a hashing function is used to locate the ____ Collision Root Foreign Key Records
answered
Aug 30
in
Others
by
yuviabhi
(
231
points)

12
views
ugcnetjuly2018ii
0
votes
1
answer
20
UGCNETJuly2018II40
Consider the following statements( ): $S_1$: There exist no algorithm for deciding if any two Turing machine $M_1$ and $M_2$ accept the same language $S_2$: The problem of determining whether a Turing machine halts on any input is undecidable Which one of ... ? Both $S_1$ and $S_2$ are correct Both $S_1$ and $S_2$ are not correct Only $S_1$ is correct Only $S_2$ is correct
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

13
views
ugcnetjuly2018ii
0
votes
2
answers
21
UGCNETJuly2018II37
Context sensitive language can be recognized by a Finite state machine Deterministic finite automata Nondeterministic finite automata Linear bounded automata
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

18
views
ugcnetjuly2018ii
0
votes
1
answer
22
UGCNETJuly2018II36
Consider the following two Grammars: $G_1 \: : \: S \rightarrow SbS \mid a$ $G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$ Which one of the folloeing options is correct? Only $G_1$ is ambiguous Only $G_2$ is ambiguous Both $G_1$ and $G_2$ are ambiguous Both $G_1$ and $G_2$ are not ambiguous
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

13
views
ugcnetjuly2018ii
0
votes
1
answer
23
UGCNETJuly2018II35
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is $2n1$ $2n$ $n+1$ $n^2$
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

36
views
ugcnetjuly2018ii
0
votes
2
answers
24
UGCNETJuly2018II34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

26
views
ugcnetjuly2018ii
0
votes
1
answer
25
UGCNETJuly2018II32
The finite state machine given in figure below recognizes: anu string of odd number of a's anu string of odd number of b's any string of even number of a's and odd number of b's any string of odd number of a's and odd number of b's
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

23
views
ugcnetjuly2018ii
0
votes
2
answers
26
UGCNETJuly2018II28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

40
views
ugcnetjuly2018ii
0
votes
1
answer
27
UGCNETJuly2018II27
Match the following with respect to algorithm paradigms: List  I List  II (a) The 8Queen's problem (i) Dynamic programming (b) SingleSource shortest paths (ii) Divide and conquer (c) STRASSEN's Matrix multiplication (iii) Greedy approach (d) Optimal binary search trees (iv) Backtracking aiv; bi ... ii aiv; biii, ci, dii aiii; biv, cii, di aiv; biii, cii, di
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

31
views
ugcnetjuly2018ii
0
votes
1
answer
28
UGCNETJuly2018II29
A 5ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be: 30 33 45 125
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

44
views
ugcnetjuly2018ii
0
votes
2
answers
29
UGCNETJuly2018II26
A binary search tree in which every nonleaf node has nonempty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

18
views
ugcnetjuly2018ii
0
votes
2
answers
30
UGCNETJuly2018II24
Which of the following algorithms solves the singlesource shortest paths? Prim's algorithm FloysWarshall algorithm Johnson's algorithm Dijkstra's algorithm
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

26
views
ugcnetjuly2018ii
0
votes
1
answer
31
UGCNETJuly2018II21
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\theta \: (lg \: m)$ $\theta \: (m)$ $\theta \: (mlg \: m)$ $\theta \: (lglg \: m)$
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

26
views
ugcnetjuly2018ii
0
votes
1
answer
32
UGCNETJuly2018II15
Match the 5 CMM Maturity levels/CMMI staged representations in List  I with their characterizations in List  II: List  I List  II Initial Processes are improved quantitatively and continually Repeatable The plan for a project comes from a template for plans Defined The plan uses processes that can be ... v; eiii av; biv; cii; diii; ei aiv; bv; cii; diii; ei
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

26
views
ugcnetjuly2018ii
0
votes
2
answers
33
UGCNETJuly2018II14
A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year? 96.9924% 97.9924% 98.9924% 99.9924%
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

29
views
ugcnetjuly2018ii
0
votes
1
answer
34
UGCNETJuly2018II13
Which one of the following is not typically provided by Source Code Management Software? Synchronization Versioning and Revision history Syntax highlighting Project forking
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

21
views
ugcnetjuly2018ii
0
votes
1
answer
35
UGCNETJuly2018II11
Assume the following regarding the development of a software system P: Estimated lines of codes P : 33, 480 LOC Average productivity for P : 620 LOC per person month Number of software developers : 6 Average salary of a software developer : INR 50, 000 per month If E, D and C are the ... respectively, then (E, D, C) = ______ (48, 8, 24) (54, 9, 27) (60, 10, 30) (42, 7, 21)
answered
Aug 29
in
Others
by
yuviabhi
(
231
points)

26
views
ugcnetjuly2018ii
0
votes
0
answers
36
if class P inherits class Q privately and class P has a friend function.
asked
Aug 21
in
Java
by
Upender
(
7
points)

8
views
0
votes
4
answers
37
Ugc Net july 2018 paper 2
Can anyone solve the following recurrence relation problem which was asked in this year Ugc net paper 2
answered
Aug 19
in
Others
by
turendar
(
161
points)

66
views
ugcnetjuly2018ii
datastructure
0
votes
2
answers
38
UGCNETJuly2018II3
What is the output of the following JAVA program? class simple { public static void main(String[ ] args) { simple obj = new simple(); obj.start(); } void start() { long [] P = {3, 4, 5}; long [] Q = method (P); System.out.print (P[0] + P[1] +P[2]+ : ); System.out.print ... + Q[2]); } long [ ] method (long [ ] R) { R[1] = 7; return R; } } //end of class 12:15 15:12 12:12 15:15
answered
Aug 18
in
Others
by
sanjeela.sagar
(
157
points)

64
views
ugcnetjuly2018ii
+2
votes
2
answers
39
UGCNETDec2015III57
What will be the output of the following Unix command? $rm chap0\[13\] Remove file chap0[13] Remove file chap01, chap02, chap03 Remove file chap$\text{\[13\]}$ None of the above
answered
Aug 17
in
Others
by
Aditya Pai
(
21
points)

500
views
ugcnetdec2015iii
unix
+1
vote
2
answers
40
UGCNETJan2017III18
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)]
answered
Aug 11
in
Computer Graphics
by
hkPriya sharma
(
11
points)

171
views
To see more, click for all the
questions in this category
.
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
Members at the site
Mk Utkarsh
arvin
Tesla!
srestha
Noddy
Raghava45
manisha11
Gurdeep Saini
Recent Posts
Mutual Exclusion vs. Hold and Wait
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
All categories
General Aptitude
1.4k
Engineering Mathematics
5.7k
Digital Logic
2.2k
Programming & DS
4.1k
Algorithms
3.6k
Theory of Computation
4.5k
Compiler Design
1.7k
Operating System
3.2k
Databases
3.2k
CO & Architecture
2.8k
Computer Networks
3.2k
Non GATE
1.1k
IS&Software Engineering
244
Web Technologies
57
Numerical Methods
53
Computer Graphics
62
Object Oriented Programming
56
Java
20
Cloud Computing
1
Distributed Computing
13
Machine Language
7
Knowledge Representation
17
Information Theory
0
Digital Image Processing
16
Digital Signal Processing
7
Computer Peripherals
10
Multimedia
2
Geometry
6
Integrated Circuits
8
Others
533
Others
1.5k
Admissions
503
Exam Queries
474
Tier 1 Placement Questions
22
Job Queries
61
Projects
13
Follow @csegate
Gatecse
Recent questions and answers in Non GATE
Recent Blog Comments
[email protected]
post it as question
[email protected]
@Swaraj i got 74.22 %
@sanjay sharma , my gmail id ...
39,683
questions
46,748
answers
140,513
comments
58,300
users