Mandatory Disclosure by Institutions Running AICTE Approved Engineering/Technology/MCA/PG Programmes To

Mandatory Disclosure by Institutions running AICTE approved Engineering/Technology/MCA/PG programmes to be included in their respective Information Brochure, displayed on their website

and to be submitted to AICTE every year latest by 30th 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

� Address including telephone, Fax, e-mail. Name Hitkarini College of Engg. & Technology,Jabalpur.

Address Permanent Location as approved by AICTE Temporary Location (if applicable)

Hitkarini Hills, Dumna Road --

Village Tembhar, P.O.Khamaria,

Taluk --

District JABALPUR

Pin Code 482005

State M.P.

STD Code 0761 Phone No: 2600222,2600224,2606066,2600300

Fax No. 2600223 E-Mail: [email protected]

[email protected]

Web site www.hitkarini.com

Nearest Rly Station JABALPUR 09 Km.

Nearest Airport JABALPUR 06 Km.

II. NAME & ADDRESS OF THE PRINCIPAL

� Address including telephone, Fax, e-mail.

Name Dr. S.C. AGRAWAL

Highest

Degree

Specialization Total

Experience

Designation Principal Qualification &

Experience

Ph.D. 40 yrs.

STD Code 0761 Phone No. (O) 2600222 Fax No. 2600223

STD Code 0761 Phone No. (R) 2401323 Fax No.

E-Mail [email protected] Mobile No. 09425801974

1Signature of Authorized Signatory with date

III. Name and Address of the Society / Trust Name Hitkarini Sabha

Address Secretary – Hitkarini Sabha

Swatantra Press Complex, Civic Centre, Jabalpur

Pin Code 482002 STD Code 0761

Phone No. 2310270 Fax No. 2414721

E-Mail ------------------------------------------------------- Web site --------------------------------------------------

IV. Brief details regarding background of the Trust /Society Hitkarini Sabha , Jabalpur has ushered into the history books in the year 1868. Since then, the history of Hitkarini Sabha is synonymous with India’s Freedom Movement. It is a leading nationalist educational conglomerate of Central India in Jabalpur and has promoted the moral, social and intellectual interests and well being of the people by extending literary and technical knowledge. Hitkarini Sabha is imparting value based education in the field of law, humanities, education, science, commerce, computer, engineering and nursing.

The Constitution of the Governing Body is done on the guidelines as laid down by the AICTE/RGPV Bhopal for the Private technical institutions. At present, it consists of Chairman, Vice-Chairman (Donors Nominee member), 2 Teachers’ representative members, 2 RGPV Nominee members, 1 AICTE Nominee member and 2 Nos. Foundation society members, 1 Member-Secretary (Convenor & Principal of the college). V. NAME OF THE AFFILIATING UNIVERSITY Name Rajiv Gandhi Prodyogiki Vishwavidyalaya (RGPV) Bhopal (M.P.)

Address Airport By-pass Road (Narsinghgarh By-pass)

Gandhi Nagar, Bhopal (M.P.) 462 036

Pin Code 462036 Period of Affiliation 6 yrs. since July, 2000

STD Code 0755

Phone No. 2678801

Fax No. 2742002

E-Mail/ Web site www.rgtu.net

VI. GOVERNANCE

� Members of the Board and their brief background (1) Shri Chandra Mohan (Chairman) - Industrialist (2) Shri Rajesh Agrawal (Vice Chairman)- Industrialist (3) Shri Mahendra Bhandari (Member) - Industrialist (4) Shri R.K. Shrivastava (Member) - Civil Engineering & Builder (5) Dr. S.C. Agrawal (Member Sectary) - Principal (6) Prof. T.K.Bandhopadyay (Member) - University Nominee (7) Prof. S.D. Patki (Member) - AICTE Nominee (8) State Govt. Nominee - (Awaited) � Members of Academic Advisory Body (1) Dr. S.C. Agrawal (Principal) (2) Prof. S. Bhatt (Vice-Principal) (3) Prof. Devashish Mukerji (Registrar) (4) All HOD’s � Frequency of the Board Meetings and Academic Adviso ry Body - Board meetings are held every

quarter i.e. four meetings in a year as per requirment of RGPV. � Nature and Extent of involvement of faculty and stu dents in academic affairs/improvements There is a continuous involvement of faculty and students for improvements into the academic affairs. The college has prescribed format for assessing the performance of teachers by the


students. Based on this, the best teachers are selected and they are encouraged by award of prizes by the Institution every year. � Nature and Extent of involvement of faculty and stu dents in academic affairs/improvements In the academic affairs/improvements of the college, a Teacher-Guardian for every 15 students have been appointed who take care of their difficulties and their academic problems. The faculty members remain continuously in touch with their students and in case of any suggestions for improvement from the students, they are being implemented by the faculty members. The college assesses the performance of the faculty members by taking the feedback from the students in the prescribed form every year. � Mechanism/Norms & Procedure for democratic/good Gov ernance For the sake of good governance, the college has prescribed Self-Appraisal forms for teachers and the management continuously monitors the performance of teachers and wherever necessary, gives guidance to them and solve their problems. The college has also various committees like discipline committee, Question Paper & Result analysis committees, purchase committee, anti-ragging committee, sports and cultural committees etc. with HODs being their Co-ordinators. � Student Feedback on Institutional Governance/facult y performance:- There has been a format

prescribed by the college which are filled in by the students of 8th semester every year and they provide feedback to the Institution based on which the best teachers are chosen and they are honoured by cash Awards & certificates by the Management

� Grievance redressal mechanism for faculty, staff an d students For this purpose, the college has Suggestion Boxes in the college through which students can approach the committee members for redressal of their grievances and can also make suggestions for improvements. These suggestions, if found suitable, are scrupulously implemented. Likewise, the college faculty and staff are making use of this mechanism for redressal of their grievances. Organizational chart and processes

ORGANIZATION CHART (DETAILED)

CHAIRMAN (GOVERNING BODY) (Appointed by Foundation Society)

Two Member Two Members Member Member from Member Member Sectary From From University From Donor State Govt. Nominee Two Teachers Principal Foundation RGPV,Bhopal College Repesentative Society

Registrar T&P CELL Vice Principal

Secretarial Staff Accounts HOD

Dept.Faculty Staff


VII. PROGRAMMES

� Name of the Programmes approved by the AICTE � Name of the Programmes accredited by the AICTE � For each Programme the following details are to be given:

• Name • Number of seats • Duration

AICTE Approved Intake during last 4 years

Courses 1st Year of approval by AICTE (give

approval ref. no. & date)

2006-2007 2005-2006 2004-2005 2003-2004 Status of Accreditat

ion (Validity period)

Sanctioned intake

Actual admissions Sanctioned intake

Actual admissions

Sanctioned intake

Actual admissions

Sanctioned intake

Actual admissions

PG(FT) Master OF Computer Apllication

2000 Ref.No.MP-

26/ET-MCA/2000

dated 20.07.2000

60 60 40 40 40 39 40 40 Not Yet

FT: Full Time, PT: Part Time VIII. Whether any excess admissions over and above the sanctioned strength are made ? If yes, give

details.

S. No. Courses Sanctioned Intake 2007-2008

Actual Admissions No. of Excess Admissions

Reasons

(1) Master Of Computer Application

60 COUNSELLING IS

ON TILL DATE

Total Intake 60

IX. FEE

� Details of fee, as approved by State fee Committee, for the Institution. � Time schedule for payment of fee for the entire pro gramme. � No. of Fee waivers granted with amount and name of students . NIL � Number of scholarship offered by the institute, dur ation and amount The college granted scholarships @ 5% of the total fee collected during the previous year. In 2004-05, the Management has sanctioned an amount of Rs. 1.8 lakhs towards scholarships. In addition to this, the government scholarships to the SC/ST/OBC students are also offered. � Criteria for fee waivers/scholarship. The criteria prescribed for scholarships is – 1. students who have passed all their examinations in first attempt (2) the annual income of the parents is less than Rs. 1.5 lakhs per annum.(3) others things being equal, the wards of widow/teachers are given preference

Estimated cost of Boarding and Lodging in Hostels. The boarding and lodging in Hostels is being arranged by the college for the students who are interested to stay there. For the girl students, it has a independent hostel. Hostel facility is also available in the college campus.


SCHEDULE OF COLLEGE FEE FOR THE YEAR 2007-08 MCA. COURSE

A). TUITION AND DEVELOPMENT FEE

1st Year (1st/2nd sem) 2007Batch

2nd Yr (3rd/4th sem) 2006Batch

3rdYear (5th/6th sem) 2005 Batch

3rdYear (5th/6th sem) 2004 Batch

Particulars

All Catagourie All Catagourie All

Catagourie Free

Catagourie Pay

Catagourie

Tuition Fee 26000 26000 29500 44000 Total (A) 0 26000 26000 29500 44000 B). Other Fees

Caution Money

Registration Fee 150 150 150 150

Cultural Activities 100 100 100 100

Student Med.Insu. Fee 50 50 50 50

Training & Placement 250 250 250 250

I.Card 25 25 25 25

Sports Fee 150 150 150 150 Welfare/Cultural/Adventure/Union Fee/sport(RGPV)

190 190 190 190

DevelopmentFee (RGPV) 350 350 350 350

Total (B) 0 1265 1265 1265 1265

Total ( A+B) 0 27265 27265 30765 45265

Less : Deposit with DTE At the time of Counselling (if applicable)

0 27265 27265 30765 45265

Ist Instalment 15265 15265 17765 27265

II ndInstalment 12000 12000 13000 18000

i) Alumini Association Fee Payable Rs. 100/- addition to above.

ii) 1st Year Fee is subject to revision by the Government.

ii) RGPV Enrolment Fee Payable Rs.150/- in Cash addition to above along with Enrolment Form. iii) Bus Charges Rs. 5000/- P.A. payable by users. SCHEDULE OF HOSTEL FEE

Rent

Administrative Charges And Other

Refundable Caution Money (Only for new hosteller)

Total :-

(X) Placement Facilities & Campus placement in last thr ee years (i) Total no. of students placed by the Institution through its Placement Cell (Discipline wise)

Year Discipline Total no. of students placed through placement cell

(last 3 years) E&Tc 02

Computer Science & Engineering 05 2001 Mechanical Engineering 03

E&Tc 06 Computer Science & Engineering 01 2002

Mechanical Engineering 08 E&Tc 03

Computer Science & Engineering 07 2003 Mechanical Engineering 03

E&Tc 13 2004 Computer Science & Engineering 17


Mechanical Engineering 05 Master of Computer Application 03

E&Tc 12 Computer Science & Engineering 14

Mechanical Engineering 11 Information Technology 04

2005

Master of Computer Application 01 E&Tc 20

Computer Science & Engineering 15 Mechanical Engineering 05 Information Technology 13

2006

Master of Computer Application 03 (ii) Provide details of companies/Industries, which visited the institute for placement since the last three years.

S.No. Year Name of the Company/Industry Number of S tudents placed

1 TATA CONSULTANCY SERVICES 38 2 SATYAM COMPUTER SERVICES LTD. 11 3 WIPRO TECH 29 4

2006-2007 HEXAWARE TECHNOLOGIES 09

1 TATA CONSULTANCY SERVICES 40 2 SATYAM COMPUTER SERVICES LTD. 04 3 PERSISTENT SYSTEMS PVT. LTD. 03 4 ZENSAR TECHNOLOGIES 01 5 ENERCON INDIA LTD. 07 6 I – FLEX TECHNOLOGIES 00 7 KPIT CUMMINS LTD. 00 8 HEXAWARE TECHNOLOGIES 00 9

2005-2006

L&T INFOTECH 00 10 TATA CONSULTANCY SERVICES 21 11 CUMMINS RESEARCH TECHNOLOGIES LTD. 02 12 INFOSYS TECHNOLOGIES LTD. 17 13 PERSISTENT SYSTEMS PVT. LTD. 01 14 L&T INFOTECH 01 15 RPG TRANSMISSION LTD. 05 16 HCL TECHNOLOGIES LTD. 04 17 SATYAM COMPUTER SERVICES LTD. 04 18

2004-2005

ARMY (SSB) 02 19 TATA CONSULTANCY SERVICES 06 20 SIGMA SOFTWARE SOLUTION PVT. LTD. 03 21 HCL INFOSYSTEM LTD. 03 22 PERSISTENT SYSTEMS PVT. LTD. 02 23 ENERCON INDIA LTD. 03 24 LAMBENT TECHNOLOGIES PVT. LTD. 01 25 CONVERGYS LTD. 03 26 ABEARIX TECHNOLOGIES 10 27 EDGEMAKERS, INDORE 07 28 WIPRO SPECTRAMIND LTD. 03 29

2003-2004

ARMY (SSB) 01 30 HCL INFOSYSTEMS LTD. 05 31 WIPRO SPECTRAMIND LTD. 07 32

2002-2003

CONVERGYS LTD. 03 33 TOUCH TEL LTD. 04 34 SSB 03 35 ITL INFOSYS LTD. 01 36 HCL INFOSYSTEM LTD. 01 37 BEE KAY INTERNATIONAL 01 38 OMCI USA 02 39 BARBER INTERNATIONAL 01 40 BLUE STAR INDIA LTD. 01 41

2001-2002

ASIAN PAINT LTD. 01


42 MAHINDRA BRITISH TELECOM LTD. 05 43 UNICONNECT SOFTWARES 01 44 HCL INFOSYSTEMS LTD. 01 45 TERMAX INDIA LTD. 02 46

2000-2001

BARBER INTERNATIONAL 01

PLACEMENT IN THE YEAR 2007 FOR 2007 BATCH NO. OF ELIGIBLE STUDENTS : 160 FROM E&TC, IT, CS, M E & MCA

S.No. Major Recruiters No. of Placement

1. TCS, MUMBAI 38

2. WIPRO TECHNOLOGIES 29

3. SATYAM COMPUTER SERVICES 10

4. LAMBIENT TECH. PVT. LTD. 02

5. HEXAWARE TECHNOLOGIES 09

6. ZENSAR TECHNOLOGIES 03

7. SYNTEL 03

8. PERSISTENT 01

9. MAH & MAH. 01

10. INDIAN NAVY 02

11 INDIAN ARMY 13

12 DESIGN TECH 02

13 IBM DAKSH 01

Selections of Students at a Glance (2008 Batch)

(from November 2006 to Till Date)

Name of Company

Date of Campus Sel

ecte

d

TCS 7,8/03/07 90

WIPRO 3,4/3/07 05

INFOSYS 13,14/03/07 06


SATYAM 23,24/03/07 04

ZENSAR 7,8/04/07 04

SYNTEL 13,14,15/04/07 11

PERSISTENCE 6/4/07 03

PEROT SYSTEM 24,25/03/07 01

INDUSLOGIC 08/03/07 00

TECH MAH Feb 07 NP

L&T INFOTECH 14/04/2007 01

SCHNEIDER 8,9/05/07 01

YES AHEAD 15/05/07 01

TOTAL (till 08/05/07) 127

* NP-Not Participated

� 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:

NIL Details of the Foreign Institution/University: • Name of the University/Institution • Address • Website • Is the Institution/University Accredited in its Home Country • Ranking of the Institution/University in the Home Country • Whether the degree offered is equivalent to an Indian Degree? If yes, the name of the agency which

has approved equivalence. If no, implications for students in terms of pursuit of higher studies in India and abroad and job both within and outside the country.

• Nature of Collaboration • Conditions of Collaboration • Complete details of payment a student has to make to get the full benefit of collaboration.

� For each Collaborative/affiliated Programme give the following: • Programme Focus • Number of seats • Admission Procedure • Fee • Placement Facility • Placement Records for last three years with minimum salary, maximum salary and average salary

� Whether the Collaborative Programme is approved by AICTE? Not Applicable VI. FACULTY

� Branch wise list faculty members: • Permanent Faculty • Visiting Faculty • Adjunct Faculty • Guest Faculty • Permanent Faculty: Student Ratio 1:15


Qualification with field of specialization Experience

S.N

o.

Name of Teaching Faculty Designation Branch/

Subject UG PG Doctorate (a) Teaching (b) Industry © Research

1 Manish Bahrani READER MCA B.Sc. M.C.A.

Nil 8Yrs Nil Nil

2 Manish Saraf READER MCA B.Sc. M.C.A. Nil 6Yrs Nil Nil

3 Vivek Badhe Sr. Lecturer MCA B.C.A. MCA & M.Tech Nil 3Yrs Nil Nil

