®

SOUTHEASTASIANEDUCATIONTRUST
S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

COURSE PLAN
COURSE INFORMATION SHEET

Course Name/Subject Code INTRODUCTION TO PYTHON

PROGRAMMING
/BPLCK205B
Degree/Branch Artificial intelligence & Data
Science.
Name of the course teacher/s & RAJASEKARAN K
Designation Assistant Professor

Course Category Core

Course Teacher Contact Details

7708126164
(Email & Mob. No)

Semester & Academic year IV, 2 0 2 3 -2024(Even Semester)

No. of credits 3

Scheme 2022

Term Dates 22-05-2024 to 07-08-2024

1
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Weightage of Marks (2022 Scheme)

Component Marks
Internal Exam
1. Internal Examinations I,II : 15%
2. Online Quiz/Assignments/Seminars/Mini Project : 10% 50
3. Laboratory : 25%
External Exam
50
Semester End Examination(SEE) : 50%
Total 100

2
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
ApprovedbyAllIndiaCouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

PROGRAMME OUTCOMES (PO)

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyse complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering
sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design system
components or processes that meet the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research methods including
design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
5. Moderntool usage: Create, select, and apply appropriate techniques, resources,and modernengineering and IT
tools including prediction and modelling to complex engineering activities with an understanding of the
limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health,
safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering
practice.
7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal
and environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams,
and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the engineering community
and with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.
11. Projectmanagementandfinance:Demonstrateknowledgeandunderstandingofthe
Engineeringandmanagementprinciplesandapplythesetoone’sownwork,asamemberandleaderinateam, to manage
projects and in multidisciplinary environments.
12. Life-long learning :Recognize the need for and have the preparation and ability to engage in independent and
life -long learning in the broadest context of technological change.

3
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
ApprovedbyAllIndia Councilfor TechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

1. Syllabus
Analysis & Design of Algorithms

Module-1
INTRODUCTION: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving. FUNDAMENTALS
OF THE ANALYSIS OF ALGORITHM EFFICIENCY: Analysis Framework, Asymptotic Notations and
Basic Efficiency Classes, Mathematical Analysis of Non recursive Algorithms, Mathematical Analysis of
Recursive Algorithms.
BRUTE FORCE APPROACHES: Selection Sort and Bubble Sort, Sequential Search and Brute Force String Matching.
Chapter 1 (Sections 1.1,1.2), Chapter 2(Sections 2.1,2.2,2.3,2.4), Chapter 3(Section 3.1,3.2)

Module-2
BRUTE FORCE APPROACHES (contd..): Exhaustive Search
(Travelling Salesman probem and Knapsack Problem). DECREASE-AND-CONQUER: Insertion Sort,
Topological Sorting. DIVIDE AND CONQUER: Merge Sort,
Quick Sort, Binary Tree Traversals, Multiplication of Large Integers and Strassen’s Matrix Multiplication.
Chapter 3(Section 3.4), Chapter 4 (Sections 4.1,4.2), Chapter 5 (Section 5.1,5.2,5.3, 5.4)
Module-3
TRANSFORM-AND-CONQUER: Balanced Search Trees, Heaps and Heapsort. SPACE-TIME TRADEOFFS:
Sorting by Counting: Comparison counting sort, Input Enhancement in String Matching: Horspool’s Algorithm.
Chapter 6 (Sections 6.3,6.4), Chapter 7 (Sections 7.1,7.2)

Module-4
DYNAMIC PROGRAMMING: Three basic examples, The Knapsack Problem and Memory
Functions, Warshall’s and Floyd’s Algorithms. THE GREEDY METHOD: Prim’s Algorithm, Kruskal’s Algorithm,
Dijkstra’s Algorithm, Huffman Trees and Codes. Chapter 8 (Sections 8.1,8.2,8.4), Chapter 9 (Sections 9.1,9.2,9.3,9.4)

Module-5
LIMITATIONS OF ALGORITHMIC POWER: Decision Trees, P, NP, and NP-Complete Problems.
COPING WITH LIMITATIONS OF ALGORITHMIC POWER: Backtracking (n-Queens problem,
Subset-sum problem), Branch-and-Bound (Knapsack problem), Approximation algorithms for
NP-Hard problems (Knapsack problem). Chapter 11 (Section 11.2, 11.3), Chapter 12 (Sections 12.1,12.2,12.3)

4
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

