Basic Programming and Data Structure(c)

Course Title: Basic Programming and Data Structure (C) Credit: 3

Course No: BEDS 101 Number of period per week: 3
Nature of the Course: Theory Total hours: 45
Year: First, Semester: First
Level: B.E. Civil

1. Course Introduction
This course aims to provide introductory understanding of the various IT and programming tools used for
software development. The course will also help the student to enhance their logical and analytical skill ,
since learning to write a program is totally logical and analytical. The course will help them to increase
their problem solving skill. This course is an in-depth course designed to provide the basic concept of
computer programming. The course begins from the basic terminologies used in computer such as
definition of computer, input output devices, computer memories, Computer Programming and so on. The
course is expanded to different aspects of programming languages, such as machine language, Assembly
language, high level language, 4th generation language and so on.

2. Objectives
After successfully completing the course activities, the student will be able to:
Know the functionality (Hardware & software) of computer
Know the hardware and software architecture of computer
Write algorithm & draw the flowchart for any task and operation
Understand the importance of programming in engineering field.
Know the functioning of software company
Use different techniques to write a program
learn to use different control structures (conditional structure, loop control structure etc)
Learn the concept of Array, function, string, structure, pointer and file handling. These are the strong
features of c language.
Learn the concept and use of different data structures.

3. Specific Objectives and Contents
Specific Objectives Contents


To understand the basic
concept and functionalities of a
computer system.





Unit I: Computer Fundamentals (2)
Introduction, Characteristics of Computer, Application of
Computer, Basic Organization of Computer System, Input
Unit, Processing Unit, Storage Unit, Output Unit, Computer
Hardware, Computer Software, Types of Computer
Software.,

To develop the skill to solve a
problem using different tools.
Understand the use of
algorithm, flow chart and
pseudo code in programming.

Unit II: Program Designing Tools (2)
Algorithm, Advantages and Limitations of an Algorithm,
Sample Examples,
Flow Chart, Advantages and Limitations of a flowchart,
Symbols used in a flow chart, Sample Examples
Pseudo code, Advantages and Limitations of Pseudo code,
Sample Examples.
To be familiar with various
aspects of a programming
language such as syntax,
semantics, errors etc.
To gain the knowledge of
different language translators.

Unit III: Basic Concept of Programming Language (4)
Machine Language, Advantages and Limitation of Machine
Language
Assembly Language, Advantages and Limitations of
Assembly Language
High Level Language, Advantages and Limitations of High
Level Language, Examples of Different High Level
Languages (FORTRAN, COBOL, BASIC, PASCAL, C)
Syntax and Semantics of a Language, Source Program and
Object Program, Language Translators ( Compiler,
Assembler and Interpreter), Testing and Debugging a
Program, Program Design Techniques (Structured
Programming Concept and Modular Programming Concept),
Procedure Oriented Programming System (POPS) and Object
Oriented Programming System (OOPS), Compilation
Process, ASCII

To know the basic and essential
parts of C programming
Understand detail of data type
operators and statements
Understand to write simple
programs

Unit IV: C Fundamentals (6)
Character set of C, Variables, Constants, Identifiers, Rules
for Declaring an Identifier, Key words, Data types,
Enumerated Data type, typedef, typecasting, Delimeters,
Operator in C (Arithmetic, Assignment, Comma, Increment,
Decrement, Relational, Logical, address of, sizeof, ternary
operator), Hierarchy- Precedence and Associatively of
Operators
Statements( Executable and Non- Executable Statements),
Comments
Basic Structure of a C Program, Pre- processor Directive,
Input/ Output Functions, Format Specifiers, Field width
Specifiers, Escape Sequences
Programming Examples

To know the details of decision
making statements
Learn to handle the conditional
statements
To know the similarities and
differences between if and
switch statements
Unit V: Decision Control Structure (3)
Introduction, If statement, Nested if statement, if else
statement, nested if else statement, use of logical operators,
switch statements, comparison of if and switch statements,
Programming examples



Understand the details of
implementing loop in a
program
Understand the different types
of Loops

Unit VI: Loop Control Structure (4)
Introduction, Need of Looping, Types of Loop Statements
(for, while, do while), Nesting of Loops, Break and Continue
statement, Finite and infinite loops, Programming examples

Know about handling of arrays
and strings
Knowledge to group and handle
set of similar data














Know about handling of pointer
Know the importance of pointer
Know the relation of pointer to
array and string







Know about handling of
structures
Learn to group and handle set
of dissimilar data in C
programming




Unit VII: Arrays and Strings (5)
Introduction, Dimension of Array, 1D Array Declaration, 1D
Array Initialization, 1D Array input, 1D Array output
2D Array Declaration, 2D Array initialization, 2D Array
input/output
String, String initialization String input/output, String
Manipulation, 2D Array of String
Programming Examples


Unit VIII: Pointer (5)
Introduction, void pointer, null pointer, pointer constants,
pointer variable, pointer arithmetic, 1D array& pointer, 2D
array& pointer, pointer& strings, chain of pointer,
application of pointer
Programming examples

Unit IX: Structure and Union (3)
Introduction, Accessing members of structure variable,
Structure input/output, initializing a structure variable, array
of structure, nesting of structure, pointer of structure variable
Introduction to union
Programming examples



Know about handling of user
defined function
Learn about components of
function
Learn about call by value and
call by reference
Learn about recursion