4 Sailja Hoonka Lecturer MCA B.Sc. M.C.A. Nil 2Yr Nil Nil

5 SUMEET SOHANE Lecturer MCA B.Sc. M.C.A. Nil 1Yr Nil Nil

6 Ms. SONAL SHARMA Lecturer MCA B.Sc. M.C.A. Nil 2 Yrs. Nil Nil

7 Mrs. GEETIKA

KHATRI Lecturer MCA B.Sc. M.C.A. Nil 1 Year Nil Nil

8 UTKARSH DIXIT Lecturer MCA B.Sc. M.C.A. Nil 3 Month Nil Nil

9 ASHISH

SHRIVASTAVA Lecturer MCA B.Sc. M.C.A. Nil 3 Month Nil Nil

10 AJAY ACHRYA Lecturer MCA M.C.A. Nil 1 Month Nil Nil

11 N. PANDEY Lecturer MCA B.Sc. M.Sc. Nil 6 Month Nil Nil


VII. PROFILE OF DIRECTOR/PRINCIPAL WITH QUALIFICATIONS , TOTAL EXPERIENCE , AGE AND DURATION OF

EMPLOYMENT AT THE INSTITUTE CONCERNED

Brief Bio-data of the Principal PRINCIPAL’S RESUME 1. Principal’s Name : Dr. S.C. AGRAWAL 2. Dt.of joining the post : 01.08.2007 Whether Regular or : Regular Part-Time? 3. Date of Birth : 12/02/1943 4. Qualifications

Name of Degree

Name of Univ.

Yr. of Passing

Division % Remark

BE(Hons) Govt Engg. College, Jabalpur

1966 I Division Hons -

ME I.I.T. Kanpur

1970 I Division - -

Ph.D A.P.S. University,

Rewa

1986 Environmental

5. Positions Held

Period Name of Post Name of Inst. From To

Job Responsibilities

Lecturer Govt Engg. College

July 1966 Dec 1983 Teaching & Academics

Reader. -do- Dec 1983 Aug 1993 Teaching, Academics & Admn.

Professor -do- Aug 1993 Oct 2000 -do- Principal -do- Oct 2003 Dec 2003 Admn. Principal GGIST ,Jabalpur. 31st July 2007 Admn

Memberships:- (1) Life Member of ISTE Publications. (a) Research Papers

S.No. Title of the Paper Name of Journal in which published

Date of Publication

Projects Guided:-

Nil ii) International Journals; Give details as follows: . b) Book(s) Nil 7.Prizes and Awards Received:- 8. State Three Major Achievement:- Nil


IX. ADMISSION

� Number of seats sanctioned with the year of approval. � Number of students admitted under various categories each year in the last three years. � Number of applications received during last two years for admission under Management Quota and

number admitted.

Admission In MCA Course

Session 2006-07

Range Of Marks As per Qualifying Exam

Branch

Total Seat Sanct

ion

Total AIMCA Quota

Total MP

Quota

Total Management Quota

Seats Alloted

Through AIMCA Quota

Seats Alloted

Through MP

Quota

Seats Alloted

Through Manageme

nt Quota

AIMCA QUOTA

MP QUOTA MANAGEMENT QUOTA

Total Admission

MCA 60 12 39 9 10 42 8 84.38-81.25 159.38-75 90.63-75.0 60

Total 60 12 39 9 10 42 8 Grand Total 60

Session 2005-06


Branch

Total Seat Sanct

ion

Total AIMCA Quota

Total MP

Quota


Seats Alloted

Through AIMCA Quota

Seats Alloted

Through MP

Quota

Seats Alloted

Through Manageme

nt Quota

AIMCA QUOTA MP QUOTA MANAGEMENT

QUOTA

Total Admission

MCA 40 8 26 6 0 34 6 NIL 164.84 - 128.57 135.16 - 72.53 40


Session 2004-05


Branch

Total Seat Sanct

ion

Total AIMCA Quota

Total MP

Quota


Seats Alloted

Through AIMCA Quota

Seats Alloted

Through MP

Quota

Seats Alloted

Through Manageme

nt Quota AIMCA QUOTA

MP QUOTA MANAGEMENT QUOTA

Total Admission

MCA 40 8 26 6 3 37 0 49.23 - 27.29 171.88 - 90.63 Nil 40


Session 2003-04


Branch

Total Seat Sanct

ion

Total Free Seat

Total Payme

nt Seat

Total Free Seat

Alloted

Total Payment

Seat Alloted

Free Seat

Payment Seat

Total Admission

MCA 40 20 20 20 17 181.82 - 154.55 154.55 - 69.7 37

Total 40 20 20 20 17

Grand Total 37

X. ADMISSION PROCEDURE

� Mention the admission test being followed, name and address of the Test Agency and its URL (website). Hitkarini College of Engineering & Technology offers three years course leading to Master’s Degree (MCA) from RGPV Bhopal. Admission against AI Quota seats is on the basis of Pre-MCA Test conducted by Vyapam, Bhopal Candidates shall have to apply separately to Vyapam for admission against AI quota seats within stipulated date. Candidates need not be domicile of MP for seeking admission against AI quota seats. Admission against the management quota is on the basis of Pre-MCA 2007 test. Candidates desirous of taking admission in management quota may appear in Pre-MCA test for which there shall not be any requirement of domicile of MP. Admission against MP quota seats is done through the counselling held by DTE,MP,Bhopal on the basis of merit list declared by Vyapam. 15% seats of intake capacity are reserved for NRI quota seats.

Name of the Test : Pre-MCA Address of the test agency : PROFESSONAL EXAMINATIO N BOARD (VYPAM) BHOPAL


� Number of seats allotted to different Test Qualified candidates separately [AIMCA/Pre-MCA (State conducted test/University tests)/Association conducted test]

AIMCA : 20% (All India) Pre-MCA : 65% (State Quota)

N.R.I. : 15%

� Calendar for admission against N.R.I. seats: (For T he Session 2007-2008) - Last date for request for applications. – 12/07/200 7 - Last date for submission of application. – 12/07/20 07 - Dates for announcing final results.- on 12/07/2007 - Release of admission list (main list and waiting list should be announced on the same day) - Date for acceptance by the candidate – On 12/07/200 7 - Last date for closing of admission.- 12/07/2007 - Starting of the Academic session.- As Per Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal.

Academic Schedule

XI. CRITERIA AND WEIGHTAGES FOR ADMISSION � Describe each criteria with its respective weightag es i.e. Admission Test, marks in qualifying

examination etc. ALL INDIA SEATS THROUGH AIMCA :-20%(THROUGH CENTRELISE COUNCELING) STATE QUOTA SEATS THROUGH Pre-MCA :- 65% (THROUGH CENTRELISE COUNCELING) NRI SEAT (as per Pre-MCA-2005 Guidelines) :- 15% (allotted by college)

� Mention the minimum level of acceptance, if any. If any seats remain vacant they may be filled in on merit basis depending on the Pre-MCA/AIMCA followed by B.Sc. (with Mathematics Subject)/BCA marks through subsequent counseling conducted by RGPV. AS PER MERIT

� Mention the cut-off levels of percentage & percentile scores of the candidates in the admission test for the last three years. 65% TO 0%

Item No I - XI must be given in information brochur e and must be hosted as fixed content in the websit e of the Institution. The Website must be dynamically updated with regard to XII–XV. XII. APPLICATION FORM

� Downloadable application form, with online submission possibilities. YES (available in www.hitkarini.com)

XIII. LIST OF APPLICANTS � List of candidates whose applications have been received along with percentile/percentage score for each

of the qualifying examination in separate categories for open seats. List of candidates who have applied along with percentage and percentile score for Management quota seats.

S.No. Name of the Candidate Pre-MCA 2006 Roll No. P re-MCA 2006 Marks

NO MANAGEMENT QUOTA FOR THE

SESSION 2007-2008

XIV. RESULTS OF ADMISSION UNDER MANAGEMENT SEATS � Composition of selection team for admission under Management / NRI Quota with the brief profiles of

members (This information be made available in the public domain after the admission process is over) • Dr. S.C. AGRAWAL Principal (Chairman) • Prof. S. Bhatt Vice-Principal (Member) • Devashish Mukerji Registrar (Member) • Manish Behrani HOD, MCA (Member)

� Score of the individual candidates admitted arranged in order of merit. & List of candidates who have been

offered admission.

S.No. Name of the Candidate Pre-MCA 2006 Roll No.

Pre-MCA 2006 Marks

Original Category/Class

Alloted Category/Class

NO MANAGEMENT QUOTA FOR THE SESSION 2007-2008


� Waiting list of the candidates in order of merit to be operative from the last date of joining of the first

list candidates. � List of the candidates who joined within the date, vacancy position in each category before operation of

waiting list. NIL XV. INFORMATION ON INFRASTRUCTURE AND OTHER RESOURCES AV AILABLE LIBRARY:

� Number of Library books/Titles/Journals available (programme-wise) � List of online National/International Journals subscribed. � E-Library facilities

17.

Library facilities

A

B

C

D

E

F

G H

Total area of the library 136.35 Sq M. Seating capacity of the library 100 Nos. Reprographic facility (yes / No) Yes. Working hours of library 09.00 AM to 6.00 PM. Library Networking facility (yes / No) Yes. ISDN co nnection of 128 kbps is available with networking f acility. Usage data of the library (in terms of books issued to the faculty & students etc.) Annual library budget (% of annual student fee col lected) 5 to 7% of the total revenue. Details of the library facilities

Books Available S.No. SUBJECTS NO.OF.

BOOKS COST TITLE

(1) COMPUTERS. 1571 6,33,880 125 (2) MATHEMATICS 340 18,000 15 (3) MANAGEMENT & ECONOMICS 531 37,173 20

TOTAL 2434 6,89,053 160

LIST OF FOREIGN. JOURNALS(HCET-LIBRARY)

ELECTRONICS & TC

S.No. Title Annual vol. Net Price (Rs.)

1 Electronic design 28 9148

2 Electromagnetic 8 42445

3 Electronic circuit 12 20394

4 Opt electronics ,IEE proceeding 6 50169

5 Wireless Communication & Mobile compu 8 24012

6 Control system Magazine 6 13767

7 Microelectronics 12 75148

8 IEEE : CIRCUIT : SYSTEM PART I :REGU.PAPER 12 25978

9 IEEE : ANTENNA : PROPAGATION 12 30016


10 IEEE : COMMUNICATION ,TRANS ON 12 29973

11 IEEE : CIRCUIT : SYSTEM PART II : EXP.BRIEF 12 24811

Total 345861

MECHANICAL ENGG

S.No. Title Annual vol. Net Price (Rs.)

1 Jr of Turbo machinery 4 14006

2 Jr of Fluid engg 6 18605

3 Jr of Energy resources tech 4 11707

4 Jr of Heat transfer 12 22996

5 Mechanism & Machine theory 12 123630

6 International JR of Refrigeration 8 54428

7 ASHRAE Journal 12 12669

8 JR OF SOLAR ENERGY ENGG 4 11448

9 JR OF MECHANICAL DESIGN 6 18525

10 MICROELECTROMECHANICAL SYSTEM 6 17692

11 MECHANICAL ENGG 12 5287

12 TRANSACTION ON MECHATRONICS 6 24353

13 APPLIED MECHANICS REVIEW ( JOURNAL ) 1 25810

Total 361156

COMPUTER SCIENCE S.No. Title Annual vol. Net Price

(Rs.) 1 JR of Computing 4 13813

2 Computer Networks 18 83152

3 Computer & digital tech. 6 50169

4 Database System Trans On 4 8827

5 Software engg & methodology trans on 6 7958

6 Network Security 12 42948

7 IEEE : SYSTEM ,MAN&CYBERNATICS 6 18858

8 JR OF COMPUTING & INFOR.SCIE. IN ENGG 4 12072

9 IEEE : FUZZY SYSTEM TRANS ON 6 29224

10 IEEE : COMPUTER MAGAZINE 12 49082

Total 316103

M.C.A.


M.C.A. S.No. Title Annual vol. Net Price

(Rs.)

1 Computer Graphics & Application Magazine 6 33365

TOTAL COST

S.No

Title JR Cost

1 Computer Science 10 316103

2 Electronics 11 345861

3 Mechanical Engg 13 361156

4 MCA 1 33365

35 1056485

(-) 9.5%DISCOUNT 100366

Total

Net Amount 956119

List of the Indian Journals We are receiving following journals. 1.TERI 18 Journals

2.Institution of engineering India 14 Journals TERI - Journals

1. Teri news wire 2. TIS Glow 3. Sesi Journal ( Journal of the solar energy of India) 4. PAJE Pacific & Asian Journal of Energy 5. TERI Asset Abstract of Selected solar Energy 6. TERI Information as Environmental science 7. TIDE Teri information Digest on Energy . 8. How Global is Global; How warm I s warming 9. TERI Scope C 10.Co Miligation & the Indian transport sector 11.Changing coast Line 12. 5th teri foundation Day Lecture 13.Annual report (TERI) 14.Solar Energy Society of India 15.TERI energy Date Directory & Year Book 16.TERI Journal of environment studies & Policy 17.Best Indian Web Sites Chip 18.Global Environmental Review

Journals of Institution of Engineers (India ) ,Kolkata

1.civil Engg 2.Computer Engg 3.Electrical Engg 4.Electronics & Telecommunication 5.Mechanical Engg 6.Environmental Engg 7.Met& Material Engg 8.Production Engg 9.Intediscriplary 10.Chemical Engg. 11.Technical


12.IEI News (supply) 13.Technoroma (supply) 14.Architectural Engg.

Journal & Magazines on Technical Subjects

1. Udhyamita (Monthly) Got Life Membership. 2500/-

2. Enterprinuar Ship (monthly) Got Life Membership. 2000/-

3.Industrial Automation (Monthly) 600/-

4. Engg Advances (Monthly) 720/-

5. Journal of research

6. Science tech Entrepreneur 180/-

7.ISTE :-Indian Society for technical education

8.ICJ Indian Concrete Journal 600/-

9. Jr. of Computer Science

XVI LABORATORY:

For each Laboratory � List of Major Equipment/Facilities

1. Computer System P-III 650MHz 2 Nos. 2. Computer System P-III 750MHz 9 Nos. 3. Computer System P-IV 2.8 GHz 09 Nos. 4. Computer System P-IV 3.0 GHz 40 Nos. 5. Laser Printer HP1000, HP 1015 02 Nos. 6. Scanner HP2200c, hp2400c 02 Nos. 7. CD Writer 24X LG 01 Nos. 8. UPS Elnova 01 Nos. 9. Internal Modem 56KBPS 01 Nos. 10. CVT 3KVA 02 Nos. 11.16-Port Switch 02 Nos. 12. 8-Port Switch 02 Nos. 13. UPS Uniline (1 KVA) 14 Nos


List of Licensed Software in MCA

S.No List of Software (Application Softwares ) 1 . Turbo C ++ 2 . Oracle 8i 3 . Windows 2000 Server (For 15 Users) 4 . Visual Studio 6.0 5 . Turbo Assembler 6 . Microsoft BackOffice Server 4.5

S.No List of Software ( System Softwares )

1 . SCO Unix Open Server AE. 2 . Windows 98SE. 3 . Windows ME. 4 . Windows XP

� List of Experimental Setup Sem-I

Programming & Problem Solving 1. WAP to find the N terms of the fibonacci series. 2. WAP to convert the decimal number into binary. 3. WAP to find the factorial of any number. 4. WAP to find the sum of the series - S = 1*1-2*2+3*3-4*4+-----------N*N. 5. WAP to check whether the given number is prime or not.

6. WAP to print first N prime numbers. 7. WAP to find the maximum element in an array. 8. WAP to find the roots of the quadratic equation. 9. WAP to search an element in an array using linear search. 10. WAP to search an element in an array using binary search.

11. WAP to arrange the elements of an array in ascending order using selection sort.

12. WAP to arrange the elements of an array in ascending order using bubble sort.

13. WAP to arrange the elements of an array in ascending order using insertion sort. 14. WAP to read a file and print mark-sheet 15. WAP to find the sum of two matrices. 16. WAP to find the multiplication of two matrices. 17. WAP to find the transpose of a matrix. 18. WAP to create a student file.

Sem I Assembly Language Programming

List of Experiments

1. Assembly program to add two numbers.

2. Assembly program to print alphabets A to Z or a-z based on user requirement.

3. Assembly program to convert a number to its binary equivalent.

4. Assembly program to divide a number by another using loop also find out the remainder.

