QuestTips.

com
SEE MORE
HOME CYBER SECURITY Online MBAPROGRAMMING
CS CORE SUBJECTS  in Banking Programs
MCQ SETS ONLINE TESTS QUE AND ANS BOOKS

Data Structure and Algorithms – MCQs Based Online Test

TABLE OF CONTENTS This Section Contain Data Structure and Algorithms Online Test/Quiz of type MCQs-Multiple Choice
Questions [Link] objective Questions is helpful for various Competitive and University Level
Data Structure and Algorithms – MCQs [Link] of these Questions have been hand picked from the Questions papers of various
Based Online Test competitive exams.
 
Data Structure and Algorithms – Recursion
Time limit: [Link]
MCQs Based Online Test

Data Structure and Algorithms – Linked Question-1.

Lists-Single-Double-Circular Array- _____ is a step-by-step recipe for solving an instance of problem
Polynomials MCQs Based Online Test 1
Algorithm

Data Structure and Algorithms – Linked Complexity

Lists-Single-Double-Circular Array-
Polynomials MCQs Based Online Test 2 Pseudocode

Analysis
Data Structure and Algorithms – Linked
Lists-Single-Double-Circular Array-
Polynomials MCQs Based Online Test 3
Question-2.
______ is used to describe the algorithm, in less formal language
Data Structure and Algorithms –
Stack,Queue MCQs Based Online Test-1 Cannot be defined

Data Structure and Algorithms – Natural Language

Stack,Queue MCQs Based Online Test-2

Pseudocode

Data Structure and Algorithms – None

Stack,Queue MCQs Based Online Test-3

Data Structure and Algorithms – Question-3.

Searching-Sorting MCQs Based Online ______ of an algorithm is the amount of time (or the number of steps) needed by a program to
Test complete its task.

Data Structure and Algorithms – Binary Space Complexity

Trees MCQs Based Online Test-1 Dynamic Programming

Data Structure and Algorithms – Binary Divide and Conquer

Trees MCQs Based Online Test-2
Time Complexity

Data Structure and Algorithms – Binary

Trees MCQs Based Online Test-3
Question-4.

Data Structure and Algorithms – Bubble ______ of a program is the amount of memory used at once by the algorithm until it completes its
execution.
Sort,Quick Sort,Selection Sort MCQs
Based Online Test Divide and Conquer

Data Structure and Algorithms – Heap Time Complexity

Sort,Internal Sort,External Sort MCQs
Space Complexity
Based Online Test
Dynamic Programming
Data Structure and Algorithms – Graph
MCQs Based Online Test-1
Question-5.
Data Structure and Algorithms – Graph ______ is used to define the worst-case running time of an algorithm.
MCQs Based Online Test-2
Big-Oh notation
Data Structure and Algorithms – Graphs-
Cannot be defined
Minimum Spanning Tree-Matrix MCQs
Based Online Test Complexity

Team behind this platform FindAnalysis

Demand Planning
Open
Software
 We Are Engineering Question-6.
Graduate ,Tutor and A problem L is NP-Complete if and only if
Technology lover, Our
HOME CYBER SECURITY CS CORE SUBJECTS  LPROGRAMMING
is NP-Hard  MCQ SETS ONLINE TESTS QUE AND ANS BOOKS
Primary Main Area of
interest is Computer
L is NP and NP-Hard
Science And Electronics
& Communication Technology L is NP

L is non-polynomial
We are trying to make all those topics more
simple and easy to understand,So that it will
help students to learn it very quickly in
Question-7.
limited amount of time like Last Peak hours
Dijkstra algorithm is for finding
of their Extermination,its like last time
revision Notes. we also have provided the Shortest paths from single source to several sinks
depth knowledge of some topics which really
require more words to explain. Minimum spanning tree for graph

Sorted list of nodes in a undirected graph with negative edge

weights

All the above

Question-8.
Find the solution for the following recurrence relation an = 5n2an–1 with a0 = 5

Search MBA in Finance

Programs
[Link]

Other Area of this online platform contains A

"Online MCQ based Tests / Multiple choice
Questions" ,Which can Helps readers to B
crack Various competitive Exams
C

Computer subject become necessary for all D

