Effective from Admissions onwards. Technology is defined as the applications of Basic Science. The past two revolutions, industrial and electronic, have transformed the society from agricultural to industrial and then to electronic.

The electronically based technologies focused in information gathering, processing and distribution. The use of this technology in all sectors gave the birth to Computer Industry and its unprecedented growth launched another revolution in Communication. Information, the basic raw material for the Decision Support System, can be derived from processing of huge database related with different sectors.

Systematic storage and management with adequate security are essential for data retrieval and processing to generate information. The information technology plays an important role in all areas. But the main drawback is the technophobia of the people to adapt with the new technologies.

This may be due to lack of awareness of the merits and advantages of new technologies. So our youths have to be equipped with all kinds of knowledge tools to work with computers comfortably which are basic requirements to provide human resource to the industry. The radical changes in technologies, both hardware as well as software, and their ever increasing adaptation to newer areas of application, demand frequent updating of the academic curriculum so that the students can rise to the expectation of the Industry.

The syllabus revision committee has considered all these factors thoroughly before venturing into the revision exercise. The knowledge acquired by the students may also equip them to meet the industrial need, and get placed.

The BCA programme of the MG University follows the choice based credit semester system as envisaged by the University Grants Commission and the Higher Education Council of Kerala.

The Programme shall be completed in six semesters. Each semester is a minimum of 18 instructional weeks, comprising 90 working days with continuous internal evaluation and University examination at the end of each semester.

The BCA Programme is designed with the following specific objectives. All the candidates admitted for the course should register with the M. G University along with the original certificate of the qualifying examinations within 3 months from the date of commencement of the I semester programme.

Optimal Static Binary Search Tree Animation

The pogramme shall normally extend over a period of three academic years consisting of six semesters. Requirement of Attendance and Progress. A candidate shall normally be permitted to register and appear for the end semester university examinations if. The evaluation of each course shall contain two parts.

The Internal and External examinations shall be evaluated using Direct Grading system based on 5-point scale as given below.

The overall grade for a programme for certification shall be based on CGPA with a 7-point scale given below. A separate minimum of D Grade for internal and external are required for a pass for a course. For a pass in a programme a separate minimum of Grade D is required for all the courses and must score a minimum CGPA of 2.

Components of the Internal evaluation and their weights are as below. Between 85 and Between 80 and Between 75 and The student has to take a minimum of 1 seminar per course. A minimum of 2 class tests are to be attended.

All documents of internal assessments are to be kept in the college for 2 years and shall be made available for verification by the university. The responsibility of evaluating the internal assessment is vested on the teacher s who teach the course. But such improvement in internal in the same paper cannot be attempted more than once. The supplementary examinations will be conducted along with the next regular semester examinations. Questions shall be set to assess knowledge acquired, standard application of knowledge, application of knowledge in new situations, critical evaluation of knowledge and the ability to synthesize knowledge.

The question setter shall ensure that questions covering all skills are set. Different types of questions shall be given different weights to quantify their range as follows: Number of questions to be answered. A bunch of 4 objective type questions. Short answer type questions. Requirement for the completion of Programme. A candidate has to complete the Programme within a period of five years after the registration. PROPOSED SCHEME FOR BCA PROGRAMME.

Introduction to Computers Core. Methodology of Programming and programming in C Core. Software Lab — I Core. Fundamentals of Digital Systems Core. Software Lab- II Core. Design and Analysis Of Algorithms Core. Durn of Exam in hours. Database Management Systems Core. Visual Programming Techniques Core.

Software Lab — V core. Software Development Lab — I Mini Project core. Lab II Main Project. Open Course for students of other Departments.

Monitors, Sound Systems, and Printers. Storing Information in a Computer: Definition of an Operating System - Different types of PC Operating Systems. Computer Networks — uses - categories of networks - LAN, WAN, The Internet - Working of Internet - Major Features of Internet. Brief idea of multimedia. Introduction to Computer Science, ITL Education Solutions limited. Methodology of Programming and Programming in C Core. Program Concept, Characteristics of Programming, Various stages in Program Development Programming aids Algorithms, Flow Charts - Symbols, Rules for making Flow chart, Programming Techniques — Top down, Bottom up, Modular, Structured - Features, Merits, Demerits, and their Comparative study.

