Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged nielit2017july-scientistb-it
0
votes
1
answer
1
NIELIT 2017 July Scientist B (IT) - Section B: 1
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is $E$ $2E$ $V$ $2V$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
9.0k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
degree-of-graph
0
votes
2
answers
2
NIELIT 2017 July Scientist B (IT) - Section B: 2
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? In adjacency list representation, space is saved for sparse graphs. Deleting a vertex in adjacency list ... Adding a vertex in adjacency list representation is easier than adjacency matrix representation. All of the option.
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
13.8k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
0
votes
1
answer
3
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once? Euler circuit Hamiltonian path Euler Path Hamiltonian Circuit
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
1.4k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
0
votes
1
answer
4
NIELIT 2017 July Scientist B (IT) - Section B: 4
What are the appropriate data structures for graph traversal using Breadth First Search(BFS) and Depth First Search(DFS) algorithms? Stack for BFS and Queue for DFS Queue for BFS and Stack for DFS Stack for BFS and Stack for DFS Queue for BFS and Queue for DFS
Lakshman Patel RJIT
asked
in
DS
Mar 30, 2020
by
Lakshman Patel RJIT
975
views
nielit2017july-scientistb-it
data-structures
graph-algorithms
breadth-first-search
depth-first-search
0
votes
1
answer
5
NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehg abfhge afghbe Which are depth first traversals of the above graph? I,II and IV only I and IV only II,III and IV only I,III and IV only
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
533
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
depth-first-search
1
vote
1
answer
6
NIELIT 2017 July Scientist B (IT) - Section B: 6
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph? $(a,b), (e,f)$ $(a,b), (a,c)$ $(c,d), (d,h)$ $(a,b)$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
585
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
bridges
0
votes
1
answer
7
NIELIT 2017 July Scientist B (IT) - Section B: 7
Which of the following statements is/are TRUE? $S1$:The existence of an Euler circuit implies that an Euler path exists. $S2$:The existence of an Euler path implies that an Euler circuit exists. $S1$ is true. $S2$ is true. $S1$ and $S2$ both are true. $S1$ and $S2$ both are false.
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
1.2k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
euler-graph
1
vote
1
answer
8
NIELIT 2017 July Scientist B (IT) - Section B: 8
A connected planar graph divides the plane into a number of regions. If the graph has eight vertices and these are linked by $13$ edges, then the number of regions is: $5$ $6$ $7$ $8$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
2.3k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
0
votes
1
answer
9
NIELIT 2017 July Scientist B (IT) - Section B: 9
Power set of empty set has exactly _______ subset One Two Zero Three
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
319
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
set-theory
2
votes
1
answer
10
NIELIT 2017 July Scientist B (IT) - Section B: 10
What is the Cartesian product of $A=\{1,2\}$ and $B=\{a,b\}$? $\{(1,a),(1,b),(2,a),(b,b)\}$ $\{(1,1),(2,2),(a,a),(b,b)\}$ $\{(1,a),(2,a),(1,b),(2,b)\}$ $\{(1,1),(a,a),(2,a),(1,b)\}$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
271
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
cartesian-product
0
votes
3
answers
11
NIELIT 2017 July Scientist B (IT) - Section B: 11
What is the Cardinality of the Power set of the set $\{0,1,2\}$? $8$ $6$ $7$ $9$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
329
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
set-theory
1
vote
1
answer
12
NIELIT 2017 July Scientist B (IT) - Section B: 12
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is $6$ $8$ $9$ $13$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
482
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
2
votes
3
answers
13
NIELIT 2017 July Scientist B (IT) - Section B: 13
Which of the following statements is false? $(P\land Q)\lor(\sim P\land Q)\lor(P \land \sim Q)$ is equal to $\sim Q\land \sim P$ $(P\land Q)\lor(\sim P\land Q)\lor(P \wedge \sim Q)$ is equal to $Q\lor P$ ... $(P\land Q)\lor(\sim P\land Q)\lor (P \land \sim Q)$ is equal to $P\lor (Q\land \sim P)$
Lakshman Patel RJIT
asked
in
Mathematical Logic
Mar 30, 2020
by
Lakshman Patel RJIT
562
views
nielit2017july-scientistb-it
mathematical-logic
propositional-logic
0
votes
2
answers
14
NIELIT 2017 July Scientist B (IT) - Section B: 14
There are four bus lines between $A$ and $B$; and three bus lines between $B$ and $C$. The number of way a person roundtrip by bus from $A$ to $C$ by way of $B$ will be $12$ $7$ $144$ $264$
Lakshman Patel RJIT
asked
in
Combinatory
Mar 30, 2020
by
Lakshman Patel RJIT
334
views
nielit2017july-scientistb-it
discrete-mathematics
combinatory
0
votes
1
answer
15
NIELIT 2017 July Scientist B (IT) - Section B: 15
The number of diagonals that can be drawn by joining the vertices of an octagon is $28$ $48$ $20$ None of the option
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
337
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
0
votes
1
answer
16
NIELIT 2017 July Scientist B (IT) - Section B: 16
A partial ordered relation is transitive, reflexive and antisymmetric bisymmetric antireflexive asymmetric
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
321
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
partial-order
0
votes
1
answer
17
NIELIT 2017 July Scientist B (IT) - Section B: 17
Let $N=\{1,2,3,\dots\}$ be ordered by divisibility, which of the following subset is totally ordered? $(2,6,24)$ $(3,5,15)$ $(2,9,16)$ $(4,15,30)$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
8.6k
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
partial-order
1
vote
1
answer
18
NIELIT 2017 July Scientist B (IT) - Section B: 18
If $B$ is a Boolean algebra, then which of the following is true? $B$ is a finite but not complemented lattice $B$ is a finite, complemented and distributive lattice $B$ is a finite,distributive but not complemented lattice $B$ is not distributive lattice
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
1.5k
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
boolean-algebra
2
votes
1
answer
19
NIELIT 2017 July Scientist B (IT) - Section B: 19
If $R$ is a relation in Relational Data Model and $A_1,A_2,\dots A_n$ are the attributes of relation $R$, what is the cardinality of $R$ ...
Lakshman Patel RJIT
asked
in
Databases
Mar 30, 2020
by
Lakshman Patel RJIT
411
views
nielit2017july-scientistb-it
databases
relational-model
relational-calculus
1
vote
1
answer
20
NIELIT 2017 July Scientist B (IT) - Section B: 20
If $A$ and $B$ are two sets and $A \cup B = A \cap B$ then $A=\phi$ $B=\phi$ $A\neq B$ $A=B$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
260
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
set-theory
0
votes
1
answer
21
NIELIT 2017 July Scientist B (IT) - Section B: 21
The relation $\{(1,2),(1,3)(3,1),(1,1),(3,3),(3,2),(1,4),(4,2),(3,4)\}$ is Reflexive Transitive Symmetric Asymmetric
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
279
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
relations
0
votes
1
answer
22
NIELIT 2017 July Scientist B (IT) - Section B: 22
Let $L$ be a lattice. Then for every $a$ and $b$ in $L$ which one of the following is correct? $a\lor b = a\land \:b$ $a\lor(b\lor c)=(a\lor b)\lor c$ $a\lor(b\land \:c)=a$ $a\lor(b\lor c)=b$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Mar 30, 2020
by
Lakshman Patel RJIT
1.3k
views
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
lattice
1
vote
0
answers
23
NIELIT 2017 July Scientist B (IT) - Section B: 23
The probability that top and bottom cards of a randomly shuffled deck are both aces is: $4/52\times 4/52$ $4/52\times 3/52$ $4/52\times 3/51$ $4/52\times 4/51$
Lakshman Patel RJIT
asked
in
Probability
Mar 30, 2020
by
Lakshman Patel RJIT
333
views
nielit2017july-scientistb-it
engineering-mathematics
probability
0
votes
1
answer
24
NIELIT 2017 July Scientist B (IT) - Section B: 24
The coupling between different modules of a software is categorized as follows: Content coupling Common coupling Control coupling Stamp Coupling Data Coupling Coupling between modules can be ranked in the order of strongest (least desirable) to weakest(most desirable) as follows: I-II-III-IV-V V-IV-III-II-I I-III-V-II-IV IV-II-V-III-I
Lakshman Patel RJIT
asked
in
IS&Software Engineering
Mar 30, 2020
by
Lakshman Patel RJIT
621
views
nielit2017july-scientistb-it
non-gate
is&software-engineering
0
votes
1
answer
25
NIELIT 2017 July Scientist B (IT) - Section B: 25
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be ... to another data store or to an external entity. II and IV II and III I and III I,II and III
Lakshman Patel RJIT
asked
in
IS&Software Engineering
Mar 30, 2020
by
Lakshman Patel RJIT
616
views
nielit2017july-scientistb-it
non-gate
is&software-engineering
2
votes
1
answer
26
NIELIT 2017 July Scientist B (IT) - Section B: 26
The following program is to be tested for statement coverage: begin if(a==b){S1;exit;} else if (c==d){S2;} else{S3;exit;} S4; end The test cases $T1,T2,T3$ and $T4$ given below are expressed in terms of the properties satisfied by the ... given below ensures coverage of statements $S1,S2,S3$ and $S4$? $T_1,T_2,T_3$ $T_2,T_4$ $T_3,T_4$ $T_1,T_2,T_4$
Lakshman Patel RJIT
asked
in
Programming
Mar 30, 2020
by
Lakshman Patel RJIT
413
views
nielit2017july-scientistb-it
programming
0
votes
1
answer
27
NIELIT 2017 July Scientist B (IT) - Section B: 27
The Function Points(FP) calculated for software projects are often used to obtain an estimate of Lines of Code(LOC) required for that project. Which of the following statements is FALSE in this context? The relationship between FP and LOC depends ... 1.6 times the functionality of a single LOC of FORTRAN. FP and LOC are not related to each other.
Lakshman Patel RJIT
asked
in
IS&Software Engineering
Mar 30, 2020
by
Lakshman Patel RJIT
500
views
nielit2017july-scientistb-it
non-gate
is&software-engineering
function-point-metric
0
votes
1
answer
28
NIELIT 2017 July Scientist B (IT) - Section B: 28
The availability of complex software is $90\%$ its Mean Time Between Failure(MTBF) is $200$ days. Because of the critical nature of the usage, the organization deploying the software further enhanced it to obtain an availability of $95\%$. In ... of the enhanced software?(choose the nearest option) $205$ days. $300$ days. $500$ days. $700$ days.
Lakshman Patel RJIT
asked
in
IS&Software Engineering
Mar 30, 2020
by
Lakshman Patel RJIT
492
views
nielit2017july-scientistb-it
non-gate
is&software-engineering
software-testing
0
votes
2
answers
29
NIELIT 2017 July Scientist B (IT) - Section B: 29
HTML(Hypertext Markup language) has language elements which permit certain actions other than describing the structure of the web document. Which of the following actions is NOT supported by pure HTML(without any server or client side ... interval. Automatically redirect to another page upon download. Display the client time as part of the page.
Lakshman Patel RJIT
asked
in
Web Technologies
Mar 30, 2020
by
Lakshman Patel RJIT
674
views
nielit2017july-scientistb-it
non-gate
web-technologies
0
votes
1
answer
30
NIELIT 2017 July Scientist B (IT) - Section B: 30
Consider the HTML table definition given below: <table border=1> <tr> <td rowspan=2>ab</td> <td colspan=2>cd</td> </tr> <tr> <td>ef</td> <td rowspan=2>gh</td> </tr> <tr><td colspan=2>ik</ ... $(2,2,3)$ $(2,3,2)$ and $(2,3,2)$ $(2,3,2)$ and $(2,2,3)$
Lakshman Patel RJIT
asked
in
Web Technologies
Mar 30, 2020
by
Lakshman Patel RJIT
448
views
nielit2017july-scientistb-it
non-gate
web-technologies
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged nielit2017july-scientistb-it
Recent Blog Comments
please add GO Classes 2023 Computer Networks...
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...