Mandatory Disclosure by Institutions running AICTE approved MCA programmes to be included in their respective Information Brochure, displayed on their website and to be submitted to AICTE every year latest by 30^th April together with its URL

The following information is to be given in the Information Brochure besides being hosted on the Institution’s official Website.

“The information has been provided by the concerned institution and the onus of authenticity

lies with the institution and not on AICTE.”

I. Name of the Institution

Gangadhar Meher College (Autonomous)

Address : Sambalpur, Pin – 768004

Tele. No.: (0663) 2403413, 2700492

Fax No. : (0663) 2403413

Email : info@gmcollege.org

II. Name & Address of the Director

Dr.D Sahu, Principal, G.M.College(Auto.), Sambalpur

Tele. No.: (0663) 2403413, 2700492

Fax No. : (0663) 2403413

Email : info@gmcollege.org

III. Name of the Affiliating University

Name	Sambalpur University
Address	Jyoti Vihar, Burla, Sambalpur.
Period of Affiliation	1967 on wards
STD code	0663	1.1Phone No	2430158

IV. Governance

v Members of the Board and their brief background

1. Prof. S.K.Sanyal, Prof. of Electrical Engineering, UCE, Burla

2. Prof. C.R.Tripathy, Prof. of Computer Science, UCE, Burla

3. Dr.S.K.Sahoo, Reader in Math. & Co-ordinator MCA, G.M.College, Sambalpur

4. Dr.Birendra Kumar Patel, Reader in Math. & Jt. Co-ordinator MCA, G.M.College, Sambalpur

5. Dr.(Mrs.) A.M.Mishra, Reader in Mathematics, Women’s College, Sambalpur

6. Mr.D.Hota, Reader in Mathematics, G.M.College, Sambalpur

v Members of Academic Advisory Body

1. Principal, G.M.College

2. Vice – Principal, G.M.College

3. CDC Chairman, Sambalpur University

4. UGC Nominee

5. Principal’s Nominee

6. All Heads of the Dept., G.M.College

7. Director, Academic Staff College, Sambalpur University

8. PG Council Chairman, Sambalpur University

9. Controller of Examination

10 Administrative Bursar

v Frequency of the Board Meetings and Academic Advisory Body

Board of Studies meet twice in a year to prepare list of Question Setters, Examiners and Moderators, Academic Advisory Body meet Once in a year

Organizational chart and processes

v Nature and Extent of involvement of faculty and students in academic affairs/improvements

Seminar are conducted once in a week by inviting resource person from different organization/Institutes, Group discussion organized among the students to develop their communicative skill, Faculty and students interaction is made every week.

v Mechanism/Norms & Procedure for democratic/good Governance

Administrator , faculty and student representative meet sever times

to plan and execute governance.

v Student Feedback on Institutional Governance/faculty performance

Coordinator takes student feedback about faculty performance and other problems.

v Grievance redressal mechanism for faculty, staff and students

Problems are settle at coordinator level if possible or else refer to Grievance redressal committee of the college.

V. Programmes

v Name of the Programmes approved by the AICTE :MCA

v Name of the Programmes accredited by the AICTE : Nil

v For each Programme the following details are to be given:

· Name :MCA

· Number of seats : 30

· Duration : 3Years

· Cut off mark/rank for admission during the last three years

Decided by the Orissa JEE (conducted by BPUT)

· Fee : Rs20000/- per annum

· Placement Facilities: There is a placement cell which takes care of placement facilities;

2000-2003 100%

2001-2004 100%

2002-2005 80%

2003-2006 continuing

· Campus placement in last three years with minimum salary, maximum salary and average salary

Max:Rs25000/ Minimum:12000/

v Name and duration of programme(s) having affiliation/collaboration with Foreign University(s)/Institution(s) and being run in the same Campus along with status of their AICTE approval. If there is foreign collaboration, give the following details:

· No affiliation/collaboration with Foreign University(s)/Institution(s)

VI. Faculty

v Branch wise list faculty members:

· Permanent Faculty :Nil

· Visiting Faculty Nil

· Adjunct Faculty 15

· Guest Faculty 5

· Permanent Faculty: Student Ratio -

v Number of faculty employed and left during the last three years: NIL

VII. Profile of Director/Principal with qualifications, total experience, age and duration of employment at the institute concerned

Photograph

(This page will be updated very soon)

For each Faculty give a page covering

1. Name

2. Date of Birth

3. Educational Qualification

4. Work Experience

- Teaching

- Research

-

Signature

Industry

- Others

5. Area of Specializations

6. Subjects teaching at Under Graduate Level

Post Graduate Level

7. Research guidance

No. of papers published in

Masters’s - National Journals

Ph.D. - International Journals

- Conferences

8. Projects Carried out

9. Patents

10. Technology Transfer

11. Research Publications

12. No. of Books published with details

VIII. Fee

v Details of fee, as approved by State fee Committee, for the Institution.: Rs.20000/-

v Time schedule for payment of fee for the entire programme : Annually.

v No. of Fee waivers granted with amount and name of students : Nil.

v Number of scholarship offered by the institute, duration and amount : Nil

v Criteria for fee waivers/scholarship : No criteria for fee waivers at present.

v Estimated cost of Boarding and Lodging in Hostels. Rs 2000/

Ix. Admission

v Number of seats sanctioned with the year of approval : 30 (2005-06).

v Number of students admitted under various categories each year in the last three years.

2003-04 : 30

2004-05 : 28

2005-06 : 23

v Number of applications received during last two years for admission under Management Quota and number admitted.

All admission process conducted by Orissa JEE( BPUT).

X. Admission Procedure

v Mention the admission test being followed, name and address of the Test Agency and its URL (website).

Students are taken from the list published by JEE Orissa conducted by BPUT.

v Number of seats allotted to different Test Qualified candidates separately [AIMCET/CET (State conducted test/University tests)/Association conducted test]

JEE Orissa conducted by BPUT

v Calendar for admission against management/vacant seats:

At present there is no provision to fill up vacant seats at college level. Process is on to decide the modality with Govt. approval .

XI. Criteria and Weightages for Admission

There is no separate criteria and weightage for admission at college levels. Criteria for admission as per BPUT guidelines.

Item No I - XI must be given in information brochure and must be hosted as fixed content in the website of the Institution.

The Website must be dynamically updated with regard to XII–XV.

XII. Application Form

Downloadable application form, with online submission possibilities are available in BPUT website.

XIII. List of Applicants

Available in website of BPUT

XIV. Results of Admission under Management Seats/Vacant Seats

