DS QUIZ-1

Which of the following is/are linear data structure(s)

• Array

• Tree

• Graph

• Linked list

What is the worst case time complexity of Linear Search

• O(n)

• O(logn)

• O(n^2)

• O(logn^2)

How to calculate mid point in Binary Search

• mid=low+high/2

• mid=(high-low)/2

• mid=(high+low)/2

• mid=low+high-1

Binary search input elements are always in ____________

• Ascending Order

• Descending Order

• Either in Ascending or descending order

• No specific order

Binary search follows_____________

• Divide and conquer strategy

• Greedy appraoch

• No specific approach

• Dynamic Programming approach

What is node in linked list

• collection of data and address fields

• Node contains only data

• Node contains either data or address

• Node is a chain

How to create a node for SLL in C language

• n=(Node*)malloc(sizeof(Node);

• n=(Node*)calloc(1,sizeof(Node));

• n=(Node*)malloc(sizeof(Node*));

• n=malloc(sizeof(Node);

How to declare self-referential structure for SLL.

• typedef struct link

  {

  int data;

  struct link *next;

  }Node;

• struct link

  {

  int data;

  struct link *next;

  }Node;

• typedef struct link

  {

  int data;

  int *next;

  }Node;

• struct link

  {

  int data;

  struct link next;

  }Node*;

Linked list is a _____________

• Neither Static nor Dynamic Data Structure

• Both static and Dynamic Data structure

• Static data Structure

• Dynamic Data Structure

Single Linked list last node next field Contains

• 0

• NULL

• Blank

• Address of first Node