Computer Programming Course Description[1]

8/3/2019 Computer Programming Course Description[1]

1/7

VARDHAMAN COLLEGE OF ENGINEERING(Autonomous)

Shamshabad, Hyderabad 501 218

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic year 2011-2012

COURSE DESCRIPTION

Course Code : ACS11T01

Course Title : COMPUTER PROGRAMMING

Course Structure :Lectur

esTutoria

lsPractic

alsCredits

4 - - 4

Course Coordinator : Prof L V Narasimha Prasad, Professor and Head

Team of Instructors :V Srinivas, C Satya Kumar, K S Niraja, B Ramana Reddy,N Ramya Tulasi

I. Course Overview:

The course helps the students to solve Engineering problems and implementation of projectsthrough computer programming. The course also helps the students to write selection testand face interviews for software jobs. The Course is important because most of theapplication and system software are developed and are being developed in C programminglanguage. Thorough knowledge of the language is essential for software professional career.

The learning approach of the course is each feature and syntax of the language will beexplained through one or more examples. This is implemented by making the student writethe programs to solve Mathematical, Engineering and simple data processing problems. Thecourse is implemented through lecture, tutorial and laboratory sessions

II. Prerequisite(s):

Level Credits Periods / Week Prerequisites

UG 4 4Mathematical

background andLogical Thinking

III. Marks Distribution:

Sessional Marks

University EndExamMarks

TotalMarks

There shall be 2 midterm examinations. Each midterm

examination consists of subjective test. The subjective test isfor 20 marks, with duration of 2 hours. Subjective test of eachsemester shall contain 5 one mark compulsory questions inpart-A and part-B contains 5 questions, the student has toanswer 3 questions, each carrying 5 marks.First midterm examination shall be conducted for the first twoand half units of syllabus and second midterm examinationshall be conducted for the remaining portion.Five marks are earmarked for assignments. There shall betwo assignments in every theory course. Marks shall beawarded considering the average of two assignments in eachcourse.

75 100


2/7

IV. Evaluation Scheme:

V. Course

Educational Objectives:

I. To make students capable of programming in high level computerlanguages as well as applications and to give the basic idea aboutprogramming.

II. Enumerate the scope of validity of variables and functions in C; explain

the operations and data manipulation in a C code fragment including pointermanipulation and describe how the pointer mechanism in C works and itsrelation with other programming language.

III. To make the students learn various features of the language and tofamiliarize the students with the large number of built-in functions available inthe language.

IV. To teach the student how to analyze the problem and write programfor a given algorithm.

V. To inculcate in students professional and ethical attitude,multidisciplinary approach and an ability to relate Computer programmingissues to broader application context.

VI. Course Outcomes:

A. Demonstrate an understanding of computer programming language concepts.

B. Demonstrate an understanding of the major programming domains and theknowledge of the most appropriate computer programming language for eachdomain.

C. To be able to develop C programs on at least two platforms.D. Demonstrate an understanding of ethical and legal issues for computing

professionals and the impact of computing technology in society.

E. Able to implement the algorithms and draw flowcharts for solvingMathematical and small Engineering problems.

F. Graduate will demonstrate an ability to design and develop Computerprograms, analyze, and interpret the concept of pointers, declarations,initialization, operations on pointers and their usage.

G. Graduates must be able to define structure data types and use them in simpledata processing applications also he/she must be able to use the concept ofarray of structures. Student must be able to define union and enumerationuser defined data types.

H. Graduates will able to demonstrate an ability to visualize and work onlaboratory and multidisciplinary tasks like Graphics and real time applications.

I. Graduate will able to learn opening of data files and learn input/ output of filedata. Also he must learn to write programs for reading, writing and appendingdata to sequential data Files.

J. Graduate will develop confidence for self education and ability for life-longlearning needed for Computer language.

S.No

Component DateDuratio

n(hours)

Marks

1I Mid Examination 28-10-

20112 20

2I Assignment 22-10-

2011- 05

3 II MidExamination

29-12-2011

2 20

