9. Consider the non-empty singly linked list with header node, containing the nodes in the order: [ header-node, 14, 10, 5 ]. Assume the Nodeptr head points to the header-node of the list. Predict the output of the following function, when the above list is passed as a parameter. void Search(Nodeptr head){ Nodeptr p1,p2; p1= p2=head; while(p2){ p1=p1->next; p2= p2->next?p2->next->next- >next:NULL; } printf("%d",p1->data); O 14 NULL O 10

9. Consider the non-empty singly linked list with header node, containing the nodes in the order: [ header-node, 14, 10, 5 ]. Assume the Nodeptr head points to the header-node of the list. Predict the output of the following function, when the above list is passed as a parameter. void Search(Nodeptr head){ Nodeptr p1,p2; p1= p2=head; while(p2){ p1=p1->next; p2= p2->next?p2->next->next- >next:NULL; } printf("%d",p1->data); O 14 NULL O 10

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Suppose you have already developed an SLL ADT. You have to search a specificelement of the linked list. If you find the element in the list then you have to swapits previous node with its next node. Otherwise, simply print the message “Datanot found”. Now write a function in your SLL ADT with this functionality.
Question 1 The code below defines a singly-linked list. This consists of the following definition of node: 1 struct node { int val; struct node * next; 4 } Also, it uses the following insert function: struct node * insert(struct node * first, const int val) { 6 struct node * pred = NULL, * succ = first; 7 while (succ != NULL) { 8 if (succ->val val > val) 10 11 break; 12 succ = succ->next; 13 } struct node * this = malloc(sizeof (struct node)); this->val = val; 14 15 16 this->next = succ; 17 if (pred != NULL) { pred->next return first; } else { 18 this; %3D 19 20 21 return this; 22 } 23 } Note that the code above compiles correctly. (a) Give an implementation in C for a function that prints all values in the singly-linked starting from the first node and following the next node one by one along the list. Use the following signature: void print (struct node * first);
B4.In double-linked list, assume head references the first list node and tail references the last list node. Write the sample of code to insert a node "Ahmed" in between Ayan and Asma. Node Node Node next - nu11 prev - data -"Asma" next - next - prev - nu11 data - "sara" prev - "Ayan" data -
F# Explain in detail what this function does and what the result is. let ip L1 L2 = List.map2 (*) L1 L2 |> List.sum printfn "%A" (ip [1;2;3][4;5;6]) %3D whn
Task 18: Add a function to task 1 which accepts a linear linked list List and converts it to a circular linked list. Where List is a pointer to the front of the list. Prototype of the function is as following Node *Convert( Node *List)
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); if(curNode!=NULL) curNode=curNode->getNext(); } A.32 B.43 C.19 D.18
Task 4: Write a function that loads the linked list with the given values of an array. Consider array and its size as input parameter to the function. void loadlist (struct node *, int [ ], int );
3. Write the remove_evens() function that receives a list of integers as a parameter and returns a new list of integers containing only the odd numbers from the original list. Ex1) If n = [1, 2, 3, 4, 5, 6], remove_evens(n) returns [1, 3, 5]. Ex2) If n = [2, 4, 8], remov move_evens(n) returns [].
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; Node<int> *aNode; while(curNode->getItem()<7){ aNode=curNode; curNode=curNode->getNext(); } a=aNode->getItem(); A. 5 B.8 C.0 D.7
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.