BCA 1st Sem Syllabus

                                                 BCA101 : Programming in ‘C’

Programming in C: History, Introduction to C Programming Languages, Structure of C
programs, compilation and execution of C programms. Debugging Techniques, Data
Types and Sizes, Declaration of variables, Modifiers, Identifiers and keywords, Symbolic
constants, Storage classes (automatic, external, register and static), Enumerations,
command line parameters, Macros, The C Preprocessor
Operators: Unary operators, Arithmetic & logical operators, Bit wise operators,
Assignment operators and expressions, Conditional expressions, precedence and order of
evaluation. Control Statements: if-else, switch, break, continue, the comma operator, go
to statement.
Loops: for, while, do-while.
Functions: built-in and user-defined, function declaration, definition and function call,
parameter passing: call by value, call by reference, recursive functions, multifile
programs.
Arrays: Linear arrays, multidimensional arrays, Passing arrays to functions, Arrays and
strings.
Structure and Union: Definition and differences, self-referential structure. And address of
(&) operator, pointer to pointer, Dynamic Momory Allocation, calloc and malloc
functions, array of pointers, function of pointers, structures and pointers.
File: File Handling in C
References:
1. V. Rajaraman, "Fundamentals of Computers", PHI
2. Pater Norton's "Introduction to Computer", TMH
3. Hahn, "The Internet complete reference", TMH
4. Peter Nortton's, "DOS Guide", Prentice Hall of India
5. Gottfried, "Programming in C, Schaum's Series Tata McGraw Hill

BCA102 : Fundamental of Computers

Introduction to Computers: Computer hardware Components, Disk Storage, memory,
keyboard, mouse, printers, monitors, CD etc., and their functions, Comparison Based
analysis of various hardware components.
Basic Operating System Concepts: MS-DOS, WINDOWS, Functional knowledge of
these operating systems. Introduction to Basic Commands of DOS, Managing File and
Directories in various operating Systems, Introduction to internet, Basic terms related
with Internet, TCP/IP.
Algorithm development, techniques of problem solving, flowcharting, stepwise
refinement algorithms for searching, sorting (exchange and insertion), merging of ordered
lists.
Programming : Representation of integer, character, real, data types, constraints and
variables, arithmetic expressions, assignment statement, logical expression; sequencing,
alteration and interaction, arrays, string processing sub programs, recursion, files and
pointers.
Structured programming concepts : Top down design, development of efficient programs;
Program correctness; Debugging and testing of programs.
Element of a computer processing system : Hardware CPU, storage devices and media,
VDU, input-output devices, data communication equipment software-system software,
application software.
Programming languages : Classification, machine code, assembly language, higher level
languages, fourth generation languages.
References :
Raja Raman V : Fundamentals of Computers
Sanders D.H. : Computers Today

BCA103: Mathematical foundation of Computer Science

Relation: Type and compositions of relations, Pictorial representation of relations,
Equivalence relations, Partial ordering relation.
Function: Types, Composition of function, Recursively defined function.
Mathematical Induction: Piano's axioms, Mathematical Induction, Discrete Numeric
Functions and Generating functions, Simple Recurrence relation with constant
coefficients, Linear recurrence relation without constant coefficients, Asymptotic
Behaviour of functions
Algebric Structures: Properties, Semi group, monoid, Group, Abelian group, properties of
group, Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism,
Isomorphism and Automorphism of groups.
Prepositional Logic: Preposition, First order logic, Basic logical operations, Tautologies,
Contradictions, Algebra of Proposition, Logical implication, Logical equivalence,
Normal forms, Inference Theory, Predicates and quantifiers, Posets, Hasse Diagram.

References:
1. Liptschutz, Seymour, "Discrete Mathematics", TMH.
2. Trembley, J.P. & R. Manohar, "Discrete mathematical Structure with Application to
Computer Science", TMH.
3. Kenneth H. Rosen, "Discrete Mathematics and its applications', TMH.
4. Doerr Alan and Levasseur Kenneth, "Applied Discrete Structure for Computer
Science, Galgotia Pub. Pvt. Ltd.
5. Gersting "Mathematical Structure for Computer Science", WH freeman and Macmillan
6. Kumar Rajendra, "Theory of Automata: Languages and Computation", PPM
7. Hopcroft J.E. Uliman J.D., "Introduction to Automata Theory, Language and
Computation" Narosa Pub. House, New Delhi.
8. C.L.Liu "Elements of Discrete Maehmatics", McGraw Hill.
9. Peter Grossman, "Discrete Mathematics for Computer", Palgrave Macmillian.

BCA104 : Business Communications

Perception, nature and importance, perceptual organization, perceptual interpretation,
social perception motivation, characteristics of needs, models of motivation, theories of
motivation.
Learning and behaviouristic theories, cognitive theories, social learning theories.
Personality, theories of personality, measurement of personality.
Communication : Fundamentals, downward and upward communication, other forms of
communication. Attitudes nature effects, measurement and changing attitudes.
Fundamentals of Technical Communications, Oral Communication and Written
Communication , Public Speaking, negotiations, Presentation skills, Transactional
Analysis and Ego-states, Role of communication in IT.