McqMate Search MCQ | Topic | Course Login Register

Computer Science Engineering (CSE) Data Structure and Algorithms (DSA) Set 1
MCQs for Related
Save
Topics
Data Structure and Algorithms (DSA) Information and Network

Solved MCQs Security

Information systems and

Download PDF Take a Test
engineering economics

Search for Multi-core processors

1. SCHOOL RANKINGS BY STATE ❯ 3. POST-GRADUATE INTERNSHIPS ❯

2. TOP 10 PART TIME JOBS ❯ 4. DELIVERY DRIVER JOB LISTINGS ❯ Computer Fundamentals
Yahoo! Search
Principles of Management
Hide answers Set 1 of 14 Sets
Usability Engineering

1. It exports a set of operations Data Analysis

A. true, false Green Computing (GC)

B. false, true DataBase Management System

C. true, true
(DBMS)

D. false, false Theory of Computation and

Compiler Design
Answer» C. true, true
discuss Artificial Intelligence and
Robotics (AIR)
2. A graph is said to be complete if there is no edge between every pair of
vertices. Information Cyber Security
(ICS)
A. true, false, true
Design and Analysis of
B. true, true, false
Algorithms
C. true, true, true
Data Compression and Data
D. false, true, true Retrieval

Answer» B. true, true, false

Computer Architecture and
discuss
Organization

3. Space Complexity iii) Is the strategy guaranteed to find the solution when there
Recommended
in one. courses
A. a-iii, b-ii, c-i Computer Science Engineering
(CSE)
B. a-i, b-ii, c-iii

C. a-iii, b-i, c-ii Information Technology

Engineering (IT)
D. a-i, b-iii, c-ii
Electronics and
Answer» C. a-iii, b-i, c-ii
Communication Engineering
discuss

Common Topics in
Competitive and Entrance
exams

4. The time complexity of binary search is O(logn).

A. true, false

B. false, true

C. false, false
D. true, true

Answer» D. true, true

discuss

5. A graph is said to be complete if there is an edge between every pair of

vertices.

A. true, true

B. false, true

C. false, false

D. true, false

Answer» A. true, true

discuss

6. To find the predecessor, it is required to traverse the list from the first node in
case of singly linked list.

A. i-only

B. ii-only

C. both i and ii

D. none of both

Answer» C. both i and ii

discuss

Share

Facebook Whatsapp

Twitter Telegram

Your recent visits

Topic: Data Structure and
7. Nodes that are not root and not leaf are called as internal nodes. Algorithms (DSA)

A. true, true

B. true, false

C. false, true

D. false, false

Answer» C. false, true

discuss

8. A node is child node if out degree is one.

A. true, true

B. true, false

C. false, true

D. false, false

Answer» B. true, false

discuss

9. Insertion b) Deletion c) Retrieval d) Traversal

A. only a,b and c

B. only a and b

C. all of the above

D. none of the above

Answer» D. none of the above
discuss

10. In strictly binary tree, the out-degree of every node is either o or 2.

A. true, false

B. false, true

C. true, true

D. false, false

Answer» C. true, true

discuss

11. The complexity of the average case of an algorithm is

A. much more complicated to analyze than that of worst case

B. much more simpler to analyze than that of worst case

C. sometimes more complicated and some other times simpler than that of worst case

D. none or above

Answer» A. much more complicated to analyze than that of worst case

discuss

12. The Average case occur in linear search algorithm

A. when item is somewhere in the middle of the array

B. when item is not in the array at all

C. when item is the last element in the array

D. when item is the last element in the array or is not there at all

Answer» A. when item is somewhere in the middle of the array

discuss

13. Which of the following case does not exist in complexity theory

A. best case

B. worst case

C. average case

D. null case

Answer» D. null case

discuss

14. The space factor when determining the efficiency of algorithm is measured by

A. counting the maximum memory needed by the algorithm

B. counting the minimum memory needed by the algorithm

C. counting the average memory needed by the algorithm

D. counting the maximum disk space needed by the algorithm

Answer» A. counting the maximum memory needed by the algorithm

discuss

15. The time factor when determining the efficiency of algorithm is measured by

A. counting microseconds

B. counting the number of key operations

C. counting the number of statements

D. counting the kilobytes of algorithm

Answer» B. counting the number of key operations

discuss

16. Two main measures for the efficiency of an algorithm are

A. processor and memory

B. complexity and capacity

C. time and space

D. data and space

Answer» C. time and space

discuss

17. Computers are used for processing numerical data called _______ data.

A. float

B. local

C. character

D. non-local

Answer» C. character
discuss

18. Each programming language contains a ______ set that is used to communicate
with the computer.

A. character

B. integer

C. float

D. numeric

Answer» A. character
discuss
19. Finite sequence S of zero or more characters is called _______.

A. array

B. list

C. string

D. block

Answer» C. string
discuss

20. String with zero characters is called ________ string.

A. null

B. binary

C. totalled

D. list

Answer» A. null
discuss

21. A computer which can access an individual byte is called a ________ machine.

A. memory addressable

B. byte addressable

C. bit

D. byte

Answer» B. byte addressable

discuss

22. Groups of consecutive elements in a string, such as words, phrases and

sentences are called ________.

A. main strings

B. substring

C. index

D. block

Answer» B. substring
discuss

23. The number of characters in a string is called its ______.

A. length

B. breath

C. width

D. none

Answer» C. width
discuss

24. _________ operation of word processing involves replacing one string in the text
by another.

A. insertion

B. deletion

C. searching

D. replacement
 Answer» D. replacement
discuss

25. ________ is the problem of deciding whether or not a given String pattern P
appears in a text T.

A. pattern matching

B. searching

C. sorting

D. deletion

Answer» A. pattern matching

discuss

jump to 1-14 1 2 3 4 5 6 7

report this ad

Tags
Question and answers in Data Structure and Algorithms (DSA),
Data Structure and Algorithms (DSA) multiple choice questions and answers,

Data Structure and Algorithms (DSA) Important MCQs, Solved MCQs for Data Structure and Algorithms (DSA),

Data Structure and Algorithms (DSA) MCQs with answers PDF download

We need your help!

We're developing a website for study materials for students.
We would love to hear your answers to some of the questions.

Take Survey

McqMate Popular Courses MCQMATE IS ALSO AVAILABLE

UPSC - Union Public Service Commission ON

McqMate.com is an educational platform, Which is developed BY STUDENTS, FOR General Knowledge

STUDENTS, The only objective of our platform is to assist fellow students in MBA
preparing for exams and in their Studies throughout their Academic career.
Popular Topics
» We provide you study material i.e. PDFs for offline use.
Human Resource Management
» We take free online Practice/Mock test for exam preparation. Contacts
» Each MCQ is open for further discussion on discussion page. Operations Management
Email: [email protected]
» All the services offered by McqMate are free. Marketing Management

© Copyright 2023 McqMate. All rights reserved. Privacy & Cookies Policy Disclaimer