KEMBAR78
Programming and Data Structures-Revised | PDF | C (Programming Language) | Computer Programming
0% found this document useful (0 votes)
25 views3 pages

Programming and Data Structures-Revised

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views3 pages

Programming and Data Structures-Revised

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

CS XXX Programming and Data Structures

L-T-P-C
2 -0 -2 -3

UG Semester –I: CE, ME, EE


UG Semester –II: CSE, ECE, EIE Pre-requisites: NIL

Course Objectives:
1. To learn the fundamentals of computers.
2. To understand the various steps in program development.
3. To learn the syntax and semantics of the C programming language.
4. To learn the usage of structured programming approaches in solving problems.
5. To analyse the output based on the given input variables.
6. To learn the uses of data type and data structures in solving real world computing
problems.

Course Contents:

Module 1 (Introduction): Basic operations of digital computers, basic concepts of integer and
floating point number representation, algorithm and efficiency.

Module 2 (Elements of C Programming): Data types, variables, operators, expression and


assignment statements, conditional and branch statements, loops and iteration statements, one-
dimensional arrays, functions and parameter passing, recursions, and strings.

Module 3 (Linear Data Structures): Two-dimensional arrays, stacks, and queues.

Module 4 (Searching and Sorting): Linear and binary search, bubble sort, quick sort and radix sort.

Topics for Practical/Assignments

1. Data types, constants, variables, and operators


2. Conditional and branch statements
3. Loops and iteration statements
4. One-dimensional arrays
5. Two-dimensional arrays
6. Functions
7. Recursion
8. Stacks
9. Queues
10. Searching and sorting

Text Books and Reference:


1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of
India.
2. Stephen Prata, C Primer Plus, Fifth Edition, Sams Publisher.
3. K N King, C Programming: A modern approach, 2nd Edition
4. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill.
5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction
to Algorithms, Fourth Edition, The MIT Press.
6. Narasimha Karumanchi, Data Structures and Algorithms Made Easy: Data Structures and
Algorithmic Puzzles, Gift Edition, CareerMonk Publications

Course Outcomes (CO):


1. To learn the syntax and semantics of the C programming language.
2. To test and execute the programs and correct syntax and logical errors.
3. To implement conditional branching, iteration and recursion.
4. To use basic data-structures (arrays, stacks, and queues) to formulate algorithms and
programs.
5. To understand and analyse different searching sorting techniques.

CO-PO mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO
1 ✔ ✔ ✔ ✔
CO
2 ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔
CO
3 ✔ ✔ ✔ ✔ ✔ ✔ ✔
CO
4 ✔ ✔ ✔ ✔ ✔
CO
5 ✔ ✔ ✔ ✔ ✔ ✔

The student will learn following through Practicals:


● To formulate the algorithms for simple problems.

● To translate given algorithms to a working and correct program.

● To be able to correct syntax errors as reported by the compilers.

● To be able to identify and correct logical errors encountered at run time.

● To be able to write iterative as well as recursive programs.

● To be able to represent data in arrays, strings and structures and manipulate them
through a program.
● To be able to declare pointers of different types and use them in defining self-
referential structures.

PO 1. Ability to apply knowledge of computing, mathematics, science and engineering


fundamentals to the solution of complex engineering problems.
PO 2. Ability to formulate and analyze a problem, and define the computing requirements
appropriate to its solution using basic principles of mathematics, science and computer
engineering.
PO 3. Ability to design, implement, and evaluate a computer based system, process,
component, or software to meet the desired needs.
PO 4. Ability to design and conduct research based experiments, perform analysis and
interpretation of data and provide valid conclusions.
PO 5. Ability to use current techniques, skills, and tools necessary for computing practice.
PO 6. Understanding of legal, health, security, cultural and social issues, and thereby ones
responsibility in their application in Professional Engineering practice.
PO 7. Understanding of the impact of professional engineering solutions on environmental
context and the need for sustainable development.
PO 8. Understanding and commitment towards the professional and ethical responsibilities of
an engineer.
PO 9. Ability to function effectively as an individual, and as a team member/leader in
accomplishing a common goal.
PO 10. Ability to communicate effectively, make effective presentations and write and
comprehend technical reports and publications.
PO 11. Ability to learn and adopt new technologies, and use them effectively towards
continued professional development throughout the life.
PO 12. Understanding of engineering and management principles and their application to
manage projects in the software industry.

You might also like