GATE CSE · 2024 · CS1
Question 17: Algorithms
Give it a try, then reveal the answer to check your work.
Question 17
CS1MCQ1 markNeeds review
Given an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2024CS1
GATE CSE 2024 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Section CS1
- Question type
- Multiple choice (MCQ)
- Marks
- 1 mark
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
algorithms
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.