DS UNIT 01 CSM

DS UNIT 01 CSM

12th Grade

20 Qs

quiz-placeholder

Similar activities

Unit 1 Review

Unit 1 Review

10th - 12th Grade

20 Qs

AP CSP Exam Review

AP CSP Exam Review

9th - 12th Grade

20 Qs

Jaringan Lokal dan Internet

Jaringan Lokal dan Internet

9th - 12th Grade

15 Qs

History of Typography

History of Typography

9th - 12th Grade

20 Qs

Windows 11

Windows 11

4th Grade - University

16 Qs

Unit 1,2, and 3 Review

Unit 1,2, and 3 Review

9th - 12th Grade

15 Qs

Examen de Software

Examen de Software

12th Grade

22 Qs

ULANGKAJI ICT TING 4

ULANGKAJI ICT TING 4

12th Grade - University

20 Qs

DS UNIT 01 CSM

DS UNIT 01 CSM

Assessment

Quiz

Computers

12th Grade

Practice Problem

Hard

Created by

anusha ambeera

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 CHOICE QUESTION

45 sec • 1 pt

What will be the output of the following code?

struct node {

int data;

struct node *x;

struct node *y;

};

Implementation of DLL

Implementation of CLL

None

Implementation of SLL

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What will be the output of the following code?

void function() {

if(head==NULL)

printf("\n List is Empty: ");

else {

    struct node *temp=head;

    head=head->next;

    free(temp) // temp->next=NULL;   }   }

DLL Delete At End

SLL Delete At End

SLL Insert At Beginning

SLL Delete At Beginning

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

.  Linked list and Array are considered as an example of ___________ type of memory allocation.


Static and Dynamic

Dynamic and Static

Heap and Dynamic

None

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What will be the output of the following code?

void function()  {

 int value;

    struct node nn=(struct node)malloc(sizeof(struct node));

    nn->data=value;

    nn->next=NULL;

    if(head==NULL)

        head=nn;

    else  {

        nn->next=head;

        head=nn;      }  }

DLL Delete At End

SLL Delete At End

SLL Insert At Beginning

SLL Insert At End

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What will be the output of the following code?

void function() {

 struct node *temp=head;

    while(temp!=NULL)  //while(temp)

    {

        printf("%d ",temp->data);

        temp=temp->next;   }  }

Displaying elements

Printing nodes

Traversal data

All

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

 Consider the following definition in c programming language.

struct node {

int data;

struct node *next;

} typedef struct node NODE;

NODE *nn;

Which of the following c code is used to create new node?

nn = (NODE*)malloc(sizeof(NODE));

nn = (NODE*)malloc(NODE);

nn = (NODE*)malloc(sizeof(NODE*));

nn = (NODE)malloc(sizeof(NODE));

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the value of the postfix expression 6 3 4 * + 2 - ?

-16

18

24

16

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?