Vous êtes sur la page 1sur 7

VARDHAMAN COLLEGE OF ENGINEERING

(Autonomous)
Shamshabad, Hyderabad 501 218

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Academic year 2011-2012 COURSE DESCRIPTION
Course Code Course Title Course Structure : ACS11T01 : COMPUTER PROGRAMMING
:

Lectur es 4

Tutoria ls -

Practic als -

Credits 4

Course Coordinator Team of Instructors I.

: Prof L V Narasimha Prasad, Professor and Head : V Srinivas, C Satya Kumar, K S Niraja, B Ramana Reddy, N Ramya Tulasi

Course Overview:

The course helps the students to solve Engineering problems and implementation of projects through computer programming. The course also helps the students to write selection test and face interviews for software jobs. The Course is important because most of the application and system software are developed and are being developed in C programming language. 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 be explained through one or more examples. This is implemented by making the student write the programs to solve Mathematical, Engineering and simple data processing problems. The course is implemented through lecture, tutorial and laboratory sessions II. Prerequisite(s): Level UG III. Marks Distribution: Universit y End Exam Marks Total Marks Credits 4 Periods / Week 4 Prerequisites Mathematical background and Logical Thinking

Sessional Marks There shall be 2 midterm examinations. Each midterm examination consists of subjective test. The subjective test is for 20 marks, with duration of 2 hours. Subjective test of each semester shall contain 5 one mark compulsory questions in part-A and part-B contains 5 questions, the student has to answer 3 questions, each carrying 5 marks. First midterm examination shall be conducted for the first two and half units of syllabus and second midterm examination shall be conducted for the remaining portion. Five marks are earmarked for assignments. There shall be two assignments in every theory course. Marks shall be awarded considering the average of two assignments in each course.

75

100

IV.

Evaluation Scheme: S.N o 1 2 3 Component I Mid Examination I Assignment II Mid Examination II Assignment External Examination Date 28-102011 22-102011 29-122011 24-122011 18-012012 Duratio n (hours) 2 2 3 Total Educational Objectives: Marks 20 05 20 05 75 100

V.

Course

4 5

I.

To make students capable of programming in high level computer languages as well as applications and to give the basic idea about programming. II. Enumerate the scope of validity of variables and functions in C; explain the operations and data manipulation in a C code fragment including pointer manipulation and describe how the pointer mechanism in C works and its relation with other programming language. III. To make the students learn various features of the language and to familiarize the students with the large number of built-in functions available in the language. IV. To teach the student how to analyze the problem and write program for a given algorithm. V. To inculcate in students professional and ethical attitude, multidisciplinary approach and an ability to relate Computer programming issues to broader application context. VI. Course Outcomes:

A. B. C.
D.

E.
F. G.

H. I. J.

Demonstrate an understanding of computer programming language concepts. Demonstrate an understanding of the major programming domains and the knowledge of the most appropriate computer programming language for each domain. To be able to develop C programs on at least two platforms. Demonstrate an understanding of ethical and legal issues for computing professionals and the impact of computing technology in society. Able to implement the algorithms and draw flowcharts for solving Mathematical and small Engineering problems. Graduate will demonstrate an ability to design and develop Computer programs, analyze, and interpret the concept of pointers, declarations, initialization, operations on pointers and their usage. Graduates must be able to define structure data types and use them in simple data processing applications also he/she must be able to use the concept of array of structures. Student must be able to define union and enumeration user defined data types. Graduates will able to demonstrate an ability to visualize and work on laboratory and multidisciplinary tasks like Graphics and real time applications. Graduate will able to learn opening of data files and learn input/ output of file data. Also he must learn to write programs for reading, writing and appending data to sequential data Files. Graduate will develop confidence for self education and ability for life-long learning needed for Computer language.

VII.

How Course Outcomes are assessed: Outcome A An ability to apply knowledge of computing, mathematical foundations, algorithmic principles, and computer science and engineering theory in the modeling and design of computer based systems to real-world problems. An ability to design and conduct experiments, as well as to analyze and interpret data. An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs, within realistic constraints such as economic, environmental, social, political, health and safety, manufacturability, and sustainability. An ability to function effectively on multi-disciplinary teams. An ability to analyze a problem, and identify, formulate and use the appropriate computing and engineering requirements for obtaining its solution. An understanding of professional, ethical, legal, security and social issues and responsibilities. An ability to communicate effectively, both in writing and orally. The broad education necessary to analyze the local and global impact of computing and engineering solutions on individuals, organizations, and society. Recognition of the need for, and an ability to engage in continuing professional development and life-long learning. Knowledge of contemporary issues. An ability to use current techniques, skills, and tools necessary for computing and engineering practice. An ability to apply design and development principles in the construction of software and hardware systems of varying complexity. An ability to recognize the importance of professional development by pursuing postgraduate studies or face competitive examinations that offer challenging and rewarding careers in computing. Lev el Proficiency assessed by --

B C

-Assignments , Tutorials, Exams -Assignments , Exams ---Exams -Lab, Exams --

D E F G H I

S H N S H S S H S

K L M

--

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 the software 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 logical operators, increment and decrement operators, conditional operator, bitwise operators, type conversions, expressions and evaluation, input and output statements, sample programs. UNIT II CONTROL STATEMENTS: If and switch statements, while, do while and for statements, 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

preprocessor, example C programs. ARRAYS: Defining and processing, one dimensional and two dimensional arrays, initialization, passing arrays to a function, multi dimensional arrays, command line arguments. UNIT III STRINGS: 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 IV STRUCTURES AND UNIONS: Structure definition, initializing, assigning values, passing of structures as arguments, array of structures, pointers to structures, self reference to structures, unions, typedef, bit fields, sample programs. UNIT V CONSOLE AND FILE I/O: File, types of files, file vs. console, file structure, file attributes, 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), The C Programming Language, 2nd Edition, Prentice Hall Software Series, India. 3. Stephen G.Kochan (2004), Programming in C, 3rd Edition, Pearson Education Private Limited.

X.
Lectu re No. 1-2

Course Plan: The course plan is meant as a guideline. There may probably be changes. Learning Objective Topics to be covered Introduction to computers, computer systems, computing environments, computer languages, creating and running programmes software development method, algorithms, pseudo code flow charts, applying the software development method introduction to c language Referenc e T1: 1.1 1.4

Must know how to create and run the programs To understand Algorithm the Design of

3 4 5

T1: 1.5 T1: 1.6 T1: 2

To understand to Drawing of Flowchart Design of Algorithm and flowchart for Decision making problems

Must remember the character set, tokens, keywords and syntax of identifiers in C language Must remember the data types and their usage Must know the precedence & associativity of operators & their application in writing expressions

Basic structures of C language, C tokens data types and sizes, declaration of variables, assigning values, Statements arithmetic, relational and logical operators increment and decrement operators conditional operator, bitwise operators type conversions, expressions and evaluation, sample programs input and output statements

T1: 3 T1: -2.5 2.4

8-10

R3: 12

11-13

Apply the formatted I/O functions scanf & printf for data input and output. Must know different forms of if and their usage in writing decision making programs Must know the Syntax of switch-case Syntax of for, while & do-while loops

T1: 2.7

14-17

If and switch statements

T1: 5.2 5.3

18-24

While, do while and for statements, sample programs FUNCTIONS: Defining and accessing, passing arguments, function prototypes, library functions, static functions user defined functions scope rules variables and storage classes

T1: 6.5

25-28 29 29 30 31 32 32 33 34-35 36 37 38-39 40 41

Must know how to write the functions Must know the knowledge of how write user defined functions Must know the scope rules

T2: 5 T1: 7.3 T1: 7.6 T1: 7.7 T1: 7.9

Must know the recursive functions

recursive functions block structure

Understand the C preprocessor Must know the need of I-Dimensional arrays & initialization Must know to write program to sort numeric data using Bubble sort Must know the need of II-Dimensional arrays & initialization Must know how to give the input through the command line Understand the string basic concepts

header files, C preprocessor ARRAYS: Defining and processing, one dimensional arrays two dimensional arrays: initialization, passing arrays to a function multi dimensional arrays command line arguments STRINGS: Defining and operations on strings, string variables declaration, reading, writing. Basics of functions, parameter passing, string handling functions. POINTERS: Basic Concepts

T1: 7.10 T1: -8.4 8.1

T1: 8.5 T1: 8.6 T1: 10.8 T1:11.111.2 T1:11.311.5 T1: 9.1

Must know the string handling functions Must know the basic concepts of pointer

48-54

Must know to write a student structure with heterogeneous data types.

STRUCTURES: Structure definition, initializing, assigning values, passing of structures as arguments, arrays of structures, pointers to structures, self reference to structures Typedef

T1: 12.3

55 56 57 58 59-63 64 65 Must know operations the formatted I/O Must know how to create a file, how to read and write the data from / into a file. Understand the unions basics

T1: 12.1 T1: 12.4 R3: 12 T1: 13.1 R3: 16 T1: 13.3 T1: 13.4

UNIONS: unions Bit fields, sample programs. CONSOLE AND FILE I/O: Files types of files, file vs. console, file structure, file attributes, file operations, sample programs. standard I/O formatted I/O

Prepared By Department of CSE Date :

Prof L V Narasimha Prasad, Professor

& Head,

25 August, 2011