B.Sc IT 3rd Sem Syllabus

                                 BS301 : Computer Based Numerical Techniques
Floating point Arithmetic: Representation of floating point numbers, Operations,
Normalization, Pitfalls of floating point representation, Errors in numerical computation.
Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial
using Bisection Method, Iteration method, Regula-Falsi method, Newton Raphson
method, Secant method, Rate of convergence of iterative methods.
Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss
Elimination direct method and pivoting, III conditioned system of equations, Refinement
of solution. Gauss Seidal iterative method, Rate of Convergence. Interpolation and
approximation: Finite Differences, Difference tables. Polynomial Interpolation: Newton's
forward and backward formula Central Difference Formulae: Gauss forward and
backward formula, stirling's Bassel's Everett's formula. Interpolation with unequal
intervals: Language's Interpolation, Newton Divided difference formula, Hermite's
interpolation Approximation of function by Taylor's series and Chebyshev polynomial.
Numerical Differentiation and Integration: Introduction, Numerical Differentiation,
Numerical Integration, Trapazoidal rule, Simpon's rules, Boole's Rule Euler-Maclaurin
Formula Solution of Differential Equations: Picard's Method, Euler's Method, Taylor's
Method, Runge-Kutta methods, Predictor-corrector method, Automatic error monitoring,
stability of solution.
References:
1. Rajaraman V., :Computer Oriented Numerical Methods". PHI
2. Gerald and Wheatley, "Applied Numerical Analyses", AW
3. Jain, Lyengar and Jain, "Numerical Methods for Scientific and Engineering
Computations:, New Ager Int.
4. Grewal B.S., "Numerical methods in Engineering and Science. Khanna
Publishers, Delhi.
5. T.Veerarajan, T Ramchandran, "Theory and Problems of Numerical Methods",
TMH
22
                                                           BS302 : DBMS
Introduction: An overview of database management system, Database System Vs File
System, Database system concepts and architecture, data models schema and instances,
data independence and data base language and interfaces, Data definitions language,
DMI, Overall Database structure. Data modeling using the Entity Relationship Model:
ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of
Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER
diagrams to tables, extended ER model, relationships of higher degree.
Relational Data Model and Language: Relational data model concepts, integrity
constraints: entity integrity, referential integrity, Keys constraints, Domain constraints,
relational algebra, relational calculus, tuple and domain calculus.
Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and
literals, Types of SQL commands, SQL operators and their procedure, Tables, views and
indexes Queries and sub queries, Aggregate functions, Insert, update and delete
operations, Joints, Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and
clusters.
Database Design & Normalization: Functional dependencies, normal forms, first, second
third normal forms, BCNF, inclusion dependencies, loss less join decompositions,
normalization using FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concepts: Transaction system, Testing of seralizability,
Seralizability of schedules, conflict and view seralizable schedule, recoverability,
Recovery form transaction failures, deadlock handling .

References:
1. Date C.J. "An Introduction to Database System". Addision Wesley
2. Korth, Silbertz, Sudarshan, "Database Concepts" McGraw Hill
3. Elmasri, Navathe, "Fundamentals of Database Systems" Addision Wesley
4. Paul Beynon Davis, "Database Systems" Palgrave Macmillan
5. Bipin C. Desai, "An introduction to Database Systems", Galgotia Pub.
23


                                                     BS303 : Digital Electronics
Representation of information & Basic Building Blocks: Introduction to Computer,
Computer hardware generation, Number System: Binary, Octal, Hexadecimal, Character
Codes (BCD), ASCII, EBCDIC and their conversion. Logic gates, Boolean Algebra, Kmap
simplification, Half Adder, Full Adder, Subtractor, Decoder, Encoders, Multiplexer,
Demultiplexer, Carry look ahead adder, Combinational logic Design, Flip-Flops,
Registers, Counters (Synchronous and asynchronous), ALU, Micro-operation. ALU-chip,
Faster Algorithm and Implementation (multiplication & Division).
Basic Organization: Operational flow chart (Fetch, Execute, Instruction Cycle),
Organization of Central Processing Unit, Hardwired & micro programmed control unit,
Single Organization, General Register Organization, Stack Organization, Addressing
modes, Instruction formats, data transfer & Manipulation, I/O Organization, Bus
Architecture, Programming Registers.
Memory Organization: Memory hierarchy, Main memory (RAM/ROM) chips), Auxiliary
memory, Associative memory, Cache memory, Virtual memory, Memory Management
Hardware, hit/miss ratio, magnetic disk and its performance, magnetic Tape etc.
I/O Organization: Peripheral devices, I/O interface, Modes of Transfer, Priority Interrupt,
Direct Memory Access, Input-Output Processor, and Serial Communication. I/O
Controllers, Asynchronous data transfer, Strobe Control, Handshaking.