. At present there is no provision to fill up vacant seats at college level. Process is on to decide the modality with Govt. approval .

XV. Information on infrastructure and other resources available

Library:

Ø Number of Library books/Titles/Journals available (programme-wise) : 3364 ( Titles: 610)

Ø List of online National/International Journals subscribed : Nil.

Ø E-Library facilities : In the process of having E-library.

Laboratory:

For each Laboratory

Ø List of Major Equipment/Facilities : Server : 02, PC: PIV-48

Ø List of Experimental Setup

Computing Facilities:

Ø Number and Configuration of Systems : 50

Ø Total number of systems connected by LAN : 32

Ø Total number of systems connected to WAN:NIL

Ø Internet bandwidth ISDN 64 kbps/s

Ø Major software packages available:13 Application Softwares

Ø Special purpose facilities available

Games and Sports Facilities yes

Extra Curriculum Activities yes

Soft Skill Development Facilities yes

Number of Classrooms and size of each

Particulars		Number of rooms available in the Institution	Carpet area of each room available in the Institution
Class rooms		30	252
Tutorial Hall		10
Drawing Hall		01
Computer Center
Library	Reading Hall	01	189.33
	Stacking Area	01	340.77
Laboratories		02	126 sq.m
Workshops			-
Total			908.10

Ø Curricula and syllabi for each of the programmes as approved by the University.

1^st semester MCA(MCA101)

Discrete Mathematics

Module 1 (16 hrs)

Sets, Relation, Proposition, Functions (16)

Sets, combination of sets, finite and infinite sets, uncountable sets, relation, properties of relations, composition of relations, closure operation on relations, equivalence relations and predictions, partial ordering relation, lattices, function as a relation, subjection, bijection, composition of function, inverse of function, cardinality, characteristic functions, proposition and logical operations, methods of proof, mathematical induction.

Module 2 (12 hrs)

Graph theory

Directed and undirected graphs, basic terminology, paths and circuits, shortest paths in weighted graphs, Eulerian paths and circuits, Hamiltonian paths and circuits, Trees; definition and properties, rooted trees, binary trees, spanning trees, cut sets, minimal spanning trees.

Module 3 (6 hrs)

Algebraic structures and application

Binary operation, semi groups, groups, subgroups, cosets, Lagrange’s theorem, codes, group codes.

Module 4 (3 hrs)

Basic properties of lattices, distributive and complemented lattices, Boolean algebra, finite Boolean algebra,

Module 5 (3 hrs)

Permutation, Combination & Discrete Probability the rules of Sum and protect Permutations, Combinations, Discrete probability, Conditional probability.

Text Book:

1. C.L.Liu, “Elements of Discrete Mathematics”, Mc Graw Hill International Student Edition.

2. Alan Doerr, Kenneth Levasseur, “Applied discrete structure for Computer Science”, Galgotia Publication Private Limited. Articals 1.1 to 1.5, 3.1-3.4, 3.6, 3.7, 4.1,4.3-4.6, 5.1-5.4, 5.6, 5.7, 6.1,6.2, 6.3, 6.6, 6.7, 11.2,11.3,11.5,11.7,12.1-12.6.

3.

Reference Books:

1. Bernardi Kolman, Robert C. Bussby, “Sharon Ross, “Discreate Mathematical Structures” Prentice Hall of India.

2. N.Ch. S.N. Lyengar, Chankrasekaran, Venkatesh, Arunachalam, “Discrete Mathematics”, Vikas Publication.

MCA102

Computer Architecture

1. Digital Logic Circuits

Logic gates, Boolean algebra, K-Map, Combinational Circuits, Adders, Flip-flops, Sequential Circuits.

2. Digital Components

Integrated Circuits, Decoders, Multiplexes, Registers, Shift registers, Binary Counters, Memory Units: RAM and ROM.

3. Data Representation

Data types, Number Systems, Decimal number, Octal numbers, Hexadecimal number representation and Conversion, BCD, Fixed point and floating-point representation.

4. Basics of Registers Transfer and Micro Operations

Registers, Register transfer, Bus and Memory transfers, Three-state bus buffers, Memory transfers: Memory read, Memory write.

Arithmetic micro operations : add micro operation, Subtract micro operation, Binary Adder, Binary Adder Subtracter, Binary incrementer, Arithmetic Circuit, 4-bit arithmetic circuit.

5. Basic Computer Organisation

Instruction Codes, Timing and Central, Instruction Cycle, Memory reference instructions, Input/Output and Interrupt.

6. Basics of Control and CPU Organisation

Control Memory, Address Sequencing, Micro program Example: General register Organisation, Stack Organisation, Instruction formats, Addressing modes, RISC and CISC characteristics.

7. Basics of Input/Output Organisation and Memory Organisation

Peripheral devices, I/O interface, Asynchronous, Data Transfer: Strobe, Handshake, Asynchronous Serial, DMA Transfer.

Memory hierarchy, Main memory, Associative memory, Cache memory, Virtual Memory.

8. Basics of Pipelining and Multiprocessing

Parallel Processing, Pipelining, Linear Pipelining, Arithmetic Pipeline, Instruction Pipe line, Vector Processing, Characteristics of Multiprocessor, Interconnection Structures, Timeshared bus, Multi port memory, Cross bar Switch, MIN, Hypercube interconnection.

Text Book: Computer System Architecture: M.Morris Mano

MCA-103

PROGRAMMING IN C

Module 1: Introduction to computers (4 hrs)

Evolution of computers, processor families – Intel, Motorola, AMD series, basic concepts of computer organizations, CPU, memory, RAM, ROM, EPROM, I/O units such as hard disk, floppy disk, CD ROM/ Writer, scanner, printers, keyboards, power supplies etc.

Module 2: Number Representation in Computers (4 hrs)

Binary Representation of numbers, integers, integers, floating point numbers, negative number representation, Arithmetic operations, addition, subtraction, multiplication, division, overflow and underflow exceptions.

Module 3: Introduction to programming and programming languages (4 hrs)

Evolution of programming languages, flow charts, structured programming, the complilation process, object code, source code, executable code, operating systems, interpretators, linkers, loaders etc.

Module 4: C Language Fundamentals (4 hrs)

Character set, Identifiers, Keywords, Data Types, Constant and Variables, Statements, Expressions, Operators, Precedence of operators, Input – output Assignments, Control structures, Decision making and Branching, Decision making & looping.

Module 5: Arrays and Strings (4 hrs)

One dimensional, Multidimensional and their applications, Declarations, Manipulation & String-handling functions.

Module 6: C Functions (6 hrs)

