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
Filter
User soujanyareddy13
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by soujanyareddy13
1
vote
1
answer
1
NIELIT 2022 April Scientist B | Section B | Question: 43
Consider the following types of languages: $\text{L1}:$ Regular, $\text{L2}:$ Context-free, $\text{L3}:$ Recursive, $\text{L4}:$ Recursively enumerable. Which of the following is/are $\text{TRUE}$ ? $\text{L3}' \cup \text{L4}$ is recursively ... and $\text{III}$ only $\text{I}$ and $\text{IV}$ only $\text{I, II}$ and $\text{III}$ only
asked
in
Theory of Computation
Apr 12, 2022
2.8k
views
nielit2022apr-scientistb
theory-of-computation
recursive-and-recursively-enumerable-languages
2
votes
1
answer
2
NIELIT 2022 April Scientist B | Section B | Question: 44
What is the time complexity of the following function? void myfun() { int a,b; for(a=1; a<=n; a++) for(b=1; b<=log(a); b++) printf(“My Function”); } $\theta (n)$ $\theta (n^2)$ $\theta (n\log n)$ $\theta (n^2(\log n))$
asked
in
Algorithms
Apr 12, 2022
2.1k
views
nielit2022apr-scientistb
algorithms
time-complexity
1
vote
0
answers
3
NIELIT 2022 April Scientist B | Section B | Question: 45
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63).$ Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and ... of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
asked
in
Others
Apr 12, 2022
1.5k
views
nielit2022apr-scientistb
operating-system
disk
normal
1
vote
0
answers
4
NIELIT 2022 April Scientist B | Section B | Question: 46
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000 \; \text{bytes}$ and the transmission rate at the sender is $80 \; \text{Kbps (1 Kbps = 1000 bits/second)}.$ ... $\text{bytes/second}.$ $2500$ $2000$ $1500$ $500$
asked
in
Others
Apr 12, 2022
1.2k
views
nielit2022apr-scientistb
computer-networks
stop-and-wait
normal
1
vote
1
answer
5
NIELIT 2022 April Scientist B | Section B | Question: 47
In a baseband communication link, frequencies upto $3500 \; \text{Hz}$ are used for signaling. Using a raised cosine pulse with $75 \%$ excess bandwidth and for no inter symbol interference, the maximum possible signaling rate is symbols $\text{per sec}$ is: $1750$ $2625$ $4000$ $5250$
asked
in
Digital Signal Processing
Apr 12, 2022
1.1k
views
nielit2022apr-scientistb
non-gate
1
vote
1
answer
6
NIELIT 2022 April Scientist B | Section B | Question: 48
The particular solution of the recurrence relation $a_{r+2} – 4a_{r+1} + 4a_{r} = 2^{r}$ is: $r.2^{r}$ $r(r-1)2^{r-1}$ $r(r-1)2^{r-2}$ $r(r-1)2^{r-3}$
asked
in
Combinatory
Apr 12, 2022
1.1k
views
nielit2022apr-scientistb
combinatory
recurrence-relation
2
votes
1
answer
7
NIELIT 2022 April Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightarrow \text{D}$ ... dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
asked
in
Others
Apr 12, 2022
935
views
nielit2022apr-scientistb
databases
database-normalization
lossless-join
1
vote
0
answers
8
NIELIT 2022 April Scientist B | Section B | Question: 50
Match the following: ... $\text{(I)}$ $\text{(II)}$ $\text{(III)}$ $\text{(IV)}$
asked
in
Others
Apr 12, 2022
875
views
nielit2022apr-scientistb
is&software-engineering
software-testing
normal
non-gate
1
vote
0
answers
9
NIELIT 2022 April Scientist B | Section B | Question: 51
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $\text{S}$ and $\text{T}$. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to ... to $\text{v}$ is discovered. $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$
asked
in
Others
Apr 12, 2022
757
views
nielit2022apr-scientistb
1
vote
0
answers
10
NIELIT 2022 April Scientist B | Section B | Question: 52
Consider the expression $(a-1) * (((b+c) / 3)) + d))$. Let $\text{X}$ be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which only load ... can have only register or immediate operands. The value of $\text{X}$ is _____________ . $2$ $1$ $4$ $3$
asked
in
Others
Apr 12, 2022
534
views
nielit2022apr-scientistb
1
vote
0
answers
11
NIELIT 2022 April Scientist B | Section B | Question: 53
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? ... $\text{(P) - (2), (Q) - (3), (R) - (4), (S) - (1)}$
asked
in
Others
Apr 12, 2022
578
views
nielit2022apr-scientistb
1
vote
1
answer
12
NIELIT 2022 April Scientist B | Section B | Question: 54
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies: name, courseNo, $\rightarrow$ grade rollNo, courseNo $\rightarrow$ grade name $\rightarrow$ rollNo rollNo $\rightarrow$ name The ... form of this relation scheme is $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$ $\text{4NF}$
asked
in
Others
Apr 12, 2022
803
views
nielit2022apr-scientistb
1
vote
1
answer
13
NIELIT 2022 April Scientist B | Section B | Question: 55
Flat top sampling of low pass signals __________ gives rise to aperture effect implies oversampling lead to aliasing introducing delay distortion
asked
in
Others
Apr 12, 2022
680
views
nielit2022apr-scientistb
1
vote
0
answers
14
NIELIT 2022 April Scientist B | Section B | Question: 56
Consider these two functions and two statements $\text{S1}$ and $\text{S2}$ about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; } int work2(int *a, int i, int j) { int t1 = i+2; ... false and $\text{S2}$ is true $\text{S1}$ is true and $\text{S2}$ is false $\text{S1}$ is true and $\text{S2}$ is true
asked
in
Others
Apr 12, 2022
608
views
nielit2022apr-scientistb
1
vote
1
answer
15
NIELIT 2022 April Scientist B | Section B | Question: 57
Consider the following two phase locking protocol. Suppose a transaction $\text{T}$ ... guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
asked
in
Others
Apr 12, 2022
657
views
nielit2022apr-scientistb
1
vote
0
answers
16
NIELIT 2022 April Scientist B | Section B | Question: 58
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read ... is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
asked
in
Others
Apr 12, 2022
478
views
nielit2022apr-scientistb
1
vote
1
answer
17
NIELIT 2022 April Scientist B | Section B | Question: 59
Let $\text{T}$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $\text{T}$ are: The height of a tree with a single node is $0$. $4$ and $15$ respectively $3$ and $14$ respectively $4$ and $14$ respectively $3$ and $15$ respectively
asked
in
Others
Apr 12, 2022
573
views
nielit2022apr-scientistb
1
vote
0
answers
18
NIELIT 2022 April Scientist B | Section B | Question: 60
For a bit-rate of $8 \; \text{kbps},$ the best possible values of the transmitted frequencies in a coherent binary $\text{FSK}$ system are : $16 \; \text{kHz}$ and $20 \; \text{kHz}$ $20 \; \text{kHz}$ and $32 \; \text{kHz}$ $20 \; \text{kHz}$ and $40 \; \text{kHz}$ $32 \; \text{kHz}$ and $40 \; \text{kHz}$
asked
in
Others
Apr 12, 2022
496
views
nielit2022apr-scientistb
1
vote
0
answers
19
NIELIT 2022 April Scientist B | Section B | Question: 61
Consider three processes, all arriving at time zero, with total execution time of $10, 20$ and $30\; \text{units,}$ respectively. Each process spends the first $20 \%$ of execution time doing $\text{I/O},$ the next $70 \%$ of time doing computation, and ... of time does the $\text{CPU}$ remain idle? $0 \%$ $10.6 \%$ $30.0 \%$ $89.4 \%$
asked
in
Others
Apr 12, 2022
471
views
nielit2022apr-scientistb
1
vote
1
answer
20
NIELIT 2022 April Scientist B | Section B | Question: 62
The function $f(x) = x(x+3)e^{-{\frac{x}{2}}}$ satisfies all the conditions of Rolle’s theorem in $[-3,0].$ The value of $c$ is: $-3$ $-2$ $3$ $0$
asked
in
Others
Apr 12, 2022
633
views
nielit2022apr-scientistb
Page:
1
2
3
4
5
6
...
50
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...