Single dimensional arrays, multidimensional arrays, initializing array using static declaration, Searching and sorting of Arrays, Array of Characters, Character arrays and strings, String handling Functions. Definition of Structures, declaration, structure passing to functions, array of structures, arrays with in structures, unions, typedef statements.

Exercises 1 and 2 will be included in the viva ]. Familiarization of Computer System and installation: Demonstration of various units of Computer system, handling of devices, demo on hardware units, Login process, Booting Process, software installation, driver installation, printer installation etc.

Practicing Operating System Commands: MS-WINDOWS —using start menu, desk top, task bar, word pad, note pad, file management- creation, copy, delete, moving of files in directories, selecting and executing a program - Demonstration of editing, compiling and executing a C program using a C compiler.

Programs using Basic Constructs: Programs using control structures: Array based programs — Creation of array containing prime numbers, matrix addition, matrix multiplication, transpose of a matrix, array sorting, preparing rank lists based on marks, searching of arrays linear for finding price of an item. Static initialization of arrays. Programs using return type functions, void type functions, example program using recursive functions, array sorting program using function with call by reference, function to copy one string into another.

Simple program using pointers. Accounting and Programming in COBOL Core. Accounting concepts, conventions, Double Entry systems, Journal and Journalizing, Ledger- Posting and balancing, Trial balance.

Optimal binary search tree applet account, Trading account, Profit and Loss account, Balance sheet. Programs based on above verbs. Sequential files and File Programs: Concept of Indexed sequential file and Random access files.

G Dastidar, - Tata McGraw Hill Second. Concept of Structured data: Data structure definition, Different types and classification of data structures, Arrays — representation of array in the memory, linear array operations, Bubble sort, Selection sort, linear search, binary search, sparse matrix.

Concept of dynamic data structures, linked list, types of linked list, earn money in farmville list using pointers, insertion and deletion — examples, circular list — doubly linked lists, garbage collection. Concept of recursion, definition of - trees, binary trees, strictly binary trees, complete binary tree and Binary search treeCreation of binary search tree, traversing methods - examples.

File organizations- sequential, random files, linked organization, inverted files, cellular partitioning, hashing function. Data Structures Through C A Practical ApproachG. Fundamentals of Data Structures, Ellis Horowitz and Sartaj Sajni.

Introduction to data structures in CAshok N. Boolean Algebra and Gate Networks: Sequential and Combinational Logic. Concept of Registers, Optimal binary search tree applet Registers, Flip banished trader cattle as building blocks of memory, RAM, ROM, organization.

Mano-Digital Logic and Computer design. Thomas C Bartee- Digital computer Fundamentals. Software Lab — II George bush stock market crash. Business Data Processing Using COBOL only business problems. Programs using ADD, SUBTRACT, MULTIPLY, DIVIDE, COMPUTE VERBS. Programs using IF, IF.

Programs using PERFORM statements. Programs using sequential file processing —only Accounting problems are to be given as listed below. The structure of the file may be Date, Account Name to be debited, Account Name to be credited, Amount. An appropriate tariff structure may be assumed. Data Structures using C. Array search and sort — Bubble sort, Selection sort, linear search, binary search, sparse matrix, polynomial addition.

Stack implementation, Application of stacks — Conversion of infix expression to postfix, expression cyprus euro rate in indian rupee. Queue implementation, Implementation of circular queue.

Linked list- implementation, concatenation etc. Creation should students get paid for good grades pros traversal of binary search trees. Advanced Statistical Methods Complementary.

Design and Analysis of Algorithms Core. Introduction — Definition of Algorithm, Areas of algorithm study, performance analysis — space complexity, time complexity, asymptotic notations Ore, Wq. Basic traversal and search techniques - BFS and traversal, DFS and traversal, Bi-connected components and DFS, Backtracking — General method, 8-queens problem, Sum of subsets problem, Graph coloring, Hamiltonian cycles.

Ellis Horowitz, Sartaj Sahni, Sanguthevan Rajasekharan. Introduction to design and analysis of algorithms. Central Processing Unit, General Register Organization, Stack Organization, Instruction Formats, Instruction Classification, Addressing modes.