Monolithic vs Modular programs, User defined vs standard functions, formal vs Actual arguments, Functions category, function prototypes, parameter passing, Recursion Classes: Auto, Extern, Global, and Static.

Module 7: Pointers (6 hrs)

Pointer variable and its importance, pointer Arithmetic, passing parameters by reference.

Module 8: Structures, Union and File handling (8 hrs)

Declaration of structures, pointer to pointer, pointer to structure, pointer to function, unions, dynamic memory allocations, unions, file management.

Books:

1. E. Balaguruswamy “Programming in C”, Tata McGraw Hill

2. H. Schildt, “C The Complete Reference”, Tata McGraw Hill

3. Y. Kanetkar, “Let us C”, BPB Publications.

4.

MCA104 Communicative English

Rationale / Objectives

This is a practice-oriented, need-based, functional-communicative course. It seeks to develop the student’s skills of communication in listening, speaking and writing. Reading, though formally not included, is still a recommended activity. The student is advised to cultivate the habit of reading newspapers, magazines and books in a free, extensive manner to consolidate the skills already achieved. A more interactive process of teaching/learning is called for in order to achieve the skills of effective communication.

Specific Objectives

The course attempts to

A) Familiarize the student with the sounds of English in a nutshell, particularly long and short vowels, some consonants, stress and intonation.

B) Provide adequate listening and speaking practice so that the learner can speak with ease, fluency and reasonable clarity in common everyday situations and on formal occasions.

C) Use grammar in meaningful contexts.

D) Things with words, i.e. to perform functions like ordering, requesting, inviting and so on.

Module – 1 Communication (6 hrs)

1.1 Verbal and non-verbal spoken and written

1.2 Language functions-descriptive, expressive and social

1.2 To inform, enquire, attract, influence, regulate and entertain

1.3 Bias-free and plain English

1.4 Formal and informal style

Module – 2 Communicative Grammar (9 hrs)

Time, tense and aspect

Verbs of states and events

Statements, questions and responses

Omission of information

Expressing emotion and attitude: hope, pleasure, disappointment, regret, approval, surprise.

Module – 3 The Sounds of English (9 hrs)

1.1 Length of vowels-Long vowels/ / I:, a:,)., U:, 3:/ as in feel, card, court, food and first respectively.

1.2 Short vowels / e, x, n / as in pen, bag, and sun respectively.

1.3 Consonants / f, v, Q, x, s, z, ___________/ as in fine, vast, through, them, sosng, zoo, shame, pleasure and judge respectively.

1.4 Stress pattern

1.5 Intonation- Rising and falling.

1.6 Friendly communication-greetings, farewells, introductions, thanks, apologies, regrets, good wishes, ongratulations, condolences, offers.

Module – 4 Doing things with words (6 hors)

1.1 To ask for information, help, permission

1.2 To instruct, command, request, accept, refuse, prohibit, persuade, and promise.

Business Communications in English.

Objectives:

The objectives are to prepare the student to

a) Produce written communication of different forms such as paragraph, report, letter, etc.

b) Make notes/summarize from a given passage.

c) Organise Meetings prepare agenda, draft resolutions and write minutes.

d) Make presentations and face interviews.

e) Documents source and prepare bibliographies.

f) The objectives of managerial oral communication; improving the facility of oral communication. Both Transmission and reception in six managerial situations such as.

i) Information sharing ii) Conversation iii) Interview iv) Committee v) Negotiation viii) Presentation.

Module – 1 Writing – I (7 hours)

1.1 Paragraph writing – topic sentence, cohesion and coherence – sentence linkers (so, but, however etc.)

1.2 Preparation of a business report – writing a business proposal – format, length, structure.

Module – 2 Writing – II (7 hours)

2.1 Preparing notes – writing business letters and E-Mail messages

2.2 Documentation. References, notes and bibliographies.

Module – 3 Writing – III (7 hours)

3.1 Writing curriculum vitae (both chronological and functional) along with an applicant for a job.

3.2 Public relations – concept and relevance – PR in a business oranisation – handling the media.

Module – 4 Meeting and presentation (9 hours)

1.1 Organising a meeting an agenda, chairing a meeting drafting resolutions, writing minutes.

1.2 Making an oral Presentation

1.3 Facing an interview

Books:

1. (John Sealy) Oxford Guide to Writing and Speaking English, OUP.

2. (Bovee et al) Business Communication Today Person Education.

3. (Rovi and Rai) Business Communication.

4. (J.V. Cilanilm) More Elective Communication, Sage Publications.

5. (J.K. Chand and B.C. das) A Millennium Guide to Writing and Speaking, (Friends Publishers)

6. The Chicago Manual of style (Part 2 section 15) Prentice-Hall of India.

7. (Sushil Bahi) Business communication Today, Sage Publications.

Books:

1 Geoffrey Leech and Jan Svartvik, Longman, A communicative Grammar of English,

2 J.D. O’connor, Better English Pronunciation, ELBS

3 J.K. Chand and B.C. Das, A Millennium Guide to writing and Speaking English, Friend’s Publishers.

4 Jhon Seaaly, Oxford Guide to Writing and Speaking, OUP.

MCA - 105

Engineering Economics and Costing

Module 1 (6 hrs)

1. Analysis of demand: Law of demand, concept ad measurement of elasticity. Properties of, indifference course and theory of consumers’ equilibrium. Laws of supply.

2. Production function, law of variable proportions, returns to scale. Long rum and short rum cost course. Engineering cost course and L-shaped cost course.

3. Equilibrium of firm. concept of break-even. Price and output determination under perfect compectition, monopoly, monopolistic competition and dligopolistic market.

4. Project evaluation. Public and private Projects. Concepts of Present value, discount vote and internet rate of return.