5. Assembly program to factorial of a number.

6. Assembly program to check that a string is palindrome or not.


7. Assembly program to sum of first N natural numbers without using formulae.

8. Assembly program to find reverse of a string without using stack.

9. Assembly program to input two numbers & swap them.

10. Assembly program to select prime numbers from a given list.

11. Assembly program to search a character in a string & also find out it counts in that string.

12. Assembly program to print reverse of a number.

DATA STRUCTURE (MCA-II Sem) 1. Write a program for bubble sort 2. Write a program for Quick sort 3. Write a program for Binary Search 4. Write a program to reverse a string 5. Write a program for Insertion Sort 6. Write a program to create stack using arrays. 7. Write a program to create stack using linked list. 8. Write a program to create queue using array. 9. Write a program to create queue using linked list. 10. Write a program to create a binary tree. 11. Write a program Selection Sort 12. Write a program to create doubly linked list. 13. Write a program to create circular linked list. 14. Write a program to calculate factorial of a number using recursion.

MCA-206 (SQL)

GAIN PRACTICE ON SQL USING THE TABLES AND QUESTION S GIVEN BELOW. Salespeople

SNUM SNAME CITY COMM

1001 Peel London .12

1002 Serres San Jose .13

1004 Motika London .11

1007 Rifkin Barcelona .15

1003 AxelRod New York .10

1005 Fran London .26

Customers

CNUM CNAME CITY RATING SNUM

2001 Hoffman London 100 1001

2002 Giovanni Rome 200 1003

2003 Liu San Jose 200 1002

2004 Grass Berlin 300 1002

2006 Clemens London 100 1001

2008 Cisneros San Jose 300 1007

2007 Pereira Rome 100 1004

Orders

ONUM AMT ODATE CNUM SNUM


3001 18.69 10/03/96 2008 1007

3003 767.19 10/03/96 2001 1001

3002 1900.10 10/03/96 2007 1004

3005 5160.45 10/03/96 2003 1002

3006 1098.16 10/03/96 2008 1007

3009 1713.23 10/04/96 2002 1003

3007 75.75 10/04/96 2002 1003

3008 4723 .00 10/05/96 2006 1001

3010 1309.95 10/06/96 2004 1002

3011 9891.88 10/06/96 2006 1001

Queries 1. *List all the columns of the Salespeople table.

2. *List all customers with a rating of 100.

3. *Find all records in the Customer table with NULL values in the city column.

4. *Find the largest order taken by each salesperson on each date.

5. *Arrange the Orders table by descending customer number.

6. *Find which salespeople currently have orders in the Orders table.

7. *List names of all customers matched with the salespeople serving them.

8. *Find the names and numbers of all salespeople who had more than one customer.

9. *?Count the orders of each of the salespeople and output the results in descending order.

10. *List the Customer table if and only if one or more of the customers in the Customer table are located in San Jose.

11. *Match salespeople to customers according to what city they lived in.

12. *Find the largest order taken by each salesperson.

13. *Find customers in San Jose who have a rating above 200.

14. *List the names and commissions of all salespeople in London.

15. *List all the orders of salesperson Motika from the Orders table.

16. Find all customers with orders on October 3.

17. Give the sums of the amounts from the Orders table, grouped by date, eliminating all those dates where the SUM was not at least 2000.00 above the MAX amount.

18. Select all orders that had amounts that were greater than at least one of the orders from October 6.

19. *Write a query that uses the EXISTS operator to extract all salespeople who have customers with a rating of 300.

20. Find all pairs of customers having the same rating.

21. Find all customers whose CNUM is 1000 above the SNUM of Serres.

22. *Give the salespeople’s commissions as percentages instead of decimal numbers.

23. Find the largest order taken by each salesperson on each date, eliminating those MAX orders which are less than $3000.00 in value.

24. List the largest orders for October 3, for each salesperson.

25. Find all customers located in cities where Serres (SNUM 1002) has customers.


26. Select all customers with a rating above 200.00.

27. Count the number of salespeople currently listing orders in the Orders table.

28. Write a query that produces all customers serviced by salespeople with a commission above 12%. Output the customer’s name and the salesperson’s rate of commission.

29. Find salespeople who have multiple customers.

30. Find salespeople with customers located in their city.

SEM-III LIST OF PROGRAMS IN OOPS

1. Program to swap two no.

2. Program to find string length.

3. Program to perform simple complex number arithmetic.

4. Program t prints the information of a student using nested class.

5. Program to print the fibonacci series using class & constructor concept

6. Program to print the result using friend function

7. Program where two derived classes access the same base class using inheritance concept.

8. Program of bank having two types of accounts saving and fixed

9. Program to print the name of students getting the financial aid using multiple inheritance concepts.

10. Program to print the fibbonocci series using copy constructor.

11. Program to print the roots of a quadratic equation using class.

12. Program to print the information of a student using the concept of overloading operator.

13. Program to find the volume of different objects using the concept of function overloading.

14. Program to find the concatenation of two strings. Using operator-overloading concept.

15. Program for granting friendship to another class.

SEM-III

LIST OF PROGRAMS IN VB

1) WAP to find the factorial of a number.

2) WAP for

Sin x =1+x3 - x5 + x7 + ……..

3! 5! 7!

COS X = X - X2 + X4

2! 4!

3) WAP to find that the given number is palindrome or not.

4) WAP for calculator.

5) WAP for analog clock.

6) WAP to calculate the basic statistics of a data set and returns them in an array.

7) WAP to load and control the form from another form.

8) WAP to maintain a list of book, indexed by ISBN.

9) WAP to browse a table rows without writing a single line of code.


10) Make a project to open any database and view the names of its tables , their structure , the queries

stored in the database and their definition

11) Make a form for representing the Combo Box & List Box.

12) Make a form for connecting the database of Access.

13) WAP to store student result in the database and perform queries.

MCA-IV Sem Computer Graphics

1. Write a program to draw line using DDA algorithm.

2. Write a program to draw line using Bresenham's algorithm.

3. Write a program to draw circle using polar coordinate equation.

4. Write a program to draw circle using mid-point algorithm.

5. Write a program to perform flood fill on a given region.

6. Write a program to perform following transformation on given object

a. Translation.

b. Rotation.

c. Scaling.

7. Write a program to perform successive transformation on a line.

8. Write a program to reflect an object about a liner y= mx+c.

9. Write a program to clip a line using COHEN SUTHERLAND algorithm.

10. Write a program to clip a Polygon using COHEN SUTHERLAND algorithm.

11. Write a program for converting RGB to CMY model.

12. Individual group program for student. SEM-V

LIST OF PROGRAMS IN UNIX

1. Program to calculate factorial of a numbers.

2. Print fibonacci series up to n terms.

3. Read a number and find if it is even or odd.

4. Find if a number is prime or not.

5. WAP to generate the series of 1st n prime number

6. Print sum and average of n number.

7. WAP to odd as many records as user wish.

8. WAP to delete a record from a database

9. WAP to find greatest of 3 numbers.

10. Write a shell script using and line arg. To copy file to dir.

11. Modify records of existing db file.

COMPUTING FACILITIES:


� Number and Configuration of Systems:- (Mentioned above) � Total number of systems connected to WAN � Internet bandwidth – ISDN Connection (128KBPS) & Broadband Connection(256 KBPS) � Major software packages available (as Shown above in Deptt information)

� Special purpose facilities available Yes. � Total number of systems connected by LAN:- 60 (Sixty Only)

Games and Sports Facilities Available. Extra Curriculum Activities Available. Soft Skill Development Facilities Available. Number of Classrooms and size of each 2 Nos. of 68.38 Sq.M each. Number of Tutorial rooms and size of each 1 No. of 36.21 Sq.M. Number of laboratories and size of each 2 Nos. of 72.10 each. Number of drawing/seminar halls and size of each 1 No. of 144 sq.M. Number of Computer Centers with capacity of each As per norms. Central Examination Facility, Number of rooms and capacity of each. Available. Teaching Learning process

� Curricula and syllabi for each of the programms as approved by the University. As per R.G.P.V. Bhopal Syllabus & Curricula

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA (University of Technology of Madhya Pradesh)

Air Port Bypass Road Gandhi Nagar, Bhopal-462 036

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA) W.E.F. 2005-2006

MCA FIRST SEMESTER

Theory Marks

Sessional Marks

Practical Marks

Total Marks

Course No. Course Name L (Hrs)

T (Hrs)

P (Hrs)

Max Min Max Min Max Min

MCA-101 Information Technology 3 1 - 100 40 50 30 - - 150 MCA-102 Mathematical Foundation of

Computer Science 3 1 - 100 40 50 30 - - 150

MCA-103 Programming and Problem Solving in C

3 1 - 100 40 50 30 - - 150

MCA-104 Computer organization and Assembly Language Programming

3 1 4 100 40 50 30 50 25 200

MCA-105 Communication Skills 3 1 - 100 40 50 30 - 150 MCA-106 Programming Laboratory in

C - - 6 - - 100 60 100 50 200

Total 15 5 10 500 350 150 1000

MCA SECOND SEMESTER

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-201 Operating System 3 1 - 100 40 50 30 - - 150 MCA-202 Data Base Management

System 3 1 - 100 40 50 30 - - 150

MCA-203 Data Structure 3 1 4 100 40 50 30 50 25 200 MCA-204 Computer Oriented 3 1 - 100 40 50 30 - - 150


Numerical & Statistical Methods

MCA-205 Accounting & Management Control

3 1 - 100 40 50 30 - 150

MCA-206 Programming Laboratory in RDBMS

- - 6 - - 100 60 100 50 200

Total 15 5 10 500 350 150 1000





MCA THIRD SEMESTER

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-301 Computer Oriented Optimization Techniques

3 1 - 100 40 50 30 - - 150

MCA-302 Software Engineering Methodologies

3 1 - 100 40 50 30 - - 150

MCA-303 Object Oriented Methodology & C++

3 1 4 100 40 50 30 50 25 200

MCA-304 Theory of Computation 3 1 - 100 40 50 30 - - 150 MCA-305 Computer Networks 3 1 - 100 40 50 30 - 150 MCA-306 Programming Laboratory

any two tools from VB, VC++, D2K etc.

- - 6 - - 100 60 100 50 200

Total 15 5 10 500 350 150 1000 MCA FOURTH SEMESTER

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-401 Artificial Intelligence & Applications

3 1 - 100 40 50 30 - - 150

MCA-402 Mobile Communication 3 1 - 100 40 50 30 - - 150 MCA-403 Computer Graphics &

Multimedia 3 1 4 100 40 50 30 50 25 200

MCA-404 Design and Analysis of Algorithms

3 1 - 100 40 50 30 - - 150

MCA-405 Elective 1(E1) 3 1 - 100 40 50 30 - 150 MCA-406 Minor Project-I (Based on

client server technology) - - 6 - - 100 60 100 50 200

Total 15 5 10 500 350 150 1000 Elective-I E-I(a) : Managerial Economics E-I(b) : JAVA Programming & Technologies E-I(c) : Compiler Design E-I(d) : Microprocessors & Interface E-I(e) : Advanced Data Base Management System






MCA FIFTH SEMESTER

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-501 Data Warehousing and Mining

3 1 - 100 40 50 30 - - 150

MCA-502 UNIX & Shell Programming

3 1 4 100 40 50 30 50 25 200

MCA-503 Internet & Its Applications 3 1 - 100 40 50 30 - - 150 MCA-504 Elective-II (E-II) 3 1 - 100 40 50 30 - - 150 MCA-505 Elective-III (E-III) 3 1 - 100 40 50 30 - 150 MCA-506 Minor Project II - - 6 - - 100 60 100 50 200 Total 15 5 10 500 350 150 1000

Elective-II E-II(a) : Modeling & Simulation E-II(b) : Organizational Behavior E-II(c ) : Soft Computing E-II(d) : Networking Programming E-II(e) : .Net Technology Elective-III E-III(a) : Distributed Systems E-III(b) : Computer Vision & Digital Image Processing

E-III(c ) : Bio-informatics E-III(d) : Embedded Systems E-III(e) : Network Security MCA SIXTH SEMESTER

Seminar Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-601 Project work of 4 to 5 months duration*

- - - 100 50 200 120 200 100 500

* Project work should be undertaken in an organization engaged in software/hardware development. Synopsis of project should be approved by HOD of concerned Institution within one month from the beginning of the project.

A confidential report of the student should be taken from the project guide and should be made part of sessional.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-101 Information Technology 3 1 - 100 40 50 30 - - 150

UNIT-I Basic concepts of IT, concepts of Data & Info, data processing, history of computers (generation, type of

languages), organization of computers, I/O devices, storage devices, system software, application software, utility packages, numerical based on storage devices.

UNIT-II Assembler : Elements of assembly language programming, a simple assembly scheme, pass structure of assembler, design of two pass assemblers, a single pass assemblers. Macros & Macro Processors : Macro definition & Call, Macro expansion Nested macro calls, advanced macro facilities, design of macro processors. UNIT-III Compilers & Interpreters : aspects of compilation, memory allocation, compilation of expression compilation of control structures, code optimization, interpreters. Software Tools : Software tools for program development, editors, debug monitors, programming environment, user interfaces. UNIT-IV Linker & Loaders : Relocation & linking concepts, design of linkers, self relocating programs, a linker for MS DOS, linking for overlays, loaders : A two pass loader scheme, Relocating loaders, subroutine linkage, Direct linkage loader, Binders overlays. UNIT-V Sequential file organisation, random file organisation, index structure, indexed file organisation, alternate key indexed sequential files, multi key organisation, multi key access, multi list file organisation, inverted files & their definitions, insertion, deletion, operations with optimum utilization of memory, comparison of various type of file organisation. BOOKS 1. D.M. Dhamdhere “ System Programming & O.S.” 2nd Ed., Tata Mc. Graw Hill. 2. J. Donovan “System Programming” THM. 3. Rajaraman V. “Fundamental of Computers” (4nd edition.) Prentice Hall of India, New Delhi 2004. 4. Sardes D.H. “Computer’s today” McGraw Hill 1988. 5. S.Jaiswal, “Fundamental of Computer & IT”, Wiley dreamtech India..

Note : Paper is to be set unit wise with internal choice.

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-102 Mathematical Foundation of Computer Science

3 1 - 100 40 50 30 - - 150

UNIT-I

Sets, Relations and Functions: Sets, Subsets, Power sets, Complement, Union and Intersection, Demorgan’s law Cartesian products, Relations, relational matrices, properties of relations, equivalence relation, functions ,Injection, Surjection and Bijective mapping, Composition of functions, the characteristic functions and Mathematical induction.


UNIT-II Proportions & Lattices : Proposition & prepositional functions, Logical connections Truth-values and Truth Table, the algebra of prepositional functions-the algebra of truth values-Applications (switching circuits, Basic Computer Components). Partial order set, Hasse diagrams, upper bounds, lower bounds, Maximal and minimal element, first and last element, Lattices, sub lattices, Isotonicity , distributive inequality, Lattice homomorphism, lattice isomorphism ,complete lattice ,complemented lattice distribution lattice . UNIT-III Groups and Fields: Group axioms ,permutation group, sub group, co-sets, normal subgroup, semi group, Lagrange theorem, fields, minimal polynomials, reducible polynomials, primitive polynomial, polynomial roots, applications. UNIT-IV Graphs: Finite graphs, incidence and degree, isomorphism, sub graphs and union of graphs, connectedness, walk, paths, and circuits Eulerian graphs ,tree properties of trees, pendant vertices in tree, center of tree ,spanning trees and cut vertices, binary tree ,matrix representation of graph, incidence and adjacency matrix and their properties, applications of graphs in computer science.

UNIT-V

Discrete Numeric function and Recurrence relation: Introduction to discrete numeric functions and generating functions introduction to recurrence relations and recursive algorithms, linear recurrence relations with constant coefficients, homogeneous solutions, particular solutions and total solutions BOOKS 1. J.P.Trembley & R.P.Manohar “Discrete Mathematical Structure with applications to Computer Science”. 2. Kenneth H. Rosen-203 “Discrete Math & its Applications” 5th ed. 3. K.A. Ross and C.R.B. Writht “Discrete Mathematics “. 4. Bernard Kolman & Robert C. Busby “Discrete Mathematical Structures for Computer Science”.

Note : Paper is to be set unit wise with internal choice. Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-103 Programming and Problem Solving in C

3 1 - 100 40 50 30 - - 150

UNIT-I

An overview: Problem identification, analysis, design, coding, testing & debugging, implementation,

