MCQ Sets

  • Mock Ups
    • Computer Operator
      • 73-01
      • 73-02
      • 73-03
      • 73-04
      • 73-05
      • 73-06
    • Assistant Computer Operator
  • Quiz
    • Computer Fundamentals
    • Operating Systems
    • MS Word
    • MS Excel
    • MS PowerPoint
    • MS Access
    • HTML
  • Sets
    • Computer Fundamentals
    • Operating System
    • Microsoft Word
    • MS Excel
    • MS PowerPoint
    • MS Access
    • HTML & Web Page Designing
    • C++
    • Data Structures & Algorithms
  • Read
    • Tips & Articles
    • Fundamentals
    • MS Word
    • DBMS
    • Operating Systems
    • HTML & Web Page Design
  • Videos
  • Ask
    • Ask MCQ Sets
    • Discussion Forum
  • Downloads
  • Old Question Papers

Data Structures & Algorithms MCQ with Answers

November 29, 2014 by Suresh Khanal 12 Comments


Data Structures & Algorithms MCQ with Answers: Any course on Data Structures and Algorithms expects a sound understanding for manipulating data. Data structures for storing information in tables, lists, trees, queues and stacks are basically expected. Some basic graph and discrete transform algorithms, some basic principles of software engineering, good programming practice for “long-life” software are generally covered.

Data Structures & Algorithms MCQ with Answers

You can find following multiple choice questions to test yourself for such expectation.

Data Structures And Algorithms MCQ Questions

1.    When determining the efficiency of algorithm, the space factor 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

2.    The complexity of Bubble sort algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

3.    Linked lists are best suited
a.    for relatively permanent collections of data
b.    for the size of the structure and the data in the structure are constantly changing
c.    for both of above situation
d.    for none of above situation

4.    If the values of a variable in one module is indirectly changed by another module, this situation is called
a.    internal change
b.    inter-module change
c.    side effect
d.    side-module update

5.    In linear search algorithm the Worst case occurs when
a.    The item is somewhere in the middle of the array
b.    The item is not in the array at all
c.    The item is the last element in the array
d.    The item is the last element in the array or is not there at all

6.    For an algorithm the complexity of the average case 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

7.    The complexity of merge sort algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

8.    The complexity of linear search algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

9.    When determining the efficiency of algorithm the time factor 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

10.    Which of the following data structure is linear data structure?
a.    Trees
b.    Graphs
c.    Arrays
d.    None of above

11.    The elements of an array are stored successively in memory cells because
a.    by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
b.    the architecture of computer memory does not allow arrays to store other than serially
c.    both of above
d.    none of above

12.    Which of the following data structure is not linear data structure?
a.    Arrays
b.    Linked lists
c.    Both of above
d.    None of above

13.    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

14.    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

15.    Finding the location of the element with a given value is:
a.    Traversal
b.    Search
c.    Sort
d.    None of above

16.    Which of the following case does not exist in complexity theory
a.    Best case
b.    Worst case
c.    Average case
d.    Null case

17.    The operation of processing each element in the list is known as
a.    Sorting
b.    Merging
c.    Inserting
d.    Traversal

18.    Arrays are best data structures
a.    for relatively permanent collections of data
b.    for the size of the structure and the data in the structure are constantly changing
c.    for both of above situation
d.    for none of above situation

19.    Each array declaration need not give, implicitly or explicitly, the information about
a.    the name of array
b.    the data type of array
c.    the first data from the set to be stored
d.    the index set of the array

20.    The complexity of Binary search algorithm is
a.    O(n)
b.    O(log )
c.    O(n2)
d.    O(n log n)

Correct Answers to Data Structures And Algorithms MCQs

1 – A 2 – B 3 – B 4 – C 5 – D 6 – A 7 – D 8 – A 9 – B 10 – C
11 – A 12 – D 13 – A 14 – C 15 – B 16 – D 17 – D 18 – A 19 – C 20 – B

Filed Under: Data Structures and Algorithms Tagged With: Data Structures and Algorithms, mcq questions, MCQ Questions from Data Structures and Algorithms

Data Structures & Algorithms MCQ with Answers – Set 2 →

Comments

  1. gagan says

    April 3, 2015 at 11:19 am

    sir plz upload more sets ….its very helpful

    Reply
  2. Anes P A says

    July 30, 2015 at 11:43 am

    Dear Team,

    the answer of second question is wrong … is O(n2). (Big O n square)…

    Reply
    • Aruna Khubalkar says

      June 3, 2016 at 11:00 am

      Dear Team,

      Complexity of Bubble sort is O(n^2).

      Your answer is wrong.

      Reply
    • RAJPUT says

      August 28, 2016 at 6:08 pm

      a agree……..please check it and do some changes.

      Reply
      • RAJPUT says

        August 28, 2016 at 6:10 pm

        sorry I replaced by a……

        Reply
    • Tarun Mittal says

      October 2, 2016 at 8:35 pm

      If element of list in sorted list is already then its O(n)..

      Reply
  3. Kabango says

    June 4, 2016 at 1:43 pm

    Very helpful. Thank you.

    Reply
  4. veerendra bharti says

    June 16, 2016 at 12:21 pm

    ya you are right.
    bubble sort complexity is O(n2)

    Reply
  5. SUPRIYA MONDAL says

    July 25, 2016 at 9:52 am

    SIR PLS UPLODE VISUAL BASIC MCQ SET
    .

    Reply
  6. Fariau says

    October 10, 2016 at 10:19 pm

    Sir plz send data structure mcqs

    Reply
  7. A says

    February 5, 2017 at 1:37 pm

    The answer in question number two is incorrect because the complexity of bubble sort is O(n^2).

    Reply
  8. owusuowusa msmsmmsdsfsfsowusu ansaow says

    May 12, 2017 at 5:13 pm

    wow perfect, but pls add explanation to the answer.

    Reply

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

User manuals http://manymanuals.com

Published MCQs for:

  • Computer Fundamentals
  • Operating Systems (Basics)
  • Word Processing (MS Word)
  • Spread Sheet (MS Excel)
  • Presentation (MS PowerPoint)
  • DBMS (MS Access)
  • Webpage Designing (HTML)
  • C++ Programming Language
  • Data Structures & Algorithms

Reading Materials for:

Fundamentals of Computers
► Syllabus of Computer Fundamentals
► Introduction to Computer Fundamentals
► History of Computers
► Computer Generations
► Classification of Computers
► Computer System
► Computer Hardware Concept
► Computer Software Concept
► Computer Networking
► Number System

Recent Posts

  • Which of the following is not an operating system?
  • Computer Networks MCQ Questions and Answers with PDF Download
  • Online Quiz MS PowerPoint
  • Solved Question Paper of PSC for NARC 2074-2-18
  • Computer Basics – Solved Question Paper of MPA 2017 (Spring) – Purbanchal University (PU)

MCQ Sets

  • Home
  • About Us
  • Contact Us
  • Privacy Policy
  • User Testimonials
  • Help MCQ Sets Grow More!
  • RSS Feeds
  • Sitemap

Recent Comments

  • Suresh Khanal on Microsoft Excel MCQ Questions – The First 100 MCQs
  • Sabina Khadgi on 101 to 200 MCQ Questions from Microsoft Excel
  • Suresh Khanal on MCQ Sets Downloads
  • emma on MCQ Sets Downloads
  • Solved C++ MCQs Set 03 » MCQ Sets on Solved C++ MCQs Set 01