BCA 201T Python Programming Notes for GGSIPU BCA Sem 3

BCA 201T Python Programming at a glance: GGSIPU BCA Sem 3 credits, units and exam pattern

It is one of the GGSIPU BCA Semester 3 papers, a semester worth 29 credits and 1,100 marks.

Grading follows the university's Ordinance 11 on examinations; each question maps to a course outcome, CO1 to CO5.

BCA 201T Python Programming Notes unit-wise: 158 solved programs across 4 units

These are Python Programming notes in English, with a program and output for nearly every topic. Notes for other papers of the course sit under GGSIPU BCA notes.

BCA 201T Unit 1: Basics, Operators, Control Structures and Strings

Unit 1 traces Python from its 1989 start to Python 3, shows how a .py file runs on the PVM, and covers identifiers, the 35 keywords, escape sequences and IDLE. It then works through relational, logical and bitwise operators, every decision statement, while and for loops, break, continue and pass, and 14 string methods.

Pages 5 to 41 · 11 official hours · 46 programs · 28 two-mark and 10 ten-mark questions · 11 figures.

Quick look: slicing "PROGRAMMING" (from page 31)

s = "PROGRAMMING"  
print(s[0:7])    # PROGRAM  
print(s[-4:])    # MING  
print(s[::-1])   # GNIMMARGORP

s = "PROGRAMMING"  
print(s[0:7])    # PROGRAM  
print(s[-4:])    # MING  
print(s[::-1])   # GNIMMARGORP

A slice stops one index before stop and never raises an error.

BCA 201T Unit 2: List, Tuple, Dictionary and Sets

Unit 2 starts with mutable and immutable objects, then gives lists the longest treatment: indexing, slicing, traversing, all and any, the methods from append to reverse, and aliasing versus copying. Sets, tuples and dictionary get(), update(), copy() and deletion follow.

Pages 42 to 72 · 11 official hours · 39 programs · 28 two-mark and 10 ten-mark questions · 8 figures.

BCA 201T Unit 3: Functions and File Handling

Unit 3 covers defining and calling functions, the four argument and return-value combinations, keyword, default and variable-length arguments, scope with the LEGB rule, lambda, recursion with a call-stack diagram for fact(4), and modules. The file half compares text, binary and CSV files and inserts, deletes and updates records through a temporary file.

Pages 73 to 103 · 10 official hours · 39 programs · 28 two-mark and 10 ten-mark questions · 9 figures.

BCA 201T Unit 4: OOP, NumPy and Matplotlib

Unit 4 covers classes, constructors, public, protected and private members with name mangling, static and class methods, encapsulation, five types of inheritance and polymorphism. NumPy follows with one-dimensional arrays, reshaping, element-wise and aggregate operations, and the unit ends with bar graphs and pie charts in Matplotlib.

Pages 104 to 137 · 12 official hours · 34 programs · 29 two-mark and 10 ten-mark questions · 14 figures, the most of any unit.

Quick look: NumPy element-wise operations (from page 123)

import numpy as np  
a = np.array([1, 2, 3, 4]); b = np.array([10, 20, 30, 40])  
print(a + b)     # [11 22 33 44]  
print(a * 10)    # [10 20 30 40]  
print(a > 2)     # [False False  True  True]

import numpy as np  
a = np.array([1, 2, 3, 4]); b = np.array([10, 20, 30, 40])  
print(a + b)     # [11 22 33 44]  
print(a * 10)    # [10 20 30 40]  
print(a > 2)     # [False False  True  True]

Binary files with pickle in Python: excerpt from page 95 of the BCA 201T notes

new_rows = []  
for r in rows:  
    roll, name, marks = r.split(",")  
    new_rows.append(f"{roll},{name.upper()},{min(100, int(marks) + 5)}")  
with open("students.txt", "w") as f:  
    f.write(header + "\n" + "\n".join(new_rows) + "\n")  
print("Modified", len(new_rows), "records")

new_rows = []  
for r in rows:  
    roll, name, marks = r.split(",")  
    new_rows.append(f"{roll},{name.upper()},{min(100, int(marks) + 5)}")  
with open("students.txt", "w") as f:  
    f.write(header + "\n" + "\n".join(new_rows) + "\n")  
print("Modified", len(new_rows), "records")

import pickle  
pickle.dump(object, file_object)    # write: file opened in 'wb' or 'ab'  
object = pickle.load(file_object)   # read: file opened in 'rb'  
# load() raises EOFError at the end of the file

import pickle  
pickle.dump(object, file_object)    # write: file opened in 'wb' or 'ab'  
object = pickle.load(file_object)   # read: file opened in 'rb'  
# load() raises EOFError at the end of the file

