0% found this document useful (0 votes)
30 views2 pages

Final Coding Syllabus

Uploaded by

a9650827710
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views2 pages

Final Coding Syllabus

Uploaded by

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

Unit Number:

Title: Conditional Statements, Basic I/O, and Loops


1

 Introduction to conditional statements for decision-making.


Topics:
o Basic input/output operations.
o Conditional statements: if, if-else, if-else-if ladder, switch-case.
o Nested conditional statements.
o Loops: for, while, do-while.
o Loop controls: break, continue.
o Applications: summation, product, factorial, range operations,
series generation (e.g., Fibonacci).

Unit Number:
2 Title: Strings, Arrays, and Basic Time Complexity

 Study of strings and arrays as foundational data structures.


Topics:
o String operations: creation, access, concatenation,
comparison, length.
o String functions: substring, find, replace, toupper, tolower.
o String tasks: vowel counting, palindrome check, whitespace
management.
o Arrays: declaration, initialization, insertion, deletion, updating.
o Multi-dimensional arrays (matrix operations).
o Array applications: finding max/min values, reversing arrays.
o Sorting: Bubble Sort, Selection Sort.
o Searching: Linear and Binary Search.
o Basic time complexity: Big-O notation for efficiency analysis.

Unit Number:
3 Title: Functions and Recursion

 Introduction to modular programming through functions and


recursion.
Topics:
o Function definition and calls.
o Parameter passing (by value and by reference).
o Variable scope: local and global.
o Recursion basics: base cases, recursive vs. iterative solutions.
o Recursive examples: factorial, Fibonacci, GCD.

Unit Number: Title: Basic Object-Oriented Programming


4 Concepts

 Introduction to basic OOP for code structuring and organization.


Topics:
o Classes and objects.
o Constructors.
o Encapsulation for data protection.
o Inheritance and polymorphism for reusability and extensibility.

Programming and Problem Solving for B.Tech Second-


Year Enhancing Coding Proficiency and Problem-Solving
Skills

You might also like