BHARATHIDASAN COLLEGE OF ARTS & SCIENCE, ERODE

DEPARTMENT OF INFORMATION TECHNOLOGY

SUBJECT NAME: Introduction to Information Technology and Programming in C

Unit: 1 Fundamental of Computers & Problem Solving in C

Fundamentals of Computers: Introduction – History of Computers-Generations of

ComputersClassification of Computers-Basic Anatomy of a Computer System-Input Devices-
Processor-Output Devices-Memory Management – Types of Software- Overview of
Operating System-Programming Languages- Programs-Problem Solving Techniques- IT
Applications.

Unit 2:Overview of C

Overview of C - Introduction - Character set - C tokens - keyword & Identifiers - Constants –

Variables - Data types – Defining Symbolic Constants - Arithmetic, Relational, Logical,
Assignment, Conditional, Bitwise, Special, Increment and Decrement operators-Arithmetic
Expressions-Evaluation of expression precedence of arithmetic operators - Type conversion
in expression - Mathematical functions - Reading & Writing a character - Formatted input
and output.

Unit 3: Decision Making,Looping and Arrays

Decision Making and Branching: Introduction – if, if….else, nesting of if …else statements-
else if ladder – The switch statement, The ?: Operator – The goto Statement. Decision
Making and Looping: Introduction- The while statement- the do statement – the for
statement-jumps in loops. Arrays– Character Arrays and Strings.

Unit 4: User-Defined Functions, Structures and Unions

User-Defined Functions: Introduction–Need and Elements of User-Defined Functions –Definition

Return Values and their types-Function Calls–Declarations–Category of Functions-Nesting of
Functions-Recursion–Passing Arrays and Strings to Functions-The Scope,Visibility and Lifetime
of Variables-Multifile Programs. Structures and Unions.

Unit 5: Advanced Concepts in C

Pointers: Basics – Pointer Arithmetic – Pointers with Arrays, Strings, Structures – Functions
and Pointers – Array of Pointers. Dynamic Memory Allocation: malloc(), calloc(), realloc(),
free() – Memory Management. File Management in C- Defining and Opening a File - Closing
the File – Input and Output Operations on Files – Sample Programs.

TextBook(s)
1 E Balagurusamy: Computing Fundamentals & C Programming – Tata Mc Graw-Hill,
Second Reprint 2008.

ReferenceBooks

1 Ashok NKamthane: Programming with ANSI and Turbo C,Pearson, 2002.

2 Henry Mullish & Hubert L.Cooper:The Sprit of C, Jaico,1996.

3.A TextBook Of Information Technology,S.Chand &Company Ltd First Edition 2003.

BHARATHIDASAN COLLEGE OF ARTS AND SCIENCE

DEPARTMENT OF INFORMATION TECHNOLOGY
Staff Name : Ms.S.SATHYA
Class : I -BCA
Subject Code : 13P
 Subject Name: Core Lab 1: Programming Lab–C
Marks : 100(40+60)
Total Hours : 24Hrs
1.Write a C program to sort the given set of numbers in ascending order.
2.Write a C program to check whether the given string is a palindrome or not using pointers.
3.Write a C program to count the number of Vowels in the given sentence.
4.Write a C program to find the factorial of a given number using a recursive function.
5.Write a C program to print the students Mark sheet assuming roll no, name, and marks in 5
subjects in a structure. Create an array of structures and print the mark sheet in the university
pattern.
6.Write a function using pointers to add two matrices and to return the resultant matrix to the
calling function.
7. Write a C program which receives two file names as arguments and check whether the file
contents are same or not.If same delete the second file
8.Write a program which takes a file as command line argument and copy it to another file.At
the end of the second file write the total i) no of chars ii) no. of words and iii)no. of lines.
TEXT BOOKS:
1. E Balagurusamy: Computing Fundamentals & C Programming – Tata McGraw-Hill,
Second Edition
REFERENCE BOOKS:
1. Ashok N Kamthane: Programming with ANSI and Turbo C,Pearson, 2002.
2. Henry Mullish & Hubert L.Cooper: The Spirit of C, Jaico,1996

BHARATHIDASAN COLLEGE OF ARTS & SCIENCE, ERODE

DEPARTMENT OF INFORMATION TECHNOLOGY

STAFF NAME :S.SATHYA

CLASS: II-BSC IT
SUBJECT NAME : Core - Data Structures

TOTAL HOURS:75

MARKS :(25+75)100

Unit:1 INTRODUCTION 15hours

Introduction of Algorithms, Analysing Algorithms. Arrays: Sparse Matrices - Representation

of Arrays. Stacks and Queues. Fundamentals - Evaluation of Expression Infix to Postfix
Conversion - Multiple Stacks and Queues

Unit:2 LINKED LIST 12 hours

Linked List: Singly Linked List - Linked Stacks and Queues - Polynomial Addition- More on
Linked Lists - Sparse Matrices - Doubly Linked List and Dynamic – Storage Management -
Garbage Collection and Compaction.

Unit:3 TREES 15 hours

Basic Terminology - Binary Trees - Binary Tree Representations – Binary Trees-Traversal-