import pickle  
records = [{"roll": 1, "name": "Riya", "marks": 88},  
           {"roll": 2, "name": "Aman", "marks": 72},  
           {"roll": 3, "name": "Zoya", "marks": 95}]  
with open("stud.dat", "wb") as f:  
    for r in records:  
        pickle.dump(r, f)

with open("stud.dat", "rb") as f:  
    while True:  
        try:  
            print(pickle.load(f))  
        except EOFError:  
            break

import pickle  
records = [{"roll": 1, "name": "Riya", "marks": 88},  
           {"roll": 2, "name": "Aman", "marks": 72},  
           {"roll": 3, "name": "Zoya", "marks": 95}]  
with open("stud.dat", "wb") as f:  
    for r in records:  
        pickle.dump(r, f)

with open("stud.dat", "rb") as f:  
    while True:  
        try:  
            print(pickle.load(f))  
        except EOFError:  
            break

Do the BCA 201T notes cover the full GGSIPU syllabus?

Yes. Every topic heading in the four official BCA 201T units has a matching section in the notes; our unit check found no gaps.

Official source: BCA Scheme and Syllabus, batch admitted 2024-25 onwards (ipu.ac.in).

Every course in GGSIPU notes is mapped to its official PDF in the same way.

How to write BCA 201T answers: output-based two-mark and ten-mark program answers

In the 20-mark Q1 of BCA 201T, write the result first, then one line of reasoning.

Worked example (two-mark, page 37): What is the output of 7 // 2, 7 / 2 and 7 % 2?
Answer: 3 (floor division), 3.5 (true division, always a float), 1 (remainder).

For ten marks, the notes' exam tip is definition, syntax, diagram or flowchart, program and output. The recursion answer guide (page 101) follows that order:

1. Define recursion, its base case and recursive case.
2. Draw the call stack for fact(4) (Figure 3.6).
3. Write factorial and Fibonacci programs with output.
4. End with a recursion vs iteration table and RecursionError.

Common slips flagged in the notes: if a = 5: for == (page 16), (5) for the tuple (5,) (page 58), a default before a non-default parameter (page 80) and recursion with no base case (page 84).

Practise this format on GGSIPU BCA important questions after each unit.

BCA 201T exam corner: 113 two-mark answers and 40 ten-mark answer guides by unit

The BCA 201T notes answer 113 two-mark questions and give guides for 40 ten-mark questions across 4 units, plus 158 programs with output. Four exam-style questions, one per unit:

1. Unit 1: Output of 12 & 10 and 12 | 10? Pointer: 1100 AND 1010 = 8; OR = 14.
2. Unit 2: append() vs extend()? Pointer: [1].append([2,3]) gives [1, [2, 3]]; extend gives [1, 2, 3].
3. Unit 3: What is the LEGB rule? Pointer: Python searches Local, Enclosing, Global, then Built-in.
4. Unit 4: What is name mangling? Pointer: private __x in class C becomes _C__x.

More practice sits in the BCA 201T important questions.

Who writes and checks the BCA 201T Python notes?

• Prateek Talwar, writer of these notes · Founder, Unnati Educations · Associate Company Secretary (ACS), ICSI, since 15 May 2019 · B.Com, University of Delhi (SOL), 2012 · author profile
• Ritik Rawat, subject reviewer for the Python content and code · Senior Full Stack Developer, Unnati Educations · B.Tech · reviewer profile

These BCA 201T Python Programming IPU notes are mapped to the scheme for the 2024-25 batch onwards. The 2026-27 edition has 158 programs, 42 figures and four revision sheets; last updated 12 October 2026 under our editorial policy.

The same team prepares GGSIPU important questions from these unit maps.

BCA 201T and the BCA 201P Python lab (25 practicals), plus other GGSIPU BCA Sem 3 papers

Theory units feeding the lab (our grouping):

• Unit 1 → core 1, 2, 3, 5 (operators to string slicing).
• Unit 2 → core 6, application 1 to 3 (linear search, list duplicates).
• Unit 3 → core 4, 7, 8, 12 to 14, application 4, 5, 7, 8 (recursion, files).
• Unit 4 → core 9, 10, 11, 15, application 6, 9, 10 (charts, classes, NumPy).

Same semester: BCA 203T Dynamic Web Designing, BCA 205T Computer Organization and Architecture, BCA 207T Discrete Mathematics, BCA 261 Vocational Course and BCA 291T Human Values and Ethics (NUES).

BCA 201T Python notes FAQs

Get the full BCA 201T Python Programming Notes on WhatsApp

Order these notes in book form. They are not available as a PDF.

The full GGSIPU BCA Sem 3 Python Programming notes are sold only as a printed book of 137 pages. Send the order on WhatsApp and our desk shares the price and delivery details there.

Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.