Find Time Complexity of Following Questions Also Write Pseudo Code of Your Solution For Explanation of Your Answers
The document lists 25 problems and their solutions are required to find the time complexity and provide pseudo code. The problems include determining if a number is even or odd, checking if all numbers in an array meet a condition, determining if a number is prime, calculating factorial of a number or array of numbers, generating Fibonacci series, performing various insertion, deletion and search operations on linked lists and arrays, and performing operations on stacks and queues.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
115 views3 pages
Find Time Complexity of Following Questions Also Write Pseudo Code of Your Solution For Explanation of Your Answers
The document lists 25 problems and their solutions are required to find the time complexity and provide pseudo code. The problems include determining if a number is even or odd, checking if all numbers in an array meet a condition, determining if a number is prime, calculating factorial of a number or array of numbers, generating Fibonacci series, performing various insertion, deletion and search operations on linked lists and arrays, and performing operations on stacks and queues.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3
Find time complexity of following questions also write pseudo
code of your solution for explanation of your answers
1 you have given a number you have to find given no is odd or even 2 Given an array of n numbers find every number is even or not 3 you have to find out that given number is prime or not 4 given an array of n numbers find every no(m) is prime or not 5 you have to find factorial of a given number 6 an array of n numbers is given. Find factorial of each number 7 fibonacci series of n numbers 8 insertion at beginning in the link list when only head pointer is given 9 insertion at end in the link list when only head pointer is given 10 insertion at given position in the link list when only head pointer is given 11 insertion at end in the link list when head pointer and tail pointer is given 12 insertion at given position in the link list when only head pointer and a pointer to that position is given 13 deletion at beginning in the link list when only head pointer is given 14 deletion at end in the link list when only head pointer is given 15 deletion at given position in the link list when only head pointer is given 16 deletion at end in the link list when head pointer and tail pointer is given 17 deletion at given position in the link list when only head pointer and a pointer to that position is given 18 searching an element in a link list 19 insertion of an element in an array 20 deletion of an element in an array 21 searching an element in an array 22 insertion of an element in a stack 23 insertion of n elements in a stack till stack become full. 24 deletion of an element in a stack 25 deletion of n elements in a stack till stack become empty 26 insertion of an element in a queue 27 insertion of n elements in a queue till queue becomes full 28 deletion of an element in a queue 29 deletion of n element in a queue till queue become empty