Question
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int val;
struct Node* next;
}*head;
int linear_search(int value)
{
struct Node *temp = head->next;
while(temp != 0)
{
if(temp->val == value)
return 1;
temp = temp->next;
}
return 0;
}
int main()
{
int arr[5] = {1,2,3,4,5};
int n = 5,i;
head = (struct Node*)malloc(sizeof(struct Node));
head->next = 0;
struct Node *temp;
temp = head;
for(i=0; i<n; i++)
{
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->next = 0;
newNode->val = arr[i];
temp->next = newNode;
temp = temp->next;
}
int ans = linear_search(60);
if(ans == 1)
printf("Found");
else
printf("Not found");
return 0;
}
a.
Finds the index of the first occurrence of a number in a linked list
b.
Finds the index of the last occurrence of a number in a linked list
c.
Checks if a number is present in a linked list
d.
None of the mentioned
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What does the following code do?
Similar Questions
Discover Related MCQs
Q. Which of the following methods can be used to search an element in a linked list?
View solution
Q. What is the time complexity of the above recursive implementation of linear search?
View solution
Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?
View solution
Q. Which of the following techniques can be used to search an element in an unsorted array?
View solution
Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?
View solution
Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?
View solution
Q. Which of the following methods can be used to find the largest and smallest number in a linked list?
View solution
Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?
View solution
Q. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?
View solution
Q. Which of the following methods can be used to find the largest and smallest element in an array?
View solution
Q. What is the time complexity of the above recursive implementation used to find the length of the string?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?
View solution
Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?
View solution
Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. Which of the following is the binary representation of 100?
View solution
Q. What can be the minimum sum of digits for a 4 digit number?
View solution
Q. What can be the maximum sum of digits for a 4 digit number?
View solution
Q. Which of the following methods can be used to find the sum of digits of a number?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