References:
1. Willam Stalling, "Computer Organization & Architecture" Pearson Education Asia
2. Mano Morris, "Computer System Architecture" PHI
3. Zaky & Hamacher, "Computer Organization: McGraw Hill
4. B. Ram, "Computer Fundamental Architecture & Organization" New Age
5. Tannenbaum, "Structured Computer Organization" PHI.
24

                                                      BS304 : Web technology
History of the web, Growth of the Web, Protocols governing the web, Introduction to
Cyber Laws in India, Introduction to International Cyber laws, Web project, Web Team,
Team dynamics.
Communication Issues, the client, Multi-departmental & Large scale Websites, Quality
Assurance and testing, Technological advances and Impact on Web Teams.
HTML: Formatting Tags, Links, List, Tables, Frames, forms, Comments in HTML,
DHTML. Java Script: Introduction, Documents, Documents, forms, statements,
functions, objects in Java Script, Events and Event Handling, Arrays, FORMS, Buttons,
Checkboxes, Text fields and Text areas.
XML: Introduction, Display and XML Documents, Data Interchange with an XML
document, Document types definitions, Parsers using XML, Client-side usage, Server
Side usage.
Common Gateway Interface (CGI), PERL, RMI, COM/DCOM, VBScript, Active Server
Pages (ASP).

References:
1. Burdman, "Collaborative Web Development", Addison Wesley
2. Sharma & Sharma, "Developing E-Commerce Sites" Addison Wesley
3. Iva Bayross, "Web Technologies Part-II" BPB Publications
4. Shishir Gundavarma, CGI Programming on the World Wide Web" O'Reilly &
Associate
5. DON Box, "Essential COM" Addison Wesley
6. Greg Buczek, " ASP Developer's Guide" TMH

Read more »

BCA 3rd Sem Syllabus

                                 BCA301 : Computer Based Numerical TechniquesFloating point Arithmetic: Representation of floating point numbers, Operations,
Normalization, Pitfalls of floating point representation, Errors in numerical computation.
Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial
using Bisection Method, Iteration method, Regula-Falsi method, Newton Raphson
method, Secant method, Rate of convergence of iterative methods.
Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss
Elimination direct method and pivoting, III conditioned system of equations, Refinement
of solution. Gauss Seidal iterative method, Rate of Convergence. Interpolation and
approximation: Finite Differences, Difference tables. Polynomial Interpolation: Newton's
forward and backward formula Central Difference Formulae: Gauss forward and
backward formula, stirling's Bassel's Everett's formula. Interpolation with unequal
intervals: Language's Interpolation, Newton Divided difference formula.
Numerical Differentiation and Integration: Introduction, Numerical Differentiation,
Numerical Integration, Trapazoidal rule, Simpon's rules, Boole's Rule Euler-Maclaurin
Formula Solution of Differential Equations: Picard's Method, Euler's Method, Taylor's
Method, Runge-Kutta methods.

References:
1. Rajaraman V., :Computer Oriented Numerical Methods". PHI
2. Gerald and Wheatley, "Applied Numerical Analyses", AW
3. Jain, Lyengar and Jain, "Numerical Methods for Scientific and Engineering
Computations:, New Ager Int.
4. Grewal B.S., "Numerical methods in Engineering and Science. Khanna
Publishers, Delhi.
5. T.Veerarajan, T Ramchandran, "Theory and Problems of Numerical Methods",
TMH



                                             BCA302 : Data Base Management System
Introduction: An overview of database management system, Database System Vs File
System, Database system concepts and architecture, data models schema and instances,
data independence and data base language and interfaces, Data definitions language,
DMI, Overall Database structure. Data modeling using the Entity Relationship Model:
ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of
Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER
diagrams to tables, extended ER model, relationships of higher degree.
Relational Data Model and Language: Relational data model concepts, integrity
constraints: entity integrity, referential integrity, Keys constraints, Domain constraints,
relational algebra, relational calculus, tuple and domain calculus.
Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and
literals, Types of SQL commands, SQL operators and their procedure, Tables, views and
indexes Queries and sub queries, Aggregate functions, Insert, update and delete
operations, Joints, Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and
clusters.
Database Design & Normalization: Functional dependencies, normal forms, first, second
third normal forms, BCNF, inclusion dependencies, loss less join decompositions,
normalization using FD, MVD, and JDs, alternative approaches to database design

References:
1. Date C.J. "An Introduction to Database System". Addision Wesley
2. Korth, Silbertz, Sudarshan, "Database Concepts" McGraw Hill
3. Elmasri, Navathe, "Fundamentals of Database Systems" Addision Wesley
4. Paul Beynon Davis, "Database Systems" Palgrave Macmillan
5. Bipin C. Desai, "An introduction to Database Systems", Galgotia Pub.



                                      BCA303 : Theory of Computation
