The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
32 views

in Algorithms by Active (4.9k points) | 32 views
+1
For Linear Search, the worst case happens when the element to be searched is not present in the array. When it is not present, the element to be searched is compared with all the elements of array one by one. Therefore, the worst case time complexity of linear search would be Θ(n).
0
option 2 is correct according to me.
0
What is the difference between options 2 and 4?
+1
i guess option 4 means that the item is not present in the universal set containing all the items.

Example -1 does not belong to Natural Numbers.
0
Answer $2$, $3$ and $4$ both should be correct.

Also, the question looks to me poorly framed.

What's the source of this question??
0

@commenter commenter

Both are same only.

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
asked Oct 24, 2018 in CO and Architecture by Balaji Jegan Active (4.9k points) | 13 views
0 votes
0 answers
2
asked Oct 24, 2018 in CO and Architecture by Balaji Jegan Active (4.9k points) | 15 views
0 votes
0 answers
3
asked Oct 24, 2018 in CO and Architecture by Balaji Jegan Active (4.9k points) | 20 views
0 votes
0 answers
4
asked Oct 24, 2018 in CO and Architecture by Balaji Jegan Active (4.9k points) | 14 views
0 votes
1 answer
5
asked Oct 24, 2018 in Compiler Design by Balaji Jegan Active (4.9k points) | 35 views
0 votes
1 answer
6
asked Oct 24, 2018 in Compiler Design by Balaji Jegan Active (4.9k points) | 48 views
0 votes
1 answer
7
asked Oct 24, 2018 in Compiler Design by Balaji Jegan Active (4.9k points) | 29 views
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
50,339 questions
55,765 answers
192,354 comments
90,814 users