Main Memory, Organization of RAM, SRAM, DRAM, Read Only Memory-ROM,PROM,EROM,EEPROM, Auxiliary memory, Cache memory, Virtual Memory, Memory mapping Techniques. Introduction to parallel processing, Pipeline computers, Multi processing systems, Architectural classification scheme-SISD, SIMD, MISD, MIMD. Pipelining and Vector processing, Introduction to pipelining, Instruction and Arithmetic pipelines design Vector processing, Array Processors.

Kai Hwang and F A Briggs-Computer Architecture and parallel processing. Practical applications of Computer Graphics: Display devices, Raster Scan Display, DVST, Flat panel, LCD, Raster Scan systems, Random Scan systems.

Input devices, Hard copy devices, Graphics software. Line drawing algorithms, Simple DDA. Circle generation, Mid point circle algorithm, Character generation.

Translation, Rotation, Scaling — Matrix representation and homogenous coordinates, composite transformation, raster methods for transformations. Clipping operations — point clipping, line clipping, Cohen Sutherland line clipping, polygon clipping, Sutherland-Hodgeman polygon clipping.

Graphical User interface and interactive input methods: Input of graphical data, interactive picture construction techniques. Three dimensional display methods, three dimensional graphics packages. Three dimensional object representations: Polygon surfaces, sweep representations, constructive solid geometry methods, octrees and quad trees.

Introduction - Object Orientation- object oriented development-Object oriented Methodology-Object oriented Models-Object oriented themes- Modeling-Objects and classes concepts-Links and anatomy of a fx trade concepts-Generalization and Inheritance-state modeling-interaction modeling. Object Oriented Modeling and Design with UML, Second Edition. By James Rumbaugh, Michael Blaha.

Software Lab III Core. Introduction to the concept of microprocessor: IntelInstruction cycle, Timing diagrams, Instruction set ofAddressing modes, Status flags, Intel Instructions.

Introduction, Pin-out Diagram, Operating modes, Operation ofRegisters, Interrupts, Bus Cycle, Addressing modes. Hard Disk drive, Definitions, Hard Disk operations, Disk formatting, Basic hard disk drive components, Hard disk features, Hard disk drive installation procedure, FAT Disk, VFAT and log file names, FAT 32, NTFS.

Will stock market be closed on veterans day Memory, Memory modules: Gaonkar- Micro processor Architecture, Programming and applications with Venugopal and Ravikanth- Introduction to assembly language programming in Scottmuller with Creigzacker- Upgrading and repairing PCs. System Analysis And Design Core. Life cycle activities - life cycle flow chart, task, management review, baseline specifications, role of system analyst.

Basic tool of system analysis: Tools for structure analysis and design: Types of basic charts, decision tables, decision trees, structured English, data flow scalper ea forex-tsd, data dictionary, system cursos para aprender a invertir en forex charts, flow charting symbols, information oriented flow charts, process oriented flow charts, HIPO charts.

Study phase activities, information service request, initial investigation, fact finding techniques, fact analysis techniques, steps in feasibility analysis, study phase report. Design phase activities, structure design, input design- input data, cfd barclays stockbrokers media and devices, output design, design phase report.

Development phase activities, bottom up and top down computer program development, training- programmer, operator, user trainings ; convertion; change over plan; PERT; steps in computer program development; structured programming; development phase report.

System Analysis And Design — Elias M AwadGalgotia Book Source. Software Engineering Concepts — Richard FairleyTata Mc Graw Publication. Data Base Management System Core. DBMS language-DDL, DML,DCL Data Base system environment, DBMS Component and modules. ER Modeling - Introduction- Entity types, Entity sets, Attributes and Keys, Relationship Types, Relationship Sets relationship instances, Constraints on relationship types, Weak entity camne nak main forex, sample ER diagrams.

Relational model concepts domains, attributes, tuples and relations, characteristics of relations. Relational Model constraints Relational Databases and relational data base schemas, entity integrity, referential integrity and foreign keys with examples.

