All Courses
Get the App Signup / Login
Sign in Open App
Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Question Bank for GATE Computer Science Engineering  >  Test: Algorithm Analysis & Asymptotic Notation- 3 - Computer Science Engineering (CSE) MCQ

Test: Algorithm Analysis & Asymptotic Notation- 3 - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test Question Bank for GATE Computer Science Engineering - Test: Algorithm Analysis & Asymptotic Notation- 3

Test: Algorithm Analysis & Asymptotic Notation- 3 for Computer Science Engineering (CSE) 2024 is part of Question Bank for GATE Computer Science Engineering preparation. The Test: Algorithm Analysis & Asymptotic Notation- 3 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Algorithm Analysis & Asymptotic Notation- 3 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Algorithm Analysis & Asymptotic Notation- 3 below.
Solutions of Test: Algorithm Analysis & Asymptotic Notation- 3 questions in English are available as part of our Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) & Test: Algorithm Analysis & Asymptotic Notation- 3 solutions in Hindi for Question Bank for GATE Computer Science Engineering course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Algorithm Analysis & Asymptotic Notation- 3 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 1
Save

Each of the function 2√n and nlogn has a growth rate .... than that of any polynomial.

Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 1

2√n and nlogn grows exponentially which have growth rate greater than any polynomial.

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 2
Save

Time complexity of an algorithm T(n), where n is the input size is given by
T(n) = T( n - 1 ) + 1/n, if n> 1 
= 1, otherwise 
The order of this algorithm is 

Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 2


⇒ O(log n)

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 3
Save

The concept of order (Big O) is important because

Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 3

Big O notation gives worst case limit for a given problem: Also find out the least upper bound of problem.

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 4
Save

Consider the following functions:

Which of the following is true?
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 4


Here f(n) is O(g(n))
f(n) is O(h(n))
If f(n) is O(g(n))
f(n) is O(g(n)) and g(n) is O (f(n))

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 5
Save

f(n) = 3n2 + 4n + 2
Which will be the exact value for f(n)?
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 5

f(n) = 3 n2 + 4n + 2 
So, f(n) = n2 + n2 + n2 = O (n2)

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 6
Save

Which of the following is the average number of key comparisons done by sequential reach in the successful case?
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 6

in linear or sequential search the maximum number of comparisons are (n) for V elements hence the number of comparisons when the element to be found is at the middle of the array

= n/2 [If n is even]
In general average case = 

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 7
Save

Which sort will operate in quadratic time relative to the number of elements in the array (on the average)?
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 7

Bubbles sort have time complexity of O(n2) and all other have times complexity 0(nlogn).

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 8
Save

 If one uses straight two-way merge sort algorithm to sort the following elements in ascending order:
20,47,15,8,9,4,40,30,12,17 
Then the order of these elements after the 2nd pass of the algorithm is
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 8

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 9
Save

 The recurrence relation: 
T(1) = 2
 , has the solution T(n) equal to
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 9

Let, 4k = n

≌ O(n)

Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 10
Save

Consider the following two functions:

Which of the following is true?
Detailed Solution for Test: Algorithm Analysis & Asymptotic Notation- 3 - Question 10


Therefore;
n2 ≤ n3 for N ≥ 10000 
g1(n) = O(g2(n))

63 videos|8 docs|165 tests
Join Course
Information about Test: Algorithm Analysis & Asymptotic Notation- 3 Page
In this test you can find the Exam questions for Test: Algorithm Analysis & Asymptotic Notation- 3 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Algorithm Analysis & Asymptotic Notation- 3, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)

Important Questions for Algorithm Analysis & Asymptotic Notation- 3

Find all the important questions for Algorithm Analysis & Asymptotic Notation- 3 at EduRev.Get fully prepared for Algorithm Analysis & Asymptotic Notation- 3 with EduRev's comprehensive question bank and test resources. Our platform offers a diverse range of question papers covering various topics within the Algorithm Analysis & Asymptotic Notation- 3 syllabus. Whether you need to review specific subjects or assess your overall readiness, EduRev has you covered. The questions are designed to challenge you and help you gain confidence in tackling the actual exam. Maximize your chances of success by utilizing EduRev's extensive collection of Algorithm Analysis & Asymptotic Notation- 3 resources.

Algorithm Analysis & Asymptotic Notation- 3 MCQs with Answers

Prepare for the Algorithm Analysis & Asymptotic Notation- 3 within the Computer Science Engineering (CSE) exam with comprehensive MCQs and answers at EduRev. Our platform offers a wide range of practice papers, question papers, and mock tests to familiarize you with the exam pattern and syllabus. Access the best books, study materials, and notes curated by toppers to enhance your preparation. Stay updated with the exam date and receive expert preparation tips and paper analysis. Visit EduRev's official website today and access a wealth of videos and coaching resources to excel in your exam.

Online Tests for Algorithm Analysis & Asymptotic Notation- 3 Question Bank for GATE Computer Science Engineering

Practice with a wide array of question papers that follow the exam pattern and syllabus. Our platform offers a user-friendly interface, allowing you to track your progress and identify areas for improvement. Access detailed solutions and explanations for each test to enhance your understanding of concepts. With EduRev's Online Tests, you can build confidence, boost your performance, and ace Algorithm Analysis & Asymptotic Notation- 3 with ease. Join thousands of successful students who have benefited from our trusted online resources.
© EduRev
Education Revolution
Follow Us
Signup to see your scores go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup