mca_2015-2018_syllabus_19-april-2016

7/25/2019 MCA_2015-2018_Syllabus_19-April-2016

1/162

1


2/162

2

MCA (Part I) From Academic Year 2015-2016

MCA (Part II) From Academic Year 2016-2017

MCA (Part III) From Academic Year 2017-2018

(I) Introduction:1. The name of the programme shall be Masters of Computer Application (M.C.A)

2.

The knowledge and skills required planning; designing to build Complex Application SoftwareSystems. These are highly valued in all industry sectors including business, health, education andthe arts. The basic objective of the education of the Masters programme in Computer Application

(M.C.A) is to provide to the country a steady stream of the necessary knowledge, skills and

foundation for acquiring a wide range of rewarding careers into the rapidly expanding world of

the Information Technology.

3. The new Curricula would focus on learning aspect from four dimensions viz. Conceptual

Learning, Skills Learning and Practical / Hands on with respect to four specialized tracks viz.

1. Software and Application Development

2. Infrastructure and Security Management

3. Information Management & Quality Control

4. Networking

4. The M.C.A. Programme will be a full-time three years Master's Degree Course of Computer

Applications. In Second year the students will have to choose one of the four specialized tracks.

The Institute should conduct sessions for the students to make them aware about the subjects,

career prospects in the tracks. Making it easier for them to select one. Once a student selects a

TRACK he/she is not allowed to change the track. Thus it is important for the Institute to guide

the students for selecting the track.

5. The need for Specialization / Specialized tracks

The curriculum is designed to cater to the challenging opportunities being faced in

Information Technology.

The specialization approach would help students to develop basic and advanced skills in

areas of their interest thereby increasing their level of expertise. This would furtherpromote the Masters programme in focused areas and result in development of expert

skills as per the demands of career opportunities.

The specialization approach may in future be open to more areas of specialization and

hence make this programme successful in academia as well as in Industry.

The first year of the specialized course has taken into consideration all fundamental areas

and aspects of technical and management training required for this programme. A good

mix of computer related courses use microcomputers to introduce standard techniques ofprogramming; the use of software packages such as databases and programming

languages for developing applications; system analysis and design tools. The general


3/162

3

business courses include the functional areas of management like information systems

and decision support systems and engineering aspects of software development.

6. The Job Opportunities are

Many graduates begin their career at a junior level but are not in a position to map theirjob with expert technical skills obtained from a usual programme. The specialized

programme would enhance their exposure to variety of roles and responsibilities they can

take up in any areas of expertise. For e.g.: In the area of software development they could

take up responsibilities in areas of database, product development, product maintenance

and support in addition to management activities. Focused grooming would also make it easier for the IT industry to decide which graduate

could be mapped to the right domain.

Enabling entrepreneurship is also the need of the hour and students interested to be on

their own could leverage from the newly designed focused programme for entrepreneurs.

It will build right platform for students to become successful Software professional. This

would emphasize on domain knowledge of various areas.

7. The Institutes should organize placement programme for the M.C.A students, by interacting with

the industries and software consultancy houses in and around the region in which the educational

Institution is located.

8. At the end of the syllabus various certifications possible for each semester. Students should try to

do maximum Certifications in their learning phase only to make their resume rich.

9. Ordinarily, in each class, not more than 60 students will be admitted.

(II)

(A) Eligibility for Admission:

The eligibility criteria for admission for the MCA course will be as decided by the Competent

Authority (Director, Technical Education-Government of Maharashtra, &/or AICTE, New Delhi)

1. A candidate who has either passed with minimum 50% of marks in the aggregate (45% in

case of candidate who is domiciled in Maharashtra and belongs to the reserved categories i.e.

S.C., S.T., D.T., N.T., O.B.C., S.B.C.)

OR

appeared at the final year examination of a post 10+2 course of minimum three years duration

leading to an award of Bachelor's Degree, in any discipline by the Association of Indian

Universities or has passed with minimum 45% of marks in the aggregate (45% in case ofcandidate who is domiciled in Maharashtra and belongs to the reserved categories) or

appeared at an examination considered equivalent there to would be treated as eligible for

Common Entrance Test (CET). Also the candidate must have passed mathematics/Business

Mathematics & Statistics paper for 10+2 or graduation Level

AND

Passed the CET conducted by Director of Technical Education, Maharashtra State, with non-

zero scorefor that year or passed the CET conducted by state level MCA Association with

non-zero score for that year, or passed the AIMCET exam for that year.


4/162

4

2. However, a candidate would not be treated as eligible for admission to the

MCA programme unless he/she passes his/her qualifying examination with

requisite percentage on or before 30thSeptember of the concerned academic year and also

passes in the CET.

(B) Reservation of Seat:

The percentage of seat reserved for candidates belonging to backward classes only from

Maharashtra State in all the Government Aided, Un-aided Institutions/Colleges and University

Departments is as given below:

) Scheduled caste and Scheduled caste convert to Buddhism 13.0%

) Scheduled Tribes including those living outside specified areas 10.5%

) Vimukta Jati (14 as specified)

) Nomadic Tribes (NT1 )(28 before 1990 as specified) 2.5%

) Nomadic Tribes (NT2)(Dhangar as specified) 2.5%

)

Nomadic Tribes (NT3)(Vanjari as specified) 2.5%

) Other Backward Class 19.0%

Total 50.0%

1. Candidate claiming to belong to categories mentioned against (e),(f) and (g) above will

have to furnish certificate from appropriate authority that the candidate's parents do not

belong to Creamy Layer as per the relevant orders of the Government.

2. If any of the (a) to (g) categories mentioned above does not get the required number of

candidates for the percentage laid down in a University area, the seats so remaining

vacant shall be filled in from among the candidates of remaining reserved categories with

reference to the inter-se-merit of all candidates belonging to the reserved categories from

the same University area. However, the total reservation shall not exceed 50%. Afterdoing so the seats remaining vacant shall be filled in with reference to inter-se-merit of all

the candidates from the same University area.

(C) Selection Basis:

The selection would be done as per the guidelines given by the Director of Technical Education,

Maharashtra State, time to time.

(III) Number of Lectures and Practical:

Lectures and Practical should be conducted as per the scheme of lectures and practical indicated in

the course structure where one session is of 1 hr 30 min, though it is up to the individual Institute todecide the time for one session while designing the time table.


5/162

5

Practical Training and Project Work:

At the end of the sixth semester of study, a student will be examined in the course" Project

Work".

1. The Major Project work will be started in Semester V. It may be done individually or in groups in

case of bigger projects. However if project is done in groups, each student must be given aresponsibility for a distinct module and care should be taken to see the progress of individual

modules is independent of others.

2. Students should take guidance from an internal guide and prepare a Project Report on "Project

Work" back to back print (one copy) which is to be submitted to the Director of the Institute.

Wherever possible, a separate file containing source-code listings should also be submitted. Every

student should also submit soft copy of their project synopsis. Their respective Institutes should

forward the copy of this synopsis to the external panel members, in advance of the project viva

dates if asked for.

3. The Project Synopsis should contain an Introduction to Project, which should clearly explain the

project scope in detail. Also, Data Dictionary, ERDs, File designs and a list of output reports

should be included if required as per the project title and scope.

4. The project Work should be of such a nature that it could prove useful or be relevant from the

commercial/management angle.

5. The project report will be duly accessed by the internal guide of the subject and marks will be

communicated by the Director to the University along with the marks of the internal credit for

theory and practical to be communicated for all other courses.

6. The project report should be prepared in a format prescribed by the University, which also

specifies the contents and methods of presentation.

7. The major project work carry 250 marks for internal assessment and 250 marks for external viva.

The external viva shall be conducted by a minimum of one external examiner. The mini project

work would be departmental.

8. Project work can be carried out in the Institute or outside with prior permission of the Institute.

9.

Project viva-voce by the University panel will be conducted in the month of April-May.

(IV) Choice Based Credit System

Choice Based Credit System (CBCS)offers wide ranging choice for students to opt for courses based

on their aptitude and their career goals. CBCS works on the fundamental premise that students are

mature individuals, capable of making their own decisions.

CBCS enables a student to obtain a degree by accumulating required number of credits prescribedfor that degree.The number of credits earned by the student reflects the knowledge or skills acquired by

him / her. Each course is assigned a fixed number of credits based on the contents to be learned & the

expected effort of the student. The grade points earned for each course reflects the students proficiencyin that course. CBCS is a process of evolution of educational reforms that would yield the result in

subsequent years and after a few cycles of its implementation.

A. Key features of CBCS:

1. Enriching Learning Environment: A student is provided with an academically rich, highly

flexible learning system blended with abundant provision for skill development and a practical

orientation that he/she could imbibe without sacrificing his/her creativity. There is a definitemovement away from the traditional lectures and written examination.


6/162

6

2. Continuous Learning & Student Centric Concurrent Evaluation:CBCS makes the learning

process continuous. Likewise the evaluation process is not only made continuous but also made

learner-centric. The evaluation is designed to recognize the capability and talent of a student.

3. Active Student-Teacher Participation: CBCS leads to quality education with active teacher

student participation. This provides avenues to meet students scholastic needs and aspirations.

4. Industry Institute Collaboration: CBCS provides opportunities for meaningful collaboration

with industry and foreign partners to foster innovation, by introduction of electives and half credit

courses through the cafeteria approach. This will go a long way in capacity building of students

and faculty.

5. Interdisciplinary Curriculum:Cutting edge developments generally occur at the interface of

two or more discipline. The interdisciplinary approach enables integration of concepts, theories,

techniques, and perspectives from two or more disciplines to advance fundamental understanding

or to solve problems whose solutions are beyond the scope of a single discipline.

6.

Employability Enhancement:CBCS shall ensure that students enhance their skill/employabilityby taking up project work , entrepreneurship and vocational training

7. Faculty Expertise:CBCS shall give the Institutes the much needed flexibility to make best use

of the available faculty expertise.

B. Pre-requisites for successful implementation of CBCS

The success of the CBCS also requires certain commitments from both the students and the teachers.

1. The student should be regular and punctual to his classes, studious in carrying out the

assignments and should maintain consistency in his tempo of learning. He should make

maximum use of the available library, internet and other facilities.

2. The teachers are expected to be alert and punctual and strictly adhere to the schedules of teaching,

tests, seminars, evaluation and notification of results.

3. All teachers should notify the tentative schedule of teaching and tests of the entire semester,

including the dates of tests, dates of score notification and all other schedules, which can be

planned in advance.

4. The teachers are expected to adhere to unbiased and objective evaluation and marking of

concurrent evaluation scores (internal examinations) which will not only maintain the confidence

of the students, but, at the same time, ensure that merit is given due credit.

5. Transparency, objectivity and quality are the key factors that will sustain a good CBCS system.

6. At the post-graduate level, and in a professional programme, the syllabus is to be looked upon asthe bare minimum requirement to be fulfilled and sufficient emphasis shall be laid on

contemporary aspects, going beyond the syllabus.

C. Credits

Credit:The definition of credits can be based on various parameters - such as the learning hoursput in, learning outcomes and contact hours, the quantum of content/syllabus prescribed for the

course.


7/162

7

Each course is assigned a certain credit, depending on the estimated effort put in by a student. When

the student passes that course, he/she earns the credits associated with that course.

In the Credit system the emphasis is on the hours put in by the learner and not on the workload

of the teacher.Each credit can be visualized as a combination of three components viz. Lecture(L) + Tutorials (T) + Practice (Practical / Project Work) (P) i.e. LTP Pattern.

The effort of the learner for each Credit Point may be considered to have two parts:

a) One part consisting of the hours actually spent in class room / practical / field work

instructions andb) The other part consisting of notional hours spent by the Learner in self-study, in the library,

peer interactions, case study, writing of journals and assignments, projects etc. for the

completion of that course.

Every course offered shall have three components associated with the teaching-learning process of the

course, viz.

a)

Lecture (L):Classroom sessions delivered by faculty in an interactive modeb) Tutorial (T): Session consisting of participatory discussion/ self-study/ desk work/ brief

seminar presentations by students and such other novel methods that make a student to

absorb and assimilate more effectively the contents delivered in the Lecture sessions

c) Practice (P):Practice session /Practical / Project Work consisting of Hands-on experience /

Field Studies / Case studies that equip students to acquire the much requiredskill component.

The teaching / learning as well as evaluation are to be interpreted in a broader perspective as follows:

a) Teaching Learning Processes: Classroom sessions, Group Exercises, Seminars, Small

Group Projects, Self-study, etc.

b) Evaluation: Tutorials, Class Tests, Presentations, Field work, Assignments, Research papers,

Term papers, etc.

In terms of credits, for a period of one semester of 15 weeks:

a)

every ONE hour session per week of L amounts to 1 credit per semester

b)

a minimum of TWO hours per week of T amounts to 1 credit per semester,

c)

a minimum of TWO hours per week of P amounts to 1 credit per semester,

A course shall have either or all the three components, i.e. a course may have only lecture component,

or only practice component or a combination of any two or all the three components.

The total credits earned by a student at the end of the semester upon successfully completing a course

are L + T + P. Thecredit patternof the course is indicated as L: T: P.

If a course is of 3 credits then the different credit distribution patterns in L: T: P format could be3:0:0, 1:2:2, 2:0:2, 2:2:0, etc. The credits of a course cannot be greater than the number of

hours (per week for 15 weeks) allotted to it.

Full Credit Course: A course with Weightage of 4 credits is considered as a full credit course.

Half Credit Course: A course with Weightage of 2 credits is considered as a half credit course.

The MCA programme is a combination of:

a) Full Credit Courses (100 Marks each) : 4 Credits each

b) Half Credit Courses (50 Marks each) : 2 Credits each

D. Adoption of Credit and Grading System


8/162

8

As per national policy and international practices, it is proposed to adopt the Credit and

Grading System for the MCA programme w.e.f. AY 2013-14.

D-1 Rationale for adoption of the Credit and Grading System:

a)

Learners Perspective: The current practice of evaluation of students performance at the end ofa semester is flawed. The students are expected to express their understanding or mastery over the

content included in their curriculum for a complete semester within a span of three hours and

their efforts over the semesters are often completely ignored. It also promotes unhealthy practice

of cramming before the examinations and focusing on marks rather than on learning.

b) Evaluation Perspective: The present system of evaluation does not permit the flexibility to

deploy multiple techniques of assessment in a valid and reliable way. Moreover, the current

practice of awarding numerical marks for reporting the performance of learners suffers from

several drawbacks and is a source of a variety of errors. Further, the problem gets compounded

due to the variations in the marks awarded in different subjects. The raw score obtained by the

learner, is, therefore, not a reflection of his true ability.

In view of the above lacunae, it is desirable that the marking system used for the declaration of

results is replaced by the grading system. The system of awarding grades provides a more

realistic picture of learners ability than the prevailing marking system. Excellence in quality

education can be achieved by evaluating the true ability of the learners with the help of

continuous evaluation.

D-2 Salient features of the grading system:

1. In this system, students (learners) are placed in ability bands that represent a range of scores. This

ability range may be designated with alphabetical letters called as GRADE.

2.

Grading reflects an individual learners performance in the form of a certain level of achievement.3. The Grading system ensures natural classification in qualitative terms rather than quantitativeterms since it expresses a range /band of scores to which a learner belongs such as O,A,B,C,P & F

4. Grades can be interpreted easily and directly and can be used to prepare an accurate profileof a

learner.

5. A properly introduced grading system not only provides for a comparison of the learnersperformance but it also indicates the quality of performance with respect to the amount of efforts

put in and the amount of knowledge acquired at the end of the course by the learners.

D-3 Basics of Credit and Grading System

Grading is a method of reporting the result of a learners performance subsequent to his evaluation. It

involves a set of alphabets which are clearly defined and designated and uniformly understood by all

the stakeholders. Grading is carried out in a variety of ways. The classification of grades depends

upon the reference point.

With Approach towards Grading as the reference point, Grading may be classified as:a) Direct grading: When the performance exhibited by the examinees is assessed in qualitative

terms and the impressions so obtained by the examiners are directly expressed in terms of letter

grades, it is called, Direct Grading.


9/162

9

b) Indirect grading: When the performance displayed by the examinees is first assessed in terms of

marks and subsequently transformed into letter grades by using different modes, it is called,

Indirect Grading.

With Standard of Judgment, as the reference point Grading may be classified as:

a)

Absolute grading: The method that is based on a predetermined standard which becomes areference point for the learners performance is called Absolute Grading. This involves direct

conversion of marks into grades irrespective of the distribution of marks in a subject.

b) Relative grading: Relative Grading is popularly known as grading on the curve. The curve refers

to the normal distribution curve or some symmetric variant of it. This method amounts to

determining in advance approximately what percentage of learners can be expected to receivedifferent grades, such as O,A,B,C,D,E,F. In this grading system the grade is not determined by

the learners performance but on the basis of group performance.

Absolute grading has several advantages such as:

a) The procedure is simple and straightforward to use,

b) Each grade is distinctly understandable,

c)

The learner has the freedom to strive for the attainment of the highest possible grade andd) It enables the learners to know their strengths and weaknesses.

The few limitations of Absolute Grading method are:

a) The distribution of scores is taken at its face value regardless of the errors of measurement

creeping in due to various types of subjectivity.

b) Besides, the cut-offs of different categories are also arbitrarily decided.

It is proposed to use the Indirect and Absolute Grading System for the MCA programme i.e. the

assessment of individual Courses in the concerned examinations will be on the basis of marks. However

the marks shall later be converted into Grades by a defined mechanismwherein the overall performance

of the learners can be reflected after considering the Credit Points for any given course. The overall

evaluation shall be designated in terms of Grade.

E. Session Duration:Each teaching-learning, evaluation session shall be of 90 minutes. However, institutes shall have the

flexibility to define their time slots in a manner as to use their faculty and infrastructure resources in

the best possible way.

F. Courses Offered:Institutes are free to offer at least two specialized tracks. It is envisaged that Institutes offer only those

tracks /electives for which they have the required faculty competencies and relevant resources.

It shall be mandatory for the Institutes to provide all information relating to the specialized tracksoffered, their respective credits, evaluation pattern, etc. to all the students so as to enable them to

make an informed choice. Such information should be hosted on the website/prospectus of the

Institute in sufficient advance, prior to commencement of the classes. Other information such as thecredits, the prerequisites, and syllabus shall also be hosted on the website of the institute.

G. Registration:Such registration shall be the basis for a student to undergo concurrent evaluation, online evaluation

and end semester examination. Application forms for University examinations are to be filled up

based on the choices finalized during the registration process and submitted to the University along

with the prescribed examination fee.

G-1 Registration Process:


10/162

10

Each student, on admission shall be assigned to aFaculty Advisorwho shall advise her/him about the

academic programs and counsel on the choice of courses considering the students profile and career

objectives.

i. With the advice and consent of the Faculty Advisor the student shall register for a set of

courses he/she plans to take up for the Semester.ii. The student should meet the criteria for prerequisites, if defined for a course, to become

eligible to register for that course.

iii. The Institute shall follow a selection procedure on a first come first served basis, determining

the maximum number of students and counseling the students if required to avoid

overcrowding to particular course(s) at the expense of some other courses.iv. It is expected that a student registers for 27 credits in Semester I, II, III, IV, V and 25 Credits

in Semester VI.

v. The maximum number of students to be registered in each specialized TRACK shall depend

upon the physical facilities available. Every effort shall be made by the Institute to

accommodate as many students as possible.

vi. The Institute may not offer a specialized track if a minimum of 33% of students are not

registered for that course.

(V) Assessment:

In total 160 credits represent the workload of a year for MCA program.

Total credits=160, 1 credit = 15 lecture Hrs, 100 Marks Subject = 4 Credits

Semester I 27 credits

Semester II 27 credits

Semester III 27 credits

Semester IV 27 credits

Semester V 27 creditsSemester VI 25 credits

Credit hours are based on the number of "contact hours" per week in class, for one term; formally,

Semester Credit Hours. One credit will represent 12 to 15 teaching hours depending on technical and

management subjects.

The final total assessment of the candidate is made in terms of an internal (concurrent) assessment

and an external (university) assessment for each course. In total the internal (concurrent) to external

(university) marks ratio is maintained 50: 50.

In general

1. For each paper, 30% marks will be based on internal assessment and 70% marks for semester and

examination (external assessment), unless otherwise stated.

2. The division of the 30marks allotted to internal assessment of theory papers is on the basis of

tutorial paper and assignments of 15 marks and seminars / presentations and attendance of 15 marks.

3. The marks of the practical would be given on internal practical exam, oral and lab assignments.

4. The internal marks will be communicated to the University at the end of each semester, but

before the semester-end examinations. These marks will be considered for the declaration of the

results.


11/162

11

(VI) Examination:

Examinations shall be conducted at the end of the semester i.e. during November and in

April/May. However supplementary examinations will also be held in November and April/May.

VI-A

Concurrent Evaluation: A continuous assessment system in semester system (also known as internal

assessment/comprehensive assessment) is spread through the duration of course and is done by the

teacher teaching the course.

The continuous assessment provides a feedback on teaching learning process. The feedback after

being analyzed is passed on to the concerned student for implementation and subsequent

improvement. As a part of concurrent evaluation, the learners shall be evaluated on a continuous

basis by the Institute to ensure that student learning takes place in a graded manner.

Concurrent evaluation components should be designed in such a way that the faculty can monitor the

student learning & development and intervene wherever required. The faculty must share the

outcomeof each concurrent evaluation component with the students, soon after the evaluation, andguide the students for betterment.

Individual faculty member shall have the flexibility to design the concurrent evaluation components

in a manner so as to give a balanced assessment of student capabilities across Knowledge, Skills &

Attitude (KSA) dimensions based on variety of assessment tools.

Suggested components for Concurrent Evaluation (CE) are:

1. C S / C / S A (G A I A)2. C T

3. O B T

4.

F V / S 5. S G P & I VV6. L D

7. S B

8. G D

9. R P / S T

10.I T P / T P11.W H A

12.I A (G A I A)13.L R / B R

14.M D / S E (G A I A)

15.I V

16.Q

T

. T

. E

10 . T I

( /). H 30/50 . M

I U U. D C E

I. T U, .


12/162

12

A C E ( 30/50 ) NOT

G I, / F.

VI-BSafeguards for Credibility of Concurrent Evaluation: The following practices are encouraged to

enhance transparency and authenticity of concurrent evaluation:

a) Involving faculty members from other management institutes.

b) Setting multiple question paper sets and choosing the final question paper in a random manner.

c) One of the internal faculty members (other than the course teacher) acting as jury during activity

based evaluations.

d) Involvement of Industry personnel in evaluating projects / field based assignments.

e) Involvement of alumni in evaluating presentations, role plays, etc.f) 100% moderation of answer sheets, in exceptional cases.

(VII) Standard of Passing:

Every candidate must secure at least Grade P in Concurrent Evaluation as well as University Examination

as separate heads of passing for each course.

Conversion of Marks to Grade Points & Grades: The marks shall be converted to gradepoints and grades using Table I below.

Table I: Points Grading System

Sr. NoMarks

Grade

Grade

Point

1 80-100 O : Outstanding 10

2 70-79 A+ : Excellent 9

3 60-69 A: Very Good 8

4 55-59 B+ : Good 7

5 50-54 B:Above Average 6

6 45-49 C: Average 57 40-44 P:Pass 4

8 0-39 F:Fail 0

9 Ab : Absent 0

Reassessment of Internal Marks:


13/162

13

In case of those who have secured less than passing percentage of marks in internal i.e. less than

40%, the institute will administer a separate internal test. The results of which may be conveyed

to the University as the Revised Internal Marks.

In case the result of the revised internal test is lower than the original marks then the original

marks will prevail. In short, the rule is higher of the two figures should be considered.

However, the institute will not administer any internal test, for any subject for those candidates

who have already secured 40% or more marks in the internal examination.

VIII) Backlog:

Candidates can keep terms for any semester of M.C.A., irrespective of the number of subjects in

which he/she has failed in the previous MCA semester examinations.

(IX) Board of Paper Setters /Examiners:

For each Semester and examination there will be one board of Paper setters and examiners for

every course. While appointing paper setter /examiners, care should be taken to see that there is at

least one person specialized in each unit course.

(x) Class:

The performance of a student will be evaluated in terms of two indices, viz.

a) Semester Grade Point Average (SGPA)which is the Grade Point Average for a semester

b) Cumulative Grade Point Average (CGPA)which is the Grade Point Average for all thecompleted semesters at any point in time.

Semester Grade Point Average (SGPA): At the end of each semester, SGPA is calculated as

the weighted average of GPI of all courses in the current semester in which the student has

passed, the weights being the credit values of respective courses.

SGPA = Grade Points divided by the summation of Credits of all Courses.

{C * GPI}

SGPA = ----------------------for a semester.

C

Where GPI is the Grade and C is credit for the respective Course.

Cumulative Grade Point Average (CGPA):Cumulative Grade Point Average (CGPA) is the grade point

average for all completed semesters. CGPA is calculated as the weighted average of all GPI of all courses

in which the student has passed up to the current semester.

Cumulative Grade Point Average (CGPA) for the Entire Course

{C * GPI}

SGPA = ---------------------- for all semesters taken together.

C

Where GPI is the Grade and C is credit for the respective Course.


14/162

14

IMPORTANT NOTE:If a student secures F grade in either or both of Concurrent Evaluation or University Evaluation

for a particular course his /her credits earned for that course shall be ZERO.

Award of Grade Cards: The University of Pune under its seal shall issue to the learners a grade card on

completion of each semester. The final Grade Card issued at the end of the final semester shall contain

the details of all courses taken during the entire programme for obtaining the degree.

Final Grades: After calculating the SGPA for an individual semester and the CGPA for entire

programme, the value shall be matched with the grade in the Grade Points & Descriptors Table as per the

Points Grading System and expressed as a single designated GRADE (as per Table II)

Table II: Grade Points & Descriptors

O: Outstanding Excellent analysis of the topic, (80% and above)

Accurate knowledge of the primary material, wide range of reading,

logical development of ideas, originality in approaching the subject, Neat

and systematic organization of content, elegant and lucid style;

A+ : Excellent Excellent analysis of the topic (70 to 79%)

Accurate knowledge of the primary material, acquaintance with seminal

publications, logical development of ideas, Neat and systematic

organization of content, effective and clear expression;

A: Very Good Good analysis and treatment of the topic (60 to 69%)Almost accurate knowledge of the primary material, acquaintance withseminal publications,logical development of ideas, Fair and systematic

organization of content, effective and clear expression;B+: Good Good analysis and treatment of the topic (55to 59%)

Basic knowledge of the primary material, logical development of ideas,

Neat and systematic organization of content, effective and clear

expression;

B: Above Average Some important points covered (50to 54%)

Basic knowledge of the primary material, logical development of ideas,

Neat and systematic organization of content, good language or expression;C: Average Some points discussed (45 to 49%)

Basic knowledge of the primary material, some organization, acceptable

language or expression;

P: Pass Any two of the above (40 to 44%)

F: Fail None of the above (0 to 39%)


15/162

15

A student who secures grade P or above in a course is said to have completed /earned the credits assigned

to the course. A student who completed the minimum credits required for the MBA programme shall be

declared to have completed the programme.

NOTE:

The Grade Card for the final semester shall indicate the following, amongst other details:a) Grades for concurrent and university evaluation, separately, for all courses offered by the

student during the entire programme along with the grade for the total score.b) SGPA for each semester.

c) CGPA for final semester.

d) Total Marks Scored out of Maximum Marks for the entire programme, with break-up of Marks

Scored in Concurrent Evaluation and University Evaluation.

e) Marks scored shall not be recorded on the Grade Card for intermediate semesters.f) The grade card shall also show the 10-point scale and the formula to convert GPI, SGPA, and/or

CGPA to percent marks.

(XI) Medium of Instruction:The medium of Instruction will be English.

(XII)Clarification of Syllabus:

It may be necessary to clarify certain points regarding the course. The syllabus Committee should

meet at least once in a year to study and clarify any difficulties from the Institutes.

(XIII) Revision of Syllabus:

As the computer technology is changing very fast, revision of the syllabus should be considered

every 3 years.

(XIV)Attendance:The student must meet the requirement of 75% attendance per semester per coursefor grant of

the term. The Director shall have the right to withhold the student from appearing for examination

of a specific course if the above requirement is not fulfilled.

Since the emphasis is on continuous learning and concurrent evaluation, it is expected that the

students study all-round the semester. Therefore, there shall not be any preparatory leave before

the University examinations.

(XV)ATKT Rules:

A student shall earn the credits for a given course in MAXIMUM FOUR ATTEMPTS.

(XVI)Maximum Duration for completion of the Programme:

The candidates shall complete the MCA Programme WITHIN 5 YEARS from the date of

admission, by earning the requisite credits. The student will be finally declared as failed if she/he

does not pass in all credits within a total period of four years. After that, such students will haveto seek fresh admission as per the admission rules prevailing at that time.


16/162

16

MCA LLAB CE 20152018

EMEE I

CCP E IN

1. F C IT11 4 70 30

2. C P D S IT12 4 70 30

3. S E IT13 4 70 30

4. D M S IT14 4 70 30

5. P P M

O B

BM11 470 30

6. B P D* BM12 2 70

P*

7. C DS L IT12L 2 50

8. DBMS L IT14L 2 50

*

9. W P SS11 1 30

I ME I

27 350 350

EMEE II

CCP E. I.

1. E O S IT21 4 70 30

2.

W T IT22 4 70 303. C J IT23 4 70 30

4. E N IT24 4 70 30

5. D M MT21 4 70 30

6. E M* BM21 2 70

P *

7. M P W T IT22L 2 50

8. C J L IT23L 2 50

*

9. O C SS21 1 30

II M E I

27 350 350


17/162

17

EMEE III

CCP E. I.

COMMON BJEC FO ALL ACK FO EMEE III

1.

P C MTC31 4 70 302. M T P* ITC31 2 70

3. S SP * SSC31 1 30

ACK I : OFAE & APPLICAION DEELOPMEN

4. A D S C++ T1IT31 4 70 30

5. D A A (DAA) T1IT32 4 70 30

6. O O A D T1IT33 4 70 30

7. A I T T1IT34 4 70 30

P*

8. DS & C++ L T1IT31L 2 50

9. M P AIT T1IT34L 2 50

ACK II :INFACE & ECI MANAGEMEN

4. IT I A T2IT31 4 70 30

5. D C A & S M T2IT32 4 70 30

6. I I S T2IT33 4 70 30

7. O A T T2IT34 4 70 30

P*

8. M P IT A I S T2IT31L 2 50

9. O A T L T2IT34L 2 50

ACK III : INFOMAION MANAGEMEN & QALI CONOL

4. E R P T3IT31 4 70 30

5. D C & C N T3IT32 4 70 30

6.

D W, M, BI T& T3IT33 4 70 307. I S & A T3IT34 4 70 30

P*

8. DCCN L T3IT32L 2 50

9. BI T L T3IT33L 2 50

ACK I :NEOKING

4. N A I T4IT31 4 70 30

5. W S C T4IT32 4 70 30

6. IT I M T4IT33 4 70 30

7. L A I T4IT34 4 70 30

P*

8.

N A L I T4IT31L 2 509. S C L (W L) T4IT32L 2 50


18/162

18

EMEE I

CCP E. I.

COMMON BJEC FO ALL ACK FO EMEE I

1. O T ITC41 4 70 30

2. R M & S T* ITC42 2 70

3. S S I * SSC41 1 30


4. A J T1IT41 4 70 30

5. P T1IT42 4 70 30

6. A DBMS T1IT43 4 70 30

7. C C T1IT44 4 70 30

P *

8. A. J L T1IT41L 2 50

9. P P L T1IT42L 2 50

ACK II :INFACE & ECI MANAGEMEN4. I A M T2IT41 4 70 30

5. IT A S T2IT42 4 70 30

6. I S A T2IT43 4 70 30

7. E S A T2IT44 4 70 30

P *

8. I A M L T2IT41L 2 50

9. M P IT A S E SA

T2IT42L2

50


4. E C & K M T3IT41 4 70 30

5. C L & I P R T3IT42 4 70 306. C R M& S C M T3BM43 4 70 30

7. S Q A & C T3IT44 4 70 30

P*

8. M P CRM & SCM T3IT43L 2 50

9. S Q A L T3IT44L 2 50

ACK I :NEOKING

4. N A II T4IT41 4 70 30

5. I T T4IT42 4 70 30

6. L A II T4IT43 4 70 30

7. W N T4IT44 4 70 30

P*

8.V L T4IT41L 2 509.W N L T4IT44L 2 50


19/162

19

EMEE

CCP E. I.

COMMON BJEC FO ALL ACK FO EMEE

1. S P M ITC51 3 70 2.P * ITC51P 3 100

3.S S G D* SSC51 1 30


4. ASP .N C# T1IT51 4 70 30

5. S O A T1IT52 4 70 30

6. B D A T1IT53 4 70 30

7. M A D T1IT54 4 70 30

P *

8. M P ASP .N T1IT51L 2 50

9. M P U M A D T1IT54L 2 50

ACK II :INFACE & ECI MANAGEMEN

4. Q T2IT51 4 70 30

5. I A & I T2IT52 4 70 30

6. IT S M T2IT53 4 70 30

7. D I

T2IT54 4 70 30

P*

8. M P I A T2IT52L 2 50

9. D

T2IT54L 2 50


4.S T & T T3IT51 4 70 30

5.E D T3BM52 4 70 30

6.D S S T3IT53 4 70 30

7.B A T3IT54 4 70 30

P *

8. CASE T L T3IT51L 2 50

9. A E D T3BM52L 2 50

ACK I :NEOKING

4. N R A T4IT51 4 70 30

5. C N S T4IT52 4 70 30

6. C A S T4IT53 4 70 30

7. U C T4IT54 4 70 30

P *

8. C N S L T4IT52L 2 50

9. C B O (D

)T4IT53L 2 50


20/162

20

EMEE I

CCP E. I.

COMMON BJEC

1. O TRACK* ITC61 3 70P *

2. O LAB ITC61L 1 30

3.P ITC61P15 250

6 150

* : D S

CP : C P

E. : E S

I. : I

H

1 O IDE C/C++ E/JAVA/W

O () : WAMP/XAMP .

2 O S D: P SQL/MSQL/SQL .

3 O S A P: T E. M/GC/LSMB/TCASH

4 O S : WPS O F/S O/O O/ LO .

5 O O S : L (F/U) .

6 M W O S 20 M 60

7 T S O L & O W

W S : M W S 20 60

L S : F/U

N: I .

H :

D C : P: D C RAM: M. 2 GB A

: P: X/ AMD

RAM: M 8 GB

N: NC


21/162

21

EMEE I

EMEE I.

N.

C I E

1 IT11 F C 30 70

O: T , .

T .

.

N D

%

N.

1 I D C1.1 C D C

1.2 T S S /

1.3 A / U S.

1.4 C, I, A, L, L

14 05

2 D B A2.1 B, O, H

2.2 1 2 .

2.3 B A. & N S BCD, EBCDIC,ASCII, DM T, D T, KM,

S , P S, A R, L,L C, NOT,AND, OR, NAND, NOR, XOR, XNOR,

G

15 06

3 C C

3.1 H / F A

3.2 D / E

3.3 M / DM

1405

4 C4.1F F SR, D, JK, M S, E T D

4.2 S R

4.3 C, S & A , B

, 10

14 05

5 M

5.1M H

5.2P M DRAM, SDRAM,DDR, RDRAM. ROM,

PROM, EPROM, EEPROM

5.3C S

5.4DMA, DMA

15 05

6 CP O

6.1 CPU B B6.2 CPU R, S C, I

, ( )

6.3 A M

6.4 I C, I

6.5 I E 6.6 H M P

6.7 RISC . CISC

28 14


22/162

22

6.8 P D P, T S D, H

B

1. C O & A C, P

2. C S A M M, P, 3E.3. A. C A K, T MGH.

4.

D C E M, T MGH,4E5. M C S Y C L & G G

6. D E B B, MGH7. I D C D V. R & R, PHI

8. C O A W. S, P, 8E

9. I M P B B, P, 7E

10. C O & D P C,PHI, 3E

11. M A R G, P I P, 6

E.

12. C A & O J.P. H, MGH,3E13. C O H, T MGH,5E

14. D L C D M M

15.

A I I F P J A,P,3E16. F 3E P K. S & P S

I

.N.

C

I E

2 IT12 C P D S 30 70

O: T . T

, , .T

C++, J . B C DS

.

.N

D%

N.

1 1A O C1.1 A B H C

1.2 F & C1.3 S C P

1.4 P D L C1.5 C V I1.6 C & E C P

O DOS& UNIX, L

3 1

2 2 , D , O & E2.1 C S , C T K & I

C, I, F P, C, S,E

2.2 B / E

2.3 D T C , V D & D, UD T

2.4 O & E A, R, L,I , D , B , A,

5 2


23/162

23

C,

T E I T

C, E T C2.5 P & A O.

2.6 B I/O F I, C I &

O , FI & O (/), &

3 3 C

3.1 I3.2 S S

3.3 I, N , ., L3.4 , , N ,

3.5 I S , , , & ,

3.6 J S G & ,3.7 ()

3.8 C S, N S

5 2

4 4 A & 4.1 S D A D, I,A E, M R

4.2 M A D, I,A E, M R.

4.3 S ( ) D, I, SM F.

8 3

5 5 P

5.1 I B P, M O,A P, D O , I

P

5.2 P E , D P V P,P A

5.3 P &, * , P P, CP,

5.4 P A, P , A 5.5 D M A (), (), (),

(), ()

10 4

6 6 F6.1 I T , D & D,

A &

6.2 P C & C 6.3 P , , P

6.4 R

8 3

7 7 , , E &

7.1S D I S, AS , S A, A S,

N , P S , S

P, 7.2 U D I U

7.3 A , D S &U, E

12 4

8 8.I F H8.1 I8.2 O F C F

8.3 I/O O F8.4 E H D I/O O

8.5 R A T F

10 4


24/162

24

9 9.

9.1 L B

9.2 S S , I , B 8 4

10 10 B D

10.1 D S10.2 I D S 2 1

11 11 A D 11.1S R A11.2 A A

11.3 P R U AA T P

M T P11.4 S M

A S M

T S M

5 2

12 12 12.1 I12.2 D

12.3 O S12.4 S I S

12.5 A S12.6 R12.7 I, P & P

12 5

13 13 Q

13.1 I13.2 D Q

13.3 O Q

13.4 S I Q

13.5 T Q C Q, P Q13.6 DEQ13.7 A Q

13.8 R S Q

12 5

Reference Books

1. C: T C R: H S, T MG H, 6 E

2. M C : PHI : A G3. L C S: Y.P. K, BPB,10 E4. S O C: M C, JAICO.

5. P C : S. K, CBS.6. C P L: K & R, PHI,2 E7. P C: R. H.

8. G U C: Y. K, BPB.9. P ANSI C, E. B, T MG H,5 E

10. D S U C C++ : L Y, PHI,2 E.11. M D S : A G12. C & D S: D

13. DS C : Y.P. K14. ..15. ..


25/162

25

EMEE I.

N.

C I E

3 IT13 S E 30 70

. N D

%

N.

1 O A

1.1 B S D L C

1.2 D S

D:

W

P

S ( WINWIN S)

RAD

1.3 G B A: JAD

1.4 R & S A

10 4

2

2.1R A

2.2R I

F

2.3R S

S S (SRS)

S

S

Q ,

,

IEEE SRS ,

F C

20 8

3 I A

3.1 D A T

D T,

D T,S E

3.2 F D D

3.3 P D F D

3.4 E R D: I E&R

3.5 D

C D FDD, DFD

23 9

4 D I, O P

4.1 D & C

O I D,

D C GD S D,

I V

4.2 D

O O

D T O O

4.3 U I :

15 6


26/162

26

E ,

D

F GUI, M, S , ,

, , , .

4.4 D S

4.5

C DC

5 M

5.1 T M

5.2 I

5.3 R ER

10 4

6 CAE

6.1 I CASE ,6.2 T CASE

P M T. A , D ,

P , P , M, A CASE T

10 4

7 C E7.1 S E & .I W E A M

S, E P

12 5

B

1. S E P, TMH,7E.

2. S A D J,N P, 3E

3. S E S,P,8E

4. S E W S J,TMH.

5.

S A & D W, B,TMH,7

E.6. S A & D E A, G P,7. O O M & D J R, PHI

8. A & D I S J S, TMH, 2E.9. A & D I S V. R,PHI,3E.

10.S E C R F,TMH.


27/162

27

EMEE I.

N.

C I E

4 IT14 D M S 30 70

O: T , , SQL

. T ..

N D

%

WN. S

1 B

1.1 D N DBMS

1.2 C DBMS

1.3 D U

1.4 3 DBMS ( 2)

1.5 V

1.6 D I

5 2

2. D M2.1 I

2.2 R & O

2.3 C R & R

2.4 R , ,

,

2.5 G,

2.6 S D

2.7 S SQL

13 5

3. M

3.1 C

3.2

R & R

R

R A

3.3 R

3.4 D SQL, V

3.5 Q SQL, S I SQL,S P SQL /

MSQL

15 6

4 D

4.1 D D ER R4.2 F

4.3

NN

(1 NF, 2 NF, 3 NF, BCNF, 4 NF, 5 NF)4.4 L

177

5 A C 5.1 C , ACID

5.2 S5.3 S ,

5.4 C 5.5 L

5.6 T 5.7 G

187


28/162

28

5.8 D

6 C B

6.1F

6.2

6.3R & A

6.4L

6.5R

6.6F NV

6.7D &

6.8R B S

15 6

7

7.1D

7.2D &

7.3M

7.4E &

15 6

8 N SQL DI,T NOSQL,N NSQL , U C

2 1

B

1. I C.J.D, P.

2. D K, TMH,5 E.

3. P D M J M, PHI.

4. E MIS S B P A G E B

5. F D S E N, P,5 .

6. O R B, PHI.

7. O G B,P,3 E.8. D M S B D, G P.9. D A , & C &

B,P,4 E.

10. D M R & G, MGH,3 E.11.NSQL D: A B G E W P P M F

N:

1. PL/SQL 2. P SQL/ MSQL L L .

3. R C .

4. C ER , N SQL


29/162

29

EMEE I.

N.

C I E

5 BM11 P P M O B

30 70

O: T .

.

N D

%

N.

1

M

1.1 T , 1.2M D

1.3T M1.4M /H

1.5M : P , O , S ,D, C

1.6M : T, C, H R

1.7 T : F, S, G

1.8L

10 4

2

E M

2.1H 2.2C T : T, F

2.3B : HR AB S A

2.4M S A

2.5S , MIS

2.6C

104

3

M D M

3.1 I

3.2D

O S, C D , ,

3.3 D T /

S , U , P &N

D

C MA

3.4 D

A, P, C,

3.5 D M T

3.6 H S' M

3.7 P R / B R

10 4

4

O4.1 I

4.2 N O4.3 P O

4.4 O

10

4


30/162

30

I N: T U 3,4,5 6 . A O B ,

, , .

B

1. P P M S

2. E 7 K H &W H TMH

3. M T P A P B & T4. M. P F I & G, D

5. O S R P 13 6. O K D

7. O F L TMH 10

8. O D.A THI 7

F , P O,

T O

5

O B

5.1 D / C5.2 N //

5.3 A

5

2

6 I B

6.1 E S6.2 T A

6.2 J W

10

4

7 G G D 10 4

8 B 10 4

9 L 8 3

10 C M 10 4

11 M : C, , 7 3


31/162

31

EMEE I.

N.

C I E

6 BM12 B P D* 70

O:

1.

T & 2. T CRM SCM.

3. T 4. T .

.

N D % N.

1

& D

1.1 S B M S / C / P

S A (W

) M N G

7.5 3

2

H

2.1 E D

2.2 R T

2.3 E A P, LA P S ,

I T , L A, PF , B, EG, I, S, A

CEH : I

7.5 3

3B C

S B A R ,AM EB

7.5 3

4

C M(CM)

4.1 I, C, S

4.2 C R (CRM) I,

C, S

4.3F : D P

7.5 3

5

F A

5.1 D E A , C

, A , D

5.2 J E R J ,

L, , T

5.3 F A P T ,

A B P F

30 12


32/162

32

6

C A

6.1 S O C A C

, A C A, C

.

6.2 T C A

)M , B , ,

)S , V

)B C T F B

V F B, P S &

F

6.3 C M A O

M A, C C

40 16

B

1. S C M S, P & O S C, P M, D. V.

K, P E.

2. M I S J M, O U P

3. C A M G B P D & S S

4. P/ H R M D DC, S R, P H

I,2008, 3 E

5. H R M J. J B, T MG H P, 4E6. P M C B M, H,29 E.

7. B A D. M O, E P

8. C M S I,E P,18 E.

9. M A D.S P

10. M A K J, TMH.


33/162

33

I

.

N.

C I E

7 IT12L C & DS LAB 50

Objective :T C & DS .

Assignments:

1. F A, P S & R.

2. F . A 3 .3. C 4. F N5. C ^6. P N.7. P N.

8. A N.9. F T10. F S11. I D, B & H .12. LCM & GCD

13. W .14. I & D .15. T 16. M 17. D & 18. A S .. , E , P 19. F & 20. F &

21. F & 22. F .23. F D 24. W .25. R .. , 26. S .. , , , , 27. P A

28. W .29. W .30. W .31. B F H ( ) D , W C , .

32. L E.33. S S , I , B . ( O I )

Data Structure:1.A M T P.

2. A T S M.3. S I S I.4. S A: I I, P & P5. S A: P & M P.6. S I Q7. Q A: J S, P Q, C Q8.R S Q

* N : O S S Q.


34/162

34

EMEE I.

N.

C I E

8 IT14L DBMS L * 50

O :T , SQL &PL/SQL, .

1. O RDBMS, I P SQL

2. S, PSQL

3. I SQL DDL, DML, DTL, B D T

4. C D, S D, D D

5. C T, D T, I Q, S Q

6. O, E, W C, AND & OR C

7.

U Q, D Q, L C, L C8. O B, G B, W C, H C, D K

9. C, J, U C, NULL V, A S

10.A C, T T, T L, S Q, A,

P

11.F: D & T, S F, A F

12.P SQL I: C/C++ / J/PHP/P

13.S , C, & ,

14.S I, ,

15.V I, , ,

16.I I, , ,

17.P DBAU , U,G,R

18.R SQL T, B, , , , SQL, B ,

19.PL/SQL I PL/SQL,A PL/SQL,S SQL,

E PL/SQL

20.PL/SQL & D T

21.PL/SQL A % , %,

22.C C I , , S

23.P D, , P

24.FD, , P

25.C

26.D T D, , ,T , &

B:

1. PSQL K D, S D ISBN #0735712573, N R

2. PSQL E R B S ISBN #0735711216, N R

3. B D PSQL R S, N M ISBN #1861005156,

W P I

4. P PSQL J C. W, J D. D ISBN #1565928466, O'R


35/162

35

EMEE I.

N.

C I E

9 SS11 S S W P* 30

O:T E E. U /E S .

, . I C E 1.

B:

1. E E G R M C U P

2. C IELTS C U P

3. M E G R M C U P

4. S E E K M/N.P.SM

5. E C P G TT MGH C


36/162

36

EMEE II

EMEE II

.N. C I E

1 IT21 E O 30 70

O : T L O .N

D%

N.

1

I

1.1 OS D,

1.2 L V , U V,

1.3 C S C & S P (O

)

1.4 C OS

1.5

C V M

104

2

P M

2.1 P C

2.2 P C B

2.3 P : C, K, , ,

,

2.4 I C, IPC

2.5 IPC CS, RTOS

156

3

CP

3.1 S C

3.2 S C

3.3 S

3.4

N 3.5 S E

3.6 S C

15 6

4

P &D

4.1 S

