Assam down town University
Gandhinagar, Panikhaiti, Guwahati-26
ODD SEMESTER 2024-25
Course Hand-out
This document gives specific details regarding the course.
Course Code & Title : BTCS1101, Problem Solving using C
Credit Details : L:T:P:S:R:O/F:C::3:0:2:0:0:0:4
Pre-Requisite : Nil
Co-Requisite : Nil
Anti-Requisite : Nil
Course Coordinator :
Course Instructors : Mr. Diganto Sahu
Instructors (Tutorials) : Mr. Diganto Sahu
Instructors (Practical) :
Instructors (S/R/O) :
COURSE OBJECTIVES (2-3):
1. To formulate simple algorithms for arithmetic and logical problems.
2. To test and execute the programs and correct syntax and logical errors.
COURSE OUTCOMES (3-5):
CO1 Understand computer system elements and a foundational comprehension of algorithms and programming.
CO2 Utilize branching and looping statements to address decision-making programming problems.
CO3 Apply homogeneous derived data types, heterogeneous data types, strings, and functions effectively for
programming tasks.
CO4 Demonstrate understanding of pointers and applying their concepts skillfully in programming scenarios.
CO5 Apply file handling concepts in C programming with competence, ensuring effective data management and
storage solutions.
COURSE DESCRIPTION:
This course is to teach students the basic of pure programming and problem solving. This course provides
students with a comprehensive study of the C programming language. The course emphasizes problem-
solving and empirical skills through the process of designing, implementing, and executing C programs.
TEXT BOOKS:
T1. E. Balaguruswamy, Programming in ANSI C, TataMcGraw-Hill.
T2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, PrenticeHall of India.
REFERENCE BOOKS:
R1. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
Course Plan: Problem Solving using C
Lecture Learning Topics to be Covered (From Reference BTL
No Outcomes Syllabus) Chap/Book
1-2 Introduction to Introduction to components of a Ch.1/T1 1, 2,
Programming, computer system: Disks, memory, 3
Computer processor, program storage and
Components execution, OS, compilers
3-4 Understanding Idea of Algorithm: Steps to solve Ch.1/T1 2, 3
Algorithms logical and numerical problems,
Representation: Flowchart/Pseudocode
with examples
5-6 Transition from From Algorithms to Programs: Source Ch.2/T1 2, 3,
Algorithms to Code code, variables (with data types), 4
memory locations, Syntax and Logical
Errors
7-8 Understanding Object and Executable Code Ch.2/T1 2, 3,
Compilation 4
9-11 Handling Arithmetic Expressions and Ch.3/T1 3, 4
Expressions and Precedence, Conditional Branching
Control Structures and Loops, Writing and evaluating
conditionals, loops
12-13 Working with Arrays: 1-D, 2-D Arrays, Character Ch.3/T1 3, 4,
Arrays Arrays, and Strings 5
14-16 Implementing Basic Basic Algorithms: Searching, Basic Ch.4/T1 4, 5
Algorithms Sorting Algorithms (Bubble, Insertion,
Selection), Finding roots of equations,
Pyramid
17-18 Understanding Functions: Using built-in libraries, Ch.5/T1 4, 5
Functions and Parameter Passing, Call by Value,
Recursion Recursion examples (Factorial,
Fibonacci, etc.)
19-21 Advanced Sorting Recursion Continued: Quick Sort or Ch.5/T1 4, 5,
Techniques Merge Sort 6
22-23 Working with Structures: Defining Structures, Array Ch.6/T1 4, 5
Structures of Structures
24-25 Introduction to Pointers: Defining Pointers, Self- Ch.6/T1 4, 5,
Pointers referential Structures, Linked Lists 6
(conceptual)
26-27 File Handling Introduction to File Handling, Ch.7/T1 4, 5,
Defining and Opening a File, Closing 6
a File, Input/Output, Error Handling
on Files
Evaluation Scheme:
Assessment Parameters Duration Original Scale down Total Scale
Procedure Weightage Weightage Down
(Marks)
Continuous Class Test 1 Sessional 1 90 Minutes
Assessment 30 10
Class Test 2/ Sessional 2 90 minutes 30 10
(40 Marks)
40
Quiz 15 minutes 10 5
Assignment 20 5
Presentation 3- 6 hours 20 5
Teacher Assessment / Attendance 10 5
Computer Based Exam on
SEE(60 Marks) 180 Minutes 60 60 60
Lab( MCQ + Descriptive)
Teaching Pedagogy: Smart Board, Power Point Presentations, Videos, Internet Resources, Student
Exercises, and Group Tasks for solving design problems.
Chamber Consultation Hour: To be announced in the class.
Notices: All notices concerning this course will be displayed on the Notice Board of Web Technology
Group and will also be available online at AdtU Portal.
Make-up Policy: Make-up is granted only for genuine cases with valid justification and prior
permissionfrom the Instructor-in-charge.
Instructor-in-charge
Mr. Diganto Sahu