More On Binary Trees – Threaded Binary Trees - Binary Tree. Representation of Trees -
Counting Binary Trees. Graphs: Terminology and Representations -Traversals, Connected
Components and Spanning Trees, Shortest Paths and Transitive Closure

Unit:4 EXTERNAL SORTING 15 hours

Storage Devices -Sorting with Disks: K-Way Merging – Sorting with Tapes Symbol Tables:
Static Tree Tables - Dynamic Tree Tables - Hash Tables: Hashing Functions - Overflow
Handling.

Unit:5 INTERNAL SORTING 15hours

Insertion Sort - Quick Sort - 2 Way Merge Sort - Heap Sort – Shell Sort - Sorting on Several
Keys. Files: Files, Queries and Sequential organizations – Index Techniques -File
Organizations.

Unit:6 Contemporary Issues 3 hours

Expert lectures, online seminars - webinars Total Lecture hours

Text Book(s)

1 Ellis Horowitz, Sartaj Shani, Data Structures, Galgotia Publication.

 Ellis Horowitz, Sartaj Shani, Sanguthevar Rajasekaran, Computer Algorithms, Galgotia
Publication.

3 S.Lovelyn Rose, R.Venkatesan, Data Structures, Wiley India Private Limited,2015, 1 st

Edition.

Reference Books

1 Jean-Paul,Tremblay & Paul G.Sorenson , An Introduction to Data structures with

Applications Tata McGraw Hill Company 2008, 2ndEdition.

2 Samanta.D , Classic Data Structure Prentice Hall of India Pvt Ltd 2007, 9 th Edition

3 Seymour Lipschutz, Data Structures McGraw Hill Publications, 2014, 1st Edition

BHARATHIDASAN COLLEGE OF ARTS & SCIENCE, ERODE

DEPARTMENT OF INFORMATION TECHNOLOGY
STAFF NAME : S.SATHYA
CLASS : III-BSC-IT
SUBJECT NAME : CORE -RDBMS AND ORACLE
TOTAL HOURS : 75 hours
MARKS : 50+ 50 TOTAL 100

Unit:1DATABASE CONCEPTS 15 hours

Database Concepts: A Relational approach: Database – Relationships – DBMS –

Relational Data Model – Integrity Rules – Theoretical Relational Languages. Database
Design: Data Modeling and Normalization: Data Modeling – Dependency – Database
Design – Normal forms – Dependency Diagrams – De -normalization – Another
Example of Normalization.

Unit:2 ORACLE9i 15hours

Oracle9i: Overview: Personal Databases – Client/Server Databases – Oracle9i an
introduction – SQL *Plus Environment – SQL – Logging into SQL *Plus - SQL *Plus
Commands – Errors & Help – Alternate Text Editors - SQL *Plus Worksheet - iSQL
*Plus. Oracle Tables: DDL: Naming Rules and conventions – Data Types – Constraints –
Creating Oracle Table – Displaying Table Information – Altering an Existing Table –
Dropping, Renaming, Truncating Table – Table Types– Spooling – Error codes.

Unit 3: WORKING WITH TABLE 15 hours

Working with Table: Data Management and Retrieval: DML – adding a new
Row/Record –Customized Prompts – Updating and Deleting an Existing Rows/Records –
retrieving Data from Table – Arithmetic Operations – restricting Data with WHERE
clause – Sorting – Revisiting Substitution Variables – DEFINE command – CASE
structure. Functions and Grouping: Built-in functions –Grouping Data. Multiple Tables:
Joins and Set operations: Join – Set operations.

Unit 4: PL/SQL 15 hours

PL/SQL: A Programming Language: History – Fundamentals – Block Structure –
Comments – Data Types – Other Data Types – Declaration – Assignment operation –
Bind variables – Substitution Variables – Printing – Arithmetic Operators. Control
Structures and Embedded SQL: Control Structures – Nested Blocks – SQ L in PL/SQL
– Data Manipulation – Transaction Control statements. PL/SQL Cursors and Exceptions:
Cursors – Implicit & Explicit Cursors and Attributes – Cursor FOR loops – SELECT…
FOR UPDATE – WHERE CURRENT OF clause –Cursor with Parameters – Cursor
Variables – Exceptions – Types of Exceptions.

Unit 5: PL/SQL COMPOSITE DATA TYPES 12 hours

PL/SQL Composite Data Types: Records – Tables – arrays. Named Blocks:
Procedures –Functions – Packages –Triggers –Data Dictionary Views.

Unit 6:Contemporary Issues 3 hours

Text Book(s)
1.Database Systems using Oracle, Nilesh Shah, 2nd edition, PHI. Database Systems using
Oracle, Nilesh Shah, 2nd edition, PHI.
 2.E-Book : Diana Lorentz, “Oracle® Database SQL Reference”, ORACLE, Dec, 2005.

3.E-Book : Bill Pribyl, Steven Feue rstein, “Oracle PL/SQL Programming”, O'Reilly

Media, Inc6th Edition, February 2014.

Reference Books

1..Database Management Systems, Majumdar & Bhattacharya, 2007, T

2. Database Management Systems, Gerald V. Post, 3rd edition, TMH