Which of these is an application of linked lists?

For separate chaining in hash-tables

Consider the following definition in c programming language.Which of the following c code is used to create new node? struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr;

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

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

ptr = (NODE)malloc(sizeof(NODE));

What kind of linked list is best to answer question like "What is the item at position n"?

Array implementation of linked list

Linked list data structure offers considerable saving in

Space Utilization and Computational Time

Which of the following points is/are true about Linked List data structure when it is compared with array

Arrays have better cache locality that can make them better in terms of performance

It is easy to insert and delete elements in Linked List

Random access is not allowed in a typical implementation of Linked Lists

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

Possible if size of linked list is even

Possible if size of linked list is odd

Possible if X is not first node

What is the functionality of the following code? public void function(Node node) { if(size == 0) head = node; else { Node temp,cur; for(cur = head; (temp = cur.getNext())!=null; cur = temp); cur.setNext(node); } size++; }

Inserting a node at the end of the list

Inserting a node at the beginning of the list

Deleting a node at the beginning of the list

Deleting a node at the end of the list

The following C function takes a simply-linked list as an input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative to replace the blank line. typedef struct node { int value; struct node *next; }Node; Node *move_to_front(Node *head) { Node *p, *q; if ((head == NULL: || (head->next == NULL)) return head; q = NULL; p = head; while (p-> next !=NULL) { q = p; p = p->next; } _______________________________ return head; }

q->next = NULL; p->next = head; head = p;

q = NULL; p->next = head; head = p;

q->next = NULL; head = p; p->next = head;

head = p; p->next = q; q->next = NULL;

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

Delete the last element of the list

Insert a new element as a first element

Add a new element at the end of the list

KLU- CLUSTER -6 DAY-7

Authored by CCC info@ccc.training

English

Professional Development

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

30 questions

Show all answers

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); printf("%d ", head->data); }

Prints all nodes of linked lists

Prints all nodes of linked list in reverse order

Prints alternate nodes of Linked List

Prints alternate nodes in reverse order

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A linear collection of data elements where the linear node is given by means of pointer is called?

linked list

node list

primitive list

None of these

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity to count the number of elements in the linked list?

O(1)

O(n)

O(logn)

None of the mentioned

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

O(1)

O(n)

θ (n)

θ (1)

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) fun(start->next->next); printf("%d ", start->data); }

1 4 6 6 4 1

1 3 5 1 3 5

1 2 3 5

1 3 5 5 3 1

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the functionality of the following piece of code? public int function(int data) { Node temp = head; int var = 0; while(temp != null) { if(temp.getData() == data) { return var; } var = var+1; temp = temp.getNext(); } return Integer.MIN_VALUE; }

Find and delete a given element in the list

Find and return the given element in the list

Find and return the position of the given element in the list

Find and insert a new element in the list

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Linked lists are not suitable to for the implementation of?

Insertion sort

Radix sort

Polynomial manipulation

Binary search

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Microsoft

or continue with

Facebook

Apple

Others

Already have an account?

Similar Resources on Wayground

25 questions

Classroom Management / E.Qat

Quiz

•

Professional Development

26 questions

Preposition of Direction

Quiz

•

Professional Development

25 questions

Meetings!

Quiz

•

University - Professi...

25 questions

B2 Business Partner Unit 7

Quiz

•

Professional Development

25 questions

OD2 Units 1-2 Revision

Quiz

•

Professional Development

25 questions

International trade documents

Quiz

•

Professional Development

25 questions

CO Level-3 Q:2

Quiz

•

Professional Development

25 questions

RCCG Sunday School Fourth Quarterly Review

Quiz

•

Professional Development

Popular Resources on Wayground

24 questions

PBIS-HGMS Day 10

Quiz

•

6th - 8th Grade

10 questions

HCS SCI 03 Summer School Review 3

Quiz

•

3rd Grade

11 questions

Home Scope

Quiz

•

7th - 8th Grade

15 questions

HCS SCI 05 Summer School Assessment 3 Review

Quiz

•

5th Grade

35 questions

Lufkin Road Middle School Student Handbook & Policies Assessment

Quiz

•

7th Grade

18 questions

Geo 11.3 Area of Circles and Sectors

Quiz

•

9th - 11th Grade

KLU- CLUSTER -6 DAY-7

What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); printf("%d ", head->data); }

A linear collection of data elements where the linear node is given by means of pointer is called?

What is the time complexity to count the number of elements in the linked list?

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) fun(start->next->next); printf("%d ", start->data); }

What is the functionality of the following piece of code? public int function(int data) { Node temp = head; int var = 0; while(temp != null) { if(temp.getData() == data) { return var; } var = var+1; temp = temp.getNext(); } return Integer.MIN_VALUE; }

Linked lists are not suitable to for the implementation of?

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Which of these is an application of linked lists?

In circular linked list, insertion of node requires modification of?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground