Scribd
Upload
12 views1 page

Internal1 QP

This document is an internal examination paper for the Algorithms course at SRI RAAJA RAAJAN COLLEGE OF ENGINEERING & TECHNOLOGY, dated March 18, 2025. It consists of two parts: Part A with 10 short answer questions and Part B with 5 detailed questions, covering various topics related to algorithms, including asymptotic notation, search methods, and recurrence relations. The paper is structured to assess students' understanding of algorithm concepts and their complexities.

Uploaded by

Saravanan Sujatha
Copyright
© © All Rights Reserved
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
12 views1 page

Internal1 QP

This document is an internal examination paper for the Algorithms course at SRI RAAJA RAAJAN COLLEGE OF ENGINEERING & TECHNOLOGY, dated March 18, 2025. It consists of two parts: Part A with 10 short answer questions and Part B with 5 detailed questions, covering various topics related to algorithms, including asymptotic notation, search methods, and recurrence relations. The paper is structured to assess students' understanding of algorithm concepts and their complexities.

Uploaded by

Saravanan Sujatha
Copyright
© © All Rights Reserved
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/ 1

SRI RAAJA RAAJAN COLLEGE OF ENGINEERING & TECHNOLOGY

Amaravathiputhur Post, Karaikudi Tk


Accredited by NAAC with B+ Grade

Internal-I MARCH 2025

Date :18.03.25
Reg. No: Yr/Sem/II/IV
Session : AN

CS3401 ALGORITHMS 100


Marks

ANSWER ALL QUESTIONS


PART A (10*2 = 20MARKS)
1. What is Algorithm? (AU.,A/M023) C213.1 BTL1
2. Define Time complexity (AU.,A/M2023) C213.1 BTL1
3. Define Space Complexity (AU.,A/M2024) C213.1 BTL1
4. Define Recurrence Relation (AU.,A/M2023) C213.1 BTL1
5. List the types of asymptotic notation in analysing the complexity of (AU.,A/M2024) C213.1 BTL1
algorithm
6. What is Frequency count? (AU.,A/M2023) C213.1 BTL1
7. Give some of the properties of asymptotic notation. (AU.,A/M 2023) C213.1 BTL1

8. What is Pattern Matching? (AU.A/M2024) C213.1 BTL1

9. Write the time and space complexity of insertion sort. (AU., A/M 2023) C213.1 BTL1

10. What are the methods of Reccurrence Relation? (AU.,A/M2024) C213.1 BTL1

PART B – (5*16 = 80 Marks) (Any FIVE)

11. What is Asymptotic Notation? Write the asymptotic notation used for (AU,A/M 2024) C213.1 BTL2
best case, average case and average case analysis of algorithm(16)

12. Explain Linear search and Binary search with suitable example.(16) (AU,A/M2024) C213.1 BTL2
14. Write a short notes on i) Frequency distributions ii)
Explain Rabin karp algorithm with suitable example.(16) (AU,A/M2024) C213.1 BTL2
Outliers
What is heap sort? Explain maxheap and minheap with suitable example.
(16) (AU.,N/D2023) C213.1 BTL2
15. Explain briefly interpolation search with suitable exaexample.(16)
AU,N/D2023) C213.1 BTL2
13.
16. Solve the following recurrence relation using backward and forward
substitution method. (AU,N/D2023) C213.1 BTL3
T(n)= n-1+ n

Prepared by: Mrs.D.Sujatha, HOD/AI&DS Approved by:

You might also like