C - Data Structures (Unit 1 - QUIZ)

     Example of Primitive Data Structure is      

• Trees

• Arrays

• Linked List

• None

    Stacks are examples of what type of Data Structure

• Primitive Data Structure

• Non Primitive Data Structure

• Non Linear Data Structure

• Both b&c

Binary Search does not follow these rules: [MULTIPLE  CHOICE]

      

• find key element, by comparing all elements

        

• elements should be in only ascending order

       

• follows divide and conquer rule

        

• none

What is the worst case time complexity for linear search

• O(1)

• O(2n)

• O(n^2)

• O(n)

Which of the following is not an application of binary search

• To find lower/upper in ordered sequence

• Debugging

• To search in unordered list

• Both b&c

The element that is going to be searched in a list is called

• Key

• Item

• Table

• Flag

The following type of search is easy to implement

• Linear Search

• Non Linear Search

• Both

• none

What is the best case time complexity for Linear Search

• O(1)

• O(2n)

• O(n^2)

• O(n)

In Binary Search,we compare the value with the elements in the _____ position of the array

• right

• left

• random

• middle

Which Searching Algorithm is more efficient

• Linear search

• Binary Search

• Both

• None