modification & maintenance; algorithms & flowcharts; Characteristics of a good program - accuracy, simplicity,

robustness, portability, minimum resource & time requirement, modularization; Rules/ conventions of coding,

documentation, naming variables; Top down design; Bottom-up design.

UNIT-II

Fundamentals of C Programming: History of C; Structure of a C Program; Data types; Constant & Variable,

naming variables; Operators & expressions; Control Constructs – if-else, for, while, do-while; Case switch

statement; Arrays; Formatted & unformatted I/O; Type modifiers & storage classes; Ternary operator; Type

conversion & type casting; Priority & associativity of operators.

UNIT-III


Modular Programming: Functions; Arguments; Return value; Parameter passing – call by value, call by

reference; Return statement; Scope, visibility and life-time rules for various types of variable, static variable;

Calling a function; Recursion – basics, comparison with iteration, types of recursion- direct, indirect, tree and tail

recursion, when to avoid recursion, examples.

UNIT-IV

Advanced Programming Techniques: Special constructs – Break, continue, exit(), goto & labels; Pointers - &

and * operators, pointer expression, pointer arithmetic, dynamic memory management functions like malloc(),

calloc(), free(); String; Pointer v/s array; Pointer to pointer; Array of pointer & its limitation; Function returning

pointers; Pointer to function, Function as parameter; Structure – basic, declaration, membership operator, pointer to

structure, referential operator, self referential structures, structure within structure, array in structure, array of

structures; Union – basic, declaration; Enumerated data type; Typedef; command line arguments.

UNIT-V

Miscellaneous Features: File handling and related functions; printf & scanf family;C preprocessor – basics,

#Include, #define, #undef, conditional compilation directive like #if, #else, #elif, #endif, #ifdef and #ifndef;

Variable argument list functions.

BOOKS:

1. Kerninghan & Ritchie “The C programming language”, PHI

2. Schildt “C:The Complete reference” 4th ed TMH.

3. Cooper Mullish “The Spirit of C”, Jaico Publishing House, Delhi

4. Kanetkar Y. “Let us C”, BPB.

5. Kanetkar Y.: “Pointers in C” , BPB

6. Gottfried : “Problem Solving in C”, Schaum Series

7. Jones, Harrow Brooklish “C Programming with Problem Solving”, Wiley Dreamtech India.


Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-104 Computer organization and Assembly Language Programming

3 1 4 100 40 50 30 50 25 200

UNIT-I Representation of Information: Number systems, integer and floating-point representation, character codes (ASCII, EBCDIC), Error detection and correction codes : parity check code,cyclic redundancy code,Hamming code . Basic Building Blocks: Boolean Algebra, Simplification of Boolean Function. Combinational blocks: gates, multiplexers, decoders,Implementation of Boolean Function in form of gates etc. Sequential building blocks: flip-flops, Registers : Buffer register, Right &Left Shift register, Bidirectional Shift register. Counters : Ripple counter,Binary Counter,MOD-10 Counter,Ring Counter. ALU, Random access memory etc. UNIT-II Register Transfer Language and Micro-operations: concept of bus, data movement among registers, a language to represent conditional data transfer, data movement from/to memory. Design of simple Arithmetic & Logic Unit & Control Unit, arithmetic and logical operations Along with register transfer, timing in register transfer.

UNIT-III

Architecture of a simple processor: A simple computer organization and instruction set, instruction formats, addressing modes, instruction cycle,instruction execution in terms of microinstructions, interrupt cycle


,concepts of interrupt and simple I/O organization,Synchronous & Asynchronous data transfer,Data Transfer Mode : Program Controlled, Interrupt driven, DMA(Direct Memory Access). implementation of processor using the building blocks.

UNIT-IV

Assembly Language programming: Pin Diagram of 8086, Architecture of 8086,Addresing Mode of 8086,detailed study of 8086/8088 assembly language, instruction set of 8086, loops and Comparisons, conditions and procedures, arithmetic operations in assembly language. Simple Assembly Language program of 8086. illustrations using typical programs like: table search, subroutines, symbolic and numerical manipulations and I/O.

UNIT-V

Memory organization: Secondary Memory, Primary Memory :Random access memory, Read Only memory basic cell of static and dynamic RAM, Building large memories using chips, Concept of segmentation & Paging, Associative memory, cache memory organization, virtual memory organization. BOOKS 1. M. Morris Mano, “Computer System Architecture”, PHI, 3rd edition, 1993 2. Govindarajalu “Computer Architecture & Organisation”. 3. Liu and Gibson, “8086/8088 Micro processor Assembly Language”. 4. M.Mano “Digital Logic & Computer Design” 5. Malvino, “Digital Computer Electronics”.


Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-105 Communication Skills 3 1 - 100 40 50 30 - 150 UNIT-I

Communication

Meaning and process of communication, importance of effective communication,

communication situation, barriers to communication. Objectives of communication, types of

communication, principles of communication, essentials of effective communication.

UNIT-II

Media of Communication

Written, oral, face-to-tace, visual, audio-Visual, merits and demerits of written and oral

communication.

UNIT-III

Communication Skills:

Developing communication skills; Listening; Speaking; Reading-Writing (Oral & Written).

Body language; Utility of aids in Communication.

UNIT-IV

Spoken Skills

Preparing for oral presentation, conducting presentations; Debates; Seminar; Speeches;

Lectures; Interviews; Telephonic Conversation; Negotiations; Group Discussions.

UNIT-V

Written Skills:

Preparing of bio-data, seminar, paper, bibliography, and official correspondence; Mechanics

of writing; Formal & Informal writings, letters; paragraphing, precise, report writing,

technical reports, length of written reports, organizing reports, writing technical reports;

Creative writing; Common Errors in Language.

BOOKS:


1. Rajendra Pal and J.S. Korlahalli “Essentials of Business Communication” , Sultan

Chand & Sons Publishers, New Delhi.

2. U.S.Rai & S.M. Rai “Business Communications” , Himalaya Publishing House.

3. Menzal and D.H. Jones “Writing a technical Paper”, Mc Graw Hill, 1961.

4. Strategy and Skill “Business Communication”, Prentice Hall New Jersey, 1987

5. Scot Ober “Contemporary Business Communication”, Wiley India.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-201 Operating System 3 1 - 100 40 50 30 - - 150

UNIT-I

Introduction: Evolution of operating systems (History of evolution of OS with the generations of computers), Types of operating systems, Multitasking, Timesharing, Multithreading, Multiprogramming and, Real time operating systems, Different views of the operating system, System Programmer’s view, User’s view, Operating system concepts and structure, Layered Operating Systems, Monolithic Systems. Processes: The Process concept, The process control block, Systems programmer's view of processes, Operating system services for process management, Scheduling algorithms, First come first serve, Round Robin, Shortest run time next, Highest response ratio next, Multilevel Feedback Queues, Performance evaluation of scheduling algorithms stated above

UNIT-II

Memory Management : Memory management without swapping or paging, Concepts of swapping and paging, Page replacement algorithms namely, Least recently used, Optimal page replacement, Most recently used, Clock page replacement, First in First out (This includes discussion of Belady’s anomaly and the category of Stack algorithms), Modeling paging algorithms, Design issues for paging system, Segmentation, Segmented Paging, Paged Segmentation UNIT-III Inter-process Communication and Synchronization: The need for inter-process synchronization, Concept of mutual exclusion, binary and counting semaphores, hardware support for mutual exclusion, queuing implementation of semaphores, Classical problems in concurrent programming, Dining Philosopher’s problem, Bounded Buffer Problem, Sleeping Barber Problem, Readers and Writers problem, Critical section, critical region and conditional critical region, Monitors and messages.

Deadlocks: Concepts of deadlock detection, deadlock prevention, deadlock avoidance. Banker’s Algorithm UNIT-IV File System: File systems, directories, file system implementation, security protection mechanisms. Input/output: Principles of I/O Hardware: I/O devices, device controllers, direct memory access. Principles of I/O software: Goals interrupt handlers, device drivers, and device independent I/O software. User space I/O Software. Disks: Disk hardware, Disk scheduling algorithms (namely First come first serve, shortest seek time first, SCAN, C-SCAN, LOOK and C-LOOK algorithms) Error handling, track-at-a-time caching, RAM Disks. Clocks: Clock hardware, memory-mapped terminals, I/O software. UNIT-V Processes and Processors in Distributed Systems: Threads, System models, processor allocation, scheduling. Distributed File Systems: Design, Implementation, and 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: WINDOWS and LINUX /UNIX Operating System. BOOKS 1. Deitel, H.M. "An Introduction to Operating Systems". Addison Wesley Publishing Company 1984. 2. Milenkovic, M., "Operating Systems - concepts and Design" McGraw Hill International Edition-

Computer Science series 1992. 3. Galvin P., J.L. Abraham Silberschatz. "Operating System Concepts". John Wiley & Sons Company,

1989. 4. Tanenbaum, A.S. "Modern Operating System", Prentice Hall of India Pvt. Ltd.1995. 5. William Stallings “Operating Systems” , Prentice Hall of India Pvt. Ltd. 6. Joshi R.C. “Operating System” Wiley India.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-202 Data Base Management System

3 1 - 100 40 50 30 - - 150

UNIT-I Introduction: Advantage of DBMS approach, various view of data, data independence, schema and sub-schema, primary concepts of data models, Database languages, transaction management, Database administrator and users, data dictionary, overall system architecture. ER model: basic concepts, design issues, mapping constraint, keys, ER diagram, weak and strong entity sets, specialization and generalization, aggregation, inheritance, design of ER schema, reduction of ER schema to tables.

UNIT-II

Domains, Relations and Keys: domains, relations, kind of relations, relational database, various types of keys, candidate, primary, alternate and foreign keys. Relational Algebra & SQL: The structure, relational algebra with extended operations, modifications of Database, idea of relational calculus, basic structure of SQL, set operations, aggregate functions, null values, nested sub queries, derived relations, views, modification of Database, join relations, DDL in SQL.

UNIT-III

Functional Dependencies and Normalization: basic definitions, trivial and non trivial dependencies, closure set of dependencies and of attributes, irreducible set of dependencies, introduction to normalization, non loss decomposition, FD diagram, first, second, third Normal forms, dependency preservation, BCNF, multivalued dependencies and fourth normal form, Join dependency and fifth normal form.

UNIT-IV

Database Integrity: general idea. Integrity rules, domain rules, attribute rules, relation rules, Database rules, assertions, triggers, integrity and SQL. Transaction, concurrency and Recovery: basic concepts, ACID properties, Transaction states, implementation of atomicity and durability, concurrent executions, basic idea of serializability, basic idea of concurrency control, basic idea of deadlock, failure classification, storage structure types, stable storage implementation, data access, recovery and atomicity- log based recovery, deferred Database modification, immediate Database modification, checkpoints. Distributed Database: basic idea, distributed data storage, data replication, data fragmentation- horizontal, vertical and mixed fragmentation


UNIT-V

Emerging Fields in DBMS: object oriented Databases-basic idea and the model, object structure, object class, inheritance, multiple inheritance, object identity, data warehousing- terminology, definitions, characteristics, data mining and it’s overview, Database on www, multimedia Databases-difference with conventional DBMS, issues, similarity based retrieval, continuous media data, multimedia data formats, video servers. Storage structure and file organizations: overview of physical storage media, magnetic disks-performance and optimization, basic idea of RAID, file organization, organization of records in files, basic concepts of indexing, ordered indices, basic idea of B-tree and B+-tree organization Network and hierarchical models: basic idea, data structure diagrams, DBTG model, implementations, tree structure diagram, implementation techniques, comparison of the three models. BOOKS 1. A Silberschatz, H.F Korth, Sudersan “Database System Concepts” –, MGH Publication. 2. C.J Date “An introduction to Database Systems” –6th ed. 3. Elmasri & Navathe “Fundamentals of Database systems” – III ed. 4. B.C. Desai. “An introduction to Database systems” BPB 5. Raghurama Krishnan “Database Systems” TMH


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-203 Data Structure 3 1 4 100 40 50 30 50 25 200 Prerequisites: Array, Structure, pointers, pointer to structure, functions, parameter passing, recursion.

UNIT-I

Stack and Queue: contiguous implementations of stack, various operations on stack, various polish notations-infix, prefix, postfix, conversion from one to another-using stack; evaluation of post and prefix expressions. Contiguous implementation of queue: Linear queue, its drawback; circular queue; various operations on queue; linked implementation of stack and queue- operations

UNIT-II

General List: list and it’s contiguous implementation, it’s drawback; singly linked list-operations on it; doubly linked list-operations on it; circular linked list; linked list using arrays.

UNIT-III

Trees: definitions-height, depth, order, degree, parent and child relationship etc; Binary Trees- various theorems, complete binary tree, almost complete binary tree; Tree traversals-preorder, in order and post order traversals, their recursive and non recursive implementations; expression tree- evaluation; linked representation of binary tree-operations. Threaded binary trees; forests, conversion of forest into tree. Heap-definition.

UNIT-IV

Searching, Hashing and Sorting: requirements of a search algorithm; sequential search, binary search, indexed sequential search, interpolation search; hashing-basics, methods, collision, resolution of collision, chaining; Internal sorting- Bubble sort, selection sort, insertion sort, quick sort, merge sort on linked and contiguous list, shell sort, heap sort, tree sort.


UNIT-V

Graphs: related definitions: graph representations- adjacency matrix, adjacency lists, adjacency multilist; traversal schemes- depth first search, breadth first search; Minimum spanning tree; shortest path algorithm; kruskals & dijkstras algorithm. Miscellaneous features Basic idea of AVL tree- definition, insertion & deletion operations; basic idea of B-tree- definition, order, degree, insertion & deletion operations;

B+-Tree- definitions, comparison with B-tree; basic idea of string processing. BOOKS 1. Kruse R.L. Data Structures and Program Design in C; PHI 2. Aho “Data Structure & Algorithms”. 3. Trembly “Introduction to Data Structure with Applications”. 4. TennenBaum A.M. & others: Data Structures using C & C++; PHI 5. Horowitz & Sawhaney: Fundamentals of Data Structures, Galgotia Publishers. 6. Yashwant Kanetkar, Understanding Pointers in C, BPB.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-204 Computer Oriented Numerical & Statistical Methods

3 1 - 100 40 50 30 - - 150

UNIT – I

Numerical approximation, Representation of integers and real numbers in computers, fixed and floating point arithmetic, normalized floating point numbers, Round off and truncation errors, relative and absolute errors. Iterative methods: Zeros of single transcendental equations and zeros of polynomials using bisections, false position, Newton Raphson methods. Convergence of solutions.

Unit – II Interpolation : Forward, Backward, central (Striplings) and divided difference formulas, lagrangie’s interpolation, Inverse interpolation for equal and unequal intervals. Numerical Integration : Newton Cote’s formula, Simpson’s 1/3rd and 3/8th rule. Gauss Legendre (two and three points) integration formula.

Unit – III

Simultaneous linear equations: Solutions of simultaneous linear equations – Gauss elimination method and pivoting, ill conditioned equations and refinement of solutions, Gauss-seidal iterative methods. Solution of differential equation: Runge-Kutta fourth order method. Euler’s method, Picard’s, Taylor’s series.

Unit - IV

Distributions : Binomial distribution, Poisson distribution and normal distribution, χ2 distribution, Rectangular distribution, hypergeometric distribution.

Unit -V Hypothesis testing for sampling: Small samples, t, z and f tests. Chi-square test. Large samples : Comparision of large samples, testing the significance of the difference between the means of two large samples. BOOKS 1. E. Balaguruswamy “Numerical Methods” , TMH, ISBN – 07-463311-2, 1999.


2. B.S. Grewal “Numerical Methods in Engineering & Science”. 3. Miller “Mathematical Statistics with applications” 7 ed, Pearson. 4. Gupta & Kapoor, Introduction to Statistics, Chand & Co. 5. V. Rajaraman “Computer Oriented Numerical Methods”. 6. M.Ray and Har Swarup Sharma “ Mathematical Statistics”. REFERENCE BOOKS 1. Iyengyr M.K. Jain & R.K. Jain “Numerical Methods for scientific and engineering computation”, Wiley

Eastern (New Age), 1995 2. E.V. Krishnamurthy & S.K. Sen “Computer Based Numerical Algorithms”. 3. Miller & Freund’s “Probability and Statistics for Engineers”.

Note : Paper is to be set unit wise with internal choice & emphasis is to be given on computerized implementation.

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-205 Accounting & Management Control

3 1 - 100 40 50 30 - 150

UNIT-I

Meaning and objects of accounting, accounting concepts and conventions, accounting equations, rules of Journalizing; Cash-book, Ledger posting, preparation of trial balance,

UNIT-II

Trading and profit and loss account and balance sheet with adjustments relating to closing stock , outstanding expenses, prepaid expenses , accrued income depreciation, bad debts, provision for bad debts, provision for discount on debtors and creditors .

UNIT-III

Inventory pricing , FIFO and LIFO methods; Simple problems of funds flow statement, cost volume, profit analysis.

UNIT-IV

Standard costing, computation of material and labour variances, budgetary control, preparation of cash budget and flexible budget.

UNIT-V

Management control and its characteristics, goals and strategies, structure and control. Responsibility centers and control centers: concepts of Responsibility centers, revenue centers, profit centers and investment centers, transfer pricing, Responsibility reporting. BOOKS 1. Bhattacharya S.K. and Deardan John “Accounting for Management” PHI 2. Chadwick “The essence of financial accounting” PHI 3. Chadwick “The essence of Management accounting” PHI 4. Grewal “Introduction to Book – keeping” 5. Subhash Sharma “Management control systems” TMH



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-301 Computer Oriented Optimization Techniques

3 1 - 100 40 50 30 - - 150

UNIT-I

Introduction of operation research. LP Formulations, Graphical method for solving LP’s with 2 variables, Simplex method, Duality theory in linear programming and applications, Integer linear programming, dual simplex method,

UNIT-II

Transportation problem, Assignment problem. Dynamic Programming : Basic Concepts, Bellman’s optimality principles, Dynamics programming approach in decision making problems, optimal subdivision problem. Sequencing Models: Sequencing problem, Johnson’s Algorithm for processing n jobs through 2 machines, Algorithm for processing n jobs through 3 or more machines, Processing 2 jobs through n machines.

UNIT-III

Project Management : PERT and CPM : Project management origin and use of PERT, origin and use of CPM, Applications of PERT and CPM, Project Network, Diagram representation, Critical path calculation by network analysis and critical path method (CPM), Determination of floats, Construction of time chart and resource labelling, Project cost curve and crashing in project management, Project Evaluation and review Technique (PERT).

UNIT-IV

Queuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems, classification of queuing models, solution of queuing M/M/1 : ∞ /FCFS,M/M/1 : N/FCFS, M/M/S : ∞/FCFS, M/M/S : N/FCFS

UNIT-V

Inventory Models : Introduction to the inventory problem, Deterministic Models, The classical EOQ (Economic Order Quantity) model, Inventory models with deterministe demands(no shortage & shortage allowed), Inventory models with probabilistic demand, multiitem determinise models.

BOOKS

1. Gillet B.E. : Introduction to Operation Research, Computer Oriented Algorithmic approach - Tata McGraw Hill Publising Co. Ltd. New Delhi.

2. P.K. Gupta & D.S. Hira, “Operations Research”, S.Chand & Co. 3. J.K. Sharma, “Operations Research: Theory and Applications”, Mac Millan. 4. S.D. Sharma, “Operations Research”, Kedar Nath Ram Nath, Meerut (UP). 5. S.S. Rao “Optimization Theory and Application”, Wesley Eastern. 6. Tata Hamdy, A “Operations Research - An Introduction”, Fifth Edition, Prentice Hall of India Pvt.

Ltd., New Delhi. 7. Taha H.A. “Operations Research an Introduction” McMillan Publication.

Note : Paper is to be set unit wise with internal choice & emphasis is to be given on computerized implementation.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-302 Software Engineering Methodologies

3 1 - 100 40 50 30 - - 150

UNIT -I

System concepts and Information system environment: The system concept, characteristics of system, elements of system, The System Development Life Cycle, The Role of System Analyst. Introduction system planning & initial investigation, various information gathering tools feasibility study conretions & structures tools of system analysis, various methods of process design, form design methodologies, introduction to information system testing, quality assurance security & diastruct computer various (deleting recovery)

UNIT -II

Software Process, Product and Project: The Product : Software, Software Myths, The process : Software Engineering : A Layered Technology, Software Process Models, The Linear Sequential Model, The Prototyping Model, The RAD Model, Evolutionary Software Process Models, Component – Based Development, Fourth Generation Techniques, Software process and Project Metrics : Software measurement

UNIT-III

Software Project Planning and Design:

Software Project Planning : Project planning objectives, Decomposition Techniques, Empirical estimation models, The Make/Buy Decision., Risk analysis.

Software Design: Design Principles, Cohesion & Coupling, Design notation and specification, structure design methodology.

UNIT-IV

Software Quality Assurance and Testing:

Software Quality Assurance : Quality Concepts, The Quality Movement, Software Quality Assurance, Software Reviews, Formal Technical Reviews, Formal Approaches to SQA, Statistical Software Quality Assurance, Software Reliability, Mistake Proofing for Software, Introduction to ISO standard.

Testing Strategies: A strategic approach of software testing strategic issues, unit testing, integration testing, validation testing, system testing, the art of debugging. OOA, OOD.

UNIT-V

Advanced Topics:

MIS & DSS:Introduction to MIS, long range planning, development and implementation of an MIS, applications of MIS in manufacturing sector and in service sector.

Decision Suppost System concepts, types of DSS.

Object Oriented Software Engineering: Object Oriented Concepts, Identifying the Elements of an Object Model, Management of Object Oriented Software Projects.

CASE tools, Re-engineering


BOOKS 1. R. S. Pressman, “Software Engineering – A practitioner’s approach”, 6th ed., McGraw Hill Int. Ed.,

2002. 2. Pankaj Jalote “Software Engg” Narosa Publications. 3. Ian Sommerville : Software Engineering 6/e (Addison-Wesley) 4. Richard Fairley : Software Engineering Concepts (TMH) 5. Elis Awad, "System Analysis & Design", Galgotia publications 6. W.S. Jawadekar: Management Information Systems, TMH Publication, India 7. Hoffer “ Modern System Analysis & Design” 3e, Pearson Edition


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-303 Object Oriented Methodology & C++

3 1 4 100 40 50 30 50 25 200

UNIT-I

C++ basics, loops and decisions, structures and functions, object and classes, object arrays, constructor and destructor functions.

UNIT-II

Operator and function overloading, pointers, pointers to base and derived classes inheritance, public and private inheritance, multiple inheritance.

UNIT-III

Polymorphism, virtual functions, abstract base classes and pure virtual function, friend function, early and late binding.

UNIT-IV

C++ I/O system, formatted I/O, creating insertors and extractors, file I/O basis, creating disk files and file manipulations using seekg(), seekp(), tellg() and tellp() functions, exception handling: try, catch and throw.

UNIT-V

UML concepts, object-oriented paradigm and visual modeling, UML diagrams, UML specifications, object model, object oriented design, identifying classes and object, object diagrams.

BOOKS

1. Lafore R. “Object Oriented Programming in C++”, Galgotia Pub. 2. Lee “UML & C++ a practical guide to Object Oriented Development 2 ed, Pearson. 3. Schildt “C++ the complete reference 4ed, 2003. 4. Hans Erit Eriksson “UML 2 toolkit” Wiley. 5. Balagurusawmy “Object Orienter Programming with C++”. 6. B.G., Boach “Object Oriented Analysis & Design with Applications”, Addision Wesly. 7. S. Parate “C++ Programming”, BPB. 8. Boggs “Mastering UML” BPB Publications.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-304 Theory of Computation 3 1 - 100 40 50 30 - - 150

UNIT-I

Review of Mathematical Priliminaries : Set, Relations and functions, Graphs and trees, string, alphabets and languages. Principle of induction, predicates and propositional calculus. Theory of Automation : Definition, description, DFA,NFA, Transition systems,2DFA, equivalence of DFA & NDFA, Regular expressions, regular grammer, FSM with output (mealy and moore models), Minimisation of finite automata.

UNIT-II

Formal Languages : Definition & description, Pharse structured grammars & their classification, Chomskey classification of languages, closure properties of families of language, regular grammar, regular set & their closure properties, finite automata, equivalence of FA and regular expression, equivalence of two way finite automata, equivalence of regular expressions.

UNIT -III

Context-Free grammar & PDA : Properties unrestricted grammar & their equivalence, derivation tree simplifying CFG, unambiguifying CFG, ∈-productions, normal form for CFG, Pushdown automata, 2 way PDA, relation of PDA with CFG, Determinism & Non determinism in PDA & related theorems, parsing and pushdown automata.

UNIT-IV

Turing Machine : Model, design, representation of TM, language accepted by TM, universal turing machine, determine & non-determinism in TM, TM as acceptor/generator/algorithms, multidimentional, multitracks, multitape, Two way infinite tape, multihead, Halting problems of TM.

UNIT-V

Computability : Concepts, Introduction to complexity theory, Introduction to undecidaibility, recursively enumerable sets, primitive recursive functions, recursive set, partial recursive sets, concepts of linear bounded Automata, context sensitive grammars & their equivalence.

BOOKS

1. Hopcroft & Ullman “Introduction to Automata theory, languages & Computation” , Narosha Publishing house.

2. Lewish Papadimutrau “Theory of Computation” , Prentice Hall of India, New Delhi. 3. Peter linz, “An Introduction to formal language and automata”, Third edition, Narosa publication. 4. Marvin L. Minskay “Computation : Finite & Infinite Machines”, PHI. 5. Mishra & Chander Shekhar “Theory of Computer Science (Automate, Language & Computations), PHI.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-305 Computer Networks 3 1 - 100 40 50 30 - 150

UNIT-I

Introduction: Computer Network, Layered Network Architecture-Review of ISO-OSI Model., Transmission Fundamentals-, Communication Media-Conductive Metal (Wired Cable), Optical Fiber links, Wireless Communication-Radio links, Setellite Links, Communication Services & Devices, Telephone System., Integrated Service Digital Network (ISDN)., Cellular Phone., ATM, Modulation & Demodulation-, Digital to Analog Conversion-Frequency Modulation (FM), Amplitude, Modulation (AM), Phase Modulation (PM)., Analog to Digital Conversion-Pulse Amplitude Modulation(PAM), Pulse Code Modulation (PCM), Differential Pulse Code Modulation, (DPCM)., Modem & Modem Types., Multiplexing-, Frequency Division Multiplexing (FDM)., Time Division Multiplexing (TDM), Statistical Time Division Multiplexing (STDM)., Contention Protocol-, Stop-Go-Access Protocol, Aloha Protocol-Pure aloha & Slotted aloha, Carrier sense multiple access with collision detection (CSMA/CD)

UNIT-II Data Security and Integrity: Parity Checking Code, Cyclic redundancy checks (CRC), Hemming Code, Protocol Concepts –, Basic flow control, Sliding window protocal-Go-Back-N protocol and selective

repeat protocol, Protocol correctness- Finite state machine

UNIT-III

Local Area Network: Ethernet : 802.3 IEEE standard, Token Ring : 802.5 IEEE standard, Token Bus : 802.4 IEEE standard, FDDI Protocol, DQDB Protocol, Inter Networking, Layer 1 connections-

Repeater, Hubs, Layer 2 connections- Bridges, Switches, Layer 3 connections- Routers, Gateways.

UNIT-IV

Wide Area Network: Introduction, Network routing, Routing Tables, Types of routing, Dijkstra’s Algorithm, Bellman-Ford Algorithm, Link state routing, Open shortest path

first, Flooding, Broadcasting, Multicasting, Congestion & Dead Lock, Internet

Protocols, Overview of TCP/IP, Transport protocols, Elements of Transport Protocol,

Transmission control protocol (TCP), User data-gram protocol (UDP).

UNIT-V Network Security, Virtual Terminal Protocol, Overview of DNS, SNMP, email, WWW, Multimedia.

BOOKS

1. A.S.Tanenbaum, “Computer Network”, 4th addition,PHI 2. Forouzan “Data Communication and Networking 3ed”, TMH 3. J.F.Hayes, “Moduling and Analysis of Computer Communication Networks”, Plenum Press 4. D.E.Comer, “Internetworking with TCP/IP”, Volume Ist & IInd, PHI 5. Willium Stalling, “Data & Computer communications”,Maxwell Macmillan International Ed. 6. D.Bertsekas and R.Gallager,”Data Networks”, 2nd Ed. ,PHI. 7. G.E. Keiser ,”Local Area Networks “, McGraw Hill, International Ed.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-401 Artificial Intelligence & Applications

3 1 - 100 40 50 30 - - 150

UNIT-I General Issues and Overview of AI The AI problems, what is an AI technique, Characteristics of AI applications. Introduction to LISP programming: Syntax and numeric functions, Basic list manipulation functions, predicates and conditionals, input output and local variables, iteraction and recursion, property lists and arrays. UNIT-II Problem Solving, Search and Control Strategies General problem solving, production systems, control strategies forward and backward chaining, exhausive searches depth first breadth first search. Heuristic Search Techniques Hill climbing, branch and bound technique, best first search & A* algorithm, AND / OR graphs, problem reduction & AO* algorithm, constraint satisfaction problems. UNIT-III

Knowledge Representations First order predicate calculus, skolemization, resolution principle & unification, interface mechanisms, horn's clauses, semantic networks, frame systems and value inheritance, scripts, conceptual dependency. UNIT-IV Natural Language processing Parsing techniques, context free grammer, recursive transitions nets (RNT), augmented transition nets (ATN), case and logic grammers, symantic analysis.

Game playing Minimax search procedure, alpha-beta cutoffs, additional refinments. Planning Overview an example domain the block word, component of planning systems, goal stack planning, non linear planning. UNIT-V Probabilistic Reasoning and Uncertainty Probability theory, bayes theorem and bayesian networks, certainty factor. Expert Systems Introduction to expert system and application of expert systems, various expert system shells, vidwan frame work, knowledge acquisition, case studies, MYCIN. Learning Rote learning, learning by induction, explanation based learning. BOOKS 1. Elaine Rich and Kevin Knight “Artifical Intelligence” - Tata McGraw Hill. 2. “Artifical Intelligence” 4 ed. Pearson. 3. Dan W. Patterson “Introduction to Artifical Intelligence and Expert Systems”, Prentice India. 4. Nils J. Nilson “Principles of Artifical Intelligence”, Narosa Publishing House. 5. Clocksin & C.S.Melish “Programming in PROLOG”, Narosa Publishing House. 6. M.Sasikumar,S.Ramani etc. “Rule based Expert System”, Narosa Publishing House.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-402 Mobile Communications 3 1 - 100 40 50 30 - - 150

UNIT- I Overview of OSI Model : Significance of layered Model , PDUs, SDUs,IDUs, Higher layer Protocols. Switching and Components. Introduction, Applications, history, of wired & wireless Communication systems. Radio Transmission: frequencies ,signal propagation, antenna , types of modulation, FHSS, DSSS. Multiple Access technology for Wireless Communication : FDMA,TDMA,CDMA Cellular System: Introduction, types.

UNIT–II

Mobile Data Communication: Cellular Telephony, Structure, Fading, Small scale fading, Multi-path Fading, Speech Coding, Error Coding and Correction, Hand off Management, Switching and authentication, MTSO interconnections, frequency hopping, frequency reuse. Circuit Switched Data Services & Packet Switched Data Services on Cellular Networks, Personal Communication Systems (PCS) Architecture, Digital Enhanced Cordless Telecommunications (DECT,) Personal Access Comm. System (PACS).

UNIT-III

Digital Cellular Systems and Standards: GSM System overview, Architecture, GSM Protocol Model, GSM Mobility Management, SMS security aspects. Broadcast System overview. General Packet Service (GRPS) Architecture, GRPS Network, Interfaces and Procedures (2.5 G), 3G Mobile Services: UMTS and International Mobile Telecommunications (IMT-2000), W-C DMA and CDMA 2000,Quality of service in 3G .

UNIT- IV

WLAN : Components and working of Wireless LAN, Transmission Media for WLAN, Infrastructure & types of WLAN, IEEE 802.11 Standards , Protocols for WLAN ,MACA,MACAW, Infrared technology. Wireless Application Protocol (WAP) model, architecture, Gateway, WAP protocols and WML

UNIT-V

Introduction to Bluetooth technology. Wireless in Local Loop (WLL) architecture, products. Satellite as a switch, Components of VSAT system, VSAT topologies, access schemes.

BOOKS

