Scribd
Upload
43 views8 pages

Programming

The document outlines the syllabus for the first year programming course at MAKAUT, prepared by Sourav Chakrabarti. It covers topics such as algorithms, programming concepts, conditional branching, loops, arrays, basic algorithms, functions, recursion, structures, and pointers. The syllabus aims to provide foundational knowledge and skills in programming for students.

Uploaded by

Adrish Sarkar
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
43 views8 pages

Programming

The document outlines the syllabus for the first year programming course at MAKAUT, prepared by Sourav Chakrabarti. It covers topics such as algorithms, programming concepts, conditional branching, loops, arrays, basic algorithms, functions, recursion, structures, and pointers. The syllabus aims to provide foundational knowledge and skills in programming for students.

Uploaded by

Adrish Sarkar
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/ 8

MAKAUT 1ST YEAR SYLLABUS

BY SOURAV CHAKRABARTI

https://souravchakrabarti.graphy.com/
https://www.youtube.com/@souravchakrabarti/feature
PROGRAMMING FOR PROBLEM SOLVING
Introduction to Programming
Introduction to components of a computer system (disks,
memory, processor, where a program is stored and
executed, operating system, compilers etc.).

Idea of Algorithm: steps to solve logical and numerical


problems. Representation of Algorithm:
Flowchart/Pseudocode with examples.

From algorithms to programs; source code, variables


(with data types) variables and memory locations, Syntax
and Logical Errors in compilation, object and executable
code.
Arithmetic expressions and precedence

Conditional Branching and Loops


Writing and evaluation of conditionals and consequent
branching.
Iteration and loops.
Arrays
Arrays (1-D, 2-D), Character arrays and Strings.

Basic Algorithms
Searching, Basic Sorting Algorithms (Bubble, Insertion
and Selection), Finding roots of equations, notion of order
of complexity through example programs (no formal
definition required).
Function
Functions (including using built in libraries), Parameter
passing in functions, call by value, Passing arrays to
functions: idea of call by reference.
Recursion
Recursion, as a different way of solving problems.
Example programs, such as Finding Factorial, Fibonacci
series, Ackerman function etc. Quick sort or Merge sort.
Structure
Structures, Defining structures and Array of Structures.

Pointers
Idea of pointers, Defining pointers, Use of Pointers in self-
referential structures, notion of linked list (no
implementation).
File handling (only if time is available, otherwise should
be done as part of the lab)
This Syllabus Is Prepared by Sourav Chakrabarti
to Help Students. All The Data are here taken
from Official Website of MAKAUT University.

You might also like