4II Assignment 24-12-

2011- 05

5ExternalExamination

18-01-2012

3 75

Total 100


3/7

VII. How Course Outcomes are assessed:

OutcomeLevel

Proficiencyassessed

by

A An ability to apply knowledge of computing,mathematical foundations, algorithmic principles, andcomputer science and engineering theory in themodeling and design of computer based systems to

real-world problems.

H --

B An ability to design and conduct experiments, as wellas to analyze and interpret data.

H --

C An ability to design, implement, and evaluate acomputer-based system, process, component, orprogram to meet desired needs, within realisticconstraints such as economic, environmental, social,political, health and safety, manufacturability, andsustainability.

SAssignments, Tutorials,

Exams

D An ability to function effectively on multi-disciplinaryteams.

S --

E An ability to analyze a problem, and identify, formulateand use the appropriate computing and engineering

requirements for obtaining its solution.

HAssignments

, ExamsF An understanding of professional, ethical, legal,

security and social issues and responsibilities.N --

G An ability to communicate effectively, both in writingand orally.

S --

H The broad education necessary to analyze the local andglobal impact of computing and engineering solutionson individuals, organizations, and society.

H --

I Recognition of the need for, and an ability to engage incontinuing professional development and life-longlearning.

S Exams

Knowledge of contemporary issues. S --

K An ability to use current techniques, skills, and toolsnecessary for computing and engineering practice. H Lab, Exams

L An ability to apply design and development principlesin the construction of software and hardware systemsof varying complexity.

S --

M An ability to recognize the importance of professionaldevelopment by pursuing postgraduate studies or facecompetitive examinations that offer challenging andrewarding careers in computing.

N --


4/7

N = None S = Supportive H = Highly Related

VIII. Syllabus:

UNIT I

INTRODUCTION TO COMPUTERS: Introduction to computers, computer systems,computing environments, computer languages, creating and running programmes,software development method, algorithms, pseudo code, flow charts, applying thesoftware development method.

INTRODUCTION TO C LANGUAGE: Basic structures of C language, C tokens,

data types and sizes, declaration of variables, assigning values

OPERATORS AND EXPRESSIONS: Statements, arithmetic, relational and logicaloperators, increment and decrement operators, conditional operator, bitwiseoperators, type conversions, expressions and evaluation, input and outputstatements, sample programs.

UNIT IICONTROL STATEMENTS: If and switch statements, while, do while and forstatements, sample programs.

FUNCTIONS: Defining and accessing, passing arguments, function prototypes,library functions, static functions, user defined functions, recursive functions,

variables and storage classes, scope rules, block structure, header files, C


5/7

preprocessor, example C programs.

ARRAYS: Defining and processing, one dimensional and two dimensional arrays,initialization, passing arrays to a function, multi dimensional arrays, command linearguments.

UNIT IIISTRINGS: Defining and operations on strings, string variables declaration,reading, writing. Basics of functions, parameter passing, string handling functions.

POINTERS: Basic Concepts, pointer to pointer, passing pointers to a function,operations on pointers, pointer arithmetic, pointers and arrays, arrays of pointers,function pointers, dynamic memory allocation.

UNIT IVSTRUCTURES AND UNIONS: Structure definition, initializing, assigning values,passing of structures as arguments, array of structures, pointers to structures, selfreference to structures, unions, typedef, bit fields, sample programs.

UNIT VCONSOLE AND FILE I/O: File, types of files, file vs. console, file structure, fileattributes, file operations, standard I/O, formatted I/O, sample programs.

IX. List of Text Books / References / Websites / Journals / Others

Text Books:1. B. A. Fouruzan and R. F. Gilberg (2006), Computer Science: A structured

programming approach using C, 3rd Edition, Thomson Publications, New Delhi.2. Yashawanth Kanethkar (2008), Let us C, 8th Edition, Jones & Bartlett

Publishers, India.

Reference Books:1. Herbert Schildt (2000), C: The Complete Reference, 4th Edition, New Delhi,

Osborne Mc Graw Hill.2. B. W. Kerninghan and Dennis M. Ritche (1988), TheC Programming Language,

2nd

Edition, Prentice Hall Software Series, India.3. Stephen G.Kochan (2004), Programming in C, 3rd Edition, Pearson Education

Private Limited.

X. Course Plan:The course plan is meant as a guideline. There may probably bechanges.

Lecture

No.

Learning Objective Topics to be coveredReferenc

e

1-2Must know how to create and run theprograms

Introduction to computers,computer systems, computingenvironments, computerlanguages, creating and runningprogrammes

T1: 1.1 -1.4

3 To understand the Design ofAlgorithm

software development method,algorithms, pseudo code

T1: 1.5

4 To understand to Drawing ofFlowchart

flow charts, applying the softwaredevelopment method

T1: 1.6

5Design of Algorithm and flowchart forDecision making problems

introduction to c language T1: 2


6/7

6Must remember the character set,tokens, keywords and syntax ofidentifiers in C language

Basic structures of C language, C

tokensT1: 3

7

Must remember the data types andtheir usage

data types and sizes, declarationof variables, assigning values,Statements

T1: 2.4-2.5

8-10

Must know the precedence &associativity of operators & their

application in writing expressions

arithmetic, relational and logicaloperators

increment and decrementoperatorsconditional operator, bitwiseoperatorstype conversions, expressions andevaluation, sample programs

R3: 12

11-13

Apply the formatted I/O functionsscanf & printf for data input andoutput.

input and output statements T1: 2.7

14-17

Must know different forms of if andtheir usage in writing decision makingprograms

If and switch statementsT1: 5.2 -5.3

18-24

Must know the Syntax of switch-caseSyntax of for, while & do-while loops While, do while and for

statements, sample programsT1: 6.5

25-28Must know how to write the functions

FUNCTIONS: Defining andaccessing, passing arguments,function prototypes, libraryfunctions, static functions

T2: 5

29Must know the knowledge of howwrite user defined functions

user defined functions T1: 7.3

29 Must know the scope rules scope rules T1: 7.6

30 variables and storage classes T1: 7.7

31 Must know the recursive functions recursive functions T1: 7.9

32 block structure

32 Understand the C preprocessor header files, C preprocessor T1: 7.10

33Must know the need of I-Dimensionalarrays & initialization

ARRAYS: Defining andprocessing, one dimensionalarrays

T1: 8.1-8.4

34-35Must know to write program to sortnumeric data using Bubble sort

two dimensional arrays:initialization, passing arrays to afunction

T1: 8.5

36Must know the need of II-Dimensionalarrays & initialization multi dimensional arrays T1: 8.6

37Must know how to give the inputthrough the command line

command line argumentsT1: 10.8

38-39

Understand the string basic concepts STRINGS: Defining andoperations on strings, stringvariables declaration, reading,writing.

T1:11.1-11.2

40Must know the string handlingfunctions

Basics of functions, parameterpassing, string handling functions.

T1:11.3-11.5

41Must know the basic concepts ofpointer

POINTERS: Basic Concepts T1: 9.1


7/7

48-54

Must know to write a studentstructure with heterogeneous datatypes.

STRUCTURES: Structuredefinition, initializing, assigningvalues, passing of structures asarguments, arrays of structures,pointers to structures, selfreference to structures

T1: 12.3

55 Typedef T1: 12.1

56 Understand the unions basics UNIONS: unions T1: 12.4

57 Bit fields, sample programs. R3: 12

58 CONSOLE AND FILE I/O: Files T1: 13.1

59-63Must know how to create a file, howto read and write the data from / intoa file.

types of files, file vs. console, filestructure, file attributes, fileoperations, sample programs.

R3: 16

64 standard I/O T1: 13.3

65Must know the formatted I/Ooperations

formatted I/O T1: 13.4

Prepared By : Prof L V Narasimha Prasad, Professor & Head,Department of CSE

Date : 25 August, 2011

Computer Programming Course Description[1]

Documents

Transcript of Computer Programming Course Description[1]