the students from various branches, and this
platform will provide them all the required
knowledge to answer the Questions correctly Question-9.
in the various competitive exams Match the following pairs:

I-P, II-M, III-N, IV-O

Search MBA in Finance Programs
I-O, II-P, III-M, IV-N
[Link] See more
I-O, II-N, III-M, IV-P

I-O, II-N, III-P, IV-M

Question-10.
Match the pairs:

a2, b4, c3,d1

a-1, b-2, c-3, d-4

a-2, b-4, c-3, d-1

Find Demand Planning

a-2, b-3, c-4, d-1 Open

Software
a-2, b-3, c-4, d-1
 Question-11.
HOME CYBER SECURITY CS CORE SUBJECTSWhat
 shall be value of x in
PROGRAMMING  the MCQ
following
SETSpseudocode?

ONLINE TESTS QUE AND ANS BOOKS

x = 0;

For (t = 1; t < N; t++)

For( p = 1; p < = t; p++)
x = x+1;
Endfor
Endfor value of x in pseudocode
x = N+1

x = N(N-1) / 2

x = N(N+1) / 2

x = N^2

Question-12.
Time complexity of merging three sorted lists of sizes m, n and p is

Θ (m + n + p)

Θ (min (m, n, p) )

Θ (max (m, n, p) )

Θ (m.n.p)

Question-13.
Which of the following algorithm employs dynamic programming

approach?

Mergesort

Quicksort

Bellman Ford

Naïve (brute force) string matching algorithm

Question-14.
f (n) = O(g(n)) if and only if

g (n) = O(f (n))

g (n) = Θ(f (n))

g (n) = Ω(f (n))

all of the above

Question-15.
(i) f (n) = Ω(n^2 log2 n)

(ii) f (n) = Ω(n^2)

(iii) f (n) = Ω(n^3)

(iv) f (n) = Ω(log2 n)

Given f (n) = Ω(n^2), which of the above shall hold good?

(i), (ii), (iii) and (iv)

(ii) and (iv)

(ii), (iii) and (iv)

(i), (ii) and (iv) notation

asymptotically
bounds a
Question-16. function from
Which of the following is correct? above as well
Θ-notation asymptotically bounds a function from above only. as below
Θ-notation asymptotically bounds a function from below only.

Find Demand Planning

f (n) = O(g(n)) implies f (n) = Θ(g(n)).

Open
Software Θ-notation asymptotically bounds a function from above as well as below.
 Question-17.
Which one of the following is analogous to f (n) = o(g(n))?

HOME CYBER SECURITY CS CORE SUBJECTS  pPROGRAMMING

<q  MCQ SETS ONLINE TESTS QUE AND ANS BOOKS

p>q

p≤q
analogous to f (n) = o(g(n))?

p≥q
p<q

Question-18.
For f (n) = 5n^2 + 3n + 2,

f (n) = O(n)

f (n) = O(n^2)

f (n) = O(n log2n)

f (n) = O(1)

Question-19.
Which of the algorithm design approach is used by Mergesort

Branch and bound approach

Dynamic approach

Divide and Conquer approach

Greedy approach

Question-20.
Which of the following shortest path algorithm cannot detect presence

of negative weight cycle graph?

Bellman Ford Algorithm

Floyd-Warshall Algorithm

Dijsktra’s Algorithm

None of the above

Finish Test

You may be interested in:

 Data Structures and Algorithms – MCQs.

 Data Structure and Algorithms Tutorials

Next 
Data Structure and Algorithms – Recursion MCQs
Based Online Test

If you have any Questions regarding this free Computer Science tutorials ,Short Questions and Answers,Multiple choice Questions And
Find Demand Planning

Answers-MCQ sets,Online Test/Quiz,Short Study Notes don’t hesitate to contact us via Facebook,or
Open through our [Link] us @
Software
examradar@[Link] We love to get feedback and we will do our best to make you happy.
 Copyright © 2023 | ExamRadar. | Contact Us | Copyright || Terms of Use || Privacy Policy

HOME CYBER SECURITY CS CORE SUBJECTS  PROGRAMMING  MCQ SETS ONLINE TESTS QUE AND ANS BOOKS

Find Demand Planning

Open
Software