Skip to content
Alerts
Exam Examination-(UG-Valuation) – Exam Registration (Regular/FE and Supplementary) for B.Tech S5 (PT) (S,FE) Exam Jan 2027 (2019 Scheme) Exam APJAKTU – Examination(UG-Valuation) – Exam registration (Supplementary) for B .Tech S2 (PT) (S,FE) Exam Dec 2026 (2019 Scheme) and B.Tech S6 (PT) (S,FE) Exam Dec 2026 (2019 Scheme) Exam Schedule for document verification of Ph.D applicants for the Academic Year 2026-27. Exam UG programmes – Revised Examination Calendar November 2026 to February 2027- Regular/Supplementary end- semester Examinations Exam Registration for B.Tech S6 (S, FE) Exam Dec 2026 (2019 Scheme) for Supplementary candidates – Opened Exam Exam registration for B.Tech S1 (S,FE) S2 (S,FE) Exam Dec 2026 (2019 Scheme) Exam Detailed Timetable of B.Tech S7 (R, S) Examinations, November 2026 (2019 Scheme) /Working Professionals (R, S) November 2026 Exam Detailed Time Table of B.Tech S5 (R) Exam November 2026, including (WP) (R) (2024 Scheme)
Homeโ€บ 2024 Schemeโ€บ Notes

Algorithmic Thinking With Python Notes | UCEST105

S1 & S2 2024 Scheme
S1
S1 & S2 ยท All Branches ยท 2024 Scheme
โ† Back to Subjects
M1
Module 1 โ€” Algorithmic Thinking With Python
1
Set 1
UCEST105 Shared by Adwaith Mohan
โฌ‡ Download
2
Set 2
UCEST105 Shared by Adwaith Mohan
โฌ‡ Download
3
Set 3
UCEST105 Shared by Adwaith Mohan
โฌ‡ Download
Have better notes for M1?
Help your fellow students by uploading
โฌ† Upload Notes
Advertisement

About Algorithmic Thinking With Python (UCEST105)

Algorithmic Thinking with Python (UCEST105) is a first-semester course in the KTU B.Tech 2024 scheme, common to all branches. It teaches how to break a problem down, plan a solution as an algorithm, and turn it into a working Python program. It combines classes with programming lab sessions.

Syllabus

  • Module 1: Problem-solving strategies such as trial and error, heuristics and backtracking, the problem-solving process, and Python basics: variables, data types, operators and input/output.
  • Module 2: Algorithms, pseudocode and flowcharts, using sequence, selection and loops.
  • Module 3: Selection and loops in Python, lists, tuples, sets, strings and dictionaries, NumPy arrays, functions, and recursion.
  • Module 4: Problem-solving approaches: brute force, divide and conquer (merge sort), dynamic programming, greedy algorithms and randomized methods.

Exam pattern

The end-semester exam is for 60 marks: 8 short questions of 3 marks each, plus 4 questions of 9 marks each, one from each module. Internal assessment, including a lab exam, adds 40 marks.

Study tips

Write and run programs yourself rather than only reading code. Practise pseudocode, flowcharts and recursion problems such as factorial, Fibonacci and GCD, and solve previous question papers to spot repeated topics.

Notes and resources

Find module-wise notes, lab programs, previous year question papers and the syllabus for UCEST105 here, shared by KTU students and teachers.

๐Ÿ“ฒ Get updates before anyone else
New notes, results & exam alerts โ€” straight to your phone.