Examples of queries in Relations Algebra Tuple relations calculus, Domain relational calculus. Relational Data base design using ER-to-Relational mapping. Data definition commands- CREATE, ALTER,DROP, Adding constraints, Basic SQL queries-INSERT, SELECT,DELETE,UPDATE Ordering of rows UNION,EXCEPT,INTERSET Substring comparisons using LIKE operator, BETWEEN operator, Complex Queries-Nested queries, EXISTS and UNIQUE functions, NULL values, Renaming of attributes and joining of tables, Aggregate functions and grouping, Managing views.

CS Optimal BST

Indexing structures for files - types of single level ordered indexes. Database Security and Authorization: Ramez Elmasri and Shamkant B. Getting Started with Visual Basic 6, Understanding Visual Basic Projects, Designing the user interface, Putting your Forms to Work with controls, Mastering Menus and Toolbars. Programming in Visual Basic: Creating Objects and Classes, Advanced Class Concepts, Working with objects and collections.

Mastering the Visual Basic Data Control, Creating Queries in Visual Basic, Mastering Jet DAO. Using Advanced Data Access Methods — ADO, OLEDB; Using Crystal Reports, Using the Package and Deployment Wizard. Using Visual Basic 6 by Bob Roselman, Richard Peasley and Wayne Prunchiah, PHI.

Software Lab IV Core. Data definition commands - CREATE, ALTER, DROP, Adding Constraints — Primary key, foreign key, unique key, check, not null.

Managing views, Simple stored procedures. Data Control commands - Access Control and Privilege commands. Designing User Interface using- List Box, Combo Box, Image and Picture Box. Directory-File-Drive list boxes, Rich text box, etc. Creating Menus- Creating Menus and writing Codes, Linking Menus with SDI.

Java Quick Guide

Database Connectivity using Controls - Designing user interface with forms. Database connectivity using Object models - Creating Database connectivity. DB as well as ADODC Connectivity. Creating Reports - Create reports using Data Report in VB and also using. Package and deployment Wizard - Package, Deploy and Scripting.

Transmission impairments- attenuation distortion and noise. Data communication protocols and standards, Network models - OSI model-layers and their functions. FDM, TDM, spread spectrum. Transmission Media- guided media and unguided media. Hop to Hop Delivery. Error Detection and Correction —Type of Errors, Redundancy, Detection ,Correction, Forward Error and Retransmission.

Coding -Block Coding Parity Chek Code and Hamming Code and Cyclic Codes. Framing, flow and error control, Protocols - Noiseless channels SimplestStop and Wait and Noisy channels Stop and Wait and Piggy Backing. Cellular Telephony Generations —First, Second and Third generations. Congestion control, quality of service. Name space, domain name space, Remote logging, Electronic mail, file transfer. Synchronization - The Critical Section problem, Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors.

Memory Management Strategies -Swapping, Contiguous memory allocation, Paging, Segmentation. Virtual Memory Management- Demand paging, Page Replacement. Object oriented programming-Encapsulation-Inheritance-Polymorphism-Genesis of Java-characteristics of java- program structure-identifiers-operators-variables-literals-data types-Arrays. Control Statements-selection statements-iterative statements-jump statements - Loops- while loop-do while loop- for loop.

Classes-declaration —object references-instantiation- method declaration-method calling — this operator- constructor- method overloading-constructor overloading-method overriding-inheritance-super class-dynamic method dispatch-final-static-abstract classes — String Handling. Packages - creating packages-using packages-Interfaces-Exception Handling Techniques-try-catch-throw-throws-finally -Multithreading- creation of multithreaded program-Thread class-Runnable interface- thread priorities.

Event Handling-Delegation Event Model-Event Classes-Sources of Events-Event Listeners- AWT: Label-Button-Checkbox-List-Choice control-Text Field-Text Area- Lay out Managers. Programming with java —. Software Lab — V.

Graphics- AWT controls- Event Handling. MethodOverloading- MethodOverriding-inheritance-abstract class — interfaces- packages-Exception Handling-Multithreading. HTML Black Book, Steven Holzner, Dreamtech Publishers. Introduction to Software Engineering — Definition, Program Vs Software, and Software process, Software Characteristics, Brief introduction about product and process, Software process and product matrices.

Software life cycle models — Definition, Waterfall model, Increment process models, Evolutionary process models, Selection of a life cycle model.