2. Faculty TimeTable & ClassTime Table:

S.E.A. COLLEGE OF ENGINEERING & TECHNOLOGY, BANGALORE-49

DEPARTMENT: AIML
CLASS TIME TABLE (Academic Year 2023-24, Even Semester)
Faculty Name: Prof.RAJASEKARAN K WEF:22/04/2024

DAY\TIME 8.30-9.30 9.30-10.30 10.45-11.45 11.45-12.45 1.30-2.25 2.25-3.30 3.30-4.15

MONDAY ADA
TUESDAY ADA
WEDNESDA
Y ADA
THURSDAY
FRIDAY ADA
SATURDAY

5
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

3. Course Description:
● To learn the methods for analyzing algorithms and evaluating their performance.
● To demonstrate the efficiency of algorithms using asymptotic notations.
● To solve problems using various algorithm design methods, including brute force, greedy,
divide and conquer, decrease and conquer, transform and conquer, dynamic programming,
backtracking, and branch and bound.
● To learn the concepts of P and NP complexity classes.
4. Course Outcomes(CO):
Sl. No DESCRIPTION
CO1 Apply asymptotic notational method to analyze the performance of the algorithms in terms of time
complexity.
CO2 Demonstrate divide & conquer approaches and decrease &
conquer approaches to solve computational problems.

CO3 Make use of transform & conquer and dynamic programming design approaches to solve the given real
world or complex computational problems.
CO4 Apply greedy and input enhancement methods to solve graph & string based computational problems.
CO5 Analyse various classes (P,NP and NP Complete) of problems
CO6 Illustrate backtracking, branch & bound and approximation methods.

5. Course Articulation Matrix 33

COs Pos PSOs

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO 3 3 3 2 2 2 2 2 2 2 3
1

CO 3
3 3 3 2 2 2 2 2 2 2
2

CO 3
3 3 3 2 2 2 2 2 2 2
3

CO 3 3 3 2 2 2 2 2 2 2 3
4

CO 3
5 3 3 2 2 2 2 2 2 2 2

6
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

6. Lesson Plan
Course Teaching
Planned Actual Outcomes Methodology
S.lNo. Module wise topics covered
Date Date

1 22-04-2024 What is an Algorithm?Fundamentals of 29-04-2024 CO1 L &T

Algorithmic problem Solving
23-04-2024 Analysis Framework 30-04-2024 L &T
2 CO1

24-04-2024 Asymptotic Notations and Basic 03-05-2024 L &T

3 Efficiency classes CO1

26-04-2024 Mathematical Analysis of non 06-05-2024 L &T

4 recursive Algorithms CO1

29-04-2024 Mathematical Analysis of recursive 07-05-2024 L &T

5 Algorithms CO1
30-04-2024 Selection Sort 13-05-2024 L &T
6 CO1
7 01-05-2024 Bubble Sort 14-05-2024 CO1 L &T
03-05-2024 Sequential Search and String Matching 14-05-2024 L &T
8 CO1
9 06-05-2024 Exhaustive search(Travelling Salesmen 14-05-2024 CO2 L &T
problem)
07-05-2024 Exhaustive search (knapsack problem) 15-05-2024 CO2 L &T
10
08-05-2024 Insertion Sort 16-05-2024 CO2 L &T
11

12 10-05-2024 Topological Sort 17-05-2024 CO2 L &T

13 13-05-2024 Merge sort 20-05-2024 CO2 L &T

14 14-05-2024 Quick Sort 21-05-2024 CO2 L &T

7
15 15-05-2024 Binary Tree Traversal 22-05-2024 CO2 L &T

16 17-05-2024 Multiplications of Large Integers and 30-05-2024 CO2 L &T

Strassen’s matrix Multiplication.

17 20-05-2024 Balanced Search Trees 31-05-2024 CO3 L &T

18 21-05-2024 Heaps and Heap Sort 03-06-2024 CO3 L &T

19 22-05-2024 Sorting By counting 04-06-2024 CO3 L &T

20 24-05-2024 Comparision counting sort 05-06-2024 CO3 L &T

21 27-05-2024 Input Enhancement in string 07-06-2024 CO3 L &T

matching:Horspool’s Algorithm
22

23

24

25

26

27
28

29

30

31

32

33

34

35

8
36

37

38

39

40

41

42

43

9
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
ApprovedbyAllIndia Councilfor TechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

Course Delivery and Teaching Methodology used.

ABBREVIATION TEACHINGMETHODOLOGY

L Classroom Lecture(Chalk and Talk)

WL Web-FacilitatedCourseDelivery/FlippedClassLecture/MultimediaLecture/Animation

SS Student Seminar

T Tutorial/Case-Study/Scenario

P Practical/Laboratory Demonstration/Model Demonstration/Simulation

GD Group Discussion/Debate/Role-play

GL Guest Lecture/Workshop/Interview with Experts/Webinars

IV Industrial Visit/Field Trip

PD Project Design/Project Demonstration/Literature Survey

7. Textbooks and Reference Books:

Sl. Book Name Author(s) Publisher Year, Edition
“Introduction to the
Design and Analysis of Anany Levitin Pearson. 3rd Edition (Indian),
1
Algorithms” 2017
Text
Books
“Design and Analysis Oxford
S. Sridhar,
2 of Algorithms,”
 8. Topics beyond syllabus/advancedtopics/design:
SL PROPOSED RELEVANCE RELEVANCE
Description of Topics Beyond the Syllabus
No. ACTIONS WITH POs WITHPSOs

1. Pattern matching Special class

PO9,PO10 PSO2

9. Teaching and Learning with Electronic Repository

Unit No. &

Module Weblink
Name

Module- ● Design and Analysis of Algorithms: https://nptel.ac.in/courses/106/101/106101060/

1,2,3,4,5

10. InternalExaminationPortionsandDate:
Internal Examination Modules Date

InternalExamination-I Module1&Module2 27TH MAY 2024

InternalExamination-II Module3&Module4 25TH JULY 2024

SemesterEndExamination Modules 1,2,3,4,5

 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

11. Weightage for Direct and Indirect assessment tools

Assessment Tools Percentage of Weightage

Direct Assessment Tools InternalExaminationI,II 40 %

Direct Assessment Tools SemesterEndExamination(SEE) 50 %

Case Study Solutions / Team

Indirect Assessment Tools
Assignments/NPTELCourses 10 %

Prepared by Approvedby

Name:RAJASEKARAN K Name:

Signature with Date: Signature with Date:

Designation: Assistant Professor Designation: Professor & Head

VISION
The Department of Information Science and Engineering aspires to be a globally acclaimed
centre for engineering education and research in field of Information Science and Engineering
and fosters academic and career success through holistic development.

MISSION
OurpurposeatthedepartmentistocreategraduatesinInformationScienceandEngineering.We
arecommittedtoinnovation,creativityandexcellenceinourteaching,learningandresearch.We inspire
integrity, team work, critical thinking, personal development, ethics in our students and
laythefoundationforlifelonglearning.Weservethetechnical,scientific,economic,andsocietal
developmental needs of our communities.

PROGRAMEDUCATIONALOBJECTIVES(PEO’S)
PEO1: To impart knowledge and develop proficiency as information science engineers to solve
wide range of computational and technical problems in IT industry.

PEO2: To impart technical and managerial competencies and skills to be able to work in
scientific and technology organisations, administrative positions in government and even take up
entrepreneurial route.

PEO-3: To impart critical thinking, creativity & Innovation, collaboration, communication,

information literacy, flexibility & adaptability, leadership and responsibility, and social and
cross-cultural interaction skills, and an ability to adapt to evolving professional environments
PROGRAM-SPECIFICOUTCOMES(PSO’S)
PSO1:Tocollect data,validatethedata,design and develop softwaremodels, convertthemodel into a
working solution using appropriate algorithms and programming language.

PSO2:To expertise in the sub domains of Information Science and Engineering such as file
structures, data mining, big data and data analytics to meet industry needs

PSO3: Ability to develop coding skills using relevant programming languages and use of open
source platforms for software application development
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
ApprovedbyAllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF COMPUTER SCIENCE & ENGINEERING

StudentList

Sl.No USN Name SCHEME