1. Jochen Schiller “Mobile Communication”, Pearson Education. 2. Yi –Bing Lin and Imrich Chlamtac “Wireless and Mobile Network Architectures”, Wiley India. 3. Raj Pandaya “Mobile and Personal Communication System & Services”. 4. Uwe Hansmann, Lothar Merk “Principles of Mobile Computing” 2nd Ed. Wiley India. 5. Roger L. Freeman “ Telecom Transmission handbook” 4th ed. 1998 John Wiley & Sons Inc. New York. 6. Lee “Mobile Cellular Telecom” 1995 Mc Graw Hill.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-403 Computer Graphics & Multimedia

3 1 4 100 40 50 30 50 25 200

UNIT-I

Computer Graphics : definition, classification & Applications, Development of Hardware & Software for Computer Graphics. Display devices, Hard copy devices. Interactive Input devices, display processor, Line

drawing; various algorithms and their comparison, circle generation- Bresenham’s mid point circle drawing algorithm, mid point ellipse drawing algorithm.

UNIT-II

Attributes of output primitives, line style, color and intensity, Area filling algorithms, Scan line algorithm, boundary fill flood fill algorithm, Antialiasing techniques. Two dimensional transformations; translation, scaling, rotation, reflection sheering, composite transformation, transformation commands, character generation.

UNIT-III

Viewing coordinates, Window, view port, clipping, Window to view port transformation, line clipping algorithm; Cohen Sutherland, polygon clipping; Sutherland hodgman algorithm, 3D clipping : Normalized view volumes, view port clipping, clipping in homogeneous coordinates. Illumination model: Light sources, diffuse reflection specular reflection, reflected light, intensity levels, surface shading; phong shading ground shading, color models like RGB, YIQ, CMY, HSV etc.

UNIT-IV

3-D Viewing: Three-dimensional concepts, 3D display techniques, 3D representation polygon & curved surfaces. Design of curves & surfaces- Bezier’s Method, B-spline methods, 3D transformation transition, scaling, composite transformation rotation about arbitrary axis, projections: Parallel & Perspective, Hidden surface and line removal; back face removal, depth buffer and scan line methods.

UNIT-V

Introduction to multimedia, multimedia components, multimedia hardware, SCSI, IDE, MCI, Multimedia data and file formats, RTF, TIFF, MIDI, JPEG, DIB, MPEG, Multimedia tools, presentations tools, Authoring tools, presentations. BOOKS 1. D.Hearn and M.P. Baker “Computer Graphics” (2nd ed), PHI. 2. S. Harrington – “Computer Graphics - a Programming approach” (2nd ed) McGrawhill. 3. New Mann & Sprovl- “Principles of interactive computer graphics” (2nd ed) McGrawhill. 4. Roger S. David “Procedural Elements for Computer Graphics”, McGraw Hill. 5. Roger S David “Mathematical Elements for Computer Graphics”, McGraw Hill. 6. Foley & Vandan “Computer Graphics Principles & Practice in “C” “Addision Wesly. 7. Tay Vaugham “ Multimedia Making it Work” 5th Ed. 2001, Tata McGraw Hill. 8. Prabhat K. Andleigh & Kiran Thakur “Multimedia System Design”, PHI 9. Drew, “Fundamentals of Multimedia”, Pearsons. 10. Nigel Chapman, J. Chapman “Digital Multimedia” Wiley India.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-404 Design and Analysis of Algorithms

3 1 - 100 40 50 30 - - 150

UNIT – I

Pre-requisites: Data structure & Discrete structures, models of computation, algorithm analysis, order architecture, time space complexities average and worst case analysis.

UNIT-II

Divide and conquer: Structure of divide-and-conquer algorithms: examples; Binary search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time recurrence relations.

Graph searching and Traversal: Overview, Traversal methods (depth first and breadth first search)

UNIT-III Greedy Method: Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree), Approximate solution (Knapsack problem), Single source shortest paths.

Branch and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem, searching & sorting algorithms.

UNIT-IV Dynamic programming: Overview, difference between dynamic programming and divide and conquer, Applications: Shortest path in graph, Matrix multiplication, Traveling salesman Problem, longest Common sequence.

Back tracking: Overview, 8-queen problem, and Knapsack problem

UNIT-V

Computational Complexity: Complexity measures, Polynomial Vs non-polynomial time complexity; NP-hard and NP-complete classes, examples.

Combinational algorithms, string processing algorithm, Algebric algorithms , set algorithms

BOOKS

1. Ullman "Analysis and Design of Algorithm" TMH

2. Goodman “Introduction to the Design & Analysis of Algorithms, TMH-2002.

3. Sara Basse, A. V. Gelder, “ Computer Algorithms,” Addison Wesley

4. T. H. Cormen, Leiserson , Rivest and Stein, “Introduction of Computer algorithm,” PHI

5. E. Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,” Galgotia

Publication



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-405 Elective-I : E1(a) Managerial Economics

3 1 - 100 40 50 30 - 150

UNIT-I

Nature and scope of managerial economics, objectives of firm, management and behavioral theories of the firm.

UNIT-II

Concepts of opportunity cost , incremental, time perspective, principles of discounting and aquamarine, demand analysis purpose and concepts, elasticity of demand, methods of demand forecasting.

UNIT-III

Product and cost analysis: short run and long run average cost curves. Profits: nature and measurement policy, break even analysis, case study.

UNIT-IV

Law of supply, economies and diseconomies of scale, law of variable proportions. Production functions: single output isoquants.

UNIT-V

Pricing: prescriptive approach, price determination under perfect competition, monopoly, oligopoly and monopolistic competition, full cost pricing, pricing strategies BOOKS 1. Dean J. Managerial Economics PHI, New Delhi 2. Mote V.L. et al Management Economics Concepts and Cases TMH, New Delhi 3. Boyes and Melvin “Text book of Economics” Wiley India. 4. Berry Keating & Wilson “Managerial Economics” Wiley India.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-405 Elective-I : E1(b) Java Programming & Technologies

3 1 - 100 40 50 30 - 150

UNIT-I The Java Environment: History of Java: Comparison of Java and C++; Java as an object oriented language: Java buzzwords; A simple program, its compilation and execution; the concept of CLASSPATH; Basic idea of application and applet; Basics: Data types; Operators- precedence and associativity; Type conversion; The decision making – if, if ..else, switch; loops – for, while, do…while; special statements–return, break, continue, labeled break, labeled continue; Modular programming methods; arrays; memory allocation and garbage collection in java keywords. Object Oriented Programming in Java: Class; Packages; scope and lifetime; Access specifies; Constructors; Copy constructor; this pointer; finalize () method; arrays; Memory allocation and garbage collection in java keywords

Inheritance : Inheritance basics, method overriding, dynamics method dispatch, abstract classes.


UNIT-II Interfaces : defining an interface, implementing & applying interfaces, variables in interfaces, extending interfaces. Multithreading and Exception Handling: Basic idea of multithreaded programming; The lifecycle of a thread; Creating thread with the thread class and runnable interface; Thread synchronization; Thread scheduling; Producer-consumer relationship; Daemon thread, Selfish threads; Basic idea of exception handling; The try, catch and throw; throws Constructor and finalizers in exception handling; Exception Handling. UNIT-III Applets: Applet security restrictions; the class hierarchy for applets; Life cycle of applet; HTML Tags for applet. The AWT: The class hierarchy of window fundamentals; The basic user interface components Label, Button, Check Box, Radio Button, Choice menu, Text area, Scroll list, Scroll bar; Frame; Layout managers- flow layout, Grid layout, Border layout, Card layout. The Java Event Handling Model: Java’s event delegation model – lgnoring the event, Self contained events, Delegating events; The event class hierarchy; The relationship between interface, methods called, parameters and event source; Adapter classes; Event classes action Event, Adjustment Event, Container Event, Focus Event, Item Event, Eey Event, Mouse Event, Text Event, Window Event. UNIT-IV Input/Output : Exploring Java i.o., Directories, stream classes The Byte stream : Input stream, output stream, file input stream, file output stream, print stream, Random access file, the character streams, Buffered reader, buffered writer, print writer, serialization. JDBC: JDBC-ODBC bridge; The connectivity model; The driver manager; Navigating the resultset object contents; java.sql Package; The JDBC exception classes; Connecting to Remote database. UNIT-V Networking & RMI: Java Networking : Networking Basics : Socket, Client server, reserved sockets, proxy servers,

Inet address, TCP sockets, UDP sockets. ; RMI for distributed computing; RMI registry services; Steps of creating RMI Application and an example. Collections: The collections framework, collection interfaces, collection classes. BOOKS 1. Naughton & Schildt “The Complete Reference Java 2”, Tata McGraw Hill 2. Deitel “Java- How to Program:” Pearson Education, Asia 3. Horstmann & Cornell “Core Java 2” (Vol I & II ) , Sun Microsystems 4. lvan Bayross “Java 2.0” : BPB publications 5. Ivor Horton’s “Beginning Java 2, JDK 5 Ed., Wiley India.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-405 Elective-I : E1(c) Compiler Design

3 1 - 100 40 50 30 - 150

UNIT-I

Introduction to Compiling and one pass compiler : Compilers and translators, phases of compilers, Structure of a compiler, compiler writing tools, bootstrapping, overview of one pass compiler, Error handling. Finite Automata & Lexical Analysis : Role of lexical analyser, specification of tokens, recognition of tokens, regular expression, finite automata, form regular expression to finite automata, DFA and NFA, implementation of lexical analyser, tools for lexical analyser, only introduction to LEX.


UNIT-II

Syntax Analysis & Parsing Techniques : Context free grammers, Phase tree, ambiguity of parse tree, bottom up parsing and top down parsing, shift reduce parshing, operator precedence parsing, elimination of left recursion, recursive descent parsing, predictive parser construction, Transition diagram.

UNIT-III LR parsers, constructing SLR and canonical LR parsing tables, using ambiguous grammer, Introduction to YACC, LR(1) & LALR Parsers. Syntax Directed Translation : Syntax directed translation scheme, construction of syntax trees, SDT with inherrited and synthesized attributes, symbol tables.

UNIT-IV Intermedicate code generation : Intermedicate languages, prefix notation, three address code, quadruples and triples, translation of assignment statements, boolean expression, procedural calls and iterative statements. Run time Environment : Source language issues, storage organisation and allocation strategies, parameter passing, implementation of block structured languages.

UNIT-V Error Detection and Recovery : Errors, sources of errors, Lexical & syntactic phase error, semantic errors:panic mode error recovery & pharse level error recovery mechanisms. Code Optimization : Optimization of basic blocks, loop optimization, global data flow analysis, loop invariant computations and other related optimization techniques. Code Generation : Issues in design of code generation, simple code generaton techniques.

BOOKS

1. Alfred V. Aho, Ravi Sethi and J.D. Ullman “Compilers- Principles, Techniques and tools” Addison Wesley. A

2. Alfred V.Aho and J.D. Ullman “Principles of Compiler Design” Narosa Publishing House. 3. Tremblay, “Theory and Practice of compiler writing”, Mc Graw Hill. 4. Holuv, “Compiler Design in C”, PHI. 5. Dhamdhare D.M., “Compiler Construction Principles and Practice”, Macmillan India.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-405 Elective-I : E1(d) Microprocessor and Interfaces

3 1 - 100 40 50 30 - 150

UNIT –1 Intel 8086 Microprocessor: 8086 Architecture, Pin out diagram and pin description, Addressing Modes, bus transfer techniques with read/write cycle, 8086 Interrupts and Interrupt Responses. UNIT –II Interfacing of 8086 with Memories, PPI (8255), Keyboard Controller (8279), DMA Controller (8257) Interfacing of 8086 with Programmable Interval Timer (8254) and Programmable Interrupt Controller (8259). UNIT-III Introduction to Intel 80286, comparison of 80286 with 8086,80286 Architecture signal and system connection,

Real and Virtual Addressing Modes, Memory Management Scheme, 80286 Protection Mechanism, 80286 Interrupts.

UNIT-IV

Introduction to Intel 80386,comparison of 80386 with 8086,80286,Difference between 80386SX and 80386DX, Memory and I/O system of 80386,Special 80386 Registers, 80386 Memory Management Scheme, memory

Paging Scheme UNIT-V Introduction of 80486, Difference between 80486DX and 80486SX,Basic 80486 Architecture, 80486 Memory and I/O system, 80486 Memory Management Scheme, Introduction to Pentium, Pentium Memory and I/O system,

Special Pentium Registers, Pentium Memory Management, Difference between Pentium and Pentium Pro. BOOKS 1. D.V.Hall: “ Microprocessor and Interfacing, Programming and Hardware” TMH 2. D.V.Hall: “ Microprocessor and Interface Programming” TMH 3. Barry. B. Brey : “ The Intel Microprocessors Architecture, Programming and Interfacing” Pearson Education (6th Edition) 4. James L. Antonakos : “The Pentium Microprocessor” Pearson Education. 5. V.Korneev,A.Kiselev “Modern Microprocessor” 3rd Edition , Wiley Dreamtech Publication



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-405 Elective-I : E1(e) Advanced DataBase Management System

3 1 - 100 40 50 30 - 150

UNIT-I Objected Oriented and Object Relational Databases Modeling Complex Data Semantics, Specialization, Generalization, Aggregation and Association, Objects, Object Identity and its implementation, Clustering, Equality and Object Reference, Architecture of Object Oriented and Object Relational databases, Persistent Programming Languages, Cache Coherence. Case Studies: Gemstone, O2, Object Store, SQL3, Oracle xxi, DB2.

UNIT-II

Deductive Databases Data log and Recursion, Evaluation of Data log program, Recursive queries with negation. Parallel and Distributed Databases Parallel architectures, shared nothing/shared disk/shared memory based architectures, Data partitioning, Intra-

operator parallelism, pipelining. Distributed Data Storage – Fragmentation & Replication, Location and Fragment Transparency Distributed Query Processing and Optimization, Distributed Transaction Modeling

and concurrency Control, Distributed Deadlock, Commit Protocols, Design of Parallel Databases, and Parallel Query Evaluation.

UNIT-III Advanced Transaction Processing Advanced transaction models: Savepoints, Nested and Multilevel Transactions, Compensating Transactions and

Saga, Long Duration Transactions, Weak Levels of Consistency, Transaction Work Flows, Transaction Processing Monitors, Shared disk systems.

UNIT-IV Active Database and Real Time Databases Triggers in SQL, Event Constraint and Action: ECA Rules, Query Processing and Concurrency Control, Recursive query processing, Compensation and Databases Recovery, multi-level recovery.

UNIT-V Image and Multimedia Databases Modeling and Storage of Image and Multimedia Data, Data Structures – R-tree, k-d tree, Quad trees, Content

Based Retrieval: Color Histograms, Textures, etc., Image Features, Spatial and Topological Relationships, Multimedia Data Formats, Video Data Model, Audio & Handwritten Data, Geographic Information Systems

(GIS). WEB Database Accessing Databases through WEB, WEB Servers, XML Databases, Commercial Systems – Oracle xxi, DB2.

BOOKS

1. Elmarsi, “Fundamentals of Database Systems”, 4 th Edition, Pearson Education 2. R. Ramakrishnan, “Database Management Systems”, 1998, McGraw Hill International Editions 3. Elmagarmid.A.K. “Database transaction models for advanced applications”, Morgan Kaufman. 4. Transaction Processing, Concepts and Techniques, J. Gray and A. Reuter, Morgan Kauffman.. 5. S. Abiteboul, R. hull and V. Vianu, “Foundations of Databases”, 1995, Addison – Wesley Publishing

Co., Reading Massachusetts. 6. W. Kim, “Modern Database Systems”, 1995, ACM Press, Addison – Wesley. 7. D. Maier, “The Theory of Relational Databases”, 1993, Computer Science Press, Rockville, Maryland


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-501 Data Warehousing and Mining

3 1 - 100 40 50 30 - - 150

UNIT – I Motivation, importance, Data type for Data Mining : relation Databases, Data Warehouses, Transactional databases, advanced database system and its applications, Data mining Functionalities: Concept/Class description, Association Analysis classification & Prediction, Cluster Analysis, Outlier Analysis, Evolution Analysis, Classification of Data Mining Systems, Major Issues in Data Mining. UNIT – II Data Warehouse and OLAP Technology for Data Mining: Differences between Operational Database Systems and Data Warehouses, a multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Architecture, Data Warehouse Implementation, Data Cube Technology. UNIT- III Data Preprocessing: Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation. Data Mining Primitives, Languages, and System Architectures, Concept Description: Characterization and Comparison, Analytical Characterization. UNIT – IV Mining Association Rules in Large Databases: Association Rule Mining: Market Basket Analysis, Basic Concepts, Mining Single-Dimensional Boolean Association Rules from Transactional Databases: the Apriori algorithm, Generating Association rules from Frequent items, Improving the efficiency of Apriory, Mining Multilevel Association Rules, Multidimensional Association Rules, Constraint-Based Association Mining. UNIT – V Classification & Prediction and Cluster Analysis: Issues regarding classification & prediction, Different Classification Methods, Prediction, Cluster Analysis, Major Clustering Methods, Applications & Trends in Data Mining: Data Mining Applications, currently available tools. BOOKS 1. J. Han and M. Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann Pub. 2. Berson “Dataware housing, Data Mining & DLAP, @004, TMH. 3. W.H. Inmon “ Building the Datawarehouse, 3ed, Wiley India. 4. Anahory, “Data Warehousing in Real World”, Pearson Education. 5. Adriaans, “Data Mining”, Pearson Education. 6. S.K. Pujari, “Data Mining Techniques”, University Press, Hyderabad.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-502 UNIX & Shell Programming

3 1 4 100 40 50 30 50 25 200

UNIT–I

General Overview of the System: System structure, user perspective, O/S services assumption about Hardware The Kernel and buffer cache architecture of Unix O/S, System concepts, Kernel data Structure, System administration, Buffer headers, Structure of the buffer pool, Scenarios for retrieval of the buffer, Reading and writing disk block, Advantage and disadvantage of buffer cache.

UNIT–II

Internal Representation of Files: INODES, Structure of regular, Directories conversions of a path name to an inode, Super block, Inode assignment to a new file, Allocation of disk blocks. System Calls for the System: Open read write file and record close, File creation, Operation of special files change directory and change root, change owner and change mode, STAT and FSTAT, PIPES Mounting and unmounting files system, Link Unlink.

UNIT–III

Structures of Processes and process control: Process states and transitions layout of system memory, the context of a process, manipulation of process address space, Sleep process creation/termination. The user Id of a process, changing the size of a process. The SHELL Interprocess Communication and multiprocessor system: Process tracing system V IPO network communication sockets problem of multiprocessors systems, solution with master and hare process, and solution with semaphores.

UNIT-IV Introduction to shell scripts: shell Bourne shell, C shell, Unix commands, permissions, editors, filters sed, grep family, shell variables, scripts, metacharacters and environment, if and case

statements, for while and until loops. Shell programming.

UNIT-V

Awk and perl Programming: Awk pattern scanning and processing language, BEGIN and END patterns, Awk arithmetic and variables, Awk built in variable names and operators, arrays, strings,

functions, perl; the chop() function, variable and operators, $_ and $. , Lists, arrays, regular expression and substitution, file handling, subroutines, formatted printing.

Linux: History & Features of Linux, Linux structure, vario us flavours of linux.

BOOKS

1. M.J. Bach “Design of UNIX O.S. “, Prentice Hall of India. 2. Y.Kanetkar “Unix shell programming”, BPB Pub. 3. B.W. Kernighan & R. Pike, “The UNIX Programming Environment”, Prentice Hall of India, 1995. 4. S. Prata “Advanced UNIX: A Programming's Guide”, BPB Publications, New Delhi. 5. Vikas/Thomsaon “Jack Dent Tony Gaddis “Guide to UNIX using LINUX” Pub. House Pvt. Ltd. 6. Linux complete, BPB Publications 7. Linux Kernel, Beck Pearson Education, Asia. 8. Sumitabha Das “ Unix concepts and Applications”.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-503 Internet & Its Applications 3 1 - 100 40 50 30 - - 150

UNIT-I

Motivation for internetworking, the TCP/IP internet, internet service, internet protocol and standardization, Ethernet, FDDI, LAN, WAN, ATM, application and network level interconnection, properties of internet, internet architecture, inter connection through IP routers, Internet addresses. UNIT-II ARP, RARP, internet protocol : connectionless datagram delivery, routing IP datagrams ,subnet and supernet address extensions.

UNIT-III

The TCP/IP internet layering model, the protocol layering principle, boundaries in the TCP/IP model, UDP: the user datagram protocol, format of UDP message, UDP pseudo-header, UDP encapsulation and protocol layering, layring and the UDP checksum computaion, UDP multiplexing, demultiplexing, and ports, reliable stream transport service: properties of the reliable delivery service, transmission control protocol, response to congestion, establishing and closing TCP connection, Routing: Cores, peers and algorithms, an exterior gateway protocol.

UNIT-IV The domain name system, applications, Telnet, FTP, SMTP, POP3, IMAP-4, MIME, SNMP, internet

security and firewall design,.

UNIT-V

Good web design, the process of web publishing, document overview, header elements, heading, image, forms, tables, website hosting, HTTP & URL, search engines, Javascript, ASP, servlets. BOOKS 1. Douglas E. Comer “Internetworking with TCP/IP”, Volume-I, PHI. 2. Thomas A. Powell “The Complete reference HTML”, TMH. 3. Douglas Comer “The Internet Book - Pearson Education”, Asia 4. K.Kalata “Internet Programming Thomson learning”. 5. E.Stephen Mack & Janan Platt “HTML 4.0”, BPB Pub 6. Joel sklar “Principles of Web Design”, Vikas Pub. House.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-504 Elective-II : E-II(a) : Modeling & Simulation

3 1 - 100 40 50 30 - - 150

UNIT-I Systems: Models types, principles used in modelling, system studies, interacting subsystems and example, simulation definition, examples, steps in computer simulation, advantages and disadvantages of simulation, simulation study, classification of simulation languages. UNIT-II System Simulation : Techniques of simulation, monte carlo method, comparision of simulation and analytical methods, numerical compution techniques for continuous and descrete models, distributed leg models, cobweb models. UNIT-III Continuous system simulation : Continuous system models, differential equation, analog computer analog methods, digital analog simulators, CSSLS, CSMPIII language. System Dynamics : Historical background, exponential, Growth and decay models, modified exponentical growth models, logistic curves and generalization of growth models, system dynamics diagrams, dynamo language. UNIT-IV Probability concepts in simulation : Stochastic variables, discrete and continuous probability function, continuous uniform distributed and computer generation of random numbers, uniform random number generator, non uniform contineously distributed random numbers, rejection method. Discrete system simulation : Discrete events, representation of time, generation of arrivel patterns, simulation of telephone system, delayed calls, simulation programming tasks, gathering statistics, discrete simulation languages.

UNIT-V Object Oriented approach in simulation, simulation in C++, Introduction to GPSS, general description, action times, choice of paths, simulation of a manufacturing shop, facilities and storage, program control statements, priorities and parameters, numerical attributes, functions, simulation of a supermarket transfer models, GPSS model applied to any application, simulation programming techniques like entry types. BOOKS 1. G.Gordan “System Simulation” , 2nd Ed, 2002 PHI. 2. T.A. Payer “Introduction to Simulation”, McGraw Hill. 3. W.A. Spriet “Computer Oriented Modeling and Simulation”. 4. Narsingh Deo “System Simulation with Digital Computers”, PHI. 5. V. Rajaraman “Analog Simulation”, PHI 6. Law & Kelton “Simulation Modelling and Analysis” 3rd Ed., 2000, McGraw Hill.



Theory Marks

Sessional Marks

Practical Marks

Total Marks

Course No Course Name L (Hrs)

T (Hrs)

P (Hrs)


MCA-504 Elective – II: EII(b) Organizational Behaviour

3 1 - 100 40 50 30 - - 150

UNIT – I Organizational Behavior Today: What is Organizational Behavior, shifting paradigms of organizational behavior, organizational behavior and diversity. Learning about Organizational Behavior: Organizational Behavior and learning imperactive scientific foundations of organizational behavior. UNIT – II Challenge and Opportunities for organizational behavior: Towards improving quality & productivity, improving people skills from management control to empowerment, from statrility of flexibility, improving ethical behavior, organizational social responsibility work and quality of life. UNIT- III A Micro Perspective of Organizational Behavior: The perception process, personality and attitudes, motivation: motivating performance through job design and goal setting, learning: processes rewards systems and behavior management. UNIT – IV

Micro and Macro Dynamics of Organizational Behavior: Graph dynamics and teams, interactive conflict and negotiation skills, stress: cause effects and coping strategies, leadership styles, activities and skills. A Macro Perspective of Organizational Behavior: Communications, decision-making, Organizational Theory & Design, Organizational Culture. UNIT – V Horizons for Organizational Behavior: International Organizational Behavior(IOB), the impact of culture on IOB, Communication in IOB, motivation across culture, managerial leadership across cultures Organizational Change & Development: Learning objectives, the changes facing organizations, managing change and organizational development, future of organizational Behavior. BOOKS 1. Fred Luthans “Organizational Behavior”, McGraw Hills international Edition, Management &

Organization series. 2. Schermerhorn, Hunt & Osborn “Organizational Behavior” (7th Edition), John Wiley & Sours Inc. 3. Stephen P. Robbins “Organizational Behavior: Concepts controversies applications”, PHI publications. 4. A.J.Robertson Lvan T. and Cooper, Cary.L. “Work Psychology Understanding Human Behavior in the

workplace” Macmillan India Ltd. Delhi 1996. 5. M.N. Mishra “Organizational Behavior”, Vikas Pub. Co.



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-504 Elective II : EII(c) : Soft Computing

3 1 - 100 40 50 30 - - 150

UNIT-I

Introduction, Soft Computing concept explanation, brief description of separate theories.

Neural Networks and Probabilistic Reasoning; Biological and artificial neuron, neural networks and their classification. Adaline, Perceptron, Madaline and BP (Back Propagation) neural networks. Adaptive feedforward multilayer networks. Algorithms: Marchand, Upstart, Cascade correlation, Tilling. RBF and RCE neural networks. Topologic organized neural network, competitive learning, Kohonen maps.

UNIT-II

CPN , LVQ, ART, SDM and Neocognitron neural networks. Neural networks as associative memories (Hopfield, BAM). Solving optimization problems using neural networks. Stochastic neural networks, Boltzmann machine.

UNIT-III Fundamentals of fuzzy sets and fuzzy logic theory, fuzzy inference principle. Examples of use of fuzzy

logic in control of real-world systems.

UNIT-IV

Fundamentals of genetic programming, examples of its using in practice. Genetic Algorithms Applications of GA's – Class.

UNIT-V

Fundamentals of rough sets and chaos theory. Hybrid approaches (neural networks, fuzzy logic, genetic algorithms, rough sets). BOOKS 1.Cordón, O., Herrera, F., Hoffman, F., Magdalena, L.: Genetic Fuzzy systems, World Scientific Publishing

Co. Pte. Ltd., 2001, ISBN 981-02-4016-3 2.Kecman, V.: Learning and Soft Computing, The MIT Press, 2001, ISBN 0-262-11255-8 3.Mehrotra, K., Mohan, C., K., Ranka, S.: Elements of Artificial Neural Networks, The MIT Press, 1997,

ISBN 0-262-13328-8 4.Munakata, T.: Fundamentals of the New Artificial Intelligence, Springer-Verlag New York, Inc., 1998.

ISBN 0-387-98302-3 5.Goldberg : Introduction to Genetic Algorithms 6.Jang, “ Nero-Fuzzy & Soft Computing”, Pearsons



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-504 Elective II : E-II(d) : Network Programming

3 1 - 100 40 50 30 - - 150

UNIT-I Communication protocol, Internet Protocols, Novell, System Network Architecture, UUCP, IPX/SPX for LANS, protocol comparisons.

UNIT-II

Berkeley sockets Overview, unix domain protocols, socket address, socket system call, reserved ports, passing file descriptions, I/O asynchronous and multiplexing, socket implementation. UNIT-III Winsock programming Using windows socket, API window socket and blocking I/O, other window extension, network dependent UNRI, DLL. sending and receving data over connection/termination.

UNIT-IV

Novell IPX/SPX Novell’s windows drivers, netware C interface for windows, IPX/SPX procedure, datagram communication, connection oriented communication with SPX,IPX/SPX implementation of DLL.

UNIT-V

Programming Applications Time and data routines, trivial file transfer protocol, remote login.

BOOKS

1. Davis R, Windows Network Programming, Add Wesley. 2. Steven R, Unix Network Programming, (Vol I & II) PHI.


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-504 Elective II : EII(e) : .Net Technology

3 1 - 100 40 50 30 - - 150

UNIT-I Introduction to .NET Technology, Introduction to VB.NET, Software development and Visual Basic .NET, Visual Basic .NET and .NET frame. UNIT-II Visual Basic fundamentals: The Visual Basic .NET Development Environment, The element of VB.NET, VB.NET operators, Software design, Conditional structure and control flow, Methods. UNIT-III Classes and Objects: Types, Structure and Enumeration, Classes, Interfaces, Exception handling and Classes, Collections, Arrays and other Data Structure. UNIT-IV Advance design concepts, Patterns, Roles and Relationships, Advanced Interface Patterns: Adapters and Delegates and Events Data Processing and I/O. UNIT-V Writing Software with Visual Basic .NET, Interfacing with the End User, Introduction to ASP.NET and C#.NET and their features.

BOOKS

1. Jeffrey R. Shapiro “The Complete Reference Visual Basic .NET” Tata Mcgraw Hill (2002 Edition). 2. Rox “Beginner and Professional Edition VB.NET” Tata Mcgraw Hill. 3. Steven Holzner “Visual Basic .NET Black Book” Wiley Dreamtech Publication. 4. Alex Homer, Dave Sussman “Professional ASP.NET1.1” Wiley Dreamtech 6. Bill Evzen,Bill Hollis “Professional VB.NET 2003” Wiley Dreamtech 7. Tony Gaddis “Starting Out VB.NET PROG.2nd Edition” Wiley Dreamtech 8. Chris Ullman, Kauffman “Beg. ASP.NET1.1 with VB.NET 2003” Wiley Dreamtech 9. Chris Ullman, Kauffman “Beg ASP.NET1.1 with VC#.NET 2003” Wiley Dreamtech


Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-505 Elective-III : EIII(a) Distributed Systems

3 1 - 100 40 50 30 - - 150

UNIT-I Introduction to Distributed Systems : Goals of Distributed Systems, Hardware and Software concepts, the client server model, Remote procedure call, remote object invocation, message and stream oriented communications.

UNIT-II Process and synchronization in Distributed Systems : Threads, clients, servers, code migration, clock

synchronization, mutual exclusion, Bully and Ring Algorithm, Distributed transactions.

UNIT-III

Consistency, Replication, fault tolerance and security : Object replication, Data centric consistency model, client-centric consistency models, Introduction to fault tolerence, process resilience, recovery, distributed security architecture, security management, KERBEROS, secure socket layer, cryptography.

UNIT-IV

Distributed Object Based and File Systems : CORBA, Distributed COM, Goals and Design Issues of Distributed file system, types of distributed file system, sun network file system,.

UNIT-V

Distributed shared memory, DSM servers, shared memory consistency model, distributed document based systems : the world wide web, distributed co-ordination based systems: JINI Implementation: JAVA RMI, OLE, ActiveX, Orbix, Visbrokes, Object oriented programming with SOM

BOOKS 1. Andrew S. Tanenbaum, Maarten Van Steen “Distributed Systems Principles and Paradigms” Pearson

Education Inc. 2002. 2. Lui “Distributed Computing Principles and Applications”. 3. Harry Singh “Progressing to Distributed Multiprocessing” Prentice-Hall Inc. 4. B.W. Lampson “Distributed Systems Architecture Design & Implementation”, 1985 Springer Varlag. 5. Parker Y. Verjies J. P. “Distributed computing Systems, Synchronization, control & Communications”

PHI. 6. Robert J. & Thieranf “Distributed Processing Systems” 1978, Prentice Hall. 7. George Coulios, “Distribute System: Design and Concepts”, Pearson Education



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-505 Elective-III : EIII(b) Computer Vision and Digital Image Processing

3 1 - 100 40 50 30 - - 150

UNIT-I Introduction: The role of Computer Vision, applications, successes, research issues; its relationship to natural vision, basic image properties. Digital image representation, fundamental steps in image processing, elements of digital image processing systems digitization, Display and recording devices.

UNIT-II

Digital Image fundamentals: A simple Image model. Sampling and quantization, Relationship between pixel, imaging geometry, image transformation, introduction to fourier transformation, Discrete fourier transformation, fast fourier transformation.

UNIT-III

Image Enhancement: Histogram processing, image subtraction, image averaging, smoothing filters, sharpening filters, enhancement in frequency domain, low pass filtering, high pass filtering.

UNIT-IV

Image Encoding & Segmentation: Segmentation, detection of discontinuation by point detection, line detection, edge detection. Edge linking & Boundary Detection: Local analysis, global by Hough transform & Global by graph theoretic techniques.

UNIT-V

Image Representation and Description: Chain codes, polygonal approximation, signatures, boundary segments, boundary descriptors, regional descriptors, introduction to image understanding. Motion Tracking , Image differencing, Feature matching, Optic flow BOOKS 1. Gonzalez and Woods “Digital Image Processing”, Addition Wesley 2. Gonzalez and Woods “Digital Image Processing using MATLAB”, Addition Wesley 3. SchalKoff: Digital Image Processing & Computer Vision, Addition Wesley. 4. M. Sonka et.al : Image Processing and Machine Vision, Prentice Hall. 5. Ballard & Brown: Computer Vision, Prentice Hall. 6. Jain A. K. Fundamentals of Digital Image Processing, PHI 7. Boyle and Thomas, ``Computer Vision - A First Course'' 2nd Edition, ISBN 0-632-028-67X,

Blackwell Science 1995. 8. Low, "Introductory Computer Vision and Image Processing", McGraw-Hill 1991, ISBN 0-07-

707403-3



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-505 Elective- III : EIII(c )

Bioinformatics

3 1 - 100 40 50 30 - 150

UNIT-I Fundamentals of Bioinformatics and Information Technology : Introduction to bioinformatics, experimental

sources of biological data fundamentals of molecular biology available databases operating system, inclusing windows and Unix networks-including the intranets and the Internet.

Analytical science and Bioinformatics : High throughput sequencing, experimental determination of protein structures, Gene expression monitoring, proteomics, metabiomics.

UNIT-II

Protein Information resources : Introduction, biological databases, primary sequence databases, composite protein sequence database, secondary databases, composite protein pattern databases, structure classification databases, web addresses. Genome information resources : Introduction, DNA sequence databases, specialised genomic resources. DNA Sequence analysis : Introduction, why analyse DNA, Gene structure and DNA sequences, features of DNA sequence analysis, issues in the interpretation of EST searches, two approaches to gene hunting, the expression profile of a cell, cDNA libraries and ESTs, different approaches to EST analysis, effects of EST data on DNA databases.

UNIT-III

Pairwise alignment techniques : Introduction, database searching, alphabets and complexity, algorithms and programs, comparing two sequences a simple case, sub-sequences, identity and similarity, the dotplot, local and global similarity, global alignment the needleman and wunsch algorithm, local alignment the smith waterman algorithm, dynamic programming, pairwise database searching. Multiple sequence alignment : Introduction, the goal of multiple sequence alignment, multiple sequence alignment a definition, the consensus, computational complexity, manual methods, simultaneous methods, progressive methods, database of multiple alignment, searching databases with multiple alignments. Secondary database searching : Introduction, why bother with secondary database searches, what is a secondary database.

UNIT-IV

Bioinformatics tools : Visualisation of sequence data, sequence alignment, homology searching, inclusing BLAST, gene expression informatics, introduction to gene finding. Building a sequence search protocol : Introduction, a practical approach, when to believe a result, structural and functional interpretation. Analysis packages : Introduction, what’s in an analysis package, commerical databases, commerical software, comprehensive packages, packages specialising in DNA analysis, intranet packages, internet packages.

UNIT-V

Applications and commercial aspects of Bioinformatics : Drug discovery, genetic basis of disease, personalised medicine and gene-based diagnostics, legal, ethical and commercial ramifications of bioinformatics. Perl Programming : Data manipulation, file maintenance, pipelining, packaging and interfacing system facilities. Macromolecular Modelling and Chemoinformatics : Acquisition of chemical information, including molecular structure from databases visualisation of molecules simulation of molecular interaction introduction to industry standard modelling software.


BOOKS

1. Attwood TK & Parry-smith DJ “Introduction to Bioinformatics” 2001, Pearson Education Asia. 2. Setup Joao & Meidanis Joa “Introduction to computational Molecular Biology” PWS Publishing

Company, 1997 (An international Thouson publishing company). 8. Andreas D. Baxevan’s & B.F. Francis Quellette, “Bio Informatics: A Practical guide to the analysis of

Genes & Proteins”, Second edition 2001, A John wiley & Sons. 9. Martin Tompa Lechre notes on Biological sequence Analysis, Department of Computer Science &

Engineering, university of wasnington, seattle USA http:/www.cs.washington.edu/education/ courses / 527/ oowi/

10. Jean Michael “Bioinformatics : A beginner’s Guide”, Wiley India. Note : Paper is to be set unit wise with internal choice.

Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-505 Elective III : EIII(d) : Embedded Systems

3 1 4 100 40 50 30 - - 150

UNIT-I Princeton (Von Neumann) and Harvard Architecture, CISC and RISC architecture, General-purpose processor, microcontroller, Embedded processor, Digital Signal processor, Application specific processor, Super scalar, VLIW, pipelined Architecture. Definition of Embedded System, classification of embedded system, skills required for an Embedded System Designer, Trends in embedded system various examples of an embedded system, Challenges to design embedded system, embedded system development design methodology. UNIT-II

Hardware units required to design embedded system like power source, clock oscillator circuit, Real time clock and timer, reset circuit, watchdog timer, memories, interrupts, DAC and ADC, LCD and LED display,PWM, Keypad/keyboard, pulse dialer, modem and transceiver. UNIT-III Embedded Software: Development tools for embedded software, Assemblers, Compilers, Editor, Interpreter, Cross Assembler, Simulator, Emulator, Locator, Linker, Profiler, Coding strategies for obtaining optimized time and space requirements, Debugging Embedded Software, Software in high level language, coding of software in machine language, Software for Device drivers and device management. UNIT-IV Introduction to Real Time Operating System, comparison of RTOS with O.S., Tasks and Task States, Task and Data, Semaphores and Share data, Interrupt, Interrupt handler, Share data problem, Messages, Queue, Mailboxes and pipe. Introduction to U-COS II Real time operating system, main features of U-COS-II UNIT-V

Embedded Communication System: Standard for Embedded Communication, USART, SPI, I2C, CAN, USB, Firewire, Ethernet, Wireless communication like IRDA, Bluetooth, 802.11,PCI Bus, SoC, IP Core, Case Study of Digital camera BOOKS 1. Frank Vahid & Tony Givargis “Embedded System Design” John Wiley & Sons. 2. Dr. Rajkamal “Embedded System” TMH 3. David E.Simon “An Embedded Software Primer”Addison Wesley Longman Publication. 4. Prasad..K.V.K.K.:“ Embedded/Real Time System Concept & Design Black Book” Wiley

Dreamtech Publication. 5. Mark miller “VoIP” Wiley Dreamtech Publication



Theory Marks

Sessional Marks

Practical Marks

Total Marks


T (Hrs)

P (Hrs)


MCA-505 Elective-III : EIII (e)

Network Security

3 1 - 100 40 50 30 - 150

UNIT-I

Classical Encryption Techniques: Symantec Cipher model, substitution Techniques, tranposition techniques, rotor machines, steganography.

Block Ciphers and the Data Encyption standards: Simplified DES, block cipher principles, the data encryption standard, the strength of DES, differential and linear cryptanalysis, block cipher design principles, block cipher

modes of operation. Advanced Encryption Standard: Evaluation Criteria for AES, the AES cipher.

Contemporary symmetric ciphers: Triple DES, blowfish. Confidentiality using symmetric encryption: Placement of Encryption function, traffic confidentiality, key

distribution, and random number generation.

UNIT-II Public key Encryption and Hash functions : Prime numbers, Fermat’s and Euler’s Theorems, testing for

primality, the chinese remainder theorem, discrete logarithms. Public key cryptography and RSA: Principles of Public key cryptosystems, the RSA algorithm.

Key Management other public key cryptosystems: Key management, diffie-Hallman key exchange, elliptic curve arithmetic, and elliptic curve cryptography.

UNIT-III

Message authentication and Hash function : Authentication Requirements, Authentication functions, message authentication codes, hash functions, security of hash function and MACs.

Hash Algorithms: MD5 message digest algorithm, secure Hash algorithm, ripemd-160, HMAC. Digital Signature and Authentication protocols: Digital signatures, Authentication protocols, and digital

signature standard. Authentication Applications: Kerberos, X.509 Authentication service.

UNIT-IV

Electronic Mail Security: Pretty Good privacy, S/MIME. IP Security: IP Security overview, IP security architecture, authentication header, encapsulating security

payload, combining security associations, key management. Web Security: Web security considerations, Secure sockets layer and transport layer security, secure electronic

transaction.

UNIT-V Part four system security: Intruders, intrusion detection, and password management.

Malicious software: Viruses and related threats, virus countermeasures. Firewalls: Firewall Design Principles, Trusted systems.

BOOKS

1. William Stallings “Cryptography and Network Security”, 3 ed, Pearson Education. 2. W.Stallings “ Network security Essential “ Applications & Standards”, Pearson ed. 3. Kanfren “Network Secirity : Private Communications in a public world 2/e 4. Eric Maiwald “ Network Secirity : A Preginner’s Guide, second ed.”, Tata Mcgraw Hill. 5. Roberta Bragg “ Mark Rhodes, Ousley & Keith Strassberg Network Secirity : The Complete Reference “

Tata McGraw Hill. 6. Eric Maiwald “Fundamentals of Network Security” Wiley India.

� Academic Calendar of the University available in RGPV,Bhopal website www.rgtu.net


� Academic Time Table

MCA I, III,& V SEM

TIME TABLE

DAY SEM 1 2 3 4 5 6 7 8

TIME-----> 10.00 to 10.45 10.45 to 11.30 11.30 to 12.15 12.15 to 1.00 1.30 to 2.15 2.15 to

3.00 3.00 to

3.45 3.45 to

4.30

I

C-LAB L1/L2/L3 SS/MB/AA

CS B6 US MFCS B6

SKT IT

B6 SS PPSC-T

B6 MB

COALP B6 AS

SEMINAR B5 UD

III

CN B5 UD

OOM B5 SH COO-T B5

SKT

TOC B5 SoS

VB-LAB L1/L2 MS/AS/UD

SE B5 AA

SEMINAR B5 AS

M V

IN B6 MS

OB B6 US

UNIX-LAB L1/L2 UD/SH

UNIX -T B5 SH

DW B5 SoS

PROJ-LAB L1/L2 SS/SH

I

C-LAB L1/L2/L3 SoS/AS/AA

CS B6 US MFCS B6

SKT IT-T

B6 SS PPSC

B6 MB

COALP B6 AS

SEMINAR B6 AS

III

CN-T B6 UD

OOM B6 SS

OOPS-LAB L1/L2 SoS/SS/SH

SE B5 AA

COO B5

SKT

VB-LAB L1/L2

MS/SS/AS

T V

IN B5 MS

OB B5 US

ES B5 AS

DW-T B5 UD

UNIX-LAB L1/L2 UD/SH

UNIX B5 SH

SEMINAR B5 SoS

I

C-LAB L1/L2/L3 SoS/MB/AA CS-T B6

US MFCS B6

SKT IT

B6 SS PPSC

B6 MB

ALP-LAB L1/L2/L3

MS/UD/SS

III

CN B6 UD

OOM B5 SH

OOPS-LAB L1/L2/L3 SS/SH/AS

TOC B5 SoS

COO B5

SKT

SE-T B6 AA

SEMINAR B5 SoS

W V

IN-T B5 MS

OB B5 US

UNIX B5 SH

DW B5 SoS

PROJ-LAB L1/L2 MS/AA

ES B6 AS

SEMINAR B6 MB

I

C-LAB L1/L2/L3 AS/SoS/MB

CS B6 US MFCS B6

SKT COALP-T B6 AS

PPSC B6 MB

ALP-LAB L1/L2/L3

MS/SS/AA

III

OOM-T B6 SS

SE B6 AA

VB-LAB L1/L2/L3 MB/MS/SoS

TOC B5 SoS

CN B5 UD

COO B5

SKT

SEMINAR B5 MB

T V

IN B5 MS

OB-T B5 US

ES B5 AS

DW B5 UD

PROJ-LAB L1/L2 SKT/UD

UNIX B6 SH

SEMINAR B6 SH

I

ALP-LAB L1/L2/L3 SoS/AS/AA

CS B6 US MFCS-T B6

SKT IT

B6 SS PPSC

B6 MB

C-LAB L1/L2/L3

UD/MS/MB

III

CN B5 UD

OOM B6 SS

VB-LAB L1/L2 MB/SoS/SH TOC-T B5 SoS

SE B6 AA

COO B5

SKT

SEMINAR B6 SH

F V

IN B5 MS

OB B5 US

ES-T B6 AS

DW B5 UD

B R

E A

K

PROJ-LAB L1/L2 SKT/UD

UNIX B6 SH

SEMINAR B6 SS

I

ALP-LAB L1/L2/L3 MB/AS/AA COALP B6

AS PPSC B6

MB

III

SE B6 AA

OOM B6 SS

VB-LAB L1/L2 MB/MS/SH

S V

IN B5 MS

UNIX B6 SH

OB B5 US

DW B5 SoS

MB MANISH BAHRANI SH SHAILJA HOONKA MS MANISH SARAF AA AJAY ACHARYA

SKT SANDEEP KUMAR TIWARI SoS SONAL SHARMA

SS SUMEET SOHANE AS ASHISH SHRIVASTVA

US U. SHRIVASTVA UD UTKARSH DIXIT


MCA II & IV SEM

TIME TABLE

DAY SEM 1 2 3 4 5 6 7 8

10.00 to 10.45 10.45 to 11.30 11.30 to 12 .15 12.15 to 1.00

1.30 to

2.15 2.15 to 3.00 3.00 to

3.45 3.45 to 4.30

M II A/C (US) CONA (SKT) OS (AS) DBMS (SS) B DS

(MB) SEMINAR (AS/S0S)

DS LAB (MS/AS/SoS)

IV CG (UD) AI (SOS) MOC (VB) ME (US) R PROJECT

(UD/SH/MS) D&A (SH) SEMINAR (SS)

T II A/C (US) CONA (SKT) OS (AS) DBMS (SS) E DS

(SH) SEMINAR (SS/AS) DS LAB

(SH/MB/MS)

IV CG (UD) AI (SOS) D&A (UD) ME (US) A CG LAB (UD/MB)

MOC (VB) SEMINAR (SOS)

W II A/C (US) CONA (SKT) OS (AS) DBMS (SS) K DS

(MB) SEMINAR (SOS/MB)

SQL LAB (SS/SoS)

IV CG (UD) D&A (SH) MOC (VB) ME (US) CG LAB

(SH/SS/UD) AI

(SOS) SEMINAR (AS/SH)

T II A/C (US) CONA (SKT) OS (AS) DBMS (SS) DS

(SH) SEMINAR (SH/AS) SQL LAB

(SS/SH/MS)

IV CG (UD) SEMINAR (SOS) D&A (UD) ME (US) PROJECT

(MB/SS/UD) MOC (VB) AI (SOS)

F II A/C (US) CONA (SKT) OS (AS) DBMS (MB) DS

(SH) SEMINAR (SoS/SS)

SQL LAB (MS/SH/SKT)

IV CG (UD) SEMINAR (SS) MOC (VB) ME (US) PROJECT

(AS/MB/SKT) D&A (UD) AI (SOS)

S II A/C (US) CONA (SKT) OS (AS) DBMS (MB) DS

(SH) SEMINAR (SoS/SS)

SQL LAB (SOS/SH/SKT)

IV CG (UD) AI (SOS) MOC (VB) ME (US) PROJECT (MS/MB)

D&A (SKT) SEMINAR (MB)

MB MANISH BAHRANI

US U SHRIVASTVA

MS MANISH SARAF

SH SHAILJA HOONKA

SKT SANDEEP TIWARI

SOS SONAL SHARMA

VB VIVEK BADE

UD UTKARSH DIXIT

SS SUMEET SOHANE

As per AICTE norms,on an average, a Professor is having 8 periods as teaching load, Readers-12 periods and Lecturers-16 periods.

� Internal Continuous Evaluation System and place Yes. Students’ assessment of Faculty, System in place. Yes.

Date : 30.08.2007 Name of Signature of Place : Jabalpur Authorized Signatory with Seal

Documents

Mandatory Disclosure by Institutions Running AICTE Approved Engineering/Technology/MCA/PG Programmes To