A brief review of Finite Automata, Regular expressions, Regular languages,
Deterministic and non-deterministic computations. Pumping Lemma for Regular
languages, Context free languages, Pushdown automaton, Pumping Lemma for Context
free languages, Grammar types and Chomsky Hierarchy. Turing Machines (TM),
Variations of TM’s, Universal Turing Machines (UTM), Church-Turing Thesis, Relation
of Languages to Automata. Turing computable functions, Halting problem, Solvability,
Undecidability and Computability.
References:
1. J.E.Hopcraft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Pearson Education
2. Cohen, “Introduction to Computer Theory”, John Wiley.
3. M. Sipser, Introduction to Theory of Computation, PWS Publishing Corporation,
1997.
4. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and
Computation, Addison-Wisley, 1979.
5. T.C. Martin, Theory of Computation, Tata McGraw-Hill
6. H.R. Lewis, C.H. Papadimitrou, Elements of the Theory of Computation, PHI.

                                        BCA304 : Organization Structure and Personnel Management
Organization Structure: Classical theories of Management: Scientific management
theory, Fayol's 14 principles of Management Webar's bureaucratic theory. Definition of
organization and organization Structure.
Some Concepts Regarding Organization Structure: Line and Staff authority,
Centralization and Decentralization, Span of control, Formal and Informal Organization.
Forms of Organization Structure and Feature: Function bases, Product bases, Geography
based, Project based (Matrix). Organization Design: Mechanistic and Organic Structure,
Virtual and Network organization Structure.
Motivation: Definition of Motivation, Importance of Motivation, Motivation and
behaviour, Theories of Motivation - Maslows need Hierarchy, Two-Factor Theory,
McClelland's Need Theory, Theory X and Theory Y.
Nature and Scope of Human Resource Management: Scope of HRM, HRM-function and
objectives, HRM model.
Personnel Function: Personnel polices and principles, duties and responsibilities of
personnel manager, differences between HRM and PM Emerging trends of personnel
management in India
Human Resource Planning: Meaning, definition and importance of HRP. Job Analysis:
Meaning and definition, process of job analysis Recruitment: Meaning and definition,
importance, sources of recruitment. Indian scenario. Selection: Meaning and definition,
selection process, types of interview.
Training and Development: Nature of training and Development, Inputs in training and
Development, importance of training and Development, training process, training of
International assignment.

References:
1. L.M. Prasad "Organizational Behavior", S.Chand
2. V.S.P. Rao, P.S. Narayana, "Organizational Theory and Behaviour" Konark Publishers
Pvt. Ltd.
3. Tripathi, Reddy, "Principles of Management:. TMH
4. Koontz, Weihrich, "Essentials of Management:, TMH
5. Fred Luthans, :Organizational Behaviour", McGraw Hill
6. K. Aswathappa, "Human Resources and Personnel Management", TMH
7. L.M. Prasad, "Human Resource management", S.Chand.

Read more »

B.Sc. (Information Technology) Subjects List

SEMESTER - I
BS101 : Fundamental of Computers and Information Technology
BS102 : Programming in ‘C’
BS103 : Mathematical Foundation
BS104 : Financial Accounting
BSP11 : Programming in ‘C’
BSP12 : PC Packages(Introduction to DOS & MS Office)

SEMESTER - II
BS201 : Data Structures
BS202 : Object Oriented Programming using ‘C++’
BS203 : System Analysis and Design
BS204 : Probability & Statistical Techniques
BSP21 : Data Structures
BSP22 : Object Oriented Programming using ‘C++’

SEMESTER - III
BS301 : Computer Based Numerical Techniques
BS302 : DBMS
BS303 : Digital Electronics
BS304 : Web technology
BSP31 : DBMS
BSP32 : Web technology

SEMESTER - IV
BS401 : Operating system
BS402 : Advance RDBMS
BS403 : Management Information System
BS404 : Multimedia Technology and Application
BSP41 : Operating system
BSP42 : Advance RDBMS

SEMESTER – V
BS501 : Programming in JAVA
BS502 : Data Communication & Networks
BS503 : Network Security
BS504 : Software Engineering
BSP51 : Programming in JAVA
BSP52 : Data Communication & Networks

SEMESTER VIBS601 : E-Governance
BS602 : Advance programming in JAVA
BSP61 : Advance programming in JAVA
BSSM : Seminar
BSPR : Project

Read more »

BCA Subjects List

SEMESTER - I
BCA101 : Programming in ‘C’
BCA102 : Fundamental of Computers
BCA103: Mathematical foundation of Computer Science
BCA104 : Business Communications
BCAP11 : Programming in ‘C’
BCAP12 : PC Packages(Introduction to Operating system & MS Office)

SEMESTER - II
BCA201 : Data Structure & File Organization
BCA202 : Programming in C++
BCA203 : System Analysis and Design
BCA204 : Digital Electronics
BCAP21 : Data Structure & File Organization
BCAP22 : Programming in C++

SEMESTER - III
BCA301 : Computer Based Numerical Techniques
BCA302 : Data Base Management System
BCA303 : Theory of Computation
BCA304 : Organization Structure and Personnel Management
BCAP31 : Computer Based Numerical Techniques
BCAP32 : Data Base Management System