1 1SP22AI001 ADBDUL SUBHAN 2022SCHEME
ABHINAV A KANAKAN
2 1SP22AI003 2022SCHEME
3 1SP22AI004 ABHISHEK M J 2022SCHEME
4 1SP22AI005 ABHISHEK N 2022SCHEME
5 1SP22AI006 ABHISHEK S M 2022SCHEME
6 1SP22AI007 ABINESH J 2022SCHEME
7 1SP22AI008 ADITHYAN B 2022SCHEME
8 1SP22AI009 AKARSH K M 2022SCHEME
9 1SP22AI010 AKASH K 2022SCHEME
10 1SP22AI011 AKASH K P 2022SCHEME
11 1SP22AI012 A ADITHYA VARDHANA REDDY 2022SCHEME
12 1SP22AI013 AMAL JOSHY 2022SCHEME
13 1SP22AI014 AMJED C P 2022SCHEME
14 1SP22AI015 ANANDU V M 2022SCHEME
15 1SP22AI016 ANANYA 2022SCHEME
16 1SP22AI017 ANGESH KUMAR RAY 2022SCHEME
17 1SP22AI018 ASMITA PANDEY 2022SCHEME
18 1SP22AI019 ASWATHI M 2022SCHEME
19 1SP22AI020 B SUSHANK 2022SCHEME
20 1SP22AI021 C H SAI SANGEETHA 2022SCHEME
21 1SP22AI022 CHANDU B K 2022SCHEME
22 1SP22AI023 DEEPESH H 2022SCHEME
23 1SP22AI024 DELBIN JOHN 2022SCHEME
24 1SP22AI025 DILSHAD D 2022SCHEME
25 1SP22AI026 HABEEB RAHMAN K 2022SCHEME
JITHIN P K

26 1SP22AI027 2022SCHEME
27 1SP22AI028 KARTHIK RAJ S 2022SCHEME
28 1SP22AI029 KIRAN GOWDA A 2022SCHEME
29 1SP22AI030 M RITHIK ROSHAN 2022SCHEME
30 1SP22AI031 MAHESHWARI K 2022SCHEME
31 1SP22AI032 MANISH N 2022SCHEME
32 1SP22AI033 MOHAMED AFSAL N 2022SCHEME
33 1SP22AI034 MOHAMMED SHAHAL P 2022SCHEME
34 1SP22AI035 MOHAMMED SHAHID FAIZAAN 2022SCHEME
35 1SP22AI036 MOHAMMED YASEEN S 2022SCHEME
MUHAMMED SINAN N K
36 1SP22AI037 2022SCHEME
37 1SP22AI038 N ANSAM SAINULABDHEEN 2022SCHEME
38 1SP22AI039 NIVEDITHA A H 2022SCHEME
39 1SP22AI040 PRATHEEKSHA R 2022SCHEME
40 1SP22AI041 PRAVALIKA N 2022SCHEME
41 1SP22AI042 PREM KUMAR V 2022SCHEME
42 1SP22AI043 R AMRUTHA 2022SCHEME
43 1SP22AI044 RAHAN ASKER 2022SCHEME
44 1SP22AI045 REKHA N 2022SCHEME
45 1SP22AI046 ROSHAN SAMUEL 2022SCHEME
46 1SP22AI047 S SAI RAHUAL 2022SCHEME
47 1SP22AI048 SAI VIGNESH S P 2022SCHEME
48 1SP22AI049 SANIYA SAIMA KHAN 2022SCHEME
49 1SP22AI050 SENIN T K P 2022SCHEME
50 1SP22AI051 SHREE VARSHA 2022SCHEME
51 1SP22AI052 SREENANDU T N 2022SCHEME
52 1SP22AI053 SREETH 2022SCHEME
53 1SP22AI054 SUJEET GANJI 2022SCHEME
54 1SP22AI055 SUMESH S 2022SCHEME
55 1SP22AI056 SURYA G 2022SCHEME
56 1SP22AI057 T H M VAIBHAV SHASTRY 2022SCHEME
57 1SP22AI058 TASMIYA A 2022SCHEME
58 1SP22AI059 TEJASWINI D 2022SCHEME
59 1SP22AI060 THEJMAL RAHMAN 2022SCHEME
60 1SP22AI061 VARSHA R 2022SCHEME
61 1SP22AI062 VEKATA SHIVA REDDY N 2022SCHEME
62 1SP22AI063 VINOD ABHISHEK H 2022SCHEME
63 1SP22AI065 AHAD MUHAMMAD 2022SCHEME
64 1SP22AI068 ATHUL R UDAY 2022SCHEME
65 1SP22AI069 VARUN V 2022SCHEME
66 1SP22AI400 KEERTHI 2022SCHEME
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF COMPUTER SCIENCE & ENGINEERING

ASSIGNMENT-1

How to calculate Time complexity of Merge sort Algorithm CO2

