Bachelors’s in Computer Application
BCA stands for Bachelor of Computer Applications. It is a three years Undergraduate Degree Course, which is divided into six semesters. Students study about Computer and Information Technology related subjects in depth. Being a best BCA college in Patna, CIMAGE offers an excellent campus placement facility. Get Admission in one of the best BCA college in Patna for best-in-class education, result, and placement. BCA Admission 2023 Open Now at CIMAGE College Patna.
India’s Leading Newspaper, Times of India declared CIMAGE as a no.1 college across Bihar. It is also recognized as a best BCA college in Patna.
If you are looking for the best BCA college in Patna, then CIMAGE is the right place. In this Hi-tech age of computers, where everything is being digitalized, knowledge about The growth of the IT industry is magnificent and evident. The Information Technology Industry is growing at a rapid pace. With the advent of globalization, computers grew in prominence. computer and Information technology are very important. It helps the student have a distinct advantage over others, who do not have a degree in Computer Applications. BCA is a technical course. After completing 3 Year Degree Course, one can make his/her career in the field of Computer Applications as well as in the field of Software & Web Development. It’s a very good course but only for those who have an interest in computers and want to see them as an IT Professional in future. If you are interested in Computer Science & Technical field, then BCA is the perfect course for you. You can get admission to CIMAGE as it is the best BCA college in Patna and providng world-class education and campus placement facility.
Students who got admission for a Bachelor in Computer Applications (BCA) course at CIMAGE College Patna gets to learn programming languages such as Java, C++, HML, SQL, etc. Information about various computer applications and latest developments in IT and communication systems is also provided. Learners not only gets skills and information about Computer and Information Technology but also in communication, organization, and Management too. As far as education and placement is concerned, CIMAGE is ranked as the best BCA college in Patna.
The opportunities available for a well-trained and Skilled BCA course are galore. CIMAGE College, Bachelor in Computer Applications (BCA) course gives a number of opportunities to individuals to go ahead and shine in their lives. The range of chances in Information Technology (IT) is immense. Some are creative while others are highly technical. A few of them being like Software Programmers, System, and Network Administrators, Web Designers, Software programmers, Database Administration, Faculty for Computer Science/Communication Technology, etc.
After Successful completion of BCA course from best BCA college in Patna you will have an added advantage and builds a firm platform for IT professional. BCA graduates can start their career as programmers and rise to that of senior programmers. They can begin their career in IT industry as Junior Programmer and can get promoted as senior project managers and senior programmers. The ones, who works in some organization for a few years and then can go for their Masters in Computer Applications(MCA). After completing their masters one becomes specialized in that particular field. It gives a distinct advantage to the students in the field of Information Technology. Getting admission for BCA course in Patna, Bihar at CIMAGE would be a great choice for all the students who passed 12th.
One can land up either with a job or can think of starting up an IT business, as per their desire and interest that one always wished for or had an eye on. The students will be able to get a strong academic base with the help of which they can get an advanced career in computer application by doing the BCA course in Patna. BCA degree helps the students to get a sound knowledge of computer applications with the help of which they can have a perfect launch pad for challenging career in the field of information technology. CIMAGE offers best bca course in Patna. This course is highly recommended for candidates willing to make it big in the field of information technology and related streams.
The IT industry is rapidly growing and the demand for BCA graduates too is increasing every year. BCA graduates have great job prospects both in the government and private sector companies.
CIMAGE Group of Institutions are widely recognized as a Center of Excellence for Management, Commerce and Information Technology, promoted by the ‘Vijayam Educational Trust’, a charitable trust managed by industry professionals. It is also recognized as a best bca college in Patna.
As a trusted name for excellence in education, our experienced and qualified faculties train & groom the students with employment requirements in our industry. Credit for providing placements to more than 3700 students in the last 11 years, we have successfully linked education with employability by offering several in-demand jobs oriented vocational Add-On Programmes with BCA course admission in patna at CIMAGE.
Students after getting admission in bca at CIMAGE college patna may apply under Student Credit Card Scheme of the State Government. Under the scheme, girls, transgender and students with disabilities are provided education loan up to Rs. 4 lakh at only 1% interest, while other students will have to pay 4% interest for pursuing higher education.
Students who are able to qualify the Entrance Examination and personal interview at CIMAGE would be allowed to apply for the Student Credit Card loan provided they complete all necessary formalities of getting enrolled at CIMAGE group of Institutions.
Information Technology & Application
Principles of Management & Organization
Python Programming (Elective-1)
Problem Solving & Programming Concept (Elective 2)
Mathematics [Numerical Techniques]
System Analysis & Design
Problem Solving Technique & Programming in C
Operating System & Unix
Object Oriented Programming Using C++
Internet and Web Designing
Relational Database Management System
Digital Electronics, Computer System Architecture and Organisation
File & Data Structure
Introduction to Statistics
Windows Programming using VB.Net
Graphics & Multimedia
Computer Network, Data communication, and Client Server Technology
Business Accounting& ERP
Web Technology(Elective 1)
Concept of Data Mining & Data Warehousing (Elective 2)
Project & Viva
Lab 601 A
Lab 601 B
Introduction to Computer Architecture
Programming Logic and Design Techniques
Programming with FOXPRO
Computer Added Drafting
Programming in Visual Basic
Elements of the User Interface
Visual Development and Event-driven Programming
Customizing the enviornment
Introduction to Visual Basic Lang Variable
Database Management System I
Database Management System II
Object Oriented Programming
Advance Topics in Computers
Being a best BCA College in Patna it offers several latest Add-On Courses, as per the requirements of the Industry, which keeps students ready to meet the Global Challenges in the field of Information Technology, resulting in giving an edge to the CIMAGEians over the rest BCA Graduates.
CIMAGE- Best BCA college in Patna | BCA Admission 2023, Ranking, Fee & Placement
CIMAGE Group of Institutions is categorized as best BCA college in Patna because of its Education, Result & Placement. It offers BCA Course with campus placement facility. Being a best BCA collge in Patna, Bihar it has achived various Awards & Recognitions.
Yes of course, India’s leading Newspaper Times of India published that CIMAGE group of Institutions is a No.1 College in Patna for the study of IT-Managemnt Courses with job placement. It is also recognized as top bca college in Patna.
Yes, CIMAGE College Patna provides campus placement after BCA course in MNC companies such as Wipro, TCS, Accenture, Infosys, PayPal etc.
If you want to join a BCA course in patna with campus placement facility then go with the CIMAGE College. It is one of the best BCA college in Patna, Bihar that offers placement facility in top companies.
As we know that IT industry is rapidly growing and thus everything is handled by computers so there is a huge demand of compauter technical peoples. Therefore BCA has become a good career option.
When it comes to top bca college in Patna there is only name comes and that is CIMAGE College Patna.
Yes, Being a best BCA college in Patna. CIMAGE Group of Institutions offers a Student Credit Card System. It is a scheme by Bihar government for poor students to continue their studies.
As CIMAGE is recognized as one of the best bca college in patna that offers best education, result and placement so you must opt this.
Yes, BCA Admission 2023 opens at CIMAGE College Patna. For more details regarding BCA Admission 2023 please Visit www.cimage.in.
Yes, You will have a great future ahead, if you do BCA course from CIMAGE College Patna. Over the years CIMAGE college has an outstanding campus plaement record in top national and multinational companies.
BCA is one of the best courses after class 12th. It depends on various factors, such as the individual’s career goals, aptitude, and interests. BCA can be a good option for students who have a strong interest in computer applications, programming, and technology. This course provides a strong foundation in computer applications, programming languages, database management, and web development, which can be useful for students interested in pursuing a career in IT. It is important to research and consider multiple options before making a decision on which course to pursue after 12th grade
BCA, or Bachelor of Computer Applications, is a 3-year undergraduate degree course in the field of computer applications. The course curriculum typically covers subjects such as programming languages (e.g., C, Java, Python), computer systems and architecture, database management, web development, data structures, algorithms, software engineering, and multimedia technologies. The course aims to provide students with a strong foundation in computer applications and technology and the skills required to design, develop, and implement computer-based solutions for various real-world problems. The BCA program is designed to prepare students for a career in the IT industry and further studies in the field of computer science and engineering
BCA can be a good option for students who have a strong interest in computer applications, programming, and technology. This course provides a strong foundation in computer applications, programming languages, database management, and web development, which can be useful for students interested in pursuing a career in IT. The demand for IT professionals with knowledge of programming languages and web development technologies is expected to remain strong in the future, making BCA a good option for students who want to pursue a career in the IT industry.
The basic knowledge required for BCA (Bachelor of Computer Applications) typically includes:
In most cases, you cannot do BCA (Bachelor of Computer Applications) without having studied mathematics at the 12th-grade level. Mathematics is considered a fundamental subject in computer science and is required for many aspects of the BCA curriculum, such as algorithms, data structures, and computer systems.
The choice between BCA and BTech depends on the individual’s aptitude, interests, and career goals. BCA may be a good option for students who have a strong interest in computer applications, programming, and technology, and want to pursue a career in the IT industry. On the other hand, BTech may be a good option for students who have a strong interest in engineering and want to pursue a career in the engineering or technical field.
CIMAGE College is the best BCA College in Patna, Bihar. CIMAGE College offers quality education, add-ons (planned according to industrial demand), and campus placements in companies like WIPRO, TCS, India Mart, XAVIENT, IBM, ACCENTURE, CAPGEMINI, etc.
After completing a BCA (Bachelor of Computer Applications) degree, there are several job roles that one can consider, depending on their interests, skills, and experience.
Definitely YES, a student can get placements while doing or completing BCA Course. CIMAGE Group of Institutions, Patna (Bihar) offers the best campus placements in BCA Courses. The average Campus Placement record of CIMAGE College is 99% in courses of BCA, BBA, BBM, BSC – IT, B.COM(P), & PGDM.
Structure of a Letter, Inquiry Letter, Sales Letter, Order Letter, Complaints, Complaint Handling, Routine letter
Memo, Agenda, Minutes, Proposals
Report Writing, Composition (argumentative, explanatory, descriptive and narrative), Paragraph writing
Sentence Structure, Idiomatic Usage of Language, Tenses, Direct & Indirect Parts of Speech, Active & Passive Voice, Vocabulary.
Selected Short Stories:
Three short stories from the book, “Added Value: The Life Stories of Indian Business Leaders.” by Peter Church, Lotus Collection, New Delhi
1. Rahul Bajaj/ Bajaj Group (Page No. 20)
2. Subhash Chandra/ Eyssel Group/Zee TV (Page No. 40)
3. NR Narayana Murthy/Infosys (Page No. 148)
Preparation for Job:
Writing Applications for Jobs, Preparing Curriculum Vitae, Preparing for Interviews, Preparing for Group Discussions.
1. Added Value: The Life Stories of Indian Business Leaders; Peter Church; Roli Books.
2. Organisations – Structures, Processes, and Outcomes; Richard h Hall; Prentice Hall India.
3. English for the Secretary; Yvonne Hoban; Tata McGraw Hill.
4. Technical Communication: M. Raman & S. Sharma; Oxford University Press.
5. Business Communication Process and Product: M.E. Guffey; Thomson Learning.
1. Human Behaviour at Work; John W New storm & Keith Davis; Tata McGraw Hill.
2. The Most Common Mistakes in English Usage; Thomas Elliot Berry, Tata McGraw Hill.
3. Business Communication: R.K. Madhukar; Vikas Publication.
BCA-102 BASIC MATHEMATICS
Objectives: To know about Logical operators, validity of arguments, set theory and set operations, relations and functions, linear operations, Binary algebra, Permutations & Combinations, Differentiation, Straight lines, pair of straight lines, Circles
MODULE I: SYMBOLIC LOGIC & SET THEORY:
Proposition, Logical operators, conjunction, disjunction, negation, conditional and bi-conditional operators, converse, Inverse, Contra Positive, logically equivalent, tautology and contradiction. Arguments and validity of arguments. Set operations, Venn diagram, Properties of sets, number of elements in a set, Cartesian product, relations & functions, Relations: Equivalence relation. Equivalence class, Partially and Totally Ordered sets, Functions: Types of Functions, Composition of Functions.
MODULE II: DIFFERENTIAL CALCULUS
Differentiation, successive differentiation, Leibnitz theorem, partial differentiation, Applications of differentiation, Tangent and normal, angle between two curves, Maximum and Minimum values (Second derivative test), Curvature and radius of Curvature (Cartesian coordinates), Envelopes.
MODULE III: INTEGRAL CALCULUS
Definite Integral and its application for area, length, and volume. Multiple Integrals. Change of order of Integration. Transformation of integral from Cartesian to polar. Applications in Areas, volume, and surfaces.
MODULE IV: TWO DIMENSIONAL ANALYTICAL GEOMETRY
Straight Lines. Pair Straight Lines. Circles.
1. Das BC and Mukherjee, Differential Calculus, Calcutta, U.N. Dhar Publishers
2. Das BC and Mukherjee, Integral Calculus, Calcutta, U.N. Dhar Publishers
3. Grewal B.S., Higher Engineering Mathematics, Delhi Khanna Publishers.
103 INFORMATION TECHNOLOGY AND APPLICATION
Introduction To Computers
Introduction, Characteristics of computers, Evolution of computers, Generation of Computers, Classification of Computers, The Computer System, Applications of Computers.
Input / Output devices and Memory
Introduction, Keyboard, Pointing Devices, Speech Recognition, Digital Camera, Scanners, Optical Scanners. Classification of Output, Printers, Plotters, Computer Output Microfilm (COM), Monitors, Audio Output, and Projectors. Random Access Memory (RAM), Read Only Memory (ROM), Types of ROM. Classification of Secondary Storage Devices, Magnetic Tape, Magnetic Disk, Optical Disk, Magneto Optical disk.
Introduction to Software, Relationship between Software and Hardware, System Software, Application Software Algorithm, Flowchart, Program, Pseudocode (P-Code). Features of a Good Programming Language.
Operating Systems: History & Evolution, Functions of an Operating System, A Brief History of MS-DOS, Linux, Windows System. Database Management System
Data Communication and Computer Network
Introduction, Data Communication, Transmission Media, Multiplexing, Switching, Computer Network, Network Topologies, Communication Protocols, and Network devices. World Wide Web, Hypertext, Uniform Resource Locator, Web Browsers, IP Address, Domain Name, Internet Services Providers, Internet Security, Internet Requirements, Web Search Engine, Net Surfing, Internet Services, Case Study, Intranet.
MS Office, MS Word, MS Excel, Ms-Power Point.
1. V. Rajaraman, Fundamentals of Computers, 3rd Edition, PHI Publications
2. Nasib S. Gill, Essentials of Computer & Network Technology, Khanna Publications.
3. Deepak Bharihoke, Fundamentals of Information Technology, Excel Books.
BCA-104 PRINCIPLES OF MANAGEMENT & ORGANIZATION
Concept of Management: Definition, Nature, and scope, and overall view of Management, Relation with other social sciences and industry.
Evolution of Management thought:
(A) Classical Theory of Management.
(A1) Bureaucracy- Introduced by Max Weber.
(A2) Scientific Management – F.W. Taylor and his followers.
(A3) Process Management – H. Fayol and others.
(B) Neoclassical Theory of Management.
(B1) Human Relations – B.E. Mayo and Roethlisberger
(B2) Behavioural Science approach – By D. McGregor, A. Maslow & others.
(C) Modern Management theories: Peter Drucker.
Management Functions: Planning, Organizing, Staffing, Directing, and Controlling.
Executive Functions: Production, Marketing, Finance, Personnel.
Planning: Concept, Nature, Importance, Objectives, Policies, Procedure, Strategies and Method of Decision-Making
Organization: Definition, Theories of Organization, Forms of organization, Formal and Informal Organization, Types of Formal Organizations, Departmentation, Line and Staff Relationship, Span of Management, Authority, Responsibility, Delegation, Centralization, Decentralization, Committees.
Staffing: Selection, Recruitment, Training, Development and Welfare
Directing: Leadership and Supervision, Motivation and Communication
Controlling: The Elements, Process and style of Control, Techniques of control. Social Responsibility of business
1. Koontz and O’Donnell – Principles of Management, Essentials of Management.
2. Theo Haiman – Management Theory and Practice.
1. P.F. Drucker – Management – Task and Responsibility
2. P.F. Drucker – The Practice of Management
3. Newman and Warren – Process of Management
4. E.F.L. Beach- The Principles and Practical Management
5. H.F. Merrill – Classics in Management – Preface
6. Mee J.E. – Management Thought in a Dynamic Economy
7. Daniel A. Wren – The Evolution of Management – Thought 8. S. N. Banerjee – Principles of Management
BCA-105: Python Programming (Elective 1)
Overview: Environment, Basic Syntax, Variable Types, Basic Operators, Installing Python. Very Simple Programs, Scripts Loops, Conditionals Functions. Tuples, Lists, Dictionaries for Loop Classes Importing Modules File I/O Error Handling.
if…else, while Loop, for Loop, Loop Control. Numbers, Strings, Lists, Tuples, Dictionary, Date & Time. Functions, Modules, Files I/O, Exceptions. Classes / Objects, Reg Expressions, GUI Programming.
Text Books and References:
1. Programming Python: Powerful Object-Oriented Programming; Mark Lutz; Shroff/O’Reilly; 2010.
2. Beginning Python: Using Python 2.6 & Python 3.1; James Payne; Wiley India; 2011.
3. Head First Programming: A Learner’s Guide to Programming Using Python Language; Barry & Griffiths; Shroff/O’Reilly; 2009.
BCA-106: PROBLEM-SOLVING AND PROGRAMMING CONCEPTS (Elective 2)
Introduction to Problem Solving and Programming: Problem-Solving Concepts – Problem-Solving in everyday life, types of problems, problem-solving concepts for computers, Algorithms, and Flow charts; Programming Concepts.
Logic Structures: Introduction to Programming structure – Modules and their functions – Local and Global Variables – Four Logic structures – Problems solving with Sequential and Decision Logic Structures.
Loop & Case Logic Structure: Loop Logic structure – While/While Wend Structure, Repeat / Until Structure, Automatic Counter loop, Nested Loops, and Recursion.
Array Data Structure & File Concepts: Processing Arrays – Arrays, one-dimensional array, 2D arrays, Multidimensional arrays – Searching and Sorting Techniques. Definition – Record, File – Primary and Secondary Keys – Sequential Access File Applications.
Application Domains: Bio-informatics and Medical Applications – Business Applications – Law Enforcement and political Processes – E-commerce – Manufacturing – Education – Entertainment and Agriculture.
Text Books and References:
1. Maureen Sprenkle, Problem-solving and Programming Concepts, Pearson Education, New Delhi.
2. Compilation Notes, Department of Information Technology, SRM University.
3. Elizabeth A. Dickson, Computer Program Design, Tata McGraw Hill.
4. Kenneth C. Louden, Programming Languages – Principles and Practice, Thomson Asia Pvt. Ltd.
5. Yuskel Uckan, Problem-Solving Using C, McGraw Hill.
BCA 107 LAB: (103)
BCA-108 LAB: (105)
BCA-109 LAB: (106)
Section I: Grammar
Expressing in Style; Words often confused; One-word substitution; Phrases; Idioms.
Section II: Advanced Reading
Paraphrasing; Interpreting visual information: Tables, Graphs, Charts; Speed Reading. Comprehension and Analysis of the book, “Who Moved My Cheese.”
Section III: Effective Writing
Business Correspondences: Fax, Email; Taking Notes; Making Inquiries; Placing Orders; Asking & Giving Information; Registering Complaints; Handling Complaints; Drafting Notices; Job Applications; Expository Composition; Argumentative Composition; Techniques of Argument; Logical Presentation; Descriptive Composition; Narrative Composition; Summary Writing, Proposal; Abstract, Agenda, Minutes.
Section IV: Speaking
Business Etiquettes; Impromptu Speech; Debate; Role Play; Presentations.
Section V: Listening Business-related Conversation Exercises.
1. Spencer Johnson; Who Moved My Cheese; Vermilion; (2009).
2. Balasubramanian, T., A Textbook of English Phonetics for Indian Students; Macmillan India, Delhi (1998).
3. McLearn, Stephen., Writing Essays and Report: A Student’s Guide; Viva Books, New Delhi (2011).
4. Burton Roberts, N., Analysing Sentences; Longman, London (1986).
5. Wekker, H. And Hagemann, L., A Modern Course in English Syntax; Croom Helm, London (1985).
BCA-202 MATHEMATICS [NUMERICAL TECHNIQUES]
Errors in Numerical Calculations: Numbers and their accuracy, Errors and their Computations Absolute, Relative and Percentage, General Error Formula. Solution of Algebraic and Transcendental Equations: Introduction, Bisection method, Iteration method, Method of False Position, Newton- Raphson method
Interpolation: Introduction, Errors in Polynomial Interpolation, Finite Differences – Forward, Backward and Central, Detection of errors using Difference tables, Differences of a Polynomial, Newton’s formulae for Interpolation, Central Difference Interpolation.
Formulae: Gauss’s Central Difference Formula, Interpolation with unevenly spaced points, Lagrange’s Interpolation Formula, Divided Differences and their properties- Newton’s General Interpolation Formula
Numerical Differentiation and Integration: Introduction, Numerical Differentiation and Errors, Numerical Integration – Trapezoidal Rule, Simpson’s 1/3 Rule, Simpson’s 3/8 Rule. Numerical Solution of Linear System of Equations: Direct Methods- Gauss-Jordan Method, Gauss Elimination Method, Method of Factorization, Ill- conditioned Linear System, Iterative Method- Gauss- Jacobi Method, Gauss-Seidel Method. Numerical Solution of Ordinary Differential Equations: Solution by Taylor’s Series, Euler’s method, Modified Euler’s method, Runge-Kutta method of 2nd and 4th order.
1.S.S. Sastry -Introductory methods of Numerical Analysis, 4th Edition, Prentice Hall of India, New Delhi, 2006.
1. V.N. Veda Murthy et.al. -Numerical Methods, Vikash Publishing House, New Delhi, 2005.
2. B.S. Grewal- Numerical Methods in Engineering & Science, Khanna Publishers, Delhi,2005.
BCA-203 SYSTEM ANALYSIS & DESIGN
Introduction to SAD
Fundamentals of System, Important Terms related to Systems, Classification of Systems, Real Life Business Subsystems, Real-Time Systems, Distributed Systems, Development of a successful System, Various Approaches for development of Information Systems. Structured Analysis and Design Approach, Prototype, and Joint Application Development.
Systems Analyst-A Profession
Why do Businesses need Systems Analysts? Users, Analysts in various functional areas, Role of a Systems Analyst Duties of a Systems Analyst, Qualifications of a Systems Analyst, Analytical Skills, Technical Skills, Management Skills, Interpersonal Skills.
Process of System Development
Systems Development Life Cycle, Phases of SDLC, Project Identification and Selection, Project Initiation and planning, Analysis, Logical Design, Physical Design, Implementation, Maintenance, Product of SDLC Phases, Approaches to Development, Prototyping, Joint Application Design, Participatory Design, Case Study.
Introduction to Documentation of Systems
Concepts and process of Documentation, Types of Documentation, System Requirements Specification, System Design Specification, Test Design Document, User Manual, Different Standards for Documentation, Documentation, Quality of Software, and Good Practices for Documentation.
Planning and Designing Systems
Process of System Planning: Fact-finding Techniques, Interviews, Group Discussion, Site Visits, Presentations, Questionnaires, Issues involved in Feasibility Study, Technical Feasibility, Operational Feasibility, Economic Feasibility, Legal Feasibility, Cost Benefit Analysis, Preparing Schedule, Gathering Requirements of System, Joint Application Development, Prototyping.
Modular and Structured Design
Design Principles, Top-Down Design, Bottom-Up Design, Structure Charts, Modularity, Goals of Design, Coupling, Cohesion. System Design and Modelling Logical and Physical Design, Process Modelling, Data Flow Diagrams, Data Modelling, E-R Diagrams, Process Specification Tools, Decision Tables, Decision Trees, Notation Structured English, and Data Dictionary.
More Design Issues and CASE Tools
Forms and Reports Design: Forms, Importance of Forms, Reports, Importance of Reports, Differences between Forms and Reports, Process of Designing Forms and Reports, Deliverables and Outcomes, Design Specifications, Narrative Overviews, Sample Design, Testing, and Usability Assessment, Types of Information, Internal Information, External Information, Turnaround Document, General Formatting Guidelines, Meaningful Titles, Meaningful Information, Balanced Layout, Easy Navigation, Guidelines for Displaying Contents, Highlight Information, Using Colour, Displaying Text, Designing Tables and Lists, Criteria for Form Design, Organization, Consistency, Completeness, Flexible Entry, Economy, Criteria for Report Design, Relevance, Accuracy, Clarity, Timeliness, Cost.
Audit and Security of Computer Systems
Introduction, Definition of Audit, Objectives of Audit.
1. Elias M. Award: System Analysis and Design; Galgotia
2. James A. Sen: Analysis of Design of Information System TMH
3. Rojer S. Pressman: Software Engineering: A Practitioners Approach, MCH 4. Pankaj Jalote: An Integrated Approach to Software Engineering; Springer. Reference Book:
1. J. L. Whitten & L. D. Bentley: System Analysis and Design Method; TMH
2. J. B. Dixit & Rajkumar: Structured System Analysis and Design; University Science Press
3. K.C. Landon & J. P. Landon: MIS ; Macmillan
BCA-204 PROBLEM-SOLVING TECHNIQUE & PROGRAMMING IN C
Fundamentals of C: Identifier and keywords – data types – constants – Variables – Declarations – Expressions – Statements – Arithmetic, Unary, Relational and logical, Assignment and Conditional Operators – Library functions. Simple C programs – Flow of control – if, if-else, while, do-while, for loop, Nested control structures – Switch, break and continue, go to statements – Comma operator.
Functions -Definition – prototypes – Passing arguments – Recursion- Storage Classes – Automatic, External, Static, Register Variables.
Arrays – Defining and Processing – Passing arrays to functions – multi-dimension arrays – Arrays and Strings.
Structures and unions – User-defined data types – Passing structures to functions – Self-referential structures – Unions – Bit-wise operations.
Pointers – Declarations – Passing pointers to Functions – Operation on Pointers – Pointer and Arrays – Arrays of Pointers – Structures and Pointers – Files: Creating, Processing, Opening, and Closing a data file.
The C Pre-processor: # define to Implement Constants, # define to Create Functional Macros, Reading from Other Files using # include, Conditional Selection of Code using #ifdef, Using #ifdef for different computer types.
Using #ifdef to temporarily remove program statements, Other Pre-processor Commands, Predefined Names Defined by Pre-processor, Macros Vs Functions.
Files: File Handling in C Using File Pointers, Opening a file using the function fopen (), Close a file using the function fclose ( ), Input and Output using file pointers, Character Input, and Output in Files, String Input / Output Functions, Formatted Input / Output Functions, Block Input / Output Functions, Sequential Vs Random Access Files, Positioning the File Pointer.
1. E. Bala guru Swamy – ANSI C Programming Language, 2nd Edition, PHI, 1988.
2. H. Scheldt, C: The Complete Reference, 4th Edition, TMH Edition, 2000.
3. Kanetkar Y., Let us C, BPB Pub., New Delhi, 1999.
4. Reema Thareja – Programming in C
5. Byron Gottfried – C Programming; Oxford University Press
BCA-205 OPERATING SYSTEM & UNIX
Introduction: Introduction to Operating Systems, Operating system services, multiprogramming, time-sharing systems, storage structures, system calls, and multiprocessor systems. Basic concepts of CPU scheduling, Scheduling criteria, Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real-time scheduling I/0 devices organization, I/0 devices organization, I/0 devices organization, and I/0 buffering.
Process Management: Process concept, process scheduling, operations on processes, threads, inter-process communication, precedence graphs, critical section problem, semaphores, and classical problems of synchronization. Deadlock problem, deadlock prevention, avoidance, recovery.
Memory Management: Concepts of memory management, logical and physical address space, swapping, contiguous and non-contiguous allocation, paging, segmentation, and paging combined with segmentation. Virtual memory, demand paging, page replacement algorithms, allocation of frames, thrashing, and demand segmentation. Security threads protection intruders-Viruses-trusted system.
Introduction to Open Source technology, Files System hierarchy, Logging in, Simple commands like ls, cp, mv, wc, sort, tsort, cat, cut, grep, dd, head, tail, uniq, diff, echo, touch, which, whereis, whatis, type, who, whoami, finger, w (option and variations included), tty, uname, printf, ps, pwd, history, exec, kill, pkill, clear, lpstate, cancel, compress, uncompress, exit. Directory commands like: Brief introduction to file system, mkdir, dir, cd, df, dfspace, du, ll, dirname, rmdir, dir access permission, changing access permission for files and directories like chmod, chgrp, chown, hard & soft links. Environments and path setting. I/O redirection & piping commands
vi editor: General start-up of vi editor and it modes, Creating and editing files, features of vi, screen movement, cursor movement, insertion, deletion, searching, submitting operations, yank, put, delete commands, reading & writing files, exec file for setting parameters, advance editing techniques, vim (improved vi).
Shell: meaning and purpose of shell, introduction to types of shell. The command line, standard input and standard output, redirection, pipes, filter special characters for searching files, and pathnames. Built-ins, functions, history, aliases, job control, file substitution, source code management – RCS and CVS. awk utility.
Features of Linux: Drawbacks of Linux, Components of Linux, Memory Management Subsystems, Linux Processes, and Thread Management, File Management System, and Device Drivers.
Linux Commands and Utilities: Entering the Machine, User Names, and Groups, Logging In, Correcting Typing Mistakes, Format of Linux Commands, Changing Your Password, Characters with Special Meanings, Linux Documentation, The File System, Current Directory, Looking at the Directory Contents, Absolute and Relative Pathnames, Some Linux Directories and Files.
Linux Utilities and Editor: Some Useful Commands, Permission Modes, Standard Files, Pipes, Filters and Redirection, Shell Scripts, Graphical User Interface, and Editor.
UNIX System Administration: System Administration, Installing Linux, Choosing an Installation Method, Choosing an Installation Class, Pre-installation checks, Installation, Booting the System, Maintaining User Accounts, File Systems, and Special Files, Backups, and Restoration.
1. A. Silber Schatz et.al. -Operating System Concepts, 6th Edition, John Wiley Inc., 2003
2. H.M. Diestel -Operating Systems, 6th Edition, Pearson Education, 2006
3. A. Robbins- Linux Programming by Example- Pearson Education, New Delhi- 2005
4. Sumitabh Das: Your UNIX The Ultimate Guide; TMH
1. D.M. Dhandhare – Operating Systems, 2nd Edition, Tata McGraw Hill, New Delhi, 2006
2. J. Goertzen- Linux Programming Bible, IDG Books, New Delhi- 2001
3. N. Mathew & R. Stones- Beginning Linux Programming Wiley Publishing India, 2004.
4. S.E. Mandnick & J.J. Donovan: Operating System; TMH
BCA-206 Lab: (204)
Arrays; Structures; Linked Lists; Stacks; Queues; Trees; Advanced Trees; Graphs; Searching; Sorting.
BCA-207 Lab: (205)
BCA-301 OBJECT-ORIENTED PROGRAMMING USING C++
Introduction to programming paradigms: Concept of object, class, objects as variables of class data type, the difference in structures and class in terms of access to members, private and public members of a class, data & function members. Characteristics of OOP- Data hiding, Encapsulation, data security.
Basics of C++: Structure of C++ programs, introduction to defining member functions within and outside a class, keyword using, declaring class, creating objects, constructors & destructor functions, initializing member values with and without the use of constructors, simple programs to access & manipulate data members, cin and cout functions. Dangers of returning a reference to a private data member, constant objects and members function, the composition of classes, friend functions and classes, using this pointer, creating and destroying objects dynamically using new and delete operators. Static class members, container classes and iterators, proxy classes.
Operator overloading: Fundamentals, Restrictions, operator functions as class members v/s as friend functions. Overloading stream function, binary operators, and unary operators. Converting between types.
Inheritance: Base classes and derived classes, protected members, the relationship between the base class and derived classes, constructors and destructors in derived classes, public, private, and protected inheritance, the relationship among objects in an inheritance hierarchy, abstract classes, virtual functions, and dynamic binding, virtual destructors.
Advanced Topics: Multiple inheritances, virtual base classes, pointers to classes and class members, multiple class members. Templates, exception handling, File handling
1. E. Balagursamy: Object-oriented programming with C++; TMH Publication.
2. Deitel and Deitel: C++ How to Program (currently in its 4th edition); PHI.
1. Robert Lafora: Object-oriented programming in Turbo C++; Galgotia Publication
BCA–302 INTERNET & WEB DESIGNING
Internet Basics: Basic concepts, Communication on the Internet, Internet Domains, Internet Server Identities, Establishing Connectivity on the Internet, Client IP Address, A brief overview of TCP/IP and its Services, Transmission Control Protocol, Web Server, Web Client, Domain Registration.
Introduction to HTML: HTML, HTML Tags, Commonly Used HTML Commands, Title and Footers, Text Formatting, Text Style, Lists, Adding Graphics to HTML Documents, Tables, Linking Documents, Frames.
1. Ivan Bay Ross – Web Enable Commercial Application Using HTML, DHTML, BPB Publication.
2. Michel Morrison – HTML and XML for Beginners, PHI, New Delhi- 200
3. H.M Dietal and P.J Dietal – Java How to Program, PHI, New Delhi- 2005
1. Java Server Side Programming -WROX Publication
BCA–303 JAVA PROGRAMMING
Java Evolution and Overview of Java Language: How Java differs from C and C++, Java and Internet, Java and World Wide Web, Introduction, Simple Java Program, More of Java, An Application with Two Classes, Java Program Structure, Java Tokens, Java Statements, Implementing a Java Program, Java Virtual Machine, Command Line Arguments, Programming Style.
Constants, Variables, and Data Types: Introduction, Constants, Variables, Data Types, Declaration of Variables, Giving Values of Variables, Scope of Variables, Symbolic Constants, Type Casting, Getting Values of Variables, Standard Default Values.
Operators and Expressions: Introduction, Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Increment and Decrement Operators, Conditional Operators, Bitwise Operators, Special Operators, Arithmetic Expressions, Evolution of Expressions, Precedence of Arithmetic Operators, Type Conversion in Expressions, Operator Precedence and Associativity, Mathematical Functions.
Decision Making and Branching: Introduction, Decision Making with if Statement, Simple if Statement, The if… else Statement, Nesting of if … else Statements, The else if Ladder, The switch Statement, The? Operator.
Decision Making and Looping: Introduction, the while Statement, The do Statement, The for Statement, Jumps in Loops, Labelled Loops. Classes, Objects and Methods: Introduction, defining a Class, Adding Variables, Adding Methods, Creating Objects, Accessing Class Members, Constructors, Methods Overloading, Static Members, Nesting of Methods, Inheritance: Extending a. Class, Overriding Methods, final Variables and Methods, Final Classes, Finalizer Methods, Abstract Methods and Classes, Visibility Control.
Arrays, String and Vectors: Arrays, One-Dimensional Arrays, Creating an Array, Two-dimensional Arrays, Strings, Vectors, Wrapper Classes. Interfaces: Multiple Inheritance: Introduction, Defining Interfaces, Extending Interfaces, implementing Interfaces, Accessing Interface Variables. Packages: Putting Classes Together: Introduction, Java API Packages, Using system Packages, Naming Conventions, Creating Packages, Accessing a Packages, Using a Package, Adding a Class to a Package, Hiding Classes. Multithreaded Programming: Introduction, Creating Threads, Extending the Thread Class, Stopping and Blocking a Thread, Life Cycle of a Thread, Using Thread Methods, Thread Exceptions, Thread Priority, Synchronization.
Managing Errors and Exceptions: Introduction, Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple Catch Statements, using finally Statements, Throwing Our Own Exceptions, Using Exceptions for Debugging. Applet Programming: Introduction, How Applets Differ from Application, Preparing to Write Applets, Building Applet Code, Applet Life Cycle, Creating an Executable Applet, designing a Web Page, Applet Tag, Adding Applet to HTML File, Running the Applet, More About Applet Tag, Passing Parameters to Applets.
Managing Input/Output Files in Java: Introduction, Concepts of Streams Stream Classes, Byte Stream Classes, Character Stream Classes, Using Streams, Other Useful I/O Classes, using the File Class, Input/Output Exceptions, Creation of Files.
1. E. Balagurusamy, Programming with Java, A Primer Second Edition, Tata McGraw Hill, New Delhi.
1. H.M.Deitel & P.J.Deitel- JA V A- How to Program, 5th Edn, Pearson Education,New Delhi2004.
2. P. Naughton and H. Schildt-JAVA: The Complete Reference, TMH, New Delhi 2005.
3. D. Jana- Java and Object-Oriented Programming Paradigm, PHI, New Delhi-2005
BCA-304 SOFTWARE ENGINEERING
Introduction to Software Engineering: Characteristics, Emergence of Software Engineering, Software Metrics & Models, Process & Product Metrics. Software Life Cycle Models: Waterfall, Prototype and Spiral Models and their Comparison.
Software Project Management: Size Estimation- LOC and FP Metrics, Cost Estimation-Delphi and Basic COCOMO, Introduction to Halstead’s Software Science, Staffing Level Estimation Putnam’s Model. Software Requirements Specification: SRS Documents, their Characteristics and Organization.
Software Design: Classification, Software Design Approaches, Function Oriented Software Design, Structured Analysis- Data flow Diagrams and Structured Design, Introduction to Object Oriented Design.
Coding and Testing of Software: Unit Testing, Block Box Testing, White Box Testing, Debugging, Program Analysis Tools, System Testing. Software Reliability and Quality Assurance: Reliability Metric- Musa’s Basic Model.
Software Quality Assurance: ISO 9000 and SEI CMM and their Comparison. Software Maintenance: Maintenance Process Models and Reverse Engineering, Estimation of Maintenance Costs.
1. Rajib Mall -Fundamentals of Software Engineering, Prentice Hall of India, New Delhi, 2005.
1. Pankaj Jalote- An Integrated Approach to Software Engineering, 3rd Edition, Narosa Publishing House, New Delhi, 2005.
2. Richard Fairley- Software Engineering Concepts, Tata McGraw Hill, New Delhi, 2006.
3. Roger S Pressman – Software Engineering; T.M.H
BCA-305 LAB (301 & 303)
BCA-306 LAB (302 & 304)
BCA-401 RELATIONAL DATABASE MANAGEMENT SYSTEM
INTRODUCTION TO DATABASE SYSTEMS: Overview and History of DBMS. File System vs DBMS. Advantages of DBMS Describing and Storing Data in a DBMS. Queries in DBMS. Transaction management and Structure of a DBMS, Components of DBMS; The 3-level architecture of DBMS – Hierarchical, Network, and Relational Model; Distributed Database; KBDBMS; OODBMS (Basic Concepts).
ENTITY RELATIONSHIP MODEL: Overview of Data Design Entities, Attributes and Entity Sets, Relationship and Relationship Sets. Features of the ER Model-Key Constraints, Participation Constraints, Weak Entities, Class Hierarchies, Aggregation, Conceptual Data Base, Design with ER Model-Entity vs Attribute, Entity vs Relationship Binary vs Ternary Relationship and Aggregation vs ternary Relationship Conceptual Design for a Large Enterprise. RELATIONSHIP ALGEBRA AND CALCULUS: Relationship Algebra Selection and Projection, Set Operations Renaming, Joint, Division, Relation Calculus, Expressive Power of Algebra and Calculus.
SQL QUERIES PROGRAMMING AND TRIGGERS: The Forms of a Basic SQL Query, Union, Intersection and Exception, Nested Queries, Correlated Nested Queries, Set-Comparison Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active Databases.
SCHEMA REFINEMENT AND NORMAL FORMS: Introductions to Schema Refinement, Functional Dependencies, Boyce-Codd Normal Forms, Third Normal Form, Normalization Decomposition into BCNF Decomposition into 3-NF.
1. Fundamental of Database Systems- Elmasri Navathe- Pearson Education Asia.
2. Database- Principles, Programming and Performance- Parick O’ Neil Elizabeth O’ Niel, Harcourt Asia PTE Limited.
1. An Introduction to Database Systems- C.J. Date, Addison Wesley, Pearson Education Press.
2. Database System Concepts- Abraham Silber chat, Henry F. Korte, S. Sudarshan, Tata McGraw Hill.
3. Database Management – Bipin C. Desai – BPB Publications.
BCA-402 DIGITAL ELECTRONICS, COMPUTER SYSTEM ARCHITECTURE, AND ORGANISATION
Introduction to Digital Circuits: The Basic Computer; The Von-Neumann Architecture, Instruction Execution: An Example, Instruction Cycle Interrupts, Interrupts and Instruction Cycle, Computers: Then and Now, The Beginning, First Generation Computers, Second Generation Computers, Third Generation Computers, Later Generations.
The Data Representation: Data Representation, Number Systems, Decimal Representation in Computers, Alphanumeric Representation, Data Representation for Computation, Error Detection, and Correction Codes.
Principles of Logic Circuits I: Logic Gates, Logic Circuits, Combinational Circuits, Canonical and Standard Forms, Minimization of Gates, Design of Combinational Circuits, Examples of Logic Combinational Circuits, Adders, Decoders, Multiplexer, Encoder, Programmable Logic Array, Read Only Memory ROM.
Principles of Logic Circuits II: Sequential Circuits: The Definition, Flip Flops, Basic Flip-Flops, Excitation Tables, Master-Slave Flip Flops, Edge Triggered Flip-flops, Sequential Circuit Design, Examples of Sequential Circuits, Registers, Counters: Asynchronous Counters, Synchronous Counters, RAM, Design of a Sample Counter.
Basic Computer Organisation: The Memory System: The Memory Hierarchy, RAM, ROM, DRAM, Flash Memory, Secondary Memory and Characteristics, Hard Disk Drives, Optical Memories, CCDs, Bubble Memories, RAID and its Levels, The Concepts of High-Speed Memories, Cache Memory, Cache Organisation, Memory Interleaving, Associative Memory.
The Input/Output System: Input / Output Devices or External or Peripheral Devices, The Input Output Interface, the Device Controllers and its Structure, Device Drivers, Input Output Techniques, Programmed Input /Output, Interrupt-Driven Input /Output, Interrupt-Processing, DMA (Direct Memory Access). Input Output Processors, External Communication Interfaces.
The Central Processing Unit: Instruction Set Architecture; Instruction Set Characteristics, Instruction Set Design Considerations, Operand Data Types, Types of Instructions, Number of Addresses in an Instruction, Addressing Schemes, Types of Addressing Schemes, Immediate Addressing, Direct Addressing, Indirect Addressing, Register Addressing, Register Indirect Addressing, Indexed Addressing Scheme, Base Register Addressing, Relative Addressing Scheme, Stack Addressing, Instruction Set and Format Design Issues, Instruction Length, Allocation of Bits Among Opcode and Operand, Variable Length of Instructions, Example of Instruction Format.
Registers, Micro-Operations and Instruction Execution: Basic CPU Structure, Register Organization, Programmer Visible Registers, Status and Control Registers, General Registers in a Processor, Micro-operation Concepts, Register Transfer Micro-operations, Arithmetic Microoperations, Logic Micro- operations, Shift Micro-operations, Instruction Execution and Microoperations, Instruction Pipelining.
ALU Organisation: ALU Organisation, A Simple ALU Organization, A Sample ALU Design, Arithmetic Processors.
The Control Unit: The Control Unit, The Hardwired Control, Wilkes Control, The Micro Programmed Control, The Micro-Instructions, Types of Micro-Instructions, Control Memory Organisation, Micro-Instruction Formats, The Execution of Micro-Program.
1. M. Morris Mano, Charles Kime: Logic and Computer Design Fundamentals, 4/E; Prentice Hall.
2. Rajaraman V.: Fundamental of Computers, PHI
3. William Stalling: Computer Organization & Architecture- Designing for Performance; PHI
4. B Ram: Computer Fundamentals: Architecture and Organization, New Age Int. Pub.
1. M. Morris Mano: Computer System Architecture; PHI.
BCA-403 File & Data Structure
Introduction to Data Structure and Application of Data Structure
Algorithms and Analysis of Algorithms: Definition, Structure, and Properties of Algorithms, Development of an Algorithm, Data Structures and Algorithms, Data Structure – Definition and Classification, Efficiency of Algorithms, Apiary Analysis, Asymptotic Notations, Time Complexity of an Algorithm using O Notation, Polynomial Vs Exponential Algorithms, Average, Best- and Worst-case Complexities, Analysing Recursive Programs, Open source software development process.
Linked List, Linked Stacks, and Linked Queues: Singly Linked Lists, Circularly Linked Lists, Doubly Linked Lists, Multiply Linked Lists, Applications of Linked Lists, Introduction to Linked Stack and Linked Queues, Operations on Linked Stacks and Linked Queues, Dynamic Memory Management and Linked Stack, Implementations of Linked Representations, Applications of Linked Stacks and Linked Queues.
Arrays, Stacks, and Queues: Array Operations, Number of Elements in an Array, Representation of Arrays in Memory, Applications of Array, Stack-Introduction, Stack Operations, Applications of Stack, Queues-Introduction, Operations on Queues, Circular Queues, Other Types of Queues, Applications of Queues, Polynomials & Sparse matrix.
Trees, Binary Trees, BST, AVL Trees, and B Trees: Trees: Definition and Basic Terminologies, Representation of Trees, Binary Trees: Basic Terminologies and Types, Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Applications, BST & AVL Trees: Introduction, BST: Definition and Operations, AVL Trees: Definition and Operations, B Trees: Introduction, m-way search trees: Definition and Operations, B Trees: Definition and Operations.
Graphs: Introduction, Definitions, and Basic Terminologies, Representations of Graphs, Graph Traversals, Single-Source Shortest-Path Problem, Minimum Cost Spanning Trees.
Sorting: Understanding Internal and External Sorting. Internal Insertion Sort, Bubble Sort, shell sort, Quick Sort, 2-way MergeSort, Heap Sort, Sorting on Several Keys.
Searching: Introduction, Binary Search, Transpose Sequential Search, Interpolation Search.
1. G A V Pai – Data Structures and Algorithms: Concepts, Techniques, and Applications, 2nd Edn, Tata McGraw-Hill, 2008.
2. Horowitz E. Sahni, S., Susan A., Fundamentals of Data Structures in C, 2nd Edition, University Press, 2010
1. J. P. Tremblay, P. G. Sorenson – An Introduction to Data Structures with Applications, 2nd Edn, McGraw-Hill, Inc. New York, NY, USA.
2. Seymour Lipschitz – Data Structures, 6th Edn, 9th Reprint 2008, Tata McGraw-Hill.
3. Adam Drozdek – Data Structures and Algorithms in C++, Thomson Learning, New Delhi – 2007.
4. J. Feller, B. Fitzgerald -Understanding Open-Source Software Development, Pearson Education Ltd, New Delhi.
5. Aron M. Tenenbaum & Others – Data Structure using C & C++; Pearson’s Publications
BCA-404 INTRODUCTION TO STATISTICS
COMBINATORICS: Permutation and Combination, Repetition and Constrained Repetition, Binomial Coefficients, Binomial Theorem.
Frequency distributions, Histograms and frequency polygons, Measures of central tendency: Mean, Mode, Median, Dispersion, Mean deviation and standard deviation. Moments, Skewness, kurtosis,
Elementary probability theory: Definition, conditional probability, Probability distribution, mathematical expectation’
Theoretical distribution: Binomial, poison and Normal distribution, Relation between the binomial, poisoned Normal distribution.
Correlation and Regression: Linear Correlation, Measure of Correlation, Least Square Regression lines.
Curve fitting: Method of least square, least square line, least squares Parabola. chi-square test: definition of chi-square; signification test: contingency test, coefficient of contingency.
Basic sampling theory: Sample means and variance, students t-test, a test of Hypotheses and significance, degree of freedom, Z-test, small and large sampling, Introduction to Monte Carlo method.
1. Advanced Engineering Mathematics: H.K. Dass; S. Chand & Co., 9 Revised Edition, 2001.
2. Discrete Mathematics: S.K. Sarkar; S. Chand & Co., 2000.
3. Numerical Analysis: S.S. Sastry; Prentice Hall of India, 1998.
4. Mathematical Statistics: J.N. Kapoor and H.C. Saxena.
5. Mathematical Statistics: M. Ray and H. Sharma
BCA-405 Lab: (401)
BCA-406 Lab: (403)
BCA-501 Windows Programming using VB.Net
Introduction to .Net Technology
Why .Net? The .Net Framework Class Library, Working with the .Net FCL, Namespaces, Types of a .Net Namespace.
The Visual Basic.Net Language VB.Net Data types, Operators, Decision Statements- If. Then, If..then..else, Select.. Case, Loop Statements- While, Do. Loop, For. Next, For Each. Next, Arrays.
OOP using VB.Net
Object Oriented features- Abstraction, Encapsulation, Polymorphism, Inheritance, Declaring Classes, Implementing Typecasting, Procedures and Functions, Optional arguments, Error handling in Procedures, Properties, Public and Private variables, Types of Properties, Polymorphism, Inheritance, Method Overriding.
Introduction to Class Libraries, Event and Event Handlers, Windows Application, Windows GUI, First Win Forms Application, Controls, Text controls, Selection List Controls, VB.Net is overridden, Some controls with examples. Error handling In Windows Forms: Types of Validations, Types of Errors, Exceptions, Classified Runtime based Exceptions. SDI and MDI Applications: SDI and MDI interfaces, Characteristics of MDI components, Creating MDI Forms.
Data access with ADO.Net
Overview of Microsoft Database Access Technology, ADO.Net, creating a Database, ADO.Net Architecture, ADO.Net Class Libraries, Data bound Controls, creating a Data Set, Using XML Data.
BCA-502 GRAPHICS & MULTIMEDIA
Computer Graphics: Picture analysis, Overview of programmer’s model of interactive graphics, Fundamental problems in geometry. Scan Conversion: point, line, circle, ellipse polygon, Aliasing, and introduction to Anti-Aliasing (No antialiasing algorithm).
2D & 3D Co-ordinate system: Homogeneous Co-ordinates, Translation, Rotation, Scaling, Reflection, Inverse transformation, Composite transformation. Polygon Representation, Flood Filling, Boundary filling. Point Clipping, Cohen-Sutherland Line Clipping Algorithm, Polygon Clipping algorithms.
Hidden Lines & Surfaces: Image and Object space, Depth Buffer Methods, Hidden Facets removal, Scan line algorithm, Area based algorithms. Curves and Splines & Rendering: Parametric and Non-parametric Representations, Bezier curve, B Spline, Basic illumination model, diffuse reflection, specular reflection, shading, Ground shading, ray tracing, colour models like RGB, YIQ, CMY, HSV
Multimedia: Multimedia components, Multimedia Input/Output Technologies: Storage and retrieval technologies, Architectural considerations, file formats.
Animation: Introduction, Rules, problems, and Animation techniques.
1. J. Foley, A. Van Dam, S. Feiner, J. Hughes: Computer Graphics- Principles and Practice, Pearson
2. Hearn and Baker: Computer Graphics, PHI
3. Multimedia Systems Design, Prabhat and leigh and Thakkar, PHI.
4. Multimedia Information Networking, N.K. Sharda, PHI.
BCA-503 COMPUTER NETWORK, DATA COMMUNICATION, AND CLIENT SERVER TECHNOLOGY
Data Transmission Basic Concepts and Terminology: Data Communication Model, Communication Tasks, Parallel & Serial Transmission, Transmission Models, Transmission Channel, Data Rate, Bandwidth Signal Encoding Schemes, Data Compression, Transmission Impairments, Layering and Design Issues, OSI Model, Services and Standards. Computer Network: Network Topology, Performance of Network, Network Classification, Advantages & Disadvantages of Network, Transmission Media (guided and unguided), Network Architecture, OSI Reference Model, TCP/IP, SNA, and DNA.
Data Line Devices: Modems, DSL, ADSL, Multiplexer, and Different Multiplexing Techniques: (FDM, TDM).
Physical Layer: Function and interface, physical layer standard, null modem. Local Area Network: Definition of LAN, LAN topologies, Layered architecture of LAN, MAC, IEEE standard. Ethernet LAN, CSMA, CSMA/ CD, Token passing LAN. Network Security: Security Requirement, Data encryption strategies, authentication protocols, Firewalls.
Data Link Layer: Need for Data Link Control, Frame Design Consideration, Flow Control & Error Control (Flow control mechanism, Error Detection and Correction techniques) Data Link Layer Protocol, HDLC.
Network Layer: Routing, Congestion control, Internetworking principles, Internet Protocols (IPv4 packet format, Hierarchal addressing subnetting, ARP, PPP), Bridges, Routers.
Transport Layer; Session Layer; Presentation Layer; Application Layer.
Basic Applications: Telnet, FTP, NFS, SMTP, SNMP, and HTTP.
Fundamental of Distributed System: An Introduction – Client/ Server Technology, classification. Distributed Computing Environment: introduction, DCE architecture. Types of CS architecture: 2-tier architecture, 3-tier architecture, Distributed collaborative enterprise architecture – Object Request Broker (ORB). Complementary technology to 3-tier: Object-oriented design, Database Two phase. Commit processing, Remote procedure call, Message Oriented middle-ware.
Distributed Computing Environment: Introduction: interoperability, C/S Model, Defining a Distributed Environment. Motivation for distributed computing, developing the distributed computing architecture framework, Fundamental technologies, and requirements of a distributed system.
1. Prakash C. Gupta – Data Communications & Computer Networks, PHI, New Delhi.
2. Behrouz Furazan – Introduction to Data Communication & Networking; T. M. H.
3. William Stallings – Data and Computer Communications; Pearson.
BCA-504 Business Accounting & ERP (Enterprise Resource Planning) Accounting Fundamentals:
Basic Concepts of Accounting, The Accounting Process; Cash Book and Bank Reconciliation; Other Subsidiary Books Bills of Exchange; Final Accounts.
Concepts Relating to Final Accounts: Final Accounts – I; Final Accounts – II; Errors and their Rectification.
Consignment and Joint Ventures: Consignments Accounts – I; Consignments Accounts – II; Consignments Accounts – III; Joint Venture Accounts.
Accounts from Incomplete Records: Self Balancing System; Accounting from Incomplete Records – I; Accounting from Incomplete Records – II; Accounting from Incomplete Records – III.
Accounts of Non-trading Concerns, Depreciation, Provisions, and Reserves: Accounts of Nontrading Concerns – I; Accounts of Non-trading Concerns – II; Depreciation – I, Depreciation – II, Provisions, and Reserves.
BCA-505 Lab: (501)
BCA-506 Lab: (502)
BCA-601: Web Technology (Elective 1)
Web2.0 and XHTML
What Is Web 2.0? Introduction to Web 2.0 terms: Search, Content Networks, Blogging, Social Networking, social media, Rich Internet Applications (RIAs), Web Services, Introduction to XHTML, Syntactic Differences between HTML and XHTML, Standard XHTML Document Structure, an example of XHTML covering Basic Syntax, Images, Hypertext Links, Lists and Tables, Creation of an XHTML Form, Internal Linking and Meta Elements.
Introduction to XML
XML Basics, XML Document Structure, XML Namespaces, Document Type Definitions, XML Schema, Displaying XML Documents, XSL, and CSS.
The Server-Side Scripting
Server-side scripting and its need, Two-Tier, Three-Tier, N-Tier, and Enterprise Architecture, Various Languages / Technologies for server scripting, HTTP Methods (such as GET, POST, HEAD, and so on), Purpose, Technical characteristics, Method selection, Use of request and response primitives, Web container – Tomcat.
JSP – Basics
Basic JSP Life-cycle, JSP Directives, and Elements, Script-lets, Expressions, Action Elements, Standard Actions, Comments and Template Data, JSP variables, The out Object, Request, response, sessions, and application objects.
Exceptions and exception handling using JSP, Cookies, and sessions, Managing Email using JSP. JSP Application Development Example applications using JSP, what is JDBC? Need for JDBC, Database Drivers, Connections using JDBC API, Application development, and deployment.
1. Ivan Bay Ross- Web Enable Commercial Application Using HTML, DHTML, BPB Publication
2. Michel Morrison -HTML and XML for Beginners, PHI, New Delhi- 2001
3. H.M Dietal and P.J Dietal -Java How to Program, PHI, New Delhi- 2005
1. Java Server Side Programming -WROX Publication
2. David S. Plat: Introducing Microsoft .Net, Microsoft Press.
BCA-602: CONCEPT OF DATA MINING AND DATA WAREHOUSING (Elective 2)
Introduction: Data Mining – Motivation, Importance of DM Functionalities, Basic Data Mining Tasks, DM Applications, and Social Implications
Data Warehousing: Differences between Operational Database and Data Warehouse – Multidimensional Data Model – From Tables to Data Cubes. Schemas, Measures, DW Implementation – Efficient Computation of Data Cubes.
Data Reprocessing, Data Mining Primitives, Languages: Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and concept of Hierarchy Generation, Task relevant Data, Background Knowledge, Presentation and Visualization of Discovered Patterns.
Data Mining Algorithms: Association Rule Mining, Classification, and Prediction – Decision Tree, Bayesian Classification Back Propagation, Cluster Analysis, Outlier Analysis.
Web, Temporal, and Spatial Data Mining: Web Content Mining, Web Structure Mining, Web Usages Mining, Spatial Mining, Generalization and specialization, Spatial Rules, Spatial Classification and Clustering Algorithms, Temporal Mining, Modelling Temporal Events, Times Series, Pattern Detection, Sequences.
1. Jiawei I-Lan & Micheline Kambler, “Data Mining: Concepts and Techniques”, Harcourt India Pvt. Ltd., First Indian Reprint, 2001
2. Margaret H. Dunham, “Data Mining: Introduction and Advance Topics”, Pearson Education, First Indian Reprint, 2003
3. Arun K. Pujari, “Data Mining Techniques”, University Press (India) Limited, First edition, 2001
4. Efrem O, Malloch, “Decision Support and Data Warehousing Systems”, McGraw-Hill International Edition, 2000
Introduction to E-commerce: E-commerce: The revolution is just beginning, the visions and forces behind E-commerce, Understanding E-commerce.
E-commerce business models and concepts: E-commerce business models, Major business-to-consumer (B2C) business models, Major business-to-business (B2B) business models, Business models in emerging E-commerce areas, and How the internet and the Web change business.
E-commerce infrastructure: The Internet, Technology background, The internet today, The world wide web. Building an E-commerce website: A systematic approach, choosing server software, choosing the hardware for an E-commerce site, and other E-commerce site tools.
Security and Encryption: The E-commerce security environment, Security threats in the E-commerce environment, Technology solutions, Policies, Procedures, and Laws.
E-commerce payment systems: Payment systems, Credit card E-commerce transactions, E-commerce digital payment systems in the B2C arena, B2B payment systems. Ethical, Social, and Political issues in E-commerce: Understanding ethical, social, and political issues in E-commerce, Privacy and information rights, Intellectual property rights, Governance, Public safety, and welfare.
1. K.C. Laudon & C.G. Traver, E-commerce, Pearson Education, 2003.
1. R. Kalakoda & A.B. Whiilston-‘ Frontiers of Electronic Commerce, Pearson Education- 2006.
2. K.K. Bajaj & D. Nag- E-Commerce, Tata McGraw Hill, New Delhi, Second Edition.
BCA-604 Project and Viva
The objective of the BCA project work is to develop a quality software solution by following software engineering principles and practices. During the development of the project, the students should involve in all the stages of the software development life cycle (SDLC). The main objective of this project course is to provide learners with a platform to demonstrate their practical and theoretical skills gained during five semesters of study in the BCA Programme. During project development students are expected to define a project problem, do requirements analysis, systems design, software development, apply testing strategies, and do documentation with an overall emphasis on the development of robust, efficient, and reliable software systems. The project development process has to be consistent and should follow standards. For example, database tables designed in the system should match the E-R Diagram. SRS documents are to be created as per IEEE standards.
Students are encouraged to spend the maximum time of the sixth semester working on a project preferably in a software industry or any research organization. Topics selected should be complex and large enough to justify as a BCA final semester project. The courses studied by the students during the BCA Programme provide them the comprehensive background knowledge on diverse subject areas in computer science such as computer programming, data structure, DBMS, Computer Organization, SAD, Software Engineering, Computer Networks, etc., which will be helping students in doing project work.
BCA-605 Lab: (601)