DS UNIT 01 CSM

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

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

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

• Static and Dynamic

• Dynamic and Static

• Heap and Dynamic

• None

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

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

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

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

• -16

• 18

• 24

• 16

Match the following questions

a)  If (rear==front)           i)   If unable insert an element into queue when it is full

b) If (rear==MAX-1)        ii) If unable delete an element from queue when it is empty

c) OVERFLOW                  iii) Queue is full

d) UNDERFLOW               iv) Queue is empty

•       a-iv b-iii c-i d-ii

•    a-iv b-iii c-ii d-i

•      a-i b-ii c-iii d-iv

• None

Match the following questions

a)  If (top==-1)               i) FIFO (FCFS)

b) If (top==MAX-1)       ii) LIFO (FILO)

c) Stack                         iii) Stack is full

d) Queue                      iv) Stack is empty

•      a-iv b-iii c-i d-ii

•      a-iv b-iii c-ii d-i

•     a-i b-ii c-iii d-iv

• None

Match the following questions

a)  If (head==NULL)               i) Delete of temp

b) free(temp)                        ii) List is empty

c) SLL                                     iii) Fordward & Backward direction

d) DLL                                   iv) Fordward direction

•       a-iv b-iii c-ii d-i

•      a-i b-ii c-iii d-iv

• a-ii b-i c-iv d-iii

• None