Learn importance of file
Learn to write data to a file and
read data from a file





Learn fundamentals of data
structure


Unit X: Function (5)
Introduction, Components of a function program, function
definition, function call, function proto type, actual
arguments, formal arguments, return types, call by value, call
by reference, passing both value and address, passing 1D and
2D array to a function, passing structure to a function ,
recursion, macro, storage classes, advantages of using a
function
Programming examples

Unit XI: File Input Output (4)
Introduction, File pointer, opening a file, modes of opening
the file, file input/output operations, random access to a file
Programming examples
Unit XII: Introduction to Data Structures (2)
Introduction, need of a data structure, types of data
structures, over view of various data structures: array, stack,
queue, linked lists, tree, graphs
















Evaluation System
Undergraduate Programs
External
Evaluation
Marks Internal
Evaluation
Weight
age

Marks Practical Weight
age

Mark
End semester
examination




60
Assignments 20%



20
Practical
Record
copy
25%



20
(Details are given
in the separate table
at the end)
Quizzes 10% Viva
25%
Attendance 20% Practical
Exam

50%
Internal
Exams
50%
Total External 60 Total Internal 100% 20 100% 20
Full Marks 60+20+20 = 100

External evaluation
1. End semester examination:
It is a written examination at the end of the semester. The questions will be asked covering all the
units of the course. The question model, full marks, time and others will be as per the following
grid.
2. External Practical Evaluation:
After completing the end semester theoretical examination, practical examination will
be held. External examiner will conduct the practical examination according to the above
mentioned evaluation. There will be an internal examiner to assist the external examiner.
Three hours time will be given for the practical examination. In this examination Students
must demonstrate the knowledge of the subject matter.
Full Marks:
100, Pass Marks: 45, Time: 3 Hrs
Nature of question
Total
questions to
be asked
Total questions to
be answered
Total
marks
Weightage
Total marks
Group A:
multiple choice
20 20 201 = 20 20%
12.0
Group B:
Short answer type questions
8 6 68 = 48 48%
28.8
Group C:
Long answer type question/long
menu driven programs
3 2 216 =32 32%
19.2

100 100%
60.0
3. Internal evaluation
Assignment: Each student must submit the assignment individually. The stipulated time for submission
of the assignment will be seriously taken.
Quizzes: Unannounced and announced quizzes/tests will be taken by the respective subject teachers.
Such quizzes/tests will be conducted twice per semester. The students will be evaluated accordingly.
Attendance in class: Students should regularly attend and participate in class discussion. Eighty percent
class attendance is mandatory for the students to enable them to appear in the end semester examination.
Below 80% attendance in the class will signify NOT QUALIFIED (NQ) to attend the end semester
examination.
Presentation: Students will be divided into groups and each group will be provided with a topic for
presentation. It will be evaluated individually as well as group-wise. Individual students have to make
presentations on the given topics.
Mid-term examination: It is a written examination and the questions will be asked covering all the
topics in the session of the course.
Discussion and participation: Students will be evaluated on the basis of their active participation in the
classroom discussions.
Instructional Techniques: All topics are discussed with emphasis on real-world application. List of
instructional techniques is as follows:
Lecture and Discussion
Group work and Individual work
Assignments
Presentation by Students
Quizzes
Guest Lecture
Students are advised to attend all the classes and complete all the assignments within the specified time
period. If a student does not attend the class(es), it is his/her sole responsibility to cover the topic(s)
taught during that period.
Prescribed Text
Programming in C: V Rajaraman, PHI Publication, 2009 Edition
Programming in C: E Balagurusamy, Tata Mc-Graw Hill Publication, 6th Edition
A Text Book of C Programming: Karn & Mahato, Bench Mark Publication, 1
st
Edition

Reference
Data Structure using C: Aaron M. Tenenbaum, Yediclyah Langsam, Augenstein, Pearson
Education Publication, 7
th
Edition 2009
Let us C: Yeswant Kanetkar, BPB Publication
Programming with C: Byron S Gottfried, Tata Mc-Graw Hill Publication, 3
rd
Edition
A book on C: A L Kelley, Ira Pohl, Pearson Education Publication, 4
th
Edition
Course Title: Basic Programming and Data Structure Practical
Course No: B.Sc.CS CHM Pr.101
Nature of the Course: Practical
Year: First, Semester: First
Level: BE Civil

Objectives:
By the end of the course the student should be able to:
Write simple and complex programs
Develop application programs
Know the syntax and semantics of C language
Identify and eliminate the syntax and semantic errors
Effectively use concept of decision control structure
Effectively use concept of loop control structure
Effectively use concept of arrays and strings
Effectively use concept of pointers
Effectively use concept of structure
Effectively use concept of function
Effectively use concept of file I/O

Laboratory Works:
Sufficient programming examples from each of specified chapters


Note:
Student must perform 6 Hours of lab work (2 Hours x 3 times or 3 Hours x 2 times) every week
The practical exam will be graded on the basis of the following marking scheme:

In-Semester Evaluation (Note copy) 25%
Final Exam Written 50 %
Final Exam Oral 25 %
Books:
Programming in C: V Rajaraman, PHI Publication
Programming in C: E Balagurusamy, Tata Mc-Graw Hill Publication, 6th Edition
A Text Book of C Programming: Karn & Mahato, Bench Mark Publication, 1
st
Edition


Credit: 1
Total hours: 15