DS QUIZ-1

DS QUIZ-1

University

20 Qs

quiz-placeholder

Similar activities

1ºDAM/DAW - Entornos de Desarrollo - UD1-6 - Prof. C. Boni

1ºDAM/DAW - Entornos de Desarrollo - UD1-6 - Prof. C. Boni

University - Professional Development

20 Qs

Closing entries

Closing entries

University

20 Qs

PARC Linux Basic Part 2

PARC Linux Basic Part 2

University

20 Qs

CSS Pseudo dan CSS Grid System

CSS Pseudo dan CSS Grid System

University

20 Qs

POST TEST WEB STATIC

POST TEST WEB STATIC

University - Professional Development

20 Qs

switch case

switch case

University

17 Qs

Into the Future

Into the Future

University

19 Qs

DS QUIZ-1

DS QUIZ-1

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

SOBHANBABU SOBHANBABU

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

20 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

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

Array

Tree

Graph

Linked list

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the worst case time complexity of Linear Search

O(n)

O(logn)

O(n^2)

O(logn^2)

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

How to calculate mid point in Binary Search

mid=low+high/2

mid=(high-low)/2

mid=(high+low)/2

mid=low+high-1

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Binary search input elements are always in ____________

Ascending Order

Descending Order

Either in Ascending or descending order

No specific order

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Binary search follows_____________

Divide and conquer strategy

Greedy appraoch

No specific approach

Dynamic Programming approach

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

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

7.

MULTIPLE SELECT QUESTION

1 min • 1 pt

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);

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?