PROPOSED SYLLABUS FOR
BACHELOR OF COMPUTER APPLICATIONS (BCA) PROGRAMME
H. N. B. GARHWAL UNIVERSITY SRINAGAR (GARHWAL)
Ordinance for Bachelor of Computer Applications (BCA) Programme 2007 & onwards
H.N.B. Garhwal University, Srinagar (Garhwal), Uttaranchal
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. 3.1 Attendance 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. 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. 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. Duration Total duration of the BCA Course shall be three years, each year comprising two semesters. Each semester shall normally have teaching for the 90 working days. 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. 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. Curriculum 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. It will also include co-curricular and extra curricular activities as prescribed from time to time by the Institute/college/university.
4. 4.1 4.2 4.3 4.4
Examination 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. 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. The maximum marks for the theory subjects shall consist of marks allotted for end semester examination and sessional work. The maximum marks for the practical shall consist of marks allotted for practical examination and sessional work. 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. The minimum pass marks in the theory subjects (including sessional marks) shall be 40%. The minimum pass marks in the practical subjects (including sessional marks) shall be 50%. The marks of the previous semester(s) shall not be added in declaring the result of any semester examination. To pass a semester candidate must secure 50% of aggregate marks in that semester. No merit position shall be awarded to a candidate who has qualified for promotion to higher classes with back papers. 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. Promotion Rules A candidate satisfying all the conditions under clause 6 shall be promoted to the next semester. 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. 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.
6.3 6.4 6.5 6.6 6.7 6.8 6.9 6.10 6.11
7. 7.1 7.2
he/she shall be placed in Second Division. he/she shall be placed in First Division.2
. of carry over subjects of semester I II III IV V 2 2 2 2 2 2 2 2 2 2 2 Carry over subjects not cleared of semester
No separate carry-over Examination will be held for any subject except for BCA Final year. permitted no. 7.1
Promotion under carry-over system A candidate who fails in the category of clause No. 8.2
For promotion to & exam II III IV V VI Admission to & Semester Exams. If candidate passes all examinations and secures aggregate marks of 50% or more but less than 60%.
9. 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.
Result Results at the end of final year will be declared with the following weightages: I year 100% II year 100% III year 100%
11. not Permitted V 8. Any candidate eligible for the carry-over system shall have to appear in the carry over subjects in the subsequent University Examination for the same semester.3
Award of Division 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.2 shall become eligible for provisional promotion to next semester and the carry-over system as per the following table.1 11. Ex-studentship Sessional marks in the subject of an ex-student shall remain the same as those secured by him/her earlier.
Grace Marks A candidate shall be entitled to grace marks of a maximum of 5 in any one subject in a semester to enable him to pass.1 13.
Scrutiny shall be allowed as per the rules of the University.12.
15. 12. Revaluation is not permitted. The grace marks will not be awarded to enable a candidate to pass in a practical or project.
Seminar and Project Candidate must secure 50% marks to pass in seminar and project. The grace marks shall not be added to the marks of the subject or to the aggregate. provided he is failing in only one subject and has secured the necessary minimum aggregate.
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++
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)
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
. Garhwal University Srinagar Garhwal
Bachelor of Computer Application Programme Structure
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 Framework BCA602 : Network Security
BCAP61 : .Net Framework BCASM : Seminar BCAPR : Project
BCAP51 : Programming in JAVA BCAP52 : Net Technology
BCA601 : .SEMESTER .
BCA202 3. Total
Theory 1. Subject Evaluation – Scheme Period Sessional L T P TA CT Examination ESE Sub. BCA204 Practical 1. Subject Evaluation – Scheme Period Sessional L T P TA CT Examination ESE Sub. BCAP12 PC Packages(Introduction to Operating system & MS Office)
Total Period = 24 Total Marks = 700
S. BCA203 4. BCA201 2. No Course No.
Total Period = 24 Total Marks = 700
S. BCA103 Mathematical Foundation 3
1 1 1 1 -
10 10 10 10 50 50
20 20 20 20 -
30 30 30 30 50 50
70 70 70 70 100 100
100 100 100 100 150 150
of Computer Science 3 4. BCA104 Business Communication Practical 1. BCAP11 Programming in ‘C’ 2. BCA102 Fundamental of Computers 3 3. BCA101 Programming in ‘C’ 3 2. BCAP21 2. TOT. Total
Theory 1. No Course No. BCAP22
Data Structures Programming in C++
System Analysis and Design
Digital Electronics Data & File Structures Programming in C++
Total : Teacher Assessment : Class Test : End Semester Examination : Subject Total : Total
3 3 3 3 12
1 1 1 1 4
4 4 8
10 10 10 10 50 50 -
20 20 20 20 -
30 30 30 30 50 50 220
70 70 70 70 100 100 480
100 100 100 100 150 150 700
TA CT ESE SUB TOT.
S. : Subject Total TOT. BCA303 Computer Architecture
Based 3 Statistical Management 3 System 3
1 1 1
10 10 10
20 20 20
30 30 30
70 70 70
100 100 100
4. BCA301 Computer
Numerical& Techniques 2. BCAP42 Visual Programming Total TA : Teacher Assessment CT : Class Test ESE : End Semester Examination SUB TOT. : Total
50 100 150 220 480 700 Total Period = 24 Total Marks = 700
Theory 1. BCAP31 Computer Based -
Numerical& Statistical Techniques 2. Total
Theory 1. BCA401 Operating
System 3 Organization & UNIX
3 3 & 3
1 1 1 1
10 10 10 10
20 20 20 20
30 30 30 30
70 70 70 70
100 100 100 100
2. BCA304 Organizational Structure & 3 Personnel Management Practical 1. BCA404 Multimedia Tools
Practical 1. BCAP32 Data Base Management System
Total Period = 24 Total Marks = 700
S. BCA403 Software Engineering 4. BCA302 Data Base System 3. BCA402 Visual Programming 3. BCAP41 Operating
System Organization & UNIX
4 4 8
50 50 -
2. Subject Evaluation – Scheme Period Sessional L T P TA CT Examination ESE Sub. Subject Evaluation – Scheme Period Sessional L T P TA CT Examination ESE Sub. No Course No. No Course No.
BCA502 Web Programming using 3
1 1 1 1 4
4 4 8
10 10 10 10 50 50 -
20 20 20 20 -
30 30 30 30 50 50 220
70 70 70 70 100 100 480
100 100 100 100 150 150 700
JAVA 3. after II and IV Semester in an organization (academic or industrial) which will be submitted in the organization. BCA501 Computer Graphics 3 2.NET framework
Seminar Project Total : Teacher Assessment : Class Test : End Semester Examination : Subject Total : Total
3 3 6
1 1 2
4 2 10 16
10 10 -
20 20 -
30 30 50 110
70 70 100 50 100 390
100 100 150 50 100 500
TA CT ESE SUB TOT. Total
Theory 1. BCAP51 Programming in JAVA 2. TOT.Net Technology
Practical 1.Net Technology Total 14
Total Period = 24 Total Marks = 700
S. BCAP62 2.
. BCAP52 .
Total Period = 24 Total Marks = 500
Note: The students with the help of the Institution may do summer training of 6-8 weeks duration.NET framework Network Security . Total
Theory 1. BCA503 Management Information 3 System 3 4. Subject Evaluation – Scheme Period Sessional L T P TA CT TOT Examination ESE Sub. No Course No. Subject Evaluation – Scheme Period Sessional L T P TA CT TOT Examination ESE Sub. BCA601 2.FIFTH SEMESTER:
S. BCA504 . BCASM 3. BCAPR
. No Course No. BCA602 Practical 1.
Semester III 4. Semester II 3. Semester V 6. Semester I 2. Semester VI (a) Seminar (b) Project TOTAL
. Semester IV 5.Each theory paper will of 100 marks comprising of 70 marks for University examination and 30 Marks for sessional. Semester VI 6. Each practical will be of 150 marks (100 marks of University examination and 50 Marks for sessional). The following in the distribution for marks (Semester wise): Theory 4x100 4x100 4x100 4x100 4x100 2x100 Practical 2x150 2x150 2x150 2x150 2x150 1x150 Total 700 700 700 700 700 350 50 100 4000
definition and function call. "Programming in C. Arrays: Linear arrays. Arithmetic & logical operators. Declaration of variables. "Fundamentals of Computers". Data Types and Sizes. PHI Pater Norton's "Introduction to Computer". "DOS Guide". structures and pointers. while. V. And address of (&) operator. Debugging Techniques. Rajaraman. Symbolic constants.BCA101 : Programming in ‘C’ Programming in C: History. "The Internet complete reference". Assignment operators and expressions. call by reference. continue. Identifiers and keywords. Control Statements: if-else. compilation and execution of C programms. File: File Handling in C References: 1. 5. external. 2. Macros. do-while. register and static). the comma operator. 3. Enumerations. precedence and order of evaluation. go to statement. array of pointers. TMH Hahn. Structure and Union: Definition and differences. command line parameters. Conditional expressions. multifile programs. multidimensional arrays. Modifiers. calloc and malloc functions. The C Preprocessor Operators: Unary operators. self-referential structure. break. pointer to pointer. Functions: built-in and user-defined. function of pointers. Loops: for. TMH Peter Nortton's. recursive functions. Arrays and strings. Dynamic Momory Allocation. Structure of C programs. parameter passing: call by value. Introduction to C Programming Languages. Storage classes (automatic. switch. Bit wise operators. Prentice Hall of India Gottfried. function declaration. Passing arrays to functions. 4. Schaum's Series Tata McGraw Hill
assembly language. keyboard. Basic terms related with Internet. character. sequencing. higher level languages. fourth generation languages. Programming languages : Classification. recursion. alteration and interaction. monitors. stepwise refinement algorithms for searching. arithmetic expressions. assignment statement. Disk Storage. merging of ordered lists.BCA102 : Fundamental of Computers Introduction to Computers: Computer hardware Components. files and pointers. storage devices and media. application software.. techniques of problem solving. CD etc. development of efficient programs. Debugging and testing of programs. Programming : Representation of integer. : Computers Today
. machine code. Managing File and Directories in various operating Systems. constraints and variables. input-output devices. data communication equipment software-system software. Structured programming concepts : Top down design. VDU. WINDOWS. Functional knowledge of these operating systems. memory. Introduction to internet.H. Program correctness. References : Raja Raman V : Fundamentals of Computers Sanders D. Algorithm development. real. sorting (exchange and insertion). arrays. printers. mouse. and their functions. data types. Basic Operating System Concepts: MS-DOS. flowcharting. Introduction to Basic Commands of DOS. TCP/IP. Element of a computer processing system : Hardware CPU. Comparison Based analysis of various hardware components. string processing sub programs. logical expression.
Normal forms. House. Asymptotic Behaviour of functions Algebric Structures: Properties. 2. Homomorphism. Hopcroft J.. Logical equivalence. Cyclic group. Language and Computation" Narosa Pub. Algebra of Proposition. Kenneth H. Logical implication. C. "Applied Discrete Structure for Computer Science. J. Discrete Numeric Functions and Generating functions. Hasse Diagram. Partial ordering relation. Abelian group. Kumar Rajendra. Permutation groups. Doerr Alan and Levasseur Kenneth. Simple Recurrence relation with constant coefficients. TMH. Liptschutz. Gersting "Mathematical Structure for Computer Science".Liu "Elements of Discrete Maehmatics". Pvt. Isomorphism and Automorphism of groups. Rosen. 3. Tautologies. Predicates and quantifiers. Linear recurrence relation without constant coefficients. Inference Theory. Galgotia Pub. Cosets.L. "Introduction to Automata Theory.BCA103: Mathematical foundation of Computer Science Relation: Type and compositions of relations. Basic logical operations. TMH. properties of group. Semi group. McGraw Hill. Posets. New Delhi. Uliman J. 5.P.D. Seymour. "Discrete Mathematics for Computer". Group. Recursively defined function. Pictorial representation of relations. Trembley. "Theory of Automata: Languages and Computation". Contradictions. TMH. "Discrete Mathematics". Prepositional Logic: Preposition. Subgroup. "Discrete Mathematics and its applications'. monoid. 4. Mathematical Induction: Piano's axioms. Equivalence relations. 8. 9. Peter Grossman. Mathematical Induction. PPM 7. Ltd. First order logic. & R. WH freeman and Macmillan 6. "Discrete mathematical Structure with Application to Computer Science".E. Palgrave Macmillian.
References: 1. Composition of function. Function: Types. Manohar.
negotiations. Communication : Fundamentals. other forms of communication. Fundamentals of Technical Communications. Learning and behaviouristic theories. Transactional Analysis and Ego-states. characteristics of needs. Presentation skills. Role of communication in IT. Public Speaking. theories of personality. measurement of personality. Oral Communication and Written Communication . cognitive theories. social learning theories. measurement and changing attitudes. downward and upward communication.
. perceptual interpretation. perceptual organization. Personality. Attitudes nature effects. nature and importance.BCA104 : Business Communications Perception. models of motivation. theories of motivation. social perception motivation.
6. address calculation. Sparse Matrices. Binary Tree. "Data Structure". and Priority Queue. "Mastering Algorithms With C". Full and Empty. Recursion: Recursive definition and processes. "Fundamentals of data Structures" Galgotia R. 4. Array and Linked Representation of Binary trees. Operations and Stacks: Push and POP. Ordered list. Array as Parameters. Traversing and Searching of Linked List. Sorenson. Algorithm Complexity and Time-Space trade-off. Pal G. Two way Merge Sort. Inc. Sorting: Insertion Sort. Operations Associated with Stacks. Overflow and Underflow. Character string operation. 7. Trees: Binary Search (BST). Operations on Queue. Kruse etal. application of arrays. Complete Binary Tree.
. Collection Resolution Strategies. Linked Representation of stack. Adm Frozdek. Add.BCA201 : Data Structure & File Organization Introduction: Basic Terminology. Searching and Hashing: Sequential search. 2. Application of stack. Shroff Publishers and Distributors Bruno R Preiss. Hash Function. Create. Bubble sorting. 3. Conversion of Infix to Prefix and Postfix Expressions. Hash Table.M. Quick Sort. "Data Structures and Algorithms in C++" Thomson Asia 8. Representation and Analysis. Tenenbaum etal. Elementary Data Organization. TMH 1. Insertion and deletion to from Linked Lists. Circular queue. Linked List of Array. Threaded Binary trees. comparison and analysis. Single and Multidimensional Arrays. "Data Structure and Algorithms with Object Oriented Design Pattern in C++. TMH K Loudon. Binary tree representation algebraic Expressions. "Data Structures and Program Design in C" Person Education A. References: Horowitz and Sahani. Array Representation of Stack. Arrays: Array Definition. "Data Structures and Program Design in C" Person Education Lipschutz. Insertion and Deletion in BST. Hash Table Implementation. Link List: Representation and implementation of Singly linked lists. Huffman algorithm. Doubly linked list. Traversing Threaded Binary tree. and Vector. Traversing Binary trees. 5. Dequeue. Stacks: Array Representation and Implementation of stack. Polynomial representation and addition. Extended Binary Tree. Data Structure operations. Queues: Array and linked representation and implementation of queues. Two-way Header List. Evaluation of postfix expression using stack. Character String in C. Garbage Collection and Compaction. "An Introduction to Data Structures with Application". Generalized linked list. Trees: Basic terminology. Jhon Wiley & Sons. Insertion and deletion Algorithms. Delete.
Converting between types. “Let Us C++”. “Complete Reference”. Const member functions. Dynamic memory allocation. Stream error. 4. Creating New data types in C++. Reference Parameters. Restrictions. Unformatted I/O. Virtual destructors. default arguments. Fundamentals. References: 1. Abstract base classes and concrete classes. Polymorphism. Linkage specifications. Herbert Scheldt. container classes and Iterators Overloading & Inheritance: Operator Overloading. Deitel H. Virtual Functions : Introduction. Friend function. 2. Class Scope. Constructor. Protocols and Private inheritance. Introduction to C++. Const objects. Constructors. Public. States. Stream manipulators. Insertion and stream extraction operators. 3. Dynamic binding. Stream Input. Stream Output. Introduction.M. Stream format states. 5. Overloading unary & binary operators. Overloading stream. Comparing class with Structure. Virtual functions. Yashwant Kanetkar. C++ Stream I/O : Streams. E. Friend class. C++ Programming by Herbert Scheldt – 2004. Basic Concepts of OOP. Balagurusamy “Object Oriented Programming with C++”. Type fields and switch statements.J. & Deitel P. Unary Scope resolution operator.
. Data abstraction and Information hiding. Inline functions. Class. Destructor. Accessing Members of a class. This pointer. declarations in C++. 6. Inheritance. Implicit Derived class object to base class object conversion. Direct base classes and Indirect Base Classes. Casting base _class pointers to derived _class pointers Overloading Base class members in a Derived class. Friend Class : Introduction. Protected members.BCA202 : Programming in C++ Introduction: Introduction to OOP. Using Constructors and Destructors in Derived classes. Introduction to C++ stream I/O. Overloading ++ and --. Applications of OOP. function Prototypes. Const Qualifier. – “How to Program C++” – PHI – 2003 Al stevenes – “C++ Programming” – Wiley dreamtech – 2003.
Implementation. Background Analysis. Behavioral issues.Awad. Feasibility Study: System performance. The Tools of Structured Analysis: The Dataflow Diagram (DFD). Requirements form Design. Performance Analysis. Systems Planning & Initial Investigation: Strategies for Determining Information Requirement. Arranging the Interview. The Structured and Unstructured Alternatives. Elias M. Interviews & Questionnaires.BCA203 : System Analysis and Design System Concepts and Information System Environment: The System Concept. "Introduction to System Analysis & Desogm". Computer based Information Systems. Efficiency Analysis. Onsite Observations. Information about the firms. Design. References: 1. Impetus for System Change. Elements of a System. Types of Interviews and Questionnaires. Guides to Successful Interview. General Business Knowledge. Economic Feasibility. Analysis. the art of Interviewing. "Modern Systems Analysis & Design" Addision Wesley 3. Review of Written Documents. Information Gathering: Kind of Information needed. Data Dictionary. Service Analysis. CRT Screen Design. Behavioral Feasibility. Analyst/User Interface. Technical Feasibility. Fact Analysis. The Role of the Systems Analyst: Role of the Analyst. McGraw Hill
. Kendall. Formal & Informal Information Systems. "Systems Analysis & Design" Galgotia Publication 2. Fact Analysis. Open and Closed and closed system. Information gathering tools. Management Information System. Post implementation & Maintenance. Output Design. Input/Output and Forms Design: Input Design. Hoffer. and Interpersonal Communicational System. The System Development Life Cycle: Recognition of needs. Decision Trees and Structured English. Problem Definition & Project initiation. Definition. Steps in Feasibility Analysis. Decision Support System. Feasibility Study. Characteristics of Systems.
Memory Organization: Memory hierarchy. EBCDIC and their conversion. I/O Organization: Peripheral devices. and Serial Communication. Hardwired & micro programmed control unit. Associative memory. Subtractor. Instruction formats. Decoder. Memory Management Hardware. Ram. "Computer System Architecture" PHI Zaky & Hamacher. 5. 3. Programming Registers. Stack Organization. ASCII. Instruction Cycle). Full Adder. "Structured Computer Organization" PHI. magnetic disk and its performance. Direct Memory Access. 4. Auxiliary memory. "Computer Organization: McGraw Hill B. Logic gates. Octal. Bus Architecture. 2. Willam Stalling. Demultiplexer. Virtual memory. Addressing modes. Half Adder.
. Basic Organization: Operational flow chart (Fetch. hit/miss ratio. "Computer Fundamental Architecture & Organization" New Age Tannenbaum. Character Codes (BCD). Asynchronous data transfer. Input-Output Processor. Modes of Transfer. "Computer Organization & Architecture" Pearson Education Asia Mano Morris. Boolean Algebra. General Register Organization. Priority Interrupt. References: 1. Single Organization.BCA204 : Digital Electronics Representation of information & Basic Building Blocks: Introduction to Computer. I/O Organization. I/O interface. magnetic Tape etc. Encoders. Multiplexer. Execute. Hexadecimal. Computer hardware generation. Number System: Binary. I/O Controllers. Kmap simplification. data transfer & Manipulation. Organization of Central Processing Unit. Cache memory. Main memory (RAM/ROM) chips).
Numerical Differentiation. Euler's Method. :Computer Oriented Numerical Methods". Gauss Seidal iterative method. Trapazoidal rule. Iteration method. New Ager Int. 4. Polynomial Interpolation: Newton's forward and backward formula Central Difference Formulae: Gauss forward and backward formula. Rajaraman V. Khanna Publishers. Numerical Differentiation and Integration: Introduction. Delhi. Regula-Falsi method. AW Jain. Taylor's Method. Grewal B. Rate of Convergence. Pitfalls of floating point representation. Interpolation and approximation: Finite Differences.S. Normalization. PHI Gerald and Wheatley. Lyengar and Jain. stirling's Bassel's Everett's formula. T Ramchandran. III conditioned system of equations. Newton Divided difference formula. Secant method. "Numerical Methods for Scientific and Engineering Computations:.BCA301 : Computer Based Numerical Techniques Floating point Arithmetic: Representation of floating point numbers. Interpolation with unequal intervals: Language's Interpolation. Gauss Elimination direct method and pivoting. "Theory and Problems of Numerical Methods". Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method. "Numerical methods in Engineering and Science. References: 1. Numerical Integration. Simultaneous Linear Equations: Solutions of system of Linear equations. Runge-Kutta methods.Veerarajan. TMH
. Boole's Rule Euler-Maclaurin Formula Solution of Differential Equations: Picard's Method. Errors in numerical computation. Refinement of solution. 5. Difference tables. 2. Operations.. T. 3. Simpon's rules. Rate of convergence of iterative methods. "Applied Numerical Analyses". Newton Raphson method..
BCNF. relationships of higher degree. 3. 5. DMI. Addision Wesley Korth. Sudarshan. Unions. candidate key. Introduction to SQL: Characteristics of SQL. Database System Vs File System. normalization using FD. second third normal forms. "An Introduction to Database System". first. integrity constraints: entity integrity. views and indexes Queries and sub queries. Keys constraints. relational calculus. Navathe. data models schema and instances. Insert. "Database Concepts" McGraw Hill Elmasri. Overall Database structure. Desai.
. primary key. keys. Relational Data Model and Language: Relational data model concepts. Intersection. extended ER model.J. Types of SQL commands. Generalization. Cursors in SQL. Database Design & Normalization: Functional dependencies. Minus. "An introduction to Database Systems". "Database Systems" Palgrave Macmillan Bipin C. Advantages of SQL. Galgotia Pub. mapping constraints. Concepts of Super Key. loss less join decompositions.BCA302 : Data Base Management System Introduction: An overview of database management system. SQL data types and literals. 2. data independence and data base language and interfaces. Date C. alternative approaches to database design References: 1. reduction of an ER diagrams to tables. Data definitions language. Data modeling using the Entity Relationship Model: ER model concepts. Joints. tuple and domain calculus. SQL operators and their procedure. aggregation. Aggregate functions. Triggers and clusters. normal forms. referential integrity. relational algebra. Domain constraints. inclusion dependencies. 4. "Fundamentals of Database Systems" Addision Wesley Paul Beynon Davis. notation for ER diagram. MVD. Database system concepts and architecture. and JDs. PL/SQL. Tables. Silbertz. update and delete operations.
J. “Introduction to Computer Theory”. J.Hopcraft. Elements of the Theory of Computation. Deterministic and non-deterministic computations. J. T. Papadimitrou. C. Solvability. Languages and Computation”.E. John Wiley. Hopcroft. Turing Machines (TM). Church-Turing Thesis. 1997.D. Cohen. Introduction to Theory of Computation.
. PWS Publishing Corporation. Theory of Computation.C. 3. Ullman. Addison-Wisley. Undecidability and Computability.H. “Introduction to Automata Theory. R. Tata McGraw-Hill 6. Universal Turing Machines (UTM). Pearson Education 2. Languages and Computation. Pumping Lemma for Context free languages.E. Turing computable functions. Relation of Languages to Automata. Sipser. Context free languages. Introduction to Automata Theory. Regular languages. Martin. Pushdown automaton. Ullman. Motwani and J. Halting problem. Grammar types and Chomsky Hierarchy.BCA303 : Theory of Computation A brief review of Finite Automata. References: 1.D. Regular expressions. PHI.R. 5. Variations of TM’s. H. Pumping Lemma for Regular languages. 4. Lewis. M. 1979.
S.S. Fayol's 14 principles of Management Webar's bureaucratic theory. "Essentials of Management:. Rao. V. HRM model. Project based (Matrix). Ltd. training of International assignment. Geography based. Weihrich. definition and importance of HRP. :Organizational Behaviour". "Organizational Theory and Behaviour" Konark Publishers Pvt. McGraw Hill 6. types of interview. Motivation: Definition of Motivation. Personnel Function: Personnel polices and principles. HRM-function and objectives. Aswathappa. P. Span of control. TMH 4. differences between HRM and PM Emerging trends of personnel management in India Human Resource Planning: Meaning.
. "Principles of Management:. Prasad "Organizational Behavior". Virtual and Network organization Structure. Centralization and Decentralization. Indian scenario. Product bases. duties and responsibilities of personnel manager. Two-Factor Theory. Prasad.M. selection process. L. Tripathi. Organization Design: Mechanistic and Organic Structure.Chand 2. TMH 7. TMH 5. Importance of Motivation. Formal and Informal Organization. 3. Training and Development: Nature of training and Development. Reddy. Theory X and Theory Y. Narayana.M.P. Inputs in training and Development. L. References: 1. Job Analysis: Meaning and definition. Motivation and behaviour. Nature and Scope of Human Resource Management: Scope of HRM. Theories of Motivation . Fred Luthans. process of job analysis Recruitment: Meaning and definition. Definition of organization and organization Structure.S.BCA304 : Organization Structure and Personnel Management Organization Structure: Classical theories of Management: Scientific management theory. S. sources of recruitment. Selection: Meaning and definition. McClelland's Need Theory. importance of training and Development. Koontz. Some Concepts Regarding Organization Structure: Line and Staff authority. importance. Forms of Organization Structure and Feature: Function bases. K.Chand. "Human Resource management". training process. "Human Resources and Personnel Management".Maslows need Hierarchy.
process Scheduling. 3. acyclic graph and general graph directory. References: 1. avoidance detection and recovery. directory system – single level. and segmentation. : Modern Operating system. simple batch system. Growley. Deadlocks. process synchronization. CPU Scheduling concepts. allocation of frames. Secondary storage structure: Disk structures. Mandnick and Donovan : Operating system (Mc–Graw Hill) 1996. linked and index allocation. synchronization hardware. Tanenbaum A. operating on process. 4. operating system service. Peterson Abraham & Silbesschatz. process. Storage management Resident monitor.BCA401 : Operating system Organization & UNIX Operating system. 2. Process concept. free space management. swapping. Demand paging. allocation methods. co-operating process. Logical versus physical address space. deadlock prevention. Case study of the UNIX system: design principles. Real time system. Virtual memory. critical section problem. deadlock characterization.S. SCM. allocation methods-contiguous. memory and file management. access methods. . programmer and user interface. storage hierarchy. File System: File supports. file protection. disk scheduling disk management.
.definition. (PHI) 1998. Scheduling algorithms. : Operating system a design Approach . Peter Galvin: Operating system concepts. page replacement and page replacement algorithms. Time sharing system. tree structured. semaphores. thrashing.
Arrays. The Control Box. The Procedure Separator. The Menu system. The Anatomy of a Procedure. Tool Box. The Image List control. Immediate. Interacting With the user. MSFlexGrid Control. Why ADO. Saving your work. Project Explorer. Creating Multiple Reports
. Specifying the Active Child Form or Control. Dynamic arrays. Font Properties. Creating a Report through a Wizard. Directory and File List Controls. The Null Value. Using the Data Source name in Our Control. Making the Menu Better. Events. Saving the Project. Activate. Declaring Fixed-Size Arrays. Circular References. Establishing a Reference. Data Types. Auto List Members. If. Images. Now Entering the Code. Opening the Code Window. The Form Window. The Design/Preview Window. Move. Data Report Controls. Write Code to Respond to User Input/Events Creating an Application : The Tool Box.BCA402 : Visual Basic Programming
Introduction : What is Visual basic. Multi-dimensional arrays. Parts of the Code Window. Using the Menu Editor. Object Box. Converting Data Types. Consistency Across Forms and the Application. Usability. Min Button and Max Button. The For. Commenting and Uncomment Statements. Table or Stored Procedure. What is a Cursor Crystal and Data Reports : Crystal Reports. Show Style. Updating the data in the Data Source. Data Report. Slider Control. Split Bar. Important Information Must be Given Prominence. Coding the Menu Items. ADO. Listing Open Forms. The Image Control. Unloading MDI Forms with Query Unload Additional Controls Available in Visual Basic 6. Maintaining State Information for a Child Form. Adding the Toolbar. The Scope of a Variable. Understanding Projects. Movable. Working with the Image List Control. Populating the Tree View control. Caption.0 : Objectives. Properties Window. Full Module View Icon. The Preserve Keyword. Tab strip Control. ActiveX Data Objects : Objectives. How Do You Put or Create the Control on the Form. and Watch Windows IDE. Show Method. Label Box. The Visual Basic Philosophy. Developing an Application. Loading MDI Forms and Child Forms. Methods. Working with the Tree View control. Simplicity. The Controls. Changing the Caption of the New Forms. Editor Features. Setting Form Properties. The Anatomy of a Form. Option Button. Command Button. All about Menus. Picture. Deactivate. What does Visual Basic 6 have for you to create applications. The Data Source. Tree View Control. Prerequisites for working with Crystal reports. Pasting Icons on Buttons Multiple Document Interface Applications : Why MDI Forms. Other Tools for Software Development. The Properties. Using Bound Controls. Next Statement. Creating a Tree View control. Creating Tabs at Design Time or Run Time. Subroutine or Function. OLE DB. Writing Code in Visual Basic : The Code Window. The error Value. Border Style. The Panel Object and the Panels Collection. Consistency. The Status Bar Control. Select Case…End Select Menus : Building the User Interface. Overcrowding. Customizing this Toolbar. The Menu Editor. How do you Define them. The Line and Shape Controls. The Decision Maker. Menu Conventions. The Fonts. The Drive. Features of an MDI Form. Extracting the Data. Project Explorer Window. Visual basic Editions. Design the User Interface. Tool Bars. Graphic Methods. The Loop. Anatomy of the Code Window. The Empty Value. Text Box Control. Hide Method. Context Menus. Declaring variables. Constants. Module Level Variable. Color Cueing. Form Layout Window. Check Box. Automatic Word Completion. Name. Unload Event. Initialize. Toolbar Conventions. Frame. Menu Bar. Background Color. Affordances. Combo Box. Features of Visual Basic. Load. Object Browser. The Picture Box. Colors. Code Editor Window. The Active Form Property. Procedures/Events Box. Working with the Properties Window. Creating a Report without a Wizard. Terminate. Forms and Controls : The Form. Opening the Code Window. OLE(Object Linking and Embedding). The Properties Window. Working with a Control. Displaying Data from a Database. Data. List Box. Locals. Parts of the Data Report. The While Loop. Getting acquainted with the Data Report Designer. Margin Indicator Bar. Procedure View Icon. Variables: What is a Variable. Show Methods. Form Methods. Form Designer. Associating the Image List Control with the Tab Strip Control. Adding Images to the Image List. The First Step. The ODBC Data Source Administrator. More work on a Control. Declaring Variable. Line Continuation Character. The Code Window.
Software Components. Pfleerger. Role of management in software development. Ghezzi Carlo and Others "Fundamentals of Software Engineering" PHI 5. Boston: McGraw Hill. evolving role of software. 2001 2. Reliability growth modeling. Software Reliability & Quality Assurance: Reliability issues. system testing and debugging. Monitoring and control. Alexis. Software quality. Software Characteristics. programming style and internal documentation. coupling. Alpha & Beta testing. Software Crisis. Ian. comparison between ISO & SEI CMM. top down and bottom up-design. Testing principles. project monitoring. the process. Software Requirement Specification: Analysis. project management. 1987
. Requirement specification. reliability assessment. CASE support in software life cycle. The Incremental Model. Fairly. Coding: Top-Down and Bottom-Up programming. "Software Engineering" TMH 4. Software-Design: Design principles. information hiding. problem partitioning. Software Applications. Spiral Model. "Software Engineering" Macmillan. risk management. "Software Engineering" New Delhi" TMH 8. Software Architecture. Levels of testing. Cohesiveness. Structured approach functional versus object oriented approach. "Software Engineering Ed. staffing. Schaum's Series. Software Project Management: The Management spectrum (The people. test case specification.BCA403 : Software Engineering Introduction: Introduction to software engineering. Roger S. documentation. References: 1. Transaction and Transaction and Transform Mapping. "Software Engineering" AWL 7. Jalote. software configuration management. Principles. Structured Vs. Unit testing. SEI capability maturity model. Architecture of CASE environment. project scheduling. S. Software engineering problems. abstraction. Importance of software. Reliability metrics. software testing strategies. Integration Testing. Water Fall Model. the product. Problem Analysis. CASE (Computer Aided Software Engineering): CASE and its scope. internal interface. Unstructured maintenance.. structured programming. structural testing. Functional independence. 6. Verification and validation.2"New Delhi: Narosa 2002 3. Role of matrices and Measurement. Forth generation techniques. quality assurance. Forth Generation Techniques. "Fundamental of Software Engg. test plane. Leon and Mathews Leon. Reverse Software Engineering. Monitoring and Control. Prototyping. "Software Engineering: A Practitioner's Approach Ed. the project) Cost estimation. Pressman. functional testing. design specifications and verification. Software Development Life Cycle. Component level Design. Software Process. Pankaj. Sommerville. ISO 9000 Certification for software industry.
Black : Computer Network. 3. message switching. Starlings. the transmission control block (TCB). other BSC system. connection oriented and connectionless networks. 6. 4. A. analog to digital communication. 1985. A parametric illustration. characteristics. application layer protocols. Tannanhaum. flow control and windows x. using the personal computers as server linking the personal computer to mainframe computers. The X. Polling/Selection. other packet type. x. 8. classification of communication protocols polling/selection systems. packet switching support to circuit switching networks. rotation for layered protocols foals of layered protocols. Satellite and Local area Networks: Binary synchronous control. passive and active operation. TCP/IP: TCP/IP and internetworking. Communication Between Analog Computers & Terminals Layered Protocols.S. examples of route discovery protocols. Digital’s switching. major features of IP. Theory and Practices. advantage. packet formats. Ahuja : Design and Analysis of Computer Communication Network. value of the transport layer. Protocols. Major IP services. 9.25. Black : Data Network. personal computer and local area networks. other standards layer the pad.
.25 facilities. and the Tele-port primary attribute of a LAN. References: 1. LAN topology and protocols. Protocols Architecture. packet switching. Switching and routing in Network: Telephone switching system. Martin J. PHI 5.25 & Digital Networks: Layers of x. structure of the communications network topologies the telephone network. IP datagram. McGraw Hill Co. Chorafas: Designing and Implementing Networks. and Introduction Mack Publishing Co. Personal Computer Network: Personal computer communications. File transfer on personal computers. IEEE LAN standards. voice transmission by packet. The IP address structure. Standards and Interface PHI – 1995. example of TCP/IP operations. network design problems. 2.BCA404 : Data Communication & Computer Networks Introduction to Computer Networking: Use. Traffic control and accountability wide area and local area networks. communication between layers. TCP. route discovery protocols. semaphores of vendor offerings. PHI – 1995. IP source routing.: Computer Network and Distributed processing. conversion using satellite communication SPUS.25 logical channel states time out and time limits. Internetworking : Principles. Comer. related protocols ports and sockets. Network & The OSI Models. communication networks communication between layers. Crichlow : Introduction to Distributed and Parallel Comp.25 flow control principles. Major features of TCP. features of x. PHI with TCP/IP 7. : Computer Network. advantage of digital networks. William : Local Networks. McGraw Hill Co. non-priority system priority system. Personal computer networks and the OSI models. Concepts. introduction to standards organizations and the ISO standard.
Prajapati A. "Procedural Elements of Computer Graphics". Matrices and operations related to matrices. Scalar product of two vectors. 3D transformations. Printers. Rogers and Adams. References: 1. Procedural. Bezier curves and surfaces. Hidden surface removal. Steven Harrington. Principles of Animation. Rogers. Foley James D. Flood fill algorithm. Graphics Operations: Clipping. Spline specifications. Superquadrics: Superellipse. 3D Graphics: 3D Display Methods. Stochastic. multiple selections. "Mathematical Elements of Computer Graphics" McGraw Hill
.BCA501 : Computer Graphics Graphics Primitives: Display Devices: Refresh Cathode Ray Tube. Donald Hearn and M Pauline Baker. and Torus. Mouse. Joystick. Animation: Introduction to Animation to Animation. McGraw Hill 7. Animation Tools: Hardware-SGI. Display file structure. Representational. Boundary-Fill Algorithm and scan-line polygon fill algorithm. Filling: Inside Tests. Menu selection. Point Clipping. Types of Animation Systems: Scripting. Basic Transformations. Spline & Bezier Representations: Interpolation and approximation splines. Tablet. Vector representation. Curves and Surfaces: Quadric surfaces: Sphere. Transformation: 2D transformation. Functions for segmenting the display file. Shearing. Input Devices: Keyboard. "Computer Graphics: A Programming Approach" TMH 3. Newman and Sprould. parametric continuity conditions. etc. Line Drawing Algorithms: DDA Algorithms. PC's Amiga etc. Geometric Continuity Conditions. Appending to segments. Constraints. Polygon Clipping. Bresenham's Line algorithm. Composite transformations: Reflection. Transformation between coordinate systems. and Digitizing Camera. Mathematics for Computer Graphics: Point representation. Light Pen. Liquid Crystal display Plotters. Rubber-Band techniques. Visible lines and surfaces identification. Ellipsoid. Free storage allocation. "Computer Graphics" PPM Ed2 4. Default error conditions. Line Clipping. Dragging Dimensioning techniques and Graphical Potentiometers. Trackball. Scales & Guidelines. Pointing and Selection: the use of selection points defining a boundary rectangle. Potentiometers. Parallel projection. Vector addition and vector multiplication. Input Techniques: Positioning techniques. "Computer Graphics" PHI 2. Plasma display. Raster Scan Display. Refresh concurrent with reconstruction.K. Posting and posting a segment. Segment & Display files: Segments. Perspective projection. Vector product of two vectors. "Computer Graphics" AW Ed2 5. "Principle of to Interactive Computer Graphics" McGraw Hill 6. superellipsoid. Types of Animation. Conics. segment naming schemes.
HTML. Security on Web. References: 1. XML: Introduction. Images on a web page. PERL. Server Side usage. Interactive layout with Frames. Documents. DHTML. the client. HTML: Formatting Tags. Web project. Font control. 3. Web Team. Comments in HTML. forms. Growth of the Web. Events and Event Handling. Tables. "Essential COM" Addison Wesley 6.BCA502 : Web Programming using JAVA Internet-Beginning and current state. Browser. "Developing E-Commerce Sites" Addison Wesley Iva Bayross. Web Home page. 4. Telnet and e-mail. Arrays. "Web Technologies Part-II" BPB Publications Shishir Gundavarma. Communication Issues. COM/DCOM. Greg Buczek. Java Script: Introduction. Technological advances and Impact on Web Teams. Frames. Active Server Pages (ASP). Introduction to Cyber Laws in India. Multi-departmental & Large scale Websites. Checkboxes. Web Authoring using HTML : Creating a Web page. Buttons. Backgrounds and colour control. URI. ISP and Internet accounts. Links. Display and XML Documents. 2. CGI Programming on the World Wide Web" O'Reilly & Associate 5. VBScript. History of the web. Plums and helpers. Document types definitions. statements. Protocols governing the web. methods of Linking. objects in Java Script. Team dynamics. RMI. Addison Wesley Sharma & Sharma. Quality Assurance and testing. Data Interchange with an XML document. "Collaborative Web Development". Publishing. Introduction to International Cyber laws. Gopher. forms. " ASP Developer's Guide" TMH
. Arranging text in lists. Client-side usage. List. Text formatting and alignment. searching tools and search engine FTP. hardware and software requirements. Parsers using XML. Common Gateway Interface (CGI). DON Box. Documents. FORMS. Burdman. functions. Text fields and Text areas.
Levels of MIS (Top. Middle. Decision Support Systems. HRM. Systems approach to problem solving.BCA503 : Management Information System Fundamentals of Information Systems.S. Lower). Planning Implementing & Controlling Information Systems. Ethics & Society.
. Brein James O.
References: 1. Data models. Developing information system solutions. Murdick & Ross – Information Systems for Modern Management 3. Aktas A. Data Security & Information quality.Ziya – Structured Analysis and Design of Information Systems. – Management Information Systems – Strategy and Action. – Management Information Systems 2. 4. Data Organization. Accounting and Finance. Executive Information Systems. Parker C. Manufacturing. Expert Systems. Computer Crime.
Corporate Databases & Database Management. Information Systems in Marketing.
Transaction Processing Systems.
Information Resource Management.
Visual Studio Environment: IDE Start Page. IDE Main Window. Handling Exceptions. Run Time. Properties Window.
. LISTS. Testing. and Object Oriented. Event Driven. SUB PROCEDURES. Toolbox. Three-Step Process. and Break Time. AND PRINTING. Coding. New Project Dialog. Microsoft’s Visual Studio. Programming Languages – Procedural. Form Designer. Printing.Net Technology Introduction to . Plan the Project. Maintenance. The Object Model. Formatting Data. Design Time. Naming Rules and Conventions for Objects. Run-Time Errors. VARIABLES. LOOPS. Visual Basic Application Files. Writing Visual Basic Project: Workspace Setup. Solution Explorer Window. Displaying Messages in Message Boxes. Writing Visual Basic Projects.NET. Toolbars. AND ADDITIONAL TOPICS IN VISUAL BASIC.NET: Writing Window Applications. Windows Graphical User Interface.BCA504 : . CONSTANTS AND CALCULATIONS: Data: Variables and Constants. MENUS. Project Debugging. DECISIONS AND CONDITIONS. Counting and Accumulating Sums. AND FUNCTIONS. GRAPHICS. Set Properties. Document Window. Finding and Fixing Errors: Syntax Errors. ANIMATION. Logic Errors. Define the User Interface.
Managing .NET Paradigm. Characterize the . Components of the CLR. . .NET : The Class Framework.NET Lesson Introduction.NET Windows Forms.NET. Interface and Inheritance-Based Polymorphism.NET Class Framework.NET Application. Compare the . Overloading. Assembly. Microsoft Intermediate Language (MSIL).Net Framework Introduction: .NET Applications.NET: Common Language Runtime Components. . Common Language Runtime (CLR). Compile and Debug. Cross-Language Interoperability.NET Compilers. Inheritance. Purpose of Namespaces. Framework Components. Component Deployment. DLL Hell. . Garbage Collection. Unifying . Structured ErrorHandling.
. Simple . Console Applications. Web Services.BCA601 : . Multiple Language Support in .NET Class Framework to a Language-Specific Class Library.
Random Number Generation. New Jersey 2. Block Cipher Modes of Operations. Block Cipher Principles. Combining Security Associations.BCA602 : Network Security Introduction To security: Attacks. "Cryptography and Network Security" TMH Practice"'
. Secure Hash Algorithm (SHA). Placement of Encryption Function. William Stallings. Conventional Encryption Model. Security Services. Services & Mechanisms. Atul Kahate. MD5 Message Digest Algorithm. Hash Function Birthday Attacks. DES Standard. Security. Message Authentication Codes. Modern Techniques: Simplified DES. Classical Encryption Techniques. International Data Encryption Algorithm. Security of Hash Function & MACS. Authentication Protocol. Conventional Encryption Algorithms: Triples DES. CAST-128. Digital Signatures: Digital Signature. DES Strength. Electronic Mail Security. Key Distribution. Pretty Good Privacy (PGP). Conventional Encryption: Classical Techniques. Directory Authentication Service. Hash Functions: Message Authentication & Hash Functions: Authentication Requirements. RCS. Johannes A. Network & System Security: Authentication Applications: Kerberos X-509. Authentication Header. References: 1. "Introduction to Cryptography" Springer-Verlag 3.S/Mine Security: Architecture. Blowfish. "Cryptography and Network Security: Principles and Prentice hall. Block Cipher Design Principles. Key Management. Buchmann. Differential & Linear Cryptanalysis. and steganography. Attacks. Encapsulating Security Payloads. Digital Signature Standard (DDS) Proof of Digital Signature Algorithm. CR2 Placement & Encryption Function. Authentication Functions.