SEMESTER - IV
BCA401 : Operating system Organization & UNIX
BCA402 : Visual Basic Programming
BCA403 : Software Engineering
BCA404 : Data Communication & Computer Networks
BCAP41 : Operating System Organization & UNIX
BCAP42 : Visual Basic Programming

SEMESTER – V
BCA501 : Computer Graphics
BCA502 : Web Programming using JAVA
BCA503 : Management Information System
BCA504 : .Net Technology
BCAP51 : Programming in JAVA
BCAP52 : Net Technology

SEMESTER VI
BCA601 : .Net Framework
BCA602 : Network Security
BCAP61 : .Net Framework
BCASM : Seminar
BCAPR : Project

Read more »

Rules & Regulations As Per University Requirement

1. Admission
Admission to the BCA Ist semester will be made as per rules prescribed by the Academic
Council of the University or as per guidelines prescribed by the State Govt. from
time to time.
 
2. Eligibility
Intermediate Mathematics.
 
3. Attendance
3.1 Every candidate is required to attend all the lectures, tutorials, practical and other
prescribed curricular and co-curricular activities. It can be condoned up to 25% on
medical grounds or for other genuine reasons.
3.2 A further relaxation of attendance up to 15% can be given by Principal/Dean/
Director of the Institute for the students, who have been absent with prior
permission, for reasons acceptable to Head of the Institution/ College/ University.
3.3 No candidate will be allowed to appear in the end semester examinations if he/she
does not satisfy the overall average attendance requirements as per clause 3.1 and
clause 3.2.
 
4. Duration
4.1 Total duration of the BCA Course shall be three years, each year comprising two
semesters.
4.2 Each semester shall normally have teaching for the 90 working days.
4.3 A student failing 2 times in I and / or II semester (of first year) and ineligible for
the carry over system (clause 8) shall not be permitted to continue studies further.
4.4 Maximum time allowed for completing the BCA course will be 5 (five) years.
Those who are unlikely to satisfy the condition shall not be allowed to continue
the studies any further.
 
5. Curriculum
5.1 The 3 (Three) years curriculum will be divided into six semesters. Each semester
include lectures, tutorials, practical and seminars as defined in the scheme of
instructions and examinations.
5.2 It will also include co-curricular and extra curricular activities as prescribed from
time to time by the Institute/college/university.

6. Examination
6.1 Student’s performance will be evaluated through continuous assessment in the
form of Class Tests, Assignments, Quizzes, Viva voce/Practical etc. There shall
also be an examination at the end of each semester in theory subjects, practical
and project.
6.2 The distribution of marks for the class tests, quiz test, assignments, end semester
theory, practical, project, seminar and other examination shall be as per the
prescribed scheme of examination.
6.3 The maximum marks for the theory subjects shall consist of marks allotted for
end semester examination and sessional work.
6.4 The maximum marks for the practical shall consist of marks allotted for practical
examination and sessional work.
6.5 Pass/fail in a subject shall be declared on the basis of total marks obtained in
theory/practical examination and the sessional award for theory/practical subjects.
6.6 The minimum pass marks in the theory subjects (including sessional marks) shall
be 40%.
6.7 The minimum pass marks in the practical subjects (including sessional marks)
shall be 50%.
6.8 The marks of the previous semester(s) shall not be added in declaring the result of
any semester examination.
6.9 To pass a semester candidate must secure 50% of aggregate marks in that
semester.
6.10 No merit position shall be awarded to a candidate who has qualified for
promotion to higher classes with back papers.
6.11 The student failing in the project only but satisfying all other requirements
including obtaining 50% or more marks in aggregate will be allowed to submit a
new / modified project at any time after three months of the declaration of result
without repeating the whole session.
 
7. Promotion Rules
7.1 A candidate satisfying all the conditions under clause 6 shall be promoted to the
next semester.
7.2 A candidate not satisfying the above conditions but failing in not more than 3
subjects (Theory and/or practical) of a semester examination shall be governed by
the clause No. 8.
7.3 All other candidates will be required to repeat the semester either as regular
candidate, after re-admission or opting for ex-studentship. This facility is however
subject to the time limits stipulated in clause No. 4.

11. Award of Division
11.1 If candidate passes all examinations in single attempt and secures 75% or more in
aggregate marks he/she shall be placed in the First Division with Honours.
11.2 If candidate passes all examinations and secures aggregate marks of 60% or more
but less than 75% OR greater than or equal to 75% after back in any examination,
he/she shall be placed in First Division.
11.3 If candidate passes all examinations and secures aggregate marks of 50% or more
but less than 60%, he/she shall be placed in Second Division.

12. Seminar and Project
12.1 Candidate must secure 50% marks to pass in seminar and project.

Read more »

B.Sc IT 2nd Sem Syllabus

                                                                BS201 : Data Structures
Introduction: Basic Terminology, Elementary Data Organization, Data Structure
operations, Algorithm Complexity and Time-Space trade-off. Arrays: Array Definition,
Representation and Analysis, Single and Multidimensional Arrays, address calculation,
application of arrays, Character String in C, Character string operation, Array as
Parameters, Ordered list, Sparse Matrices, and Vector. Stacks: Array Representation and
Implementation of stack, Operations and Stacks: Push and POP, Array Representation of
Stack, Linked Representation of stack, Operations Associated with Stacks, Application of
stack, Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix
expression using stack. Recursion: Recursive definition and processes.
Queues: Array and linked representation and implementation of queues, Operations on
Queue; Create, Add, Delete, Full and Empty, Circular queue, Dequeue, and Priority
Queue. Link List: Representation and implementation of Singly linked lists, Two-way
Header List, Traversing and Searching of Linked List, Overflow and Underflow,
Insertion and deletion to from Linked Lists, Insertion and deletion Algorithms, Doubly
linked list, Linked List of Array, Polynomial representation and addition, Generalized
linked list, Garbage Collection and Compaction.
Trees: Basic terminology, Binary Tree, Binary tree representation algebraic Expressions,
Complete Binary Tree, Extended Binary Tree, Array and Linked Representation of
Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded
Binary tree, Huffman algorithm. Searching and Hashing: Sequential search, comparison
and analysis, Hash Table, Hash Function, Collection Resolution Strategies, Hash Table
Implementation.
Sorting: Insertion Sort, Bubble sorting, Quick Sort, Two way Merge Sort, Trees: Binary
Search (BST), Insertion and Deletion in BST.
References:
1. Horowitz and Sahani, "Fundamentals of data Structures" Galgotia
2. R. Kruse etal, "Data Structures and Program Design in C" Person Education
3. A.M. Tenenbaum etal, "Data Structures and Program Design in C" Person Education
4. Lipschutz, "Data Structure", TMH
5. K Loudon, "Mastering Algorithms With C", Shroff Publishers and Distributors
6. Bruno R Preiss, "Data Structure and Algorithms with Object Oriented Design Pattern
in C++, Jhon Wiley & Sons, Inc.
7. Adm Frozdek, "Data Structures and Algorithms in C++" Thomson Asia
8. Pal G. Sorenson, "An Introduction to Data Structures with Application", TMH
18


                                   BS202 : Object Oriented Programming using ‘C++’
 
Introduction: Introduction to OOP, Basic Concepts of OOP, Applications of OOP.
Introduction to C++, Introduction to C++ stream I/O, declarations in C++, Creating New
data types in C++, function Prototypes, Inline functions, Reference Parameters, Const
Qualifier, Dynamic memory allocation, default arguments, Unary Scope resolution
operator, Linkage specifications.
Class, Constructors, Friend Class : Introduction, Comparing class with Structure, Class
Scope, Accessing Members of a class, Constructor, Destructor, Const objects, Const
member functions, Friend class, Friend function, This pointer, Data abstraction and
Information hiding, container classes and Iterators
Overloading & Inheritance: Operator Overloading, Fundamentals, Restrictions,
Overloading stream, Insertion and stream extraction operators, Overloading unary &
binary operators, Converting between types, Overloading ++ and --. Inheritance,
Introduction, Protected members, Casting base _class pointers to derived _class pointers
Overloading Base class members in a Derived class, Public, Protocols and Private
inheritance, Direct base classes and Indirect Base Classes, Using Constructors and
Destructors in Derived classes, Implicit Derived class object to base class object
conversion.
Virtual Functions: Introduction, Type fields and switch statements, Virtual functions,
Abstract base classes and concrete classes, Polymorphism, Dynamic binding, Virtual
destructors.
C++ Stream I/O: Streams, Stream Input, Stream Output, Unformatted I/O, Stream
manipulators, Stream format states, Stream error, States.
Files : File Operations –File pointers – error Handling during file Operations
References:
1. Deitel H.M. & Deitel P.J. – “How to Program C++” – PHI – 2003
2. Al stevenes – “C++ Programming” – Wiley dreamtech – 2003.
3. Herbert Scheldt, “Complete Reference”.
4. E. Balagurusamy “Object Oriented Programming with C++”.
5. Yashwant Kanetkar, “Let Us C++”.
6. C++ Programming by Herbert Scheldt – 2004.
19


                                                  BS203 : System Analysis and Design
System Concepts and Information System Environment: The System Concept,
Definition, Characteristics of Systems, Elements of a System, Open and Closed and
closed system, Formal & Informal Information Systems, Computer based Information
Systems, Management Information System, Decision Support System, General Business
Knowledge, and Interpersonal Communicational System.
The System Development Life Cycle: Recognition of needs, Impetus for System Change,
Feasibility Study, Analysis, Design, Implementation, Post implementation &
Maintenance.
The Role of the Systems Analyst: Historical Perspective, Academic & Personal
Qualifications, the multifaceted role of the Analyst, The Analyst/User Interface,
Behavioral issues.
Systems Planning & Initial Investigation: Strategies for Determining Information
Requirement, Problem Definition & Project initiation, Background Analysis, Fact
Analysis, Review of Written Documents, Onsite Observations, Interviews &
Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service
Analysis.
Information Gathering: Kind of Information needed. Information about the firms,
Information gathering tools, the art of Interviewing, Arranging the Interview, Guides to
Successful Interview, Types of Interviews and Questionnaires, The Structured and
Unstructured Alternatives.
The Tools of Structured Analysis: The Dataflow Diagram (DFD), Data Dictionary,
Decision Trees and Structured English.
Feasibility Study: System performance, Economic Feasibility, Technical Feasibility,
Behavioral Feasibility, Steps in Feasibility Analysis.
Input/Output and Forms Design: Input Design, CRT Screen Design, Output Design,
Requirements form Design.
References:
1. Elias M.Awad, "Systems Analysis & Design" Galgotia Publication
2. Hoffer, "Modern Systems Analysis & Design" Addision Wesley
3. Kendall, "Introduction to System Analysis & Desogm", McGraw Hill
20



                                             BS204 : Probability & Statistical Techniques
Data representation, Histogram, frequency distribution, Ogive, Arithmetic mean and
Geometric Mean, Harmonic Mean, Medium quadrates.
Probability Theory: Sample space & events, the axioms of probability, some elementary
theorem, conditional probability, Baye’s Theorem, mathematical expectation.
Probability distribution: random variables, binomial distribution, hyper geometric
distribution, chebyshev distribution, Poisson distribution, geometric distribution, Erlang
distribution.
Probability Densities: continuous random variables, normal distribution, uniform
distribution.
Example of Least square, fitting of curves. Correlation and regression.
Theory of Sampling: Sampling, sampling of attributes, Mean of standard deviation of
sample, Sampling distribution, Distribution of the means.
Chi square test as a goodness of fit, Chi square test as test of independence.
References:
1. Bernstein: “ Element of statistics”, PHI
2. Hogg:” Introduction Mathematical Statistics”, Pearson Education
3. Lipschutz, “ Introduction to Probability & Statistics” PHI

Read more »

BCA 2nd Sem Syllabus

                                        BCA201 : Data Structure & File Organization

Introduction: Basic Terminology, Elementary Data Organization, Data Structure
operations, Algorithm Complexity and Time-Space trade-off. Arrays: Array Definition,
Representation and Analysis, Single and Multidimensional Arrays, address calculation,
application of arrays, Character String in C, Character string operation, Array as
Parameters, Ordered list, Sparse Matrices, and Vector. Stacks: Array Representation and
Implementation of stack, Operations and Stacks: Push and POP, Array Representation of
Stack, Linked Representation of stack, Operations Associated with Stacks, Application of
stack, Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix
expression using stack. Recursion: Recursive definition and processes.
Queues: Array and linked representation and implementation of queues, Operations on
Queue; Create, Add, Delete, Full and Empty, Circular queue, Dequeue, and Priority
Queue. Link List: Representation and implementation of Singly linked lists, Two-way
Header List, Traversing and Searching of Linked List, Overflow and Underflow,
Insertion and deletion to from Linked Lists, Insertion and deletion Algorithms, Doubly
linked list, Linked List of Array, Polynomial representation and addition, Generalized
linked list, Garbage Collection and Compaction.
Trees: Basic terminology, Binary Tree, Binary tree representation algebraic Expressions,
Complete Binary Tree, Extended Binary Tree, Array and Linked Representation of
Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded
Binary tree, Huffman algorithm. Searching and Hashing: Sequential search, comparison
and analysis, Hash Table, Hash Function, Collection Resolution Strategies, Hash Table
Implementation.
Sorting: Insertion Sort, Bubble sorting, Quick Sort, Two way Merge Sort, Trees: Binary
Search (BST), Insertion and Deletion in BST.
References:
1. Horowitz and Sahani, "Fundamentals of data Structures" Galgotia
2. R. Kruse etal, "Data Structures and Program Design in C" Person Education
3. A.M. Tenenbaum etal, "Data Structures and Program Design in C" Person Education
4. Lipschutz, "Data Structure", TMH
5. K Loudon, "Mastering Algorithms With C", Shroff Publishers and Distributors
6. Bruno R Preiss, "Data Structure and Algorithms with Object Oriented Design Pattern
in C++, Jhon Wiley & Sons, Inc.
7. Adm Frozdek, "Data Structures and Algorithms in C++" Thomson Asia
8. Pal G. Sorenson, "An Introduction to Data Structures with Application", TMH
17


                                                             BCA202 : Programming in C++

Introduction: Introduction to OOP, Basic Concepts of OOP, Applications of OOP.
Introduction to C++, Introduction to C++ stream I/O, declarations in C++, Creating New
data types in C++, function Prototypes, Inline functions, Reference Parameters, Const
Qualifier, Dynamic memory allocation, default arguments, Unary Scope resolution
operator, Linkage specifications.
Class, Constructors, Friend Class : Introduction, Comparing class with Structure, Class
Scope, Accessing Members of a class, Constructor, Destructor, Const objects, Const
member functions, Friend class, Friend function, This pointer, Data abstraction and
Information hiding, container classes and Iterators
Overloading & Inheritance: Operator Overloading, Fundamentals, Restrictions,
Overloading stream, Insertion and stream extraction operators, Overloading unary &
binary operators, Converting between types, Overloading ++ and --. Inheritance,
Introduction, Protected members, Casting base _class pointers to derived _class pointers
Overloading Base class members in a Derived class, Public, Protocols and Private
inheritance, Direct base classes and Indirect Base Classes, Using Constructors and
Destructors in Derived classes, Implicit Derived class object to base class object
conversion.
Virtual Functions : Introduction, Type fields and switch statements, Virtual functions,
Abstract base classes and concrete classes, Polymorphism, Dynamic binding, Virtual
destructors.
C++ Stream I/O : Streams, Stream Input, Stream Output, Unformatted I/O, Stream
manipulators, Stream format states, Stream error, States.
References:
1. Deitel H.M. & Deitel P.J. – “How to Program C++” – PHI – 2003
2. Al stevenes – “C++ Programming” – Wiley dreamtech – 2003.
3. Herbert Scheldt, “Complete Reference”.
4. E. Balagurusamy “Object Oriented Programming with C++”.
5. Yashwant Kanetkar, “Let Us C++”.
6. C++ Programming by Herbert Scheldt – 2004.
18


                                                        BCA203 : System Analysis and Design

System Concepts and Information System Environment: The System Concept,
Definition, Characteristics of Systems, Elements of a System, Open and Closed and
closed system, Formal & Informal Information Systems, Computer based Information
Systems, Management Information System, Decision Support System, General Business
Knowledge, and Interpersonal Communicational System.
The System Development Life Cycle: Recognition of needs, Impetus for System Change,
Feasibility Study, Analysis, Design, Implementation, Post implementation &
Maintenance.
The Role of the Systems Analyst: Role of the Analyst, Analyst/User Interface, Behavioral
issues.
Systems Planning & Initial Investigation: Strategies for Determining Information
Requirement, Problem Definition & Project initiation, Background Analysis, Fact
Analysis, Review of Written Documents, Onsite Observations, Interviews &
Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service
Analysis.
Information Gathering: Kind of Information needed. Information about the firms,
Information gathering tools, the art of Interviewing, Arranging the Interview, Guides to
Successful Interview, Types of Interviews and Questionnaires, The Structured and
Unstructured Alternatives.
The Tools of Structured Analysis: The Dataflow Diagram (DFD), Data Dictionary,
Decision Trees and Structured English.
Feasibility Study: System performance, Economic Feasibility, Technical Feasibility,
Behavioral Feasibility, Steps in Feasibility Analysis.
Input/Output and Forms Design: Input Design, CRT Screen Design, Output Design,
Requirements form Design.
References:
1. Elias M.Awad, "Systems Analysis & Design" Galgotia Publication
2. Hoffer, "Modern Systems Analysis & Design" Addision Wesley
3. Kendall, "Introduction to System Analysis & Desogm", McGraw Hill
19



                                                                 BCA204 : Digital Electronics

Representation of information & Basic Building Blocks: Introduction to Computer,
Computer hardware generation, Number System: Binary, Octal, Hexadecimal, Character
Codes (BCD), ASCII, EBCDIC and their conversion. Logic gates, Boolean Algebra, Kmap
simplification, Half Adder, Full Adder, Subtractor, Decoder, Encoders, Multiplexer,
Demultiplexer.
Basic Organization: Operational flow chart (Fetch, Execute, Instruction Cycle),
Organization of Central Processing Unit, Hardwired & micro programmed control unit,
Single Organization, General Register Organization, Stack Organization, Addressing
modes, Instruction formats, data transfer & Manipulation, I/O Organization, Bus
Architecture, Programming Registers.
Memory Organization: Memory hierarchy, Main memory (RAM/ROM) chips), Auxiliary
memory, Associative memory, Cache memory, Virtual memory, Memory Management
Hardware, hit/miss ratio, magnetic disk and its performance, magnetic Tape etc.
I/O Organization: Peripheral devices, I/O interface, Modes of Transfer, Priority Interrupt,
Direct Memory Access, Input-Output Processor, and Serial Communication. I/O
Controllers, Asynchronous data transfer.
References:
1. Willam Stalling, "Computer Organization & Architecture" Pearson Education Asia
2. Mano Morris, "Computer System Architecture" PHI
3. Zaky & Hamacher, "Computer Organization: McGraw Hill
4. B. Ram, "Computer Fundamental Architecture & Organization" New Age
5. Tannenbaum, "Structured Computer Organization" PHI.

Read more »

B.Sc IT 1st Sem Syllabus

                              BS101 : Fundamental of Computers and Information Technology

Computer system concept, computer system characteristics, capabilities and limitations,
types of computers – analog, digital, hybrid, general, special purpose, micro, mini,
mainframe, super. generations of computers, personal computer (PC) - IBM PC,
characteristics, PC/PCXT/PCAT - configurations, Pentium and newer PC specifications
and main characteristics. Types of PC- desktop, laptop, notebook, palmtop, workstations
etc, their characteristics, add on cards on PC : sound card, video card, network card etc.
Basic components of a Computer System - Control Unit, ALU, Input / Output functions
and Characteristics, Memory – RAM, ROM, EPROM, PROM and other types of
memory.
Input devices-Keyboard, Mouse, Trackball, Joystick, Digitizing Tablet, Scanners, Digital
Camera, MICR, OCR, OMR, Bar-code Reader, Voice Recognition, Light Pen, Touch
Screen – Working Principles, Areas of use & characteristics.
Output Devices – Monitors, Characteristics and Types of Monitor – Digital, Analog,
Size, Resolution, Refresh Rate, Interlaced / Non Interlaced, Dot Pitch, Video Standard –
VGA, SVGA, XGA etc.
Printers - Daisy Wheel, Dot Matrix, Inkjet, Laser, Line Printer, Plotter
Storage Devices –Fundamentals, Primary Vs Secondary, Data Storage and Retrieval
Methods - Sequential, Direct and Index Sequential, Various storage devices - Magnetic
Tape, Magnetic Disks, Cartridge Tape, Hard Disk Drives, Floppy Disks(Winchester
Disk), Optical Disks, CD, VCD, CD-R, CD-RW, Zip Drive.
Need, Types of Software - System Software, Application Software, System Software -
Operating System, Utility Program, Programming Languages, Assemblers, Compilers
and Interpreter, Operating Systems - Functions, Types - Batch, Single,
Multiprogramming, Multiprocessing, Programming Languages- Machine, Assembly,
High Level, 4GLs, Their merits and demerits, Application Software – Word Processing,
Spreadsheet, Presentation Graphics, Data Base Management Software, Characteristics,
Uses and examples and area of applications of each of them.
Virus, Types of Viruses, Virus detection and prevention Viruses on Network.
Introduction to Multimedia.

References:
1. INTRODUCTION TO COMPUTERS AND INFORMATION TECHNOLOGY BY
ANURAG SEETHA, RAM PRASAD & SONS, BHOPAL.
2. COMPUTERS TODAY BY S.K.BASANDRA, GALGOTIA PUBLICATIONS.
3. FUNDAMENTALS OF INFORMATION TECHNOLOGY BY ALEXIS LEON &
MATHEWS LEON, VIKAS PUBLISHING HOUSE, NEW DELHI.
14



                                                       BS102 : 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.

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
15



                                                            BS103 : Mathematical Foundation
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.
Lattices: Introduction, Ordered set, Hasse diagram of partially ordered set, Consistent
enumeration, Isomorhic ordered set, Well ordered set, Lattices, Properties of lattices,
Bounded lattices, Distributive lattices, and Complemented lattices.
Classification & Presentation of Data including diagrammatic presentation. Measures of
central tendency – Mean, Mode, Median, Geometric & Harmonic. Measures of
dispersion - Range, Quartile Deviation, Average & Standard deviation.
Type of sampling : Probability Vs. Non Probability, Sampling, Random, Non Random,
Sampling, Size of sample. Probability theory – Baye’s Probability.
Simple Bivariate, Correlation & regression. Only concept of partial & multivariate
correlation & regression. Index numbers – Aggregative & average of price relative
methods.

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. C.L.Liu "Elements of Discrete Maehmatics", McGraw Hill.
5. Peter Grossman, "Discrete Mathematics for Computer", Palgrave Macmillian.
16



                                                             BS104 : Financial Accounting
Accounting: Principles, Concepts and conventions, double entry system of accounting,
Ledger posting and Trial balance. Final Accounts: Trading, profit and loss accounts and
balance sheet of sole proprietary concern with normal closing entries. Introduction to
manufacturing account of partnership firms, limited company.
Capital Budgeting: Meaning, importance, difficulties, Introduction to evaluation
techniques - Traditional techniques (ARR Payback method). Discounting cash flow
techniques (Present value, NPV, IRR) Ratio Analysis: Meaning, advantages, limitations
of ratio analysis, Types of ratios and their usefulness.
Costing: Nature, importance and Types of cost Marginal costing: Nature, scope and
importance of marginal costing. Break-even analysis, its uses and limitations,
construction of break-even charts. Practical applications of marginal costing. Inventory
Control System: The need cost of inventory, methods of inventory costing.
References:

1. S.N. Maheswari & S.K. Maheshwari, "Introduction of Fincncial Accountancy" Vikas
Pulication.
2. S.N. Maheshwari & S.K. Maheshwari, "Advanced Accountancy" Vikas Pub.
3. S.N. Maheshwari & S.K. Maheshwari "Financial Management, Vikas Pub.

Read more »

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.

Read more »