4.2 SR

4.3 C S P & S

4.4 M4.5 D

4.6 D &

4.7 D D

4.8 N D

4.9 D R

20 8

5

M M5.1 C

5.2 M M T5.3 C & N C

5.4 L & P M

5.5 C L P

5.6 MFT MVT

5.7 N

5.8

P, S

20 8


37/162

37

5.9 N

P .

5.10 S

5.11 V M C

5.12 D

P R A F

5.13 T

6 F

6.1 F S

6.2 P6.3 FILE I

6.4 D

6.5 F S M

6.6 A M

6.7 E & P

6.8 R

104

7 D M7.1 D S7.2 D S

7.3 N D

7.4 D

7.5 S S M

7.6 RAID

7.7 D

10

4

B

1. O S : A G,TMH,2E.

2. O S : G,W,8

E.3. S P & OS : D.M. D, TMH,2E.4. R H B C F L : C N (W P.)

5. O S : A T, PHI,3E.


38/162

38

EMEE II.

N.

C I E

2 IT22 W T 30 70

O:

T , .T HTML ,

, DHTML.

.

N D

%

N.

1

HML

1.1. I T HTML, WWW, W3C, C HTML

1.2. T , O & U L,

1.3. I

1.4. C

1.5. T

1.6. T

1.7. F

1.8. F

1.9. I , , ,

L , , .

2510

2

C

2.1I S S

2.2T S

2.3I, E, E CSS.

2.4CSS B, , P, , , ,

, , , , ,

2.5U I & CSS

2.6 &

2.7I CSS3 : G, T,

A,

20 5

3

J

3.1C , T S,I

3.2V,

.

3.3O ,

3.4E ,

3.5C ,

(, , , , , ,.)

3.6C , , ,

3.7M , .

3.8E

3.9M .

3.10 S ,

3.11 DOM , DOM

30 15


39/162

39

3.12 W , H ,

3.13 L

3.14 V , ..

4

AP

4.1I ASP

4.2H IIS

4.3ASP ,,

4.4ASP F

4.5ASP S C

4.6ASP G.

4.7ASP O R,R,A,S.4.8ASP D I

,R,U,D.

P D

25 10

B

1. C HTML, TMH,2. JS B, W P.

3.

HTML, DHTML, JS, P & CGI I B, BPB P4. VB S P W P

5. P W W W R W. S

6. W C A D HTML, DHTML7. VBS P P

8. VBS N :

1. ://.3.

2. ..


40/162

40

EMEE II

. N.

C I E

3. IT23 C J 30 70

O:T J L

,

.

N D

%

N.

1

F OOPW OOP

D P O

B OOP O, , ,

, ,

5 2

2

I JAAH J

F JD C++ & JAVA

JDK E

J V MJ R

2.51

3

P C B JI K

D T J

J CE J

C ,

A G & ()

5 2

4

J

D O

A

A

C

M , ,

N & I

W CS (S A, S M, SB)

10 4


41/162

41

5

I

S & A

M

D D

10

4

6

P I

I U

M & A (D, , ,

, )I U

A

10 4

7

E

T E

, , , , C

N M U

7.5 3

8

J I OJ IO

F C

B/C SB /

F /

P F S / R

S

7.5 3

9

M

M C

T L CC A

T P

T I

10 4

10

A C G

C, F PL M

. B L. F L

. G L

10 4


42/162

42

B

1. J J P V L

2.

OOP J A T J A B,

3. J 6 P B B B K S I, T P

4. C J 2 V I C S H, F C, S M P

5. C J 2 V II C S H, F C, S M P

6. P J, A P E.B, MGH, 4 E.

7. O , E ,M G H, RB, S TS, X C

8. A G SCJP , P,K A. M, R W.

R.

. C L

AWT C

E D M

. E S H

. E C, L, A C

11

AA

C

D W B .

T HTML APPLET T .

P P

E

A D A V A

5 2

12

F M C

S

JB, JR B, JA , JCB, JT,JPB, JS ,J D

5 2

13

J C FC O

T C I

. C I, L I, S I,. S S I

. T C C

.

A L C, L L C, H S C,T S C

. A C I T M

I. M I, S M I

. T M C

. H M, T M T L I. E I

. T L C V , S H

12.5 5


43/162

43

EMEE II

. N.

C I E

4. IT24 E N 30 70

O:T , ,

.

N

%

N.

1

I:

W C , , S D,

C C, T M,

S .T M:

)G M T P, C F,)U M: R, VHF, M W S

M D C: C,

M: FDM, TDM, CDM WDM

12 5

2

C N A

C N/W C N/W

P

X.25 E (S F):

W LAN 802.11(A, , .),

802.11

135

3

OI M

P L

ISO/OSI MTCP/IP M

OSI .TCP/IP

135

4

L A N

C & T, A T,T P & M

7 3

5

B B NI S D N (ISDN),

B B ISDN,

ATM ATM T M

V S A T (VSAT)

10 4


44/162

44

6

IP A &

IP N H P

N M, N B , A C, L ,

IP , R T, S & PS W

R F IP, TCPTCP C .

IPV6: T P

25 10

7

A L: D N S (DNS) DNS

,

E M: A , M

F, MIME, , SMTP, M G,

R, C M S, F T P,

G M,

W W W: I, A ,

, WWW B,

HTTP

20 8

B

1.C N A S. T, P,5 E

2. D C N B A. F , TMH,4 E.

3. C N S AK , TMH, 2 E.

4. N E N GSW MCSE S N5. I T H CISCO S

6. C N I

7. I A D E. C

8. C N S W S


45/162

45

EMEE II.

N.

C I E

5 MT21 D M 30 70

O: T

. L, R F, A F G

T ..N

D%

N.

1 MAHEMAICAL LOGICP (S), L ,,, , ,,C , , ,

.

N : , .

C , , ,

.

T , ,

,

.

30 13

2 ELAION AND FNCIONR , U, , ,

, R , C ,

R, ,

, G D

P R, , ,A, , E, ,

, , ,

, W .

P H , ,

, ,

F , P , ,

, , ,

, , I ,

N .

20 7

3 ALGEBAIC CEO U, , . D

(R ). P

, , , , ,

, .S, , M, ,

, , ,

S: C, , , ,

, , .

G : W H ,

20 7


46/162

46

, ,

, H ,

, , ,

A .4 GAPH HEO

B , , , , , , , ,

, I, , ,

, , , E , , E E , E

T : D , , , , R

,

30 13

B

1. D M S C S S K B B R2. D M S C S T

M3. D M C L L4. D M R


47/162

47

EMEE II.

N.

C I E6 BM 21 E M 70

O:1. T M E.2. T M IT .N

%

N.

1

M : I1.1D, S , C

N, W, D, C V,

E, C & C, C

S, C D, C L,

M / M

1.2M: D M, C, K

, M, M ,

M

1.3C O M P:

P, P, S, M, S,

T, R, H M

O. S M,

156

2

M M:

2.1 C M M2.2 7P M (P, P & P

E)

15 6

3

C B

3.1D & ,3.2 C O B

,

3.3 B ,3.4 S

20 8

4

O C:

4.1 B G C M,

4.2 G EM,

D, P , B

,

T .4.3 D P

P S P C I

.4.4 D S ,

, ,

208


48/162

48

N: F M M 5 . P .

B

1. M M: A S A P, 14E(E),P

K, K. K, A K M J

2. M M S A S

3. E M J S, A A, R F, P H

4. D M D CBCS

5. G EM P G

6. SN D T & P R T. R P.K. K

://..://../

EMEE II

. N.

C I E

7 IT22L M P W T * 50

O: S .

A HTML, DHTML, JS ASP.

, ,

.

5

EM:

5.1 P M

P, C C V , P,

E ,5.2 P:

B & , P ,

D S

20 8

6 C/ M P/ M, 10 4


49/162

49

EMEE II

. N.

C I E

8 IT23L C J L * 50

O :T J P S.A J I, P, E H, A,

, A W T, J I O & J .

S II

. N.

C I E

9 SS21 S S O C* 30

O:

T . T ,D H . T F I C,

I 30 M B

U T M 5

P M 5

A 5

P/CS/G

A/O

10

A 5

M 30

P50 M B

P H 40

V 5

A 5

M 50

Note :

Guidance should be given to students for selecting a track before the start of the semester III by

conducting expert sessions for the tracks which are offered by the Institute. The Institute should

assist the student for selecting the tracks based on their subject strengths.

Reference Books :

1. Careers in Information Technology By Christine Wilcox

2. Global Success @ IT Careers By Dr. Deepak Shikarpur, Dr. Deepali Sawai

3. Excellence in IT Achieving Success in an Information Technology Career By Warren C.

Zabloudil


50/162

50

EMEE III

COMMON BJEC FO EMEE III.N.

C

I E

1 MTC31 P & C 30 70

O:. C .

. U .

. U .

.

N D

%

N.

1 CONING PINCIPLE

1.1A M P1.2P O, C P,

P

1.3C

1.4B M T

10 4

2 PINCIPLE OF INCLION AND ECLION2.1P I E

2.2D N

2.3N

15 6

3 INODCION O POBABILI3.1T, E, S S T E

3.2M P, A P, S

3.3I D E, C P

3.4B T

15 6

4 ANDOM AIABLE AND MAHEMAICAL EPECAION4.1R V D C

4.2P D R V, P

M F, P D F, D

F

4.3M E P D,

T, C M V

M E

4.4M G F C G

F

4.5C B R V, D

C B R V

20 8

5 PECIAL DICEE POBABILI DIIBION5.1B D

5.2B D

5.3P D

5.4C M V

E, MGF, CGF.

5.5S .

20 8

6 PECIAL CONINO POBABILI DIIBION6.1U D6.2N D

6.3L D

6.4C M V

20 8


51/162

51

E, MGF, CGF

6.5S .

B

1. D M C L L2. D M R

3.

P & R P T. V4. F M S S. C. G V. K. K5. S M S. P. G

COMMON BJEC FO EMEE III.

N.

C I E

2 ITC31 M T P* 70

O :

T L

T I T / S . M , .

1 C M A D

E M WBT, CBT, V C, LMS &

LCMS, V C, C B, B

O C, / SL, C S

25 10

2 C PP P, F,A P, A P 9

20 8

3 O S T P, E, P. 25 10

4 C O C MP ,I M LMS , A

, E

, , ,

30 12

:

1. ..

2. ..3. ..

N: U .

.

N D%

N.


52/162

52

COMMON BJEC FO EMEE III

.

N.

C I E

3 SSC31 S S P* 30

O: N P P GF

E S B P: P , P M , D , ,

, M . E T (MS PP)

B:

1. B C B A K, P H I, P.L, N D.2. D C B K M/M B, M I L.

3. C S B L SPHI L P L.N D

EMEE III

ACK 1 : OFAE & APPLICAION DEELOPMEN

.

N.

C I E

4 T1IT31 Advanced Data Structure and C++ programming 30 70

Objective: By the end of the course students will be able to write C++ as well as DS programs

withCPPusing advanced language features, utilize OO techniques to design C++ programs, use

the standard C++ library, exploit advanced C++ techniques.

Sr.

No Topic Details%

Weightage

No. of

Sessions

1

Basics of C++1.1A Brief History of C & C++ , C Vs C++

1.2A Simple C++ Program , Application of C++

1.3Structure & Class, Compiling & Linking

5 2

2

C++ Expression2.1Tokens, Keywords, Identifiers & Constants

2.2Basic Data Types, User-Defined Data Types

2.3Symbolic Constant, Type Compatibility

2.4Reference Variables, Operator in C++2.5Scope Resolution Operator, Member De-referencing

Operators, Memory Management Operators,

Manipulators, Type Cast Operator

5 2

3

Functions In C++

3.1The Main Function, Function Prototyping

3.2Call by Reference, Call by Address,

3.3Call by Value, Return by Reference

3.4Inline Function, Default Arguments

3.5Const Arguments, Function Overloading,3.6Friend Function

32

4Classes & Objects

4.1A Sample C++ Program with class, Access modifiers4.2Defining Member Functions, Making an Outside

7

4


53/162

53

Function Inline4.3Arrays within a Class

4.4Memory Allocation for Objects

4.5Static Data Members, Static Member

4.6Functions, Arrays of Objects

4.7Object as Function Arguments

4.8Friend Functions, Returning Objects, Const member

functions4.9Pointer to Members, Local Classes

4.10 Constructor - Parameterized Constructor, Multiple

Constructor in a Class , Constructors with Default

Arguments

4.11 Destructor

5

Operator Overloading & Type Conversion5.1Defining operator Overloading

5.2Overloading Unary Operator, Overloading Binary

Operator, Overloading Binary Operator Using Friend

function.

5.3Manipulating of String Using Operators

5.4Type Conversion5.5Rules for Overloading Operators

10 4

6

Inheritance & Polymorphism

6.1Defining Derived Classes

6.2Types of Inheritance-Single, Multilevel, Hierarchical,

Multiple Inheritance, Hybrid Inheritance6.3Virtual Base Classes, Abstract Classes6.4Constructor in Derived Classes

6.5Nesting of Classes

6.6Pointer to Derived Class

6.7 Virtual Function

104

7

The C++ I/O System Basics7.1C++ Streams, C++ Stream Classes7.2Working with Files Introduction

7.3Classes for File Stream Operation , Opening & Closing

Files

7.4Detection of End of File , More about Open( ): File modes

7.5File pointer ,Sequential Input & output Operation

7.6Updating a File : Random Access, Command Line

Arguments

10 4

8

Exception handling8.1 Exception Handling Fundamentals

8.2The try Block, the catch Exception Handler

8.3The try/throw/catch sequence

8.4Uncaught Exception

62

9

Fundamentals of DS with CPP

9.1 Stacks

9.2 Queues

9.3 linked lists

8 3

10 Tree 12 5


54/162

54

N : A OOP J,

J.

B

1. C++: T C R H S,TMH,5 E

2. L C++ K,BPB,2 E

3. O O P C++ E. B,TMH,4 E.

4. C++ P S L & L,P,3 E

5. C++ P L B S, P, 3 E.

6. C++ P B A S & C W, W P.

7. D S U C C++ L Y, PHI,2 E.

8. T E D S C++ B,K

9. M D S A G

10.D S U C ++ M D S

11.D S C ++ K N.S., P P.Y.

12.P A D S H

13.D S U C++ K N.

14.P D S U C C++ D V V.

15.D S A C++ J B K

10.1 Tree Terminology10.2 Binary Tree

10.3 Binary Tree Representation

10.4 Binary Search Tree (BST) Creating a BST

10.5Binary Search Tree Traversal

Preorder Traversal

Inorder Traversal

Postorder Traversal

11

B 11.1 AVL

11.2 B

I B I B

D B

I B+, B*

11.3 E T11.4 T B T

14 4

12

G12.1 I

12.2 G R

A MA L

12.3 G T

D F SB F S

12.4 A G

10 4


55/162

55

16.D S A C++ D A

17.D S U C++ M D S, CENGAGE L P.

18.D S C++: S O H J

19.D S C++ Y.P. K, BPB,2 E.

20.

F DS C++ H S, G .21.DS C++ A

EMEE III

ACK 1 : OFAE & APPLICAION DEELOPMEN

.N.

C

I E

5 T1IT32 D A A A 30 70

O: T ..

.

N D

%

N.

1

I

1.1 A, 1.2 T

1.3 O, O T

104

2

2.1 H H

2.2 S

2.3 U .

2.4 S .

2.5

T H

12.55

3

D A C3.1 D C

3.2 G S

3.3 E. B S

3.4 Q S

3.5 M S

104

4

G M4.1 G S, K

4.2 J D4.3 O

4.4 M S T

4.5

D .

17.5

7

5

D P5.1 G S

5.2 M 5.3 OBST, 0/1 K

5.4 T S P5.5 F S S

15 6

6

B6.1 B: G S

6.2 N Q 6.3 G C

156


56/162

56

6.4 H C, 0/1 K

7

B B

7.1 G S, 0/1 K7.2 T S P

12.5 5

8

NPHAD AND NPCOMPLEE POBLEM

B , NPH A NPC P (O )

7.5 3

B

1. B, F A. PHI

2. H/S, F A, G.

3. M D S, A G : PHI P

4. T H C C E.L L, I A PHI

5. A. V. A J.D. U, D A A, A W

EMEE IIIACK 1: OFAE AND APPLICAION DEELOPMEN

.

N.

C I E

6 T1IT33 O O A A D 30 70

O:

A : U

, A .

D . D . L

U M L.

.N D % N.

1

I1.1 T D: SSAD OOAD.

W O O? O P1.2 O 1.3 A 1.4 M M1.5 I, I P1.6 A C

7 3

2

I ML & M2.1

R O M B,R, C Y, I J

2.1 U A : D N

T UML

2.2UML D D P

7 4

3

OO DP3.1 R U P3.2 F M : I , E,

C, T.3.3 R E3.4 P U S

12 5


57/162

57

T .3.5 R M F OOA & OOAD : A & D R

M3.6 S UML B P

4.

M

4.1 C S M T A

4.2M S E : C, R,

I , P

4.3C D

4.4 D ERD & C D

4.5O D

257

5.

B M

5.1C B M T

5.2 I

5.3U C U C D

5.4I D : S D, C

D , A D, S D

5.5F & R E

25 7

6.

A M

6.1C A M T

6.2M A

6.3C & C D

6.4D & D D

6.5C

7 3

7

P O D I7.1 T C D M D.

7.2

O P7.3 O D M S7.4 O O R D.7.5 M R D .

7 3

8

O 8.1 I T S.8.2 I O O T.8.3 T B P.

52

9

P9.1 B .9.2 U D A.

9.3

U P D D

5 2

10CAE ( H L)A T UML

A T

4

B

1. O O A D A G B., B /

C , 1994., P P.

2. O O M D J R, M B, W . P ,PHI P.

3. M O O A D A G N P : PHI

P

4. P O O S D A E , A W.

5. O O S D A B MGRAWHILL I E.


58/162

58

6. OO S E I J P E INC

7. A UML A P C L P E INC

8. UML D M F P E INC

9. T U M L U G G B, J R, I J

P E INC

10.

T U M L R G G B, J R, IJP E INC

11. D O O S R W B. B W, L W

12. O O A D B , S MG H.

13. D F O O S UML C R, T

14. I UML M A LP

15. UML I T A P W P

16. UML N ,O P.

N: T S . T

ML .

EMEE IIIACK 1 : OFAE & APPLICAION DEELOPMEN

.

N.

C I E

7 T1IT34 A I T 30 70

O:T 2 . HTML 5, XML, Q,

AJAX PHP

.N D

%

N.

1

HML5

1.1B HTML5 I, , & HTML5

1.2, , .1.3I S V G (SVG)

A JS1.4I

1.5MVC (M, C)1.6D

1.7F

15 6

2

ML

2.1C XML, XML2.2W XML , .

2.3 XML CSS, .2.4XML DSO, .

2.5 XML N, XML DTD, .2.6XML , XSLT

2.7SAX P, DOM P2.8I SOAP, E XML

15 6

3Q

3.1I Q, S O

3.2 A Q S, C Q

25 10


59/162

59

3.3T DOM, S E Q,

3.4R & F S, S F

E

3.5W S C, G & S

3.6CSS, S, & D

3.7M E G S

I E, M, C,

R E, C N E

3.8M A, U M

3.9E C E E, N

E, E , T E ,

E D

3.10 JQ E /, , , ,

,

3.11 I D, D, R,

S,

S3.12 W A, DP, M, T3.13 P U , C

, W

P

4

AJA

4.1AJAX O

4.2Q' AJAX ,

4.3A F

4.4A E

10 3

5

PHP

5.1O, I C PHP

5.2I

PHP W S A

M, O PHP C

5.3CGI . S O M

PHP HTML E T S

5.4S PHP S E

5.5PHP HTTP E V5.6PHP L C

V, C D T,

O

5.7D M , F C L

5.8W A

5.9W S

O D,

5.10 I R S

5.11 F D A O

5.12 E H R C

5.13 P HTML F I U

5.14 C D HTML F PHP

5.15 L A U

5.16 U GET, POST, SESSION, COOKIE

35 15


60/162

60

B

1. I HTML5 B L, R S

2.

AJS B G, S S3. L Q J C, K S

4. P A, 2 E W P

5. I T H , TMH.

6. B XML W P

7. XML D & D, P P.

8. P W W W R W. S,P,4 E.

9. HTML5 & CSS3 , C E 7 E

10. B PHP5

11. C R. PHP

12. B PHP, A, MS .

:1. ://.3.

2. ://..

5.17 S M V

5.18 W C,

5.19 S E

5.20 I O PHP: C &

C

5.21

PHP AJAX5.22 D O PHP

B D F, C

MSQL( A O D), C

D, D D, S

D, B S Q

D E, R , U

I D

N: A H


61/162

61

S III

TRACK I.N.

C

I E

8 T1IT31L DS & C++ L * 50 O: T C++ & DS C++

.C++ P , , , , , , I/O ,

DS C++ S, Q, L L

T , B T T & G

S III

TRACK I

.N.

C

I E

9 T1IT34L M P AIT* 50

O:

T W T. S HTML5, XML, PHP, AJAX, JQ MSQL.


62/162

62

EMEE IIIACK II: INFACE & ECI MANAGEMEN

EMEE III

ACK II : INFACE AND ECI MANAGEMEN

.

N.

C I E

4 T2IT31 IT I A 30 70

O :

T

O S

.

N D

%

N.

1 I I

I, C IT I M,D I IT O IT I, IT

S M P, IT S MP, I S D P

10 4

2 D P

S L M, F M, IT

S C M, C M &

A M

15 6

3 P

C M, I M,

P M, C M & R

M

25 10

4 M

S, B, A R, D R,S M, D A P

D R

25 10

5 M

C S, I S, P S,I M, A C S I D

25 10

B

1. IT I & I M: P G, S P & U J,

T MGH E

2.

I M: I D, C, M, R, R: W. R H, R C. G. H, W U

3. I.T. I M (2 E): A S


63/162

63


III

.N. C I E

5 T2IT32 D C A & S

M30 70

O:) T , D C,

D C

D C.) T , I L, C

, S .

.

N D

%

N.

1 DAA CENE1.1I

1.2S S E C1.3H L A1.4A R, G S1.5A P

5 2

2 DAA CENE DEIGN2.1A D S R2.2R A F D B P,

.2.3IT H

2.4C S O E C

2.5E P S2.6R L2.7F P S S2.8B A E M S2.9C H

20 8

3 OAGE MANAGEMEN3.1I S T3.2S S A3.3P

3.4M

3.5C RAID 3.6D RAID

: RAID 0, RAID 1, RAID 3, RAID 4,

RAID 5, RAID 0+1, RAID 1+0, RAID 63.7I M 3.8

10 4


64/162

64

4 NEOKED OAGE4.1E

4.2A, , FCSAN, NAS,

IPSAN

4.3B

4.4N CAS

4.5A

15 6

5 MANAGING DAA CENE5.1R / 5.2I

5.3D (BC)

(DR), RTO RPO

5.4I

5.5A / /

,

5.6R

5.7K

5.8I

5.9K .

30 12

6 ECING OAGE AND OAGE IALIAION6.1I S

6.2C

6.3S , A

6.4S V: F, C C

6.5T S V: B FL.

20 8

B

1. D C F M A, C P; 1 (4 D 2003)2. D C V F: U T D H

E D C C N, UCS, MDS, B G S, C

P; 1 (21 J 2013)3. EMC E S, I S M, G.S,

AS, W, P I., 2011.4. S N: T C R, R S, TMGH,O,

2003.5. B S N, M F,TMG H, O. 2001.6. S A N F, MG, P E L, 2002


65/162

65


III.

N.

C I E

6. T2IT33 I I S 30 70O:T I I

IT . ..

N D

%

N.

1

I 1.I1.1 S

1.2 C S C1.3. T, A, A1.4. S F R

1.5. A S A O S

1.6. C S T

1.7. C S S

15 6

2

C 2.1. C S E

2.2. M A H F

2.3. PK E2.4. D S K M

2.5. P A: E S D

15

5

3

Models, Frameworks , Standards & Legal Framework3.1 A structure and framework of compressive security

policy,

3.2 policy infrastructure,3.3 policy design life cycle and design processes,

3.4 PDCA model,

3.5 Security policy standards and practices - ISO 27001,SSE-CMM, IA-CMM, ITIL & BS 15000, BS7799

3.6 Understanding Laws for Information Security:

Legislative Solutions, Contractual Solutions,Evidential Issues, International Activity

3.7 Indian IT Act

3.8 Laws of IPR

3.9 Indian Copyright Act

25 10

4

Controls4.1. Access Control Principles

4.2. Subjects, Objects, and Access Rights4.3. Discretionary Access Control

4.5. Role-Based Access Control

4.6. Case Study

15 7


66/162

66

5

Virus and Malware5.1. Introduction & types of Malicious Software

(Malware)

5.2. PropagationInfected ContentViruses

5.3. PropagationVulnerability ExploitWorms

5.4. PropagationSocial EngineeringSPAM E-mail,

Trojans

5.5. PayloadSystem Corruption5.6. PayloadAttack AgentZombie, Bots

5.7. PayloadInformation TheftKeyloggers, Phishing,

Spyware

5.8. PayloadStealthingBackdoors, Rootkits

5.9. Countermeasures

15 6

6

Security issues6.1 Database security challenge in the modern world,

6.2 Federated Databases,

6.3 securing Mobile databases

6.4 Network Security,

6.5 trusted & un trusted networks,

6.6 network attacks, network security dimensions,

6.7 network attack the stages; using firewallseffectively;

6.8 Privacy Privacy invasion due to direct marketing,

outsourcing, using data masking ; privacy issues in

smart card applications6.9 Ethical Hacking ;Role of Cryptography in

information security,

6.10 digital signatures

15 6

Reference Books

1. Information Systems Security: Security Management, Metrics, Frameworks And Best

Practices (With Cd) : Nina Gobole

2. The complete reference Information Security by Mark Rhodes ousley

3. Information security Theory and practices By Dhiren R Patel

4. M. Stamp, Information Security: Principles and Practice, Wiley

5. G. McGraw, Software Security: Building Security In, Addison Wesley

6. Electronic Signature law by L Padmavathi

7. Network Security by Ankit Fadia

8. Security Plus study guide by Michael Cross, Norrris Johnson

9. Information Security policies made easy version

Reference websites:

www.cengage.com/resource_uploads/downloads/1111138214_259146.pdf

www.searchsecurity.techtarget.com

www.secure-byte.com

www.security-internal-audit.com

www.ngssecure.com/services

www.pcisecuritystandards.org


67/162

67


III

.N. C I E

7 T2IT34 O A T 30 70

O: T

..N

D%

N.

1 C O AP , ,

, ,

,

, O .

156

2 O A :O , W

.

10 4

3 I W W T F P

P, F, E, E I

S W S W G W T W T W

U M M C T C, I, B W M D

W F U F W CW

25 10

4 C

I C, E, E, F D,

U C G, U S T,U G C, P, E, E,

F F, U DP, D

A, L C D, S R, CM

25 10

5 I GI I, U S M, S, T, A F T, A

F P, M G O, F

G O, S, C, O O,

S, N, H, S S: T,

A, P, E, E, S

S S, S U C I

25 10

B

1. ://../2. ://..//D


68/162

68


III

.N. C I

8 T2IT31L M P O IT &

I S*

50

C I S , .

EMEE III

ACK II: INFACE & ECI MANAGEMEN

III.

N.

C I

9 T2IT34L O A T L* 50

G: L W, C I G. S O ( , )

.

EMEE III


.

N.

C I E

4. T3IT31 E R P 30 70

O : T ERP , , ,

.N

% N.

1 E P

1.1I

1.2

D ERP 1.3W I ERP?

1.4N ERP.1.5A ERP

1.6R ERP

1.7G ERP

10 4

2 EP M

2.1 F2.2 P P, C M

2.3 S D

2.4 H R M

2.5 I C S

20 8


69/162

69

2.6 Q M

2.7 P M

3 EP I

3.1 ERP I (T)

3.2 ERP I L C

3.3 I M3.4E ERP

3.5ERP P T: V, E, C

3.5 T & E

3.6 P & M

3.7 P I A3.8 O & ERP

3. 9 M P ERP S

3.10 S & ERP

I

20 8

4 EP M

4.1ERP M M D

4.2 C C ERP P V,; SAP, O, PS, BAAN .

10 4

5 EP

5.1 B P RE (BPR)5.2 I S M I

S (MIS), D S S (DSS),E S S (ESS)

5.3 D W, D M5.4 OL A P (OLAP)

5.5 S C M5.6 C R M

20 8

6 EP C 6.1 ERP :TISCO,

SKF A B C. L, Q CDMA,C

6.2 P I ERP

mca_2015-2018_syllabus_19-april-2016

Documents