Complete Python Course for CBSE 9th 10th 11th and 12th Students

The video tutorials of this course are in encrypted form and can be played on TTRC Player only. Enrolling this course also gives access to all other premium courses taught by Subrat Sir. You can take any subscription of TTRC Player to play these videos. To know more about subscriptions please Click Here. To know a list of the courses, Frequently Asked Questions and Download link of the courses click below download button.

This course covers the following syllabus which may be helpful for CBSE 9th, 10th, 11th and 12th students or any other board which have the same curriculum.

Class 9th Python Syllabus :

Theory :

• Introduction to Python
• A simple “Hello World” program
• Running a Python program
• The notion of data-types and variables: integer, float, string
• Arithmetic operations: +, -, *, /

Theory Marks : 10/30

Lab

Write basic Scratch/Python programs.

Practical Marks : Write basic python programs – 7.5 /30

Reportfile + Viva : 4 Python Programs – 10/25

Class 10th Python Syllabus

Theory :

• Revision of Python Basics
• Conditionals : if, if-else statements
• Loops : for, while
• Practice simple programs

Theory marks : 8/30

Lab

Write basic Scratch/Python programs.

Practical Marks : Write one python programs – 15 /30

Reportfile + Viva : 5 Python Programs – 10/25

Class 11th Python Syllabus

Theory :

Programming and Computational Thinking (PCT-1)

• Familiarization with the basics of Python programming: a simple “hello world” program,
  process of writing a program, running it, and print statements; simple data-types: integer,
  float, string
• Introduce the notion of a variable, and methods to manipulate it (concept of L-value and Rvalue even if not taught explicitly)
• Knowledge of data types and operators: accepting input from the console, assignment
• statement, expressions, operators and their precedence.
• Conditional statements: if, if-else, if-elif-else; simple programs: e.g.: absolute value, sort 3
  numbers, and divisibility.
• Notion of iterative computation and control flow: for, while, flowcharts, decision trees and
  pseudo code; write a lot of programs: interest calculation, primarily testing, and factorials.
• Idea of debugging: errors and exceptions; debugging: pdb, break points.
• Lists, tuples and dictionary: finding the maximum, minimum, mean; linear search on list/tuple
  of numbers, and counting the frequency of elements in a list using a dictionary. Introduce the
  notion of accessing elements in a collection using numbers and names.
• Sorting algorithm: bubble and insertion sort; count the number of operations while sorting.
• Strings: compare, concat, substring; notion of states and transitions using state transition
  diagrams.
• Total Theory Marks : 35/70

Lab :

At least the following Python concepts should be covered in the lab sessions: expressions, conditionals, loops, list, dictionary, and strings. The following are some representative lab assignments.

• Find the largest and smallest numbers in a list.
• Find the third largest number in a list.
• Test for primarily.
• Find whether a string is a palindrome or not.
• Given two integers x and n, compute x^n
• Compute the greatest common divisor and the least common multiple of two integers.
• Test if a number is equal to the sum of the cubes of its digits. Find the smallest and largest
  such numbers.

Practical Marks : 8/12

Report file + Viva : 7/10

Class 12th Python Syllabus

Theory :

Programming and Computational Thinking (PCT-2)

• Revision of the basics of Python
• Functions: scope, parameter passing, mutable/immutable properties of data objects, pass
  arrays to functions, return values, functions using libraries: mathematical, and string functions.
• File handling: open and close a file, read, write, and append to a file, standard input, output,
  and error streams, relative and absolute paths.
• Using Python libraries: create and import Python libraries
• Recursion: simple algorithms with recursion: factorial, Fibonacci numbers; recursion on
  arrays: binary search
• Idea of efficiency: performance defined as inversely proportional to the wall clock time, count
  the number of operations a piece of code is performing, and measure the time taken by a
  program. Example: take two different programs for the same problem, and understand how
  the efficient one takes less time.
• Data visualization using Pyplot: line chart, pie chart, and bar chart.
• Data-structures: lists, stacks, queues.
• Total Theory Marks : 30/70

Practical :

• Recursively find the factorial of a natural number.
• Read a file line by line and print it.
• Remove all the lines that contain the character `a’ in a file and write it to another file.
• Write a Python function sin(x, n) to calculate the value of sin(x) using its Taylor series
• expansion up to n terms. Compare the values of sin(x) for different values of n with the correct
  value.
• Write a random number generator that generates random numbers between 1 and 6
  (simulates a dice).
• Write a recursive code to find the sum of all elements of a list.
• Write a recursive code to compute the nth Fibonacci number.
• Write a Python program to implement a stack and queue using a list data-structure.
• Write a recursive Python program to test if a string is a palindrome or not.
• Write a Python program to plot the function y = x^2 using the pyplot or matplotlib libraries.
• Create a graphical application that accepts user inputs, performs some operation on them, and then writes the output on the screen. For example, write a small calculator. Use the tkinter library.
• Open a webpage using the urllib library.
• Compute EMIs for a loan using the numpy or scipy libraries.
• Take a sample of 10 phishing e-mails and find the most common words.

Python program (60% logic + 20% documentation + 20% code quality ) : 7/10

Who can take this course :

• CBSE Class 9th, 10th, 11th or 12th students willing to learn python
• Any one interested to learn Python
• Any one who have the above syllabus in Python.