Chapter 1 and 2. Software Requirement Analysis and Specification — Requirements Engineering — type of requirements, Feasibility Studies, Requirement Elicitation, Various steps for requirement analysis, Requirement documentation, Requirement validation, an example to illustrate the various stages in Requirement analysis. Project planning-Size estimation, cost estimation, the constructive cost model COCOMO.

Chapter 3 and 4. Software Design - Definition, Various types, Objectives and importance of Design phase, Modularity, Strategy of design, Function oriented design, IEEE recommended practice for software design descriptions. Steps to Analyze and Design Objected Oriented System. Software Reliability — Definition, McCall software quality model, Capability Maturity Model.

Chapter 5 and 7. Software Testing — What is testing? Software Engineering Third Edition. New Age International Publications. Software Engineering VII th Edition Pearson Education. An Integrated approach to Software Engineering. Narosa Publishing Company, Second Edition.

Dispelling the Myths, Obstacles- Upfront and hidden, open systems and standards, Standards setting organizations, factors of success. Client hardware and software: Client components and operating systems.

Application logic client software products: GUI design standards, Open GUI standards, Interface dependents, testing interfaces, development aides. Benchmarks, categories of servers, features and classes of server machines. Platform independence, transaction processing, connectivity, intelligent database, stored procedures, Triggers, Load Leveling, Optimizer, testing and diagnostics tools, real ability backup and recovery mechanisms.

Server data management and access tools: Data manager features, data management software, database gateways. LAN hardware and software, Network Operating Systems. Dawna Travis DewireClient Server Computing, McGraw Hill International.

Tanenbaum and Van Steen, Distributed Systems — Principles and Paradigams. Orfali,Harkey and Edwards, The Essential Client server Survival guide, 2 nd edition.

B-tree - Wikipedia

David VaskevitchClient Server Strategies, Galgotia, Commands for files and directories — cd, ls, cp, rm, mkdir, rmdir, pwd, file, more, less, Creating and viewing files using cat, file comparisons, View files, disk related commands, checking disk free spaces.

Shell programming - Basics of shell programming, various types of shell available in Linux, comparisons between various shells, shell programming in bash. Conditional and looping statements, case statement, parameter passing and arguments, Shell variables, system shell variables, shell keywords, Creating Shell programs for automating system tasks. Introduction — Data Mining, Data Ware House, Transactional Databases, Data Mining Functionalities — Characterization and Discrimination, Mining frequent patterns, Association and correlation, Classification and Prediction, Cluster Analysis, Classification of Data Mining Systems, Data Mining Task Primitive, Integration of Data Mining systems, Major issues in Data Mining, Data integration and transformation, Data reduction, Data discretization.

Association Rules and Classification Concepts — Efficient and Scalable Frequent item set Mining methods, Mining various kind of association rules, from association mining to Co-relation analysis, Classification and prediction, Issues, Classification by Decision tree induction, Bayesian Classification, Rule-based classification, Support Vector Machines, Learning from your neighbors, Prediction.

Mining Complex Data — Spatial Data Mining, Multimedia Data Mining, Text Mining and Mining WWW. Jiawei Han and Micheline Kamber. Data Mining - Concepts and Techniques Second Edition. Data Mining — Practical Machine Learning Tools and Techniques Second Edition. Soman, Divakar and Ajay. System software and application software-general concepts.

Introduction, Language Processing activities, Fundamentals of Language Processing, Fundamentals of Language specification. Phases of language processor. Assembly Language statements- imperative, declarative, assembler directive, Elements of assembly language programming- forward reference problem, design of two pass assemblers and single pass.

Macro Definition, macro call, macro features. Aspects of compilation, Phases of compiler, syntactic structure of language, Grammars-classification, Scanning, Parsing techniques- representation of parse tree-intermediate code generation-loop optimization. Various types of loaders — linking and relocation concepts.

Principles of Compiler Design by Aho and Ullman. Systems programming and Operating Systems by D. Introduction to System ProgrammingLeland L. Beck -3 rd Edition-Pearson Education. A seminar report in bound form in the pattern of a complete technical report with contents page, well structured presentation, references etc.

A project report shall be submitted in hard bound complete in all aspects. For internal evaluation, the progress of the student shall be systematically assessed through various stages of evaluation at periodic intervals. Letter Grade Performance Grade point G Grade Range A Excellent 4 3.