[go: up one dir, main page]
Scribd
Upload
16 views2 pages

Python Syllabi

The document outlines a tri-semester course titled 'Python for Placement' that covers basic to advanced Python concepts, data science libraries, and machine learning. Each semester includes minor and major projects, with prerequisites in programming and mathematics. The syllabus details topics such as algorithm analysis, data structures, object-oriented programming, and sorting techniques.

Uploaded by

Jatin Jaiswal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

Python Syllabi

The document outlines a tri-semester course titled 'Python for Placement' that covers basic to advanced Python concepts, data science libraries, and machine learning. Each semester includes minor and major projects, with prerequisites in programming and mathematics. The syllabus details topics such as algorithm analysis, data structures, object-oriented programming, and sorting techniques.

Uploaded by

Jatin Jaiswal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1|P ag e

COURSE NAME: PYTHON FOR PLACEMENT---GO DIVE IN DEPTH

NOTE:

 The course syllabi is bifurcated in 3 semesters (tri-Semester course) where you learn ,explore and able to

build new systems .

 Every semester involves minor and major project which needs to be submitted.
 Make sure you do have git-hub, leet-code and hacker rank account for recursive practice.
 First Semester involves basic and some advanced python concepts along with paradigm & approaches
through which go through . It will be covered in first 45 days.
 Second Semester involves purely advanced python concepts along with paradigm & approaches through
which go through and an amazing start of data-science libraries. It will be completed in next 30 days.
 Third Semester is a mix of data-science libraries and ML(Machine Learning). It will be completed in
remaining days.

SYLLABI FOR SEMESTER-I


Pre-Requistes: 1) Basic Programming Knowledge
2) Mathematics: Functions, Series(AP,GP, HP) , Matrices ,Logarithms,
Calculus, Exponents and Probability.

UNIT-1: Analysis of Algorithms

(i) Algorithm Concept & Lifecycle.


(ii) Analysis of Algorithm
(iii) Methodology & Types of Analysis
(iv) Asymptotic Notations
(v) Framework for Analysing recursive algorithm
(vi) Apriori Analysis of Non-Recursive Algorithms
(vii) Analysing loops (Loop Complexities)
(viii) Space Complexity

UNIT-2: BASIC PYTHON PART -A:

Introduction To Python, Features of Python , Applications, Limitations, Identifiers, Data-Types, Type-


Casting, Immutability, Range Function Forms, Operators, Modules, Input Stream,

Command-Line Arguments, Output Streams, Flow Control and Conditional Statements, Iterative
Statements, Transfer Statements , Pattern- Making , String Data Type and Slice-Operator,
Number to Word Conversion, String Functions, List Data Type, List Functions, List
Comprehension.
2|P ag e

UNIT-3: BASIC PYTHON PART -B:

Tuple Data Structure ( Introduction, Methods, Functions, Comprehensions, Differences),

Set Data Structure(Properties, Creation, Methods, Operators in SETS, Comprehension)

Dictionary Data Structure (Properties, Accessing data , updation , deletion, Merging of Collections

Nested Collections, Mini-Project of SuperMarket by using Dictionary)

Functions , Modules, Packages, File Handling.

UNIT-4: Advance PYTHON:

OOPS Programming: Class, Object, Reference Variable, Self Variable, Python Constructors, Instance
Variables, Static Variables, Instance & Class & Static Methods, Accessing members of one class
inside another class, Inner classes , Nested Classes, Garbage Collection , Destructor, Inheritance,
Method Resolution Order, super( ) function, Polymorphism, Abstract Method and Classes, Data
Hiding , Abstraction, Public & Private Members, Encapsulation, etc.

UNIT-5: Design Strategy & Sorting Techniques:

General Method, Max-Min Problem, Binary Search, Matrix Multiplication, Long Integer
Multiplication, Master Method , Recursion Tree, Merge Sort , Quick Sort, Bubble Sort, Selection Sort,
Insertion Sort, Radix Sort.

SUBMISSION OF MAJOR PROJECT BASED ON ABOVE KNOWLEDGE

You might also like