5. Theory of employment. Consumption and investment functions. Measurement of GNP. Fiscal policy and role of Government.`1

Books Recommended:-

1) Managerial Economics (Vikas Pushishing House) by D.N. DEIVEDI Chapter 3 (5,6,7) Chapter 4 (3) Ch-6,Ch-7, Ch-9,11,12,13.15(4), 22.

2) Modern Micro Economics (Macmillan) by A.KONTSOYIANNIS Chapter-2(11), 3(1,2,3,4), 4(1,2,3,4), 5(1,2),6,7,8,9.

3) Public France Theory Practice (Mc Graw Hill) E.A. MASGRANE and P. MASGRANE. Chapter – 9.

4) Advanced Economics Theory – P.N.CHOPRA (Relevant Chapters).

Module 2 (10 hrs)

Costing: cost concepts, material, labour and overhead costs, overhead allocations and absorption, Introduction to job costing, process costing, marginal costing, and standard costing.

Module 3 (14 hrs)

Variance Analysis, Management Decision based on variance analysis, relevant costs for decision making, cost control and cost reduction.

Books:

1. Horngreen C.T., “Cost Accounting”, Prentice Hall of India.

2. DeGamo Patel, “Principles of Engineering Economics”, Prentice Hall of India.

2^nd semester MCA

MCA 201 Business Data Processing

Prerequisite : Nil.

1.Introduction to Data processing : records and files; data collection, preparation, verification, editing and checking.

2.Business files - File Organization Master and transaction file, file generations, Back-ups and file recovery procedures.

3.COBOL programming - language constructs and structured program development.

4.File sorting, searching,merging,matching.

Books Prescribed :

1. Roy, M.K. and Dastidar Ghosh, D. : COBOL programming, Tata -Mc Graw Hill Publ. Com. Ltd., 1982.

Chapters : 3 to 14.

2. Rajaraman, V. & Sahasrabuddhe, H.V.; Computer Programming in COBOL, Prentice- Hall India.

Books of Reference :

1. Philippakis and Kazmier, Information System Through COBOL 2nd Edn. Mc Graw Hill Int. Editions.

2. Popkin, G.S. : Advanced Structured COBOL, 2nd Edn. Kent Publ.Comp.1987.

3. Pierson & Horn : Structured COBOL Programming scott Foresman and Co., 1986.

4. Grover, P.S. : Programming with structured COBOL Macmillan, 1989.

MCA 202 Data Structure Using C

Module 1 (8 hrs)

Development of Algorithms: Notations and Analysis. Storage structures for arrays-sparse matrices structures and arrays of structures. Stacks and Queues: Representations and applications.

Module 2 (8 hrs)

Linked Lists: Singly linked lists – Linked stacks and queues- operations on Polynomials – Linked Dictionary – Doubly Linked Lists – Circularly Linked Lists. Dynamic storage management- Garbage collection and compaction.

Module 3 (8 hrs)

Binary Trees: Binary Search Trees- General Trees- Tree Traversing- Operations on Binary Trees- Expression Manipulations- Symbol Table construction- Height Balanced Trees.

Module 4 (16 hrs)

Graphs: Representation of Graphs- Path Matrix- BFS, DFS- Bi-connected Graphs – Topological sort shortest path problems. String- Representation- Manipulations- Patten Matching.

Sorting Techniques: Selection, Bubble, Insertion, Merge, Heap, Quick, Radix and address calculation. Linear searching – Binary Searching. Hash Table Methods.

Text Books:

1. Data Structures in C by Tanenbaum.

2. Fundamentals of Data Structure.

Reference Book: Data Structures, by Tremblay and Sorenson.

MCA 203 Computer Based Numerical Methods

Module 1 (8 hrs)

Fixed point arithmetic, rounding error, truncation error, loss of significance and error propagation and stability, computational methods for error estimation, convergence of sequences, some mathematical preliminaries.

Module 2 (16 hrs)

1.Roots of f(x) by bisection method, method of false position, secant method, Newton-Raphson methods, fixed point iteration method.

2.Solution of Ax = b: Solution of simultaneous liner equations by Cramer’s rule, Gauss’ ellmination method, Grauss-Jordan method, Gauss-Seidel method, matrix inversion by Gauss-Jordan method.

3.Curve Fitting: Least square approximation of functions by liner regressing, polynomial regression.

Module 3 (10 hrs)

Numerical differentiation and integration: Differentiation formulae, integration by trapezoidal rule, Simpson’s 1/3 rule and 3/8 rule.

Numerical solution of Ordinary Differential Equation:

Euler’s method, modifications of Euler’s, Runge-Kulta methods of the third and fourth order, Predictor-corrector methods.

Module 4 (6 hrs)

Miscellaneous topics: Determination of eigen values and eigen vectors of a matrix by iteration, Inverse of a matrix.

Text Books:

1. Numerical Methods for Engineers – S.C. Chopra and R.P. Canole.

2. Elementary Numerical Analysis – S.D. Conte and C. de Boor.

Reference Books:

1. Applied Numerical Analysis – C.F.Gerald, P.O.Wheatly.

2. Numerical Methods for Scientific and Engineering Computation by M.K.Jain, S.R.K. lyengar and R.K.Jain.

MCA-204

VISUAL BASIC

Introduction to Visual Basic & some features about vb. Using of all controls of tool box in vb form (small starting program).Some Graphics Interface(using Picture control, image control, Line, shape, Timer).Conditional statement and witch case statement and array(calculator program).Control structure (looping) (matrix programming). Input Box & Message Box & Preserve statement (program taking preserve statement).User defines data type (program student details). Validation (program for student, data are name; mark, grade, date of birth; percentage).Function (a small program).Menu forms (program color).MDI form (program for Notepad).File I/O (program taking file controls (Drive List Box, File List Box, Dir List Box)).String manipulations. Database (DAO, ADO, RDO using database Access 7.0 & Access 2000 and Oracle 8.0).Data Report. Introduction to .Net.

TEXT BOOK;

1. Evangelos Petroutsos: Mastering Visual Basic 6.0

Ch-1,Ch-3,Ch-4[177-205],Ch-5,Ch-6,Ch-8[383-407],Ch-9,Ch-10,Ch-17,Ch-18

REFERENCE BOOKS:

1. David jung & Cos:Visual Basic 6 SuperBible

2. Complete Reference Visual Basic 6.0

UNIX

Introduction to UNIX operating system, General commands (pwd, path, cal, date, banner, type, man, uname, passwd, who, clear, bc, echo, tput, spell, more). Handling files (cat, mkdir, cd, rmdir, cp, rm, mv, lp, split, cmp, comm.., diff, head, tail, wc, cut, paste, sort, uniq, tr,, grep, fgrep, ps, kill, nice, find), Vi editor, Shell programming.

TEXT BOOK:

1. Sumitabha Das : UNIX Concepts & Applications.

Ch-1,Ch-2,Ch-3,Ch-4,Ch-5,Ch-6,Ch-7,Ch-8,Ch-10,Ch-11,Ch-12,Ch-13,Ch-15

REFERENCE BOOKS:

1. Yashavant P. Kanetkar; UNIX Shell programming

2. Brian W. Kernighan & Rob Pike: The UNIX programming Environment.

MCA 205 Microprocessor and Assembly Language Programming

Module – 1 (10)

Microprocessors: Their emergence from 8-bit, Introduction to the basic features of RISC and CISC processors, Micro controllers. Their areas of use Introduction to 8085 Microprocessor: Architecture, Bus organization, registers, ALU, Control section, Basic Fetch and Execute cycle of a program, Timing diagrams, Instruction set of 8085, Instruction format, Types of instructions, Addressing modes.

Memory Interfacing: Logic devices for interfacing: Tri-state devices, Buffers, Bi-directional buffers, Decoders, Encoders and Latches. R/W and ROM models, Memory map addresses, Memory address range of a 1K memory chip, Memory address lines, memory word size, Memory and instruction fetch, Memory classification. Memory structure and its requirements, Basic concepts in memory interfacing, Address decoding and memory addresses, Interfacing the 8155 memory segment, Absolute vs. partial decoding and multiple address ranges.

Module – 2 (10)

Assembly Language Programming Instruction and data format, How to write, Assemble and execute a simple program, Writing assembly language programs, Debugging a program, Programming techniques such as rotate and compare, Dynamic debugging, Counters and delays, Stacks and subroutines, Advanced subroutine concepts.

Module – 3 (10 hrs)

Data Transfer Techniques: Programmed data transfer, Parallel data transfer using 8155, Programmable peripheral interface (8255) and handshake input/output, Asynchronous and data transfer using 8251A, Programmable interrupt controller 8259A transfer, DMA transfer, Cycle stealing and burst mode of DMA, 8257-DMA controller.

Various Interfacing Protocols: Polling Interrupts of various types (software, hardware, vectored), Interrupt service routines, CALL vs. hardware & software interrupts, Preliminary concepts of Exceptions/Traps, DMA and its use.

Module – 4 (10 hrs)

Analog Digital Interfacing: A/D/ & D/A converters, Analog Signal Conditioning circuits, Data Acquisitions Systems.

Some Standard Interfaces: Data communication buses such as IEEE 488 and CAMAC standard, Serial data communication Standards such as 20-mA current and Rs-232C, Network communication protocol such as SDLC.

Books:

1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and Applications with the 8085”, Fourth Editions, Penram International Publishing (India).

2. F. Cady “Micro controllers and Microcomputers: Principles of hardware and software”’ OXFORD Press.

MCA 206 Computer Lab.

(A) Data structure using C.

(B) Cobol Programming.

(C) Project work in C.

3^rd semester MCA

MCA 301

DATA BASE MANAGEMENT SYSTEM

1. Basic concepts, Database & Database users, Characteristic of the database Approach, Database system, Concepts and architecture, Datamodels, schemes and instance, DBMS Architecture &Data Independence, Database languages& interfaces, Data modeling using the entity –Relationship Approach.
2. Relational Model, Languages and system, relational Data model & Relational Algebra, Relational Model concepts, Relational model Constraints, Relational Algebra, SQL-A Relational Database language, Data Definition in SQL, View and the quires in SQL, Specifying constraints and indexes in SQL, Relational Database Management System, ORACLE/IINGRES.
3. Conventional Data Models & system, Network Data model & IDMS system, characteristics of a set, Membership types & options in a set, DML for the network model, Navigation within the network Database, Hierarchical Data model & IMS system, Hierarchical Database structures, HSAM, HISAM, HDAM & HIDAM organization, DML for hierarchical model, overview of the IMS.
4. Relational Database Design, Function Dependencies & normalization for Relational Data Base, Functional Dependencies, Normal form based on primary keys (1NF, 2NF, 3NF, & BCNF) Loss less join & dependency preserving decomposition.
5. Concurrency Control & Recovery Techniques, Concurrency Control Ttechniques, Locking Techinques, Time Stamp ordering, Gravularity of Data items, Recovery Techniques, Recovery concepts, Database Backup and recovery from catastrophic failures.
6. Concept of Object Oriented database Management system.

REFERENCES:

1. Elmsari and Navathe, “Fundamental of Database System”, Addition Wesly
2. Ulman, j.d.”Principles of Database System” Galgotia publications.
3. Bipin Desai, “An Introduction to Database Concepts” Galgotia Publications.
4. Datte, c.j.”An introduction to Database Systems” Narosa Publishing House.

MCA 302

PROGRAMMING USING C++ & OBJECT

ORIENTED MODULES

Beginning with C++, Tokens expression and control structures, functions in C++, classes and objects, constructors & destructors, Operator overloading and Type conversion, Inheritance (extending classes) pointer Virtual functions and polymerism, Managing console, I/O operation Working with files, Object oriented system Development.

Overview of ORACLE (THEORY)& SQL.

Books prescribed:

BALAGURUSWAMY,”object oriented programming with C++” Tata McGraw Hill publication.

Books for reference:

Programming with C++ Ravichandran.

Convert C to C++ Holmes visual C++ Dummies.

Oracle with SQL+, E.Virus Convert

MCA 303

COMPUTER BASED OPTIMIZATION MODEL (CBOM I)

Prerequisite: Probability & Statistics, Mathematical foundation of computer science and computer programming and problem solving.

1. Linear programming: Mathematical model, assumptions of linear programming, principles of simple method, Duality, Dual simplex method and sensitivity analysis.
2. Special L.P Problems: Transportation algorithms, least cost rule N-W corner rule, Assignment problem.
3. Dynamic Programming: Deterministic and probabilistic dynamic programming.
4. Scheduling Problem: Network concept, Job scheduling, CPM (Critical Path Method) & PERT (Programming Evaluation and Review Technology).
5. Introduction to Genetic Algorithm & Application for Optimization.
6. Fuzzy optimization concept, Multi Criteria Decision Making.
7. Decision Making in Competitive situation, Game Theory.

Text Books:

1. S.S.Rao: Optimization Theory & Application. ( Art 12.7,12.10 )
2. KantiI Swaroop, P.K.Gupta and man Mohan: Operation Rasearch, Sultan Chand & Sons, New Delhi.

Chapter: 2,3,4,6,7,9,12,21

Reference Books:

1. F.S.Filler and G.J.Liebermarmar: Operation Research, Holden Day inc. U.S.A

2. H.A.Taha: Operation Research, Mac Millan Publishing Company.

3. A.Ravindram, D.T. Phillips and J.D.Solberg: Operation Research Principles and Practice, John Willy & Sons.

N.B Emphasis will be given on the solving of methods not on Mathematical Theorems)

MCA 304 (DATA COMMUNICATION AND NETWORKING)

1. Introduction to data communication and networking:

Networking goals, application of computer networks, Basic concept of WAN, MAN and LAN, Computer network viz, distributed system, Network structure and network topologies.

2. Fundamental concepts of Data transmission and communication:

Terminologies, Analog and digital data transmission guided transmission media, wireless transmission, and modulation and demodulation technique (amplitude, frequency and pulse code), Synchronous and asynchronous data transmission, Error detection and control, HDLC, X.21 digital interface, QS-232C.

3. Importance of multiplexing in data communication and networks, Frequency

division multiplexing, Time division multiplexing (synchronous and statistical).

4. Introduction to the switching networks, circuits witching, packet switching, data

Gain approach, virtual circuit approach congestion control, X.25, frame relay, comparison of various switching networks.

5. Basic idea of ATM networks, LAN architecture and LAN systems.
6. Basic idea on network protocols and architecture, TCP/IP, OSI reference model, design issue of the various layers, OSI terminologies, connection oriented and connective less service.
7. Introduction to the internet networking, principles of the internetworking, internet protocols, Routing, IPV6, Application of internet ASN-1, SNMPV2, Electronic mail, URL, URI, HTTP.
8. Security requirements, privacy with conventional encryption, message atttentication and hash functions, the future of data communications.

Prescribed Books:

1. Computer Networks: A.S.Tanenbaum (PHI publication, 2nd Edition)

Section (1.1.1,1.1.2,1.2,1.3)

Section (2.3.1,2.3.2,2.4.1,2.4.2)

Section (1.3,1.4,1.5,4.3.1,5.1.1,5.2.1,5.3.1)

2. Data and Computer Communicationss: William stalling (PHI Publication, 2nd

Edition).

Section (2.1,2.2,2.3,3.1,5.1,6.2,6.3,6.4,6.5)

Chapter 7

Section (8.1,8.2,8.3,9.1,9.3,9.4,10.1,10.3,10.4,10.5,10.6)

Section (11.1,11,2,12.1,12.2,12.3,12.4,12.5,13.5,13.6)

Section (16.1,16.2,16.4,16.5,19.1,19.2,19.3,19.4,19.5)

MCA-305(OPERATING SYSTEMS)

Introduction:

Evolution of operating systems, Types of the operating systems, Different view of the operating system, operating system concepts and structure.

Processes:

The process concept, system programmer’s view of processes. The operating system view of processes, operating system services for process management scheduling algorithms. Performance evaluation.

Interprocess Communication and synchronization:

The need for the intercrosses synchronization, mutual exclusion, semaphore, hardware support for mutual exclusion, queuing implementation of semaphores, classical problems in concurrent programming, critical region and conditional critical region, monitors, messages, deadlocks.

1.2Memory Management

Memory Management without swapping or paging, swapping, virtual memory, page replacement algorithms, modeling-paging algorithms, design issues for paging systems, segmentation.

File Systems:

File system, directories; file system implementation, security protection mechanisms.

Input/Output:

Principles of input/output Hardware, I/O device, device controllers, direct memory access, principles of I/O software Goals, interrupt handler, device drivers, device independent I/O software, user space I/O software, Disks, Disks hardware, scheduling algorithms, Error handling, track at a time caching, RAM Disks, clocks clock hardware, clock software, terminals, Terminal hardware, Memory Mapped terminal, I/O software, processes and processors in distributed systems. Threads, system models, processor allocation, scheduling. Distributed File system, Design, implementation, trends.

Performance Measurement, Monitoring and evaluation:

Introduction, important trends affecting performance issues, why performance monitoring and evaluation are needed, performance measures, evaluation techniques, bottlenecks and saturation, feedback loops.

Case studies: MS DOS, MS WINDOWS, LINUX(UNIX)operating system.

References:

Milan Milenkovic,”Operation systems-Concepts and design”. McGraw Hill

International Edition-Computer Science series 1992.

Harvey M.Deitel,”An Introduction to the Operation systems.” Addison Wesely Publishing Company 1984.

James L.Peterson, Abraham Silberschaatz.”Operation system concepts”. Addison Wesley publishing Company 1989

Andrew S.Tanenbaum,”Modern Operating Systems”. Prentice Hall of India pvt.ltd. 1995

MCA 306 COMPUTER LAB.

(A) C++ (B) ORACLE.

4^th semester MCA

MCA 401.

ANALYSIS AND DESIGN OF ALGORITHMS

Module I (10 hrs)

Algorithms and Complexity – asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques – divide & conquer, dynamic programming, greedy method, backtracking.

Module II (10 hrs)

Randomization. Data Structures- heaps, search trees, Dynamic Programming.: Multistage graphs, Traveling Salesman Problem. Applications sorting & searching, combinatorial problems.

Module III (10 hrs)

Optimization problems, All pairs shortest path problems, string matching, Graph Algorithm-BFS and DFS.

Module IV (10 hrs)

Minimum cost Spanning trees, single source shortest paths. NP-completeness, Approximation algorithms.

Text Books:

1. Horowitz E. & Sahni S., Fundamentals of Computer Algorithms, Galgotia Publications. Chap. 1,2 (upto 2.4), 3(upto 3.4), 4 (4.1,4.4,4.5,4.8), 5 (5.1,5.2,5.3,5.4,5.6), 6(6.1,6.2), 7(7.1,7.2,7.3), 11.1.1, 11.1.2, 12.1
2. Aho, Hopcroft & Ullman, The design and Analysis of Algoritm, Addison- Wesley.
3. Coreman, Rivest, The design and Analysis of Algoritm – PH 1.

MCA-402( MANAGEMENT INFORMATION SYSTEMS (MIS))

Module I (8 hrs)

Fundamentals of Information Systems, Systems approach to problem solving, Developing is solutions.

Module II (7 hrs)

Corporate databases & database management, Data Organisatiion, Data models, Data security & information quality.

Module III (8 hrs)

Transaction Processing Systems, Executive information systems, Decision support systems, Expert Systems, Information Systems in marketing, manufacturing, HRM, Accounting and Finance.

Module IV (7 hrs)

Information Resource Management, planning implementating & controlling information Systems, Computer crime, Ethics & Society.

Books:

1. Brein James O. – Management Information Systems.
2. Murdick & Ross – Information Systems for Modern Management.
3. Parker C.S. – Management Information Systems- Strategy and Action.
4. Aktas A. Ziya – Structured Analysis and Design of Information Systems.

MCA 403. COMPUTER GRAPHICS

Prerequisite: Data and File Structure.

1. INTRODUCTION: - The origin of computer graphics, how the In Interactive

Graphic Display device works, new display devices, general purpose graphics software,

the user interface, the display of solid objects.

2. POINT-PLOTTING TECHNIQUES: - Coordinate Systedms, Incremental methods,

Line-drawing algorithms, circle generators.

3. LINE – DRAWING DISPLAY: - Display devices and controllers, display devices, the CRT,

4. TWO DIMENSIONAL TRANSFORMATIONS: - Transformation principles, concatenation, matrix representations, use of homogeneous coordinate system.

5. CLIPPING AND WINDDOWING: - A line clipping algorithm, mid point subdivision, clipping other graphic entities, polygon clipping viewing transformations, the windowing transformation.

6. A SIMPLE GRAPHICS PACKAGE: - Ground rules for graphic software design,

functional domains graphic primitives, windowing functions miscellaneous functions, implementation of the function.

7. SEGMENT DISPLAY FILES: - Segments functions for segmenting the display file, posting and un posting segments, segment naming schemes.

8. GEOMETRIC MODELS: - A simple modeling example, geometric modeling, symbols and instances instance transformation.

9. GRAPHICAL INPUT DEVICES: - Keyboards touch panels Hornlightpens, graphics tables, joysticks, trackball, mouse.

10. GRAPHICAL INPUT TECHNIQUES: - Introduction, positioning techniques, panting and selection, inking and painting.

11. Raster graphic fundamentals: - Introduction, generating raster image:

the frame buffer display.

12. SOLID AREA SCANS CONVERSION: - Geometric representation of areas, scan-converting polygons, the Y-X algorithm properties of scan conversion algorithms.

13. Curves and surfaces: - Shape description, requirements, Bezier methods, B-Spine methods.

14. Three dimensional transformation and perspective: - Transformation, transformation in viewing, the prospective transformation, Three dimensional graphic packages, rotating about an arbitrary axis as an example of transformation.

15. HIDDEN-SURFACE AND HIDDEN-LINE REMVOAL: - Classification of algorithms, depth-buffer method, scan line method, depth-soling method, area subdivision method.

16. SHADING: - A shading model, applying the shading models, special effects.

TEXT BOOKS: 1. Newman, W.M.and Sproull, F.F.: Principals of Interactive Computer Graphics. 2. Hearn, D. and Baker, M.F. : Computer Graphics.

MCA 404. PRORAMMING IN JAVA

Fundamentals of object Oriented Programming, JAVA Evolution, Overview of JAVA language, constants, variables and Data types, Operations and Expressions, Decision making and Branching, Decision making and looping, classes, Objects and Methods, Arrays, Strings and Vectors, Interfaces, Multiple inheritance, Packages : Putting classes together, Multithreaded Programming : Managing Errors and Exceptions, Applet Programming, Graphics Programming.

PRESCRIBED BOOKS:

1. Programming with JAVA by E. Balaguruswamy, Chapter: 1-15

REFERENCES:

JAVA-A Complete Reference by Patric Naughton.

MCA 405.

INTERNET TECHNOLOGY

Module 1 (10 hrs)

Internet Architecture:

Internet Overview, evolution of Internet.

Internet Components – Local Area Networks, Access Networks, Core Networks, Routers, Transmission Infrastructure, ISPs.

Packet switching fundamentals – Packet Switching versus Circuit Switching, Connectionless packet switching (IP).

Internet Standards: Standards bodies and the standards process, IETF, ITU, IEEE, ATM Forum.

Module 2 (10 hrs)

Networking Protocols:

Network Protocol Overview : What are networking protocols, and what do they do ? Key protocol architectures.

IP Network Overview: What are the key IP network capabilities? How will these capabilities adapt to future networks? IP protocol operation.

IP addressing: IP address classes. Why are IP addresses under pressure, and what fixes are in place?

TCP Fundamentals: How does TCP shield end users from IP network problems? TCP protocol operation and capabilities. TCP/IP: routing.

Module 3 (10 hrs)

Access Methods and Internet working:

Access Network Architectures: Access network characteristics. Differences between Access Networks, Local Area Networks and Wide Area Networks.

Access Technologies: Why there is an upper limit on modern speeds. Voice grade modems, ADSL, Cable Modems, Frame Relay.

DNS: Domain Names. Resolving Domain Names to IP addresses (DNS Operation). Registering Domain Names and solving Domain Name disputes.

Routing: How the key IP routing protocols (OSPF and BGP4) operate. Implications of future Internet growth on routing protocol performance.

Module 4 (10 hrs)

Internet Applications:

FTP, Telnet, Email, Chat.

World Wide Web: HTTP protocol. Search Engines.

E-Commerce and Security issues in cluding symmetric and asymmetric key, encryption and digital signature, authentication.

Emerging trends, Internet telephony, virtual reality over the web, etc.

Intranet and extranet, firewall.

Text Book:

1. Data & Computer Communications, By William Stallings.
2. Computer Networks, A System approach By Larry L. Peterson, Bruce S. Davie.
3. Internetworking with TCP/IP, Principals, Protocols and Architecture, By Douglas E. Corner.

5^th semester MCA

MCA 501( ENTERPRISE WEB-BASED COMPUTING WITH JAVA)

Module – I

Designing web pages: HTML, Forms, CGI Scripts and Clickable Maps.

Module – II

Designing web application: JAVA Applets, JAVA Scripts, JAVA Servlets.

Module – III

JAVA Server pages, JAVA Server faces, Struts, Perl, DHTML, HML.

Web based application architecture : JSP model 1, MVC Architecture, Struts.

Module – IV

J2EE 1.3 including RMI, EJB,JDBC, SERVLETS, JNDI, JTA, JAAS, JMS, JAVA Mail etc.

Text Book:

1. Web Technologies – I & II by lvan Byross.
2. Java Server Programming J2EE 1.3 Edition.

MCA 502(Artificial Intelligence)

Introduction: Introduction and some application of artificial Intelligence.

Problem Solving:

i) Problems and Problem spaces : Defining problem as a state – Space search, production system , different search stratergies.

ii) Basic Problem solving Methods

Game Playing:

Knowledge Representation:

i)The predicate calculus in AI. ii) Resolution in propositional Logicand predicate Logic.

iii)The unification Algorithm. iv)Question Answering. v) Natural Deduction.

vi) Non-monotonic Reasoning.

Structured Representation of Knowledge:

(i) Semantic Nets. (ii) Conceptual Dependency. (iii)Frames. (iv)Scripts

(v) The syntactic-semantic spectrum of representation.

(vi) Procedural representation

Advanced Problem Solving Systems

(i) Structure of an Expert System. (ii)Interaction with an Expert System.

National Language Understanding

Prescribed books:

Artificial Intelligence by Elaine Rich, Mc Graw Hill

Chapter – 1

Chapter - 2

Chapter – 3 clause 3.1,3.2 ,3.5,3.6.1 to 3.6.6

Chapter – 4 clauses 4.1 to 4.4

Chapter - 5

Chapter - 6

Chapter - 7

Chapter - 9 clause 9.1 ,9.2, 9,3

Reference Books :

Artificial Intelligence and Design of Expert system by F. Lunger , Stubblefield.

Books of Reference

1. Boris Bezer, “ Software testing Techniques “, Second edition Van Nostrand reinhold.1990

2. Whitten, Bently and Barlow , “ System Analysis and Design Methods “, Second Edition, Galgotia Publication,1996.

3. IEEE Guide to Software Requirements Specification, std 830-1984.In IEEE Sandards Collection, 1993 , Available from IEEE Standards Boars, 445 Hoes Lane, P.O. Box-1331.Piscataway,NJ 08855- 1331,NJ,USA.

4. IEEE Standards for Software User Demonstration Std 1063 - 1987

MCA – 503

Analysis, design & information system

1. Introduction to information systems development:- Overview of system analysis and design. Role of system analyst, categories of information systems. System development strategies (S.D.LC, Structured Analysis Development Method, System Prototype method) sources of project request, preliminary investigation, testing project feasibility.
2. Requirement analysis and determination:-Requirement determination, activities in requirement determination, fact finding techniques(interview, questionnaire, record view),tools for documenting procedures and decisions (decision table, decision tree, structured English).
3. Structured analysis and development strategy:- Structured analysis, components of structured analysis ,DFD(Logical data flow diagram and physical data flow diagram),Data dictionary, data modeling using entity relationship diagrams.
4. Feasibility study and cost estimation: -types of feasibility, cost benefit analysis.
5. System design:- analysis to design transition (identification of requirements, objectives in designing an information system, elements of design)
6. Design of output(identifying output needs, design output, presenting information)
7. Design of input and control (concerns for input design, capturing data for input, input validation).
8. Design for database interactions (Entity relationships, overview of data structuring).
9. System engineering and quality assurance:-software design objectives, software design and documentation tools (structured flowcharts, HIPO diagrams), Managing quality assurance, testing and types of testing.
10. Hardware and software selection: -hardware selection. software selection

Book Prescribed:

James a senn,”Analysis and design of information systems ”Tata Mc Grow Hill Company. Chapters (1,2,3,4,7,8,9,12,14,17)

Books of Reference:

1.j.kwhitten, L.D.bently, v.m.Brlow”System analysis and design Methods”- Galotia publication Pvt. Ltd.

MCA- 504(Simulation and modeling)

70 marks

System Models

The concept of a system, system environment, stochastic activities,

Continuous and discrete systems, system modeling, types of models,

Static physical models, dynamic physical models, static mathematical models,

Dynamic mathematical models, principals used in modeling.

System Studies

Subsystems, a corporate model, environment segment, production segment,

Management segment, the full corporate model, types of system study, system analysis,

System design, system postulation.

System simulation

The technique of simulation, the Monte Carlo method, comparison of simulation and Analysis methods, experimental nature of simulation ,types of system simulation, numerical computation technique for continuous models, numerical computation technique for discrete models, distributed lag models, cobweb models,

Progress of Simulation study.

Continuous system simulation

Continuous system models, differential equation, analog computers,

Analog methods, Hybrid computers, digital-analog simulators, continuous system,

Simulation language (CSSLs), CSHP III, Hybrid simulation, feedback systems;

Simulation of an autopilot, interactive systems, Real time simulation,

System Dynamics

Historical background, exponential growth models, exponential decay models,

Modified exponential growth models, logistics curves, generalization of growth models,

System dynamics diagrams, simple system diagrams, multi-segment model,

Representation of time delays, feedback in sosio-economic systems, a biological example, world models, the dynamo language.

Probability concept in Simulation

Stochastic variables, discrete probability functions, continuous probability functions;

Measures of probability functions, numerical evaluation of continuous probability functions;

Continuous uniformly distributed random numbers, computer generation of random numbers, uniform random number generator, generating discrete distribution, on-uniform distributing random numbers, the rejection methods.

Reference: 1. System Simulation: G.Gordan, PHI.

MCA 505

COMPILER DESIGN

Introduction to Compilers, programming languages, Finite Automata and Lexical Analysis, The syntactic Specification of programming languages, Basic Parsing Techniques construction of effection parsers Syntax directed translation, Symbol Taples, Run-time storage Administration, Error Detection and Recovery. Introduction to code optimization, Object oriented programs.

Prescribed Books:

Principles of compiler Design by Alfred V.Aho & Jeffrey D.Ullman,

Addition Wesley, 1977

Chapter 1(articles 1.1 to 1.12)

Chapter 2(articles 2.1 to 2.12)

Chapter 3(articles 3.1 to 3.8)

Chapter 4(articles 4.1 to 4.3)

Chapter 5(articles 5.1 to 5.4)

Chapter 6(articles 6.1 to 6.3)

Chapter 7(articles 7.1 to 7.5 and 7.8)

Chapter 9(articles 9.1 to 9.3)

Chapter 10(articles 10.1 to 10.2)

Chapter 11(articles 11.1 to 11.4)

Chapter 12(articles 12.1 to 12.2)

Chapter 15(articles 15.1 to 15.5).

Ø Academic Calendar of the college:

Admission to First Semester 2006-07 : 15 day after the Counseling of

BPUT, University.

10.07.06 to 20.07.06 : End Term Exam of 2^nd & 4^th Sem.

01.08.06 : Starting of 3^rd & 5^th sem classes.

15.11.06 to 25.11.06 : Starting of Mid Term Examination

of 1^st ,3^rd & 5^th sem.

25.12.06 to 05.01.07 : Starting of End Term Exam 5^th sem

2006-07.

15.01.07 to 25.01.07 : End Term Exam. 1^st & 3^rd sem.

05 02.07 : Starting of 2^nd & 4^th semester.

01.05.07 to 10.05.07 : Mid Term Exam. 2^nd & 4^th sem

2006-07.

Ø Academic Time Table 8.00am to 5.00 pm Every day

Ø Teaching Load of each Faculty: Taking classes along with their normal duties in respective branches

Ø Internal Continuous Evaluation System and place Mid term examination of 30 marks out of 100 in each papers.

Ø Students’ assessment of Faculty, System in place. Mid term examination of 30 marks out of 100 in each papers.

Note: Suppression and/or misrepresentation of information would attract appropriate penal action.

Sd/

Principal

G.M.College