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
NIELIT STA 2021
rsansiya111
asked
in
Algorithms
Dec 6, 2021
recategorized
Jul 6, 2022
by
Lakshman Patel RJIT
145
views
0
votes
0
votes
Worst Case scenario in case of linear search algorithm is_______________.
Item is somewhere in the middle of the array
Item is not in the array at all
Item is the last element in the array
Item is the last element in the array or is not there at all
data-structures
algorithms
rsansiya111
asked
in
Algorithms
Dec 6, 2021
recategorized
Jul 6, 2022
by
Lakshman Patel RJIT
by
rsansiya111
145
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
2
votes
2
votes
Answer: D
In both the cases n comparison required(n is number of elements in array) which is the worst case. And time complexity O(n).
raja11sep
answered
Dec 6, 2021
by
raja11sep
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
0
answers
1
rsansiya111
asked
in
DS
Dec 6, 2021
231
views
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$ (n + m) $log_{2} m$ mn $log_{2} n$ mn $log_{2} m$
rsansiya111
asked
in
DS
Dec 6, 2021
by
rsansiya111
231
views
data-structures
0
votes
0
votes
1
answer
2
rsansiya111
asked
in
DS
Dec 6, 2021
300
views
NIELIT STA 2021
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1 $2n^{2}$ 2^n 2n – 1
rsansiya111
asked
in
DS
Dec 6, 2021
by
rsansiya111
300
views
data-structures
0
votes
0
votes
1
answer
3
rsansiya111
asked
in
Algorithms
Dec 6, 2021
114
views
NIELIT STA 2021
Which of the following is not a stable sorting algorithms ? Insertion sort Selection sort Bubble sort Merge sort
rsansiya111
asked
in
Algorithms
Dec 6, 2021
by
rsansiya111
114
views
algorithms
0
votes
0
votes
0
answers
4
rsansiya111
asked
in
Algorithms
Dec 6, 2021
149
views
NIELIT STA 2021
The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is: (m and n are lengths of subsequences) O(m.n) O(m+n) O(log m.n) O(m/n)
rsansiya111
asked
in
Algorithms
Dec 6, 2021
by
rsansiya111
149
views
algorithms
time-complexity
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
AIMT is live now:...
It is at 9:30. Test Link will be available at...
@Deepak Poonia @Sachin Mittal 1 sir...
@mahendrapatel
Initially go classes planned on saturdays but...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
