DS_week1_quiz_cse1_on_28_march_2023

•The  notations   for  algorithm analysis

For  time  complexity  analysis, we  use  a notation

• Big M notation

• Big O notation

• Big N notation

• A and C

1) Which is not a properties of an algorithm

• Input

• Finiteness

• Definiteness

• Conditionality

ADT contains

Which of the following statement is true about ADT

• It makes implementation details visible

• It hides implementation

• ADT contain only data declarations

• ADT contains operational declarations

Which is not an atomic data types

• Array

• Double

• Float

• Number

Primitive data structures

• complex data types

• basic data types

• BLOB

• None of the above

Non primitive data structures are

• simple data structure

• Derive data structure.

• Complex data structure

• Option A and Option B

Array is a

How many keywords will be used for stack operations

• 2

• 3

• 4

• Option A and Option B

Last in first out structure is

• Linked list

• Stack

• Queue

• Trees