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 nielit2017oct-assistanta-it
0
votes
0
answers
1
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 1
Twelve $1\;\Omega$ resistances are used as edges to from a cube. The resistance between two diagonally opposite corners of the cube is $\frac{5}{6}\;\Omega$ $\frac{1}{6}\;\Omega$ $\frac{6}{5}\;\Omega$ $\frac{3}{2}\;\Omega$
Lakshman Patel RJIT
asked
in
Digital Signal Processing
Aug 28, 2020
by
Lakshman Patel RJIT
215
views
nielit2017oct-assistanta-it
non-gate
0
votes
0
answers
2
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 6
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$ $e^{-2t}u(t)$ $e^{2t}u(t)$ $e^{-t}u(t)$ $e^{t}u(t)$
Lakshman Patel RJIT
asked
in
Calculus
Aug 28, 2020
by
Lakshman Patel RJIT
261
views
nielit2017oct-assistanta-it
differential-equation
non-gate
0
votes
4
answers
3
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 10
A $4$ bit ripple counter and a $4$ bit synchronous counter are made using flip-flops having a propagation delay of $10$ ns each. If the worst case delay in the ripple counter and the synchronous counter be $R$ and $S$ respectively, then $R = 10$ ns, $S = 40$ ns $R = 40$ ns, $S = 10$ ns $R = 10$ ns, $S = 30$ ns $R = 30$ ns, $S = 10$ ns
Lakshman Patel RJIT
asked
in
Digital Logic
Aug 28, 2020
by
Lakshman Patel RJIT
645
views
nielit2017oct-assistanta-it
digital-logic
sequential-circuit
flip-flop
digital-counter
0
votes
0
answers
4
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 11
In MOSFET fabrication, the channel; length is defined during the process of Isolation oxide growth Channel stop implantation Poly-silicon gate patterning Lithography step leading to the contact pad
Lakshman Patel RJIT
asked
in
Digital Signal Processing
Aug 28, 2020
by
Lakshman Patel RJIT
168
views
nielit2017oct-assistanta-it
non-gate
0
votes
1
answer
5
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 1
The question is based on the following program fragment. f(intY[10],int x){ int u,j,k; i=0;j=9; do{ k=(i+j)/2; if(Y[k] < x) i=k; else j=k; } while((Y[k]!=x) && (i<j)); if (Y[k]==x) printf( x is in the array. ); else printf ... $x>2$ $Y$ is $[2\;4\;6\;8\;10\;12\;14\;16\;18\;20]$ and $2<x<20$ and $'x'$ is even
Lakshman Patel RJIT
asked
in
Programming
Apr 1, 2020
by
Lakshman Patel RJIT
746
views
nielit2017oct-assistanta-it
programming-in-c
output
0
votes
1
answer
6
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
Lakshman Patel RJIT
asked
in
Algorithms
Apr 1, 2020
by
Lakshman Patel RJIT
648
views
nielit2017oct-assistanta-it
algorithms
time-complexity
0
votes
1
answer
7
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 3
By open domain CASE tools we mean tools available in open domain software packages which can be downloaded from the internet software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet source codes of CASE tools
Lakshman Patel RJIT
asked
in
IS&Software Engineering
Apr 1, 2020
by
Lakshman Patel RJIT
820
views
nielit2017oct-assistanta-it
is&software-engineering
1
vote
2
answers
8
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 4
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
Lakshman Patel RJIT
asked
in
Computer Networks
Apr 1, 2020
by
Lakshman Patel RJIT
543
views
nielit2017oct-assistanta-it
computer-networks
bit-stuffing
1
vote
2
answers
9
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 5
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
Lakshman Patel RJIT
asked
in
Databases
Apr 1, 2020
by
Lakshman Patel RJIT
756
views
nielit2017oct-assistanta-it
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
1
vote
0
answers
10
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 6
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$ $R$ has no duplicates and $S$ is non-empty $R$ and $S$ have no duplicates $S$ has no duplicates and $R$ is non-empty $R$ and $S$ has the same number of tuples
Lakshman Patel RJIT
asked
in
Databases
Apr 1, 2020
by
Lakshman Patel RJIT
490
views
nielit2017oct-assistanta-it
databases
sql
1
vote
1
answer
11
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 7
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately $50$ $74$ $40$ $60$
Lakshman Patel RJIT
asked
in
Digital Logic
Apr 1, 2020
by
Lakshman Patel RJIT
470
views
nielit2017oct-assistanta-it
digital-logic
number-system
3
votes
1
answer
12
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 8
Match list $I$ with List $II$ ... iii, D-iv A-iii, B-ii, C-iv, D-i A-ii, B-iii, C-i, D-iv A-i, B-iv, C-ii, D-iii
Lakshman Patel RJIT
asked
in
CO and Architecture
Apr 1, 2020
by
Lakshman Patel RJIT
1.2k
views
nielit2017oct-assistanta-it
co-and-architecture
instruction-format
machine-instructions
1
vote
1
answer
13
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 9
Which of the following definitions generates the same languages as $L,$ where $L = \{x^{n}y^{n},n \geq 1\}$ $E \rightarrow xEy \mid xy$ $xy \mid x^{+}xyy^{+}$ $x^{+}y^{+}$ $(i)$ Only $(i)$ and $(ii)$ only $(ii)$ and $(iii)$ only $(ii)$ only
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 1, 2020
by
Lakshman Patel RJIT
440
views
nielit2017oct-assistanta-it
theory-of-computation
context-free-language
2
votes
2
answers
14
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 10
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
Lakshman Patel RJIT
asked
in
Operating System
Apr 1, 2020
by
Lakshman Patel RJIT
1.3k
views
nielit2017oct-assistanta-it
operating-system
demand-paging
page-fault
0
votes
1
answer
15
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 11
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel? $16.15$ kbps $23.24$ kbps $40.12$ kbps $24.74$ kbps
Lakshman Patel RJIT
asked
in
Others
Apr 1, 2020
by
Lakshman Patel RJIT
567
views
nielit2017oct-assistanta-it
0
votes
0
answers
16
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 12
At $100\%$ modulation, the power in each sideband is _______ of that of carrier. $50\%$ $40\%$ $60\%$ $25\%$
Lakshman Patel RJIT
asked
in
Others
Apr 1, 2020
by
Lakshman Patel RJIT
171
views
nielit2017oct-assistanta-it
0
votes
2
answers
17
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 1
What will be the output of following? main() { Static int a = 3; Printf(“%d”,a--); If(a) main(); } $3$ $3\;2\;1$ $3\;3\;3$ Program will fall in continuous loop and print $3$
Lakshman Patel RJIT
asked
in
Programming
Apr 1, 2020
by
Lakshman Patel RJIT
590
views
nielit2017oct-assistanta-it
programming-in-c
output
1
vote
1
answer
18
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
819
views
nielit2017oct-assistanta-it
data-structures
binary-tree
0
votes
1
answer
19
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 3
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is called Hypertext Hypermedia Both $(A)$ and $(B)$ Anchoring
Lakshman Patel RJIT
asked
in
Web Technologies
Apr 1, 2020
by
Lakshman Patel RJIT
928
views
nielit2017oct-assistanta-it
web-technologies
html
0
votes
1
answer
20
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 4
If the objects focus on the problem domain, then we are concerned with Object Oriented Analysis Object Oriented Design Object Oriented Analysis and Design None of the above
Lakshman Patel RJIT
asked
in
Object Oriented Programming
Apr 1, 2020
by
Lakshman Patel RJIT
587
views
nielit2017oct-assistanta-it
non-gate
object-oriented-programming
2
votes
1
answer
21
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 5
Which of the following is not a form of main memory? Instruction cache Instruction register Instruction opcode Translation look-aside buffer
Lakshman Patel RJIT
asked
in
CO and Architecture
Apr 1, 2020
by
Lakshman Patel RJIT
499
views
nielit2017oct-assistanta-it
co-and-architecture
memory-management
0
votes
2
answers
22
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
514
views
nielit2017oct-assistanta-it
data-structures
queue
0
votes
1
answer
23
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 7
$M$ is a square matrix of order $’n’$ and its determinant value is $5.$ If all the elements of $M$ are multiplied by $2,$ its determinant value becomes $40.$ The value of $’n’$ is $2$ $3$ $5$ $4$
Lakshman Patel RJIT
asked
in
Linear Algebra
Apr 1, 2020
by
Lakshman Patel RJIT
409
views
nielit2017oct-assistanta-it
linear-algebra
matrix
determinant
0
votes
1
answer
24
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 8
Is null an object? Yes No Sometimes yes None of these
Lakshman Patel RJIT
asked
in
Java
Apr 1, 2020
by
Lakshman Patel RJIT
598
views
nielit2017oct-assistanta-it
non-gate
java
3
votes
2
answers
25
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
Lakshman Patel RJIT
asked
in
Operating System
Apr 1, 2020
by
Lakshman Patel RJIT
2.6k
views
nielit2017oct-assistanta-it
operating-system
process-scheduling
0
votes
1
answer
26
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 10
Which of the following is a desirable property of module? Independency Low cohesiveness High Coupling Multifunctional
Lakshman Patel RJIT
asked
in
CO and Architecture
Apr 1, 2020
by
Lakshman Patel RJIT
701
views
nielit2017oct-assistanta-it
co-and-architecture
data-dependency
0
votes
1
answer
27
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 11
Which of these events will be generated if we close an applet’s window? ActionEvent ComponentEvent AdjustmentEvent WindowEvent
Lakshman Patel RJIT
asked
in
Web Technologies
Apr 1, 2020
by
Lakshman Patel RJIT
1.5k
views
nielit2017oct-assistanta-it
non-gate
0
votes
2
answers
28
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
2.1k
views
nielit2017oct-assistanta-it
data-structures
queue
0
votes
0
answers
29
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 13
The following program fragment prints int i = 5; do { putchar(i+100); printf(“%d”, i--;) } while(i); i5h4g3f2el 14h3g2f1e0 An error message None of the above
Lakshman Patel RJIT
asked
in
Programming
Apr 1, 2020
by
Lakshman Patel RJIT
431
views
nielit2017oct-assistanta-it
programming-in-c
output
0
votes
0
answers
30
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 14
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $= p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$
Lakshman Patel RJIT
asked
in
Algorithms
Apr 1, 2020
by
Lakshman Patel RJIT
670
views
nielit2017oct-assistanta-it
algorithms
recurrence-relation
time-complexity
master-theorem
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(848)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged nielit2017oct-assistanta-it
Recent Blog Comments
Please upload updated previous year question...
The last hardcopy that was made was for GATE 2022...
overall only 3 post .no post for gen male
for gen GS in the range of 720-750 approx.
can we get 2023 hark copy from amazon?