How to calculate Time complexity of Insertion sort Algorithm CO2
How to calculate Time complexity of Quick sort Algorithm CO2
How to calculate Time complexity of Knapsack Algorithm CO2
How to calculate Time complexity of Travelling salesmen problem CO2
 QUESTIONBANK

Module1
1) List and explain the use of comparison operator in Python.Write the step by step execution of the following
expression in Python 3/2*4+3+(10/4)**3-2
2) Explain the control statements if, else, elif with proper syntax and examples.
3) With Python programming examples to each,explain the syntax and control flow diagram of break and continue
statements
4) Explain two ways of importing modules into application in python with syntax with suitable programming
examples.
5) Develop a python program for Fibonacci sequence of length n and read n from console.
6) Explain for loop structure with flow chart. Develop a program to all the odd number using for loop
7) Explain print(),input(),len(),str(),int() and float() with examples
8) What are the functions? Explain python function with parameter and return statement
9) Write a program to calculate binomial coefficient using factorial.
10) Explain for loop in list with suitable examples
11) Define exception handling. How exceptions are handled in python. write a program to solve divide by zero
execution
12) Explain local and global scope of variable with suitable examples.

Module2

1) What is List? Explain the concept of list indexing and slicing with examples.
2) write the code to find a value in a list a index().
3) Explain list methods append(),insert(),len(),remove(),sort() with suitable examples.
4) Write a python code for magic 8 ball program
5) Expain for loop in list with suitable examples
6) Explain following methods i) keys(), ii) values, iii) items() in a dictionary
7) How is tuple different from a listand which function is used to convert list to tuple.explain?
8) List the merits of dictionary over list.
9) Read N number from the console and create a list. Develop a program to compute and print mean, variance and
standard deviation and print.
10) Explain the concept of list slicing and list traversing

Module3

1) Explain the following methods with suitable examples

i) Upper(), ii) lower(), iii) is_upper() iv) is_lower()
2) Illustrate with examples opening of afile with open() function, reading the contents of file with read() function
and writing to files with write() function
3) Explain the steps involved in adding bullets to wiki-markup. Support with appropriate code.
4) Write a python program to count number of lines in a file
5) Explain the following functions with examples
a) Makedirs(), getcwd(), velpath(),listdir(),sub()
6) What are the three “mode” arguments that can be passed to open() function with example
Module 4
1) What is logging? How this would be used to debug the python program.
2) What is the use of zip? Explain how to create Zip folder.
3) How do you copy files and folder using shutil Module.Explain in detail.
4) What are Assertions.Write the content of an assert Statement.Explain them with examples.
5) Explain the logging module and debug the factorial of number program.
6) What is meant by compressing files?Explain reading,extracting and creating zip files with an example.
7) How does os.walk work in Python?
8) Discuss basicconfig() method to configure the logging module with an example.
9) Write the program to depict Raising exceptions.
10) .write the python Program to accept the sentence and find the number of words,digits,upper case and
lower case letter.

Module 5

1) Compare the differences between static, class and instance method.

2) Define classes and objects in python. create a class called Employee. and initialize with employee name and
id.design method to
i) Set age -to assign age to the employee
ii) Set salary- to assign salary to the employee
iii) Display to display all information to the employee
3) Explain –init—and –str—methods with examples.
4) Write a program to implement polymorphism in python using method over riding
5) Define pure function ? give example program that returns square of the passed integer.
6) How class can be instantiated in Python. Write a python program to instances as return values to define a class
rectangle with member width, height,corner X,corner Y and member function to find center area and perimeter
of a rectangle.
Course Objectives: This course(BCS401) will enable students to:

● To learn the methods for analyzing algorithms and evaluating their performance.
● To demonstrate the efficiency of algorithms using asymptotic notations.
● To solve problems using various algorithm design methods, including brute force, greedy, divide and
conquer, decrease and conquer, transform and conquer, dynamic programming, backtracking, and branch and
bound.
● To learn the concepts of P and NP complexity classes.
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF COMPUTER SCIENCE & ENGINEERING

Result Analysis

Sub Name: ANALYSIS AND DESIGN OF ALGORITHM

Sub Code :BCS401

Total No of Students Appeared

No. of Student’s Pass
No. ofStudent’s Fail
No. of Student’s Absent
Result in percentage
 ®
SOUTHEASTASIANEDUCATIONTRUST

S.E.A.COLLEGEOFENGINEERING&TECHNOLOGY
Approvedby AllIndia CouncilforTechnicalEducation(AICTE),NewDelhi,
AffiliatedtoVisvesvarayaTechnologicalUniversity(VTU),Belagavi,RecognizedbyGovernmentof Karnataka
AccreditedwithGradeB++byNationalAssessment andAccreditationCouncil(NAAC)

DEPARTMENTOF COMPUTER SCIENCE & ENGINEERING

Subject ANALYSIS AND DESIGN External

: OF ALGORITHM
Code BCS401 MAXMARKS 60
Attainment
AttemptedCount
StudentScoredMorethan50%
SN USN Name Marks
1 1SP22AI001 ADBDUL SUBHAN
2 1SP22AI003 ABHINAV A KANAKAN
3 1SP22AI004 ABHISHEK M J
4 1SP22AI005 ABHISHEK N
5 1SP22AI006 ABHISHEK S M
6 1SP22AI007 ABINESH J
7 1SP22AI008 ADITHYAN B
8 1SP22AI009 AKARSH K M
9 1SP22AI010 AKASH K
10 1SP22AI011 AKASH K P
11 1SP22AI012 A ADITHYA VARDHANA REDDY
12 1SP22AI013 AMAL JOSHY
13 1SP22AI014 AMJED C P
14 1SP22AI015 ANANDU V M
15 1SP22AI016 ANANYA
16 1SP22AI017 ANGESH KUMAR RAY
17 1SP22AI018 ASMITA PANDEY
18 1SP22AI019 ASWATHI M
19 1SP22AI020 B SUSHANK
20 1SP22AI021 C H SAI SANGEETHA
21 1SP22AI022 CHANDU B K
22 1SP22AI023 DEEPESH H
23 1SP22AI024 DELBIN JOHN
24 1SP22AI025 DILSHAD D
25 1SP22AI026 HABEEB RAHMAN K
26 1SP22AI027 JITHIN P K
27 1SP22AI028 KARTHIK RAJ S
28 1SP22AI029 KIRAN GOWDA A
29 1SP22AI030 M RITHIK ROSHAN
30 1SP22AI031 MAHESHWARI K
31 1SP22AI032 MANISH N
32 1SP22AI033 MOHAMED AFSAL N
33 1SP22AI034 MOHAMMED SHAHAL P
34 1SP22AI035 MOHAMMED SHAHID FAIZAAN
35 1SP22AI036 MOHAMMED YASEEN S
36 1SP22AI037 MUHAMMED SINAN N K
37 1SP22AI038 N ANSAM SAINULABDHEEN
38 1SP22AI039 NIVEDITHA A H
39 1SP22AI040 PRATHEEKSHA R
40 1SP22AI041 PRAVALIKA N
41 1SP22AI042 PREM KUMAR V
42 1SP22AI043 R AMRUTHA
43 1SP22AI044 RAHAN ASKER
44 1SP22AI045 REKHA N
45 1SP22AI046 ROSHAN SAMUEL
46 1SP22AI047 S SAI RAHUAL
47 1SP22AI048 SAI VIGNESH S P
48 1SP22AI049 SANIYA SAIMA KHAN
49 1SP22AI050 SENIN T K P
50 1SP22AI051 SHREE VARSHA
51 1SP22AI052 SREENANDU T N
52 1SP22AI053 SREETH
53 1SP22AI054 SUJEET GANJI
54 1SP22AI055 SUMESH S
55 1SP22AI056 SURYA G
56 1SP22AI057 T H M VAIBHAV SHASTRY
57 1SP22AI058 TASMIYA A
58 1SP22AI059 TEJASWINI D
59 1SP22AI060 THEJMAL RAHMAN
60 1SP22AI061 VARSHA R
61 1SP22AI062 VEKATA SHIVA REDDY N
62 1SP22AI063 VINOD ABHISHEK H
63 1SP22AI065 AHAD MUHAMMAD
64 1SP22AI068 ATHUL R UDAY
65 1SP22AI069 VARUN V
66 1SP22AI400 KEERTHI
 SyllabusCoverage:

IA-1(27-05-2024 to 29-05-2024) IA-2 (25-07-2024 to 27-07-2024)

Number Of Classes Portions Number Of Classes Portions
Conducted Conducted
Covered In % Covered In
%
27 80 30 100

FacultyFeedback:

Subject Code BCS401

Faculty Name RAJASEKARAN K

Teacher Rating in Percentage

Comments From Faculty

Comments From HOD