Department of Computer Science & Engineering · Master of Computer Application Page 3 Dr. K N Modi University, Newai Objective of the course Master of Computer Applications (MCA)

Syllabus

Master of Computer Application Page 1

Dr. K. N. Modi University, Newai Rajasthan

(Established by the Government of Rajasthan &

Recognized by UGC under section 2(F) of UGC Act, 1956.)

Department of Computer Science &

Engineering

MCA -Syllabus & Evaluation Scheme

(Effective from 2017-18)

Syllabus


EVALUATION SYSTEM

Syllabus


Dr. K N Modi University, Newai

Objective of the course

Master of Computer Applications (MCA) is a three-year (six semesters) professional Master's

Degree in computer Application.MCA course is exclusively designed to meet requirements of IT

trained students for various IT industries. It has more emphasis on latest programming language

and tools to develop better and faster applications. The well balanced course significantly

emphasizes on planning, designing and building of complex commercial application software,

web development and system software. The course also places equal importance on the

functional knowledge in various areas. A three year full-time MCA course is not just a

postgraduate course; it is also a complete grooming for students for a successful career in the IT

industry.

Syllabus


Student Evaluation System

Examination Process

Continuous Assessment

All courses undertaken by students are evaluated during the semester using internal system of

continuous assessment. The students are evaluated on class /tutorial participation, assignment work, lab

work, class tests, mid-term tests, quizzes and end semester examinations, which contribute to the final

grade awarded for the subject. Students will be notified at the commencement of each courses about the

evaluation methods being used for the courses and weightages given to the different assignments and

evaluated activities.

In order to make the evaluation system as similar and transparent with any of the globally reputed

educational institutions like N.I.Ts, I.I.Ts etc. the Dr. K. N. Modi University Academic Council has

adopted the grading practices. Here marks obtained in the continuous assessment and end semester

examination are added together and a 10-point grading system will be used to award the student with

on overall letter grade for the course (subject).

Distribution of Marks

(i) Courses without Practical Components

10Marks -IITest Midterm(d)

Marks 10 -ITest Midterm(c)

10Marks -subject)each (for each marks 5 of sAssignment Two(b)

Marks 10 - etc.Seminar Projects, Quizzes, Tests, Class ion,participat Class Attendance(a)

40 Marks

(e) End –Term Examination - 60 Marks } 60 Marks __________________________________________

Total : 100

(ii)Courses with Practical Components only

Internal Practical Examination and Continuous Progress- 50 End –Term Examination (Practical) - 50

Total : 100

Letter Grading System

Final evaluation of course is carried out on a TEN POINT grading system. Performance Grade and

Grade Points are as shown below:

Syllabus


Table 1

Marks Grade Value Grade Description

91 to 100 10 AA Out Standing

81 to 90 9 A+ Excellent

71 to 80 8 A Very Good

61 to 70 7 B+ Good

51 to 60 6 B Above Average

41 to 50 5 C Satisfactory

Less than 41 0 F Exposed

Absent in the University

Final Examination

0 I Incomplete

Note: In order to convert the SGPA and CGPA into percentile, multiply the same with the Conversion

factor of 10.

A student who earns a minimum of 5 grade Point (C grade) in a course (subject) is declared to have

successfully completed the course, and is deemed to have earned the credits assigned to that course. A

course successfully completed cannot be repeated.

A student should have appeared for the end semester examination of the prescribed course of study

(mere appearance in the continuous assessment test is not sufficient) to be eligible for the award of the

degree in the course.

If a student is eligible for but-fails to appeared in the end semester examination, he/she will be awarded

an ‘I grade (in complete) on the grade sheet. For all practical purposes an ‘I ‘Grade is treated as an ‘F’.

If a student is not eligible to appear in the end semester examination owing to his/her not fulfilling the

minimum attendance requirements, he may be permitted to re-register for those courses in which he/she

had attendance shortage, at the next available opportunity.

Grade Point Average (SGPA) &Cumulative Grade Point Average (CGPA)

Each course grade will be converted into a specific number of points associated with the grade as

mentioned in above Table 1. Here points are weighted with the number of credits assigned to a course.

The Grade Point Average (GPA) is the weighted average of grade points awarded to a student. The

Grade Point Average for each semester will be calculated only for those students who have passed all

Syllabus


the courses of that semester. The weighted average of GPA’s of all semester that the student has

completed at any point of time is the Cumulative Grade Point Average (CGPA) at that point of time.

CGPA up to any semester will be calculated only for those students who have passed all the courses up

to that semester.

A student of student has to earn minimum of 244 credits to gets his B. Tech. Degree on completion of

eight semesters.

Calculation of SGPA and CGPA:

Example:

Table 2

Courses Credits Letter

Grade

Grade

Value

Credit

Value

Grade

Points

Mathematics 3 B+ 7 3x7 21

Chemistry 3 A 8 3x8 24

Physics 3 A+ 9 3x9 27

Language Lab 2 A 8 2x8 16

TOTAL 11 TOTAL 88

In this case GPA = Total Grade Points 88 88

Credits 11

Suppose the GPAS in two successive semesters are 7.0 and 8.0 with 26 and 24 respective course

credits, then the

CGPA = 7x26+8x24 = 374

26+24 50

After the results are declared, grade cards will be issued to each student which will contain the list of

courses for that semester and the grades obtained by the student, as well as GPA of that semester.

However, a conversion factor of “10”, will be included, enabling students and future employers for

transforming CGPA into percentage of marks at par with the existing practices of I.I.Ts, N.I.Ts and

A.I.C.T.E.

= = 8.0

= 7.48

Syllabus


Minimum Eligibility Requirements in Dr. K. N. Modi University for proceeding to the next

academic year of study.

A First year Student of Dr. K. N. Modi University satisfying the below mentioned requirements is

eligible to study in the 3rd Semester of next academic year.

“Pass with Minimum C Grade in Four Theory Papers & Pass in Four Laboratory Papers in the I & II

Semester ( Combined)”

A Second year Student of Dr. K. N. Modi University satisfying the below mentioned requirements is

eligible to study in the Vth Semester of the next academic year.

“Pass with Minimum C Grade in Four Theory Papers & Pass in Four Laboratory Papers in the IIIrd&

IV Semester (Combined)”

A Third year Student of Dr. K. N. Modi University satisfying the below mentioned requirements is

eligible to study in the VIIth Semester of the next academic year.

“Pass with Minimum C Grade in Four Theory Papers & Pass in Four Laboratory Papers in the Vth&

VIth Semester (Combined)”

Proficiencies:

Extra-curricular activities as listed below will be offered to students of all programs. These activities

will run in both semesters and evaluated. Activities will be graded as Outstanding/Excellent/ Very

Good/Good/ Above Average/ Satisfactory/Exposed/Incomplete.

The extracurricular activities are sports, cultural:

1. Tennis 2. Athletics 3. Table Tennis

4. Badminton 5. Gymnastics 6. Chess

7. Throw Ball 8. Gardening 9. Organization & Management

10. Football 11. Electronics 12. Fine Arts & Paintings

13. Cricket 14. Social Service Club 15. Rovers & Rangers

16. Volleyball 17. Music and Dramatics 18. Model and Sculptures

19. Basketball 20. Debate 21. Equestrian Race

22. Kho - Kho 23. Robotics 24. Yoga & Meditation

25. Art & Photography Club 26. Cultural Club 27. Any other activity with prior

approval of the President.

Guideline for submission of assignment

A. Assignments (Theory)

Following are the guidelines of assignments, their evaluation.

Syllabus


Assignment means a set of work, tasks and/or numerical problems given to the student, on the basis of

topics recently covered in the class as homework to be solved and submitted, within the time frame

given by the faculty and the examination cell. Each assignment should require 5 – 6 hours’ work to be

done by the student. The Date of Submission (DOS) duly announced on the Date of Allotment (DOA)

to the student and duly mentioned in the Academic Calendar.

1. In a multiple-section course, the preparation, duplication and distribution is the responsibility of

the Course Coordinator.

a. Allotment of an assignment should be made in the academic calendar of the semester.

b. The Date of Submission (DOS) of an assignment should be the tutorial in the prescribed

week wherever applicable. Where tutorials are not scheduled, submission should be in the

first lecture of the subsequent week.

2. Assignment should NOT have any descriptive questions (that can be directly copied from a book

or from the internet). However, in those course(s) where only descriptive problems are feasible,

prior approval for the same is to be sought from the President in writing mentioning the

justification for the same.

3. The effective teaching for semester is generally of 14 weeks. The minimum number of

assignments to be given throughout the semester is two. No assignment should be due in the

last week of the semester.

4. The assignment is to be submitted on or before the Date of Submission (DOS) as announced.

5. The evaluation of numerical assignment will be done through a test based on the assignment. The

test would comprise of one of the questions from the assignment to be solved in the class. The

following process may be adopted for the purpose:

a) Ask students to bring the assignment sheets to the class (along with calculators, if

required).

b) Take 60 sheets of A4 sheets. On each sheet write the roll number of a student and the

question number from the assignment that he/she has to solve. Different question for

adjacent students. Make student sit roll-number-wise, so that no two adjacent students are

given the same problem.

c) Give student just sufficient time to solve the problem assuming that they have done the

assignment at home.

d) Make sure they have submitted the assignment before the start of the test and that they are

not copying.

6. Marks to be awarded in these assignment-quizzes only if the assignment is submitted in time.

7. For non-numeric assignments the rest could have questions based on the assignment. Make sure

that there are multiple shuffled sets for these tests to prevent copying. The comments on the

assignments are mandatory. The marks are to be allotted to submission and test separately.

8. Minimal time to be given to the students to attempt the said tests because they should not require

any thinking for solving these as they have already solved these problems earlier.

9. The evaluated assignments/tests are to be shown to the student (as done in scrutiny of the End

Term Examination answer sheets) and are to be retained by the instructor. The evaluated

assignments/test should be retained till the next assignment is evaluated. This is to permit

checking by designated authority at any instance.

10. The assignment-based tests should be given on the Date of Assignment (DOS). Only the students

who have submitted the assignment on time should be allowed to take the test, otherwise, the

student should be awarded ZERO marks for the same.

Syllabus


11. This procedure is to be announced and explained to the students in the very first class. The

importance of timely submission of assignments should be explained.

12. No deviation from this policy is permitted except with a written prior approval from the president.

B. Laboratory Assessments

Following are the guidelines for the conduct and evaluation of practical in all courses with laboratory

components:

1. A practical is where a student is taken to a laboratory and is asked to perform a set of task on

the given computer, equipment or on a setup comprising of devices or components. This

includes on-the spot conduct of an activity to derive desired results and to report the findings.

2. A student will have to maintain record of the experiments performed in the labs in the bound

lab notebook.

3. The lab notebook should be maintained in the format of a lab journal, where (in general) the

aim of the experiment, the observations, calculations, results ad discussions are reported. These

should not have any description like ‘method’ etc, unless the method itself is the aim of the

experiment. Error analysis forms an essential part of the lab journal.

4. Each lab work performed is to be verified by the respective teachers in the next class.

5. A student will be evaluated on every experiment/lab performed. The components of practical

assessment are to be re-defined, notified to the student and to be strictly adhered to.

6. The records of the students attendance in the lab is to be maintained. The lab file record is

evaluated for 10 marks and the attendance weightage will be again 10 Marks.

Syllabus


DR.K.N MODI UNIVERSITY

Syllabus and Evaluation Scheme

MCA (Master of Computer Application)

Effective from session 2017-18

Year-I Semester-I S.

NO.

Sub Code Subject Name Period Evaluation Scheme Credit

Continuous

Assessment

Final

Exam

Total

L T P

1 01MC101 Professional

Communication

3 1 0 40 60 100 4

2 01MC102 Financial Accounting 3 1 0 40 60 100 4

3 01MC103 Computer Concept and

programming in C

3 1 0 40 60 100 4

4 01MC104 Discrete Mathematics 3 1 0 40 60 100 4

5 01MC111 Computer

Organization &

Architecture

3 1 0 40 60 100 4

LAB

1 01MP101 Communication Lab 0 0 4 50 50 100 2

2 01MP103 C Programming Lab 0 0 4 50 50 100 2

5 01MP1010 Seamless Learning 0 0 4 100 100 1

6 01MP1011 Co-Curricular

Activities

0 0 4 100 100 1

TOTAL 15 5 16 900 26

Syllabus


DR. K. N. MODI UNIVERSITY Syllabus and Evaluation Scheme



Year-I Semester-II S.

NO.


Continuous

Assessment

Final

Exam

Total

L T P

1 01MC202 Computer Based

Numerical &

Statistical

Technique

3 1 0 40 60 100 4

2 01MC211 Innovation &

Entrepreneurship

3 1 0 40 60 100 4

3 01MC205 Environment

Science and

Ecology

3 1 0 40 60 100 4

4 01MC206 Data Structure

Using ‘C’

3 1 0 40 60 100 4

5 01MC207 Introduction to

Automata theory

and Languages

3 1 0 40 60 100 4

LAB

1 01MP202 CBNST Lab 0 0 4 50 50 100 2

2 01MP206 Data Structures

Lab

0 0 4 50 50 100 2



Activities

0 0 4 100 100 1

TOTAL 15 5 16 900 26

Syllabus





Year-II Semester-III S.

NO.


Continuous

Assessment

Final

Exam

Total

L T P

1 02MC301 Internet and Core

JAVA

4 1 0 40 60 100 4

2 02MC302 Database

Management

System

3 1 0 40 60 100 4

3 02MC303 Operating System

3 1 0 40 60 100 4

4 02MC304 Design & Analysis

of Algorithms

3 1 0 40 60 100 4

5 02MC306 Computer Based

Optimization

Techniques

3 1 0 40 60 100 4

6 02MC308 Cyber Security 3 1 0 40 60 100 4

LAB

1 02MP301 CORE JAVA LAB 0 0 4 50 50 100 2

2 02MP302 DBMS LAB 0 0 4 50 50 100 2



Activities

0 0 4 100 100 1

TOTAL 18 6 16 1000 30

Syllabus





Year-II Semester-IV S.

NO.


Continuous

Assessment

Final

Exam

Total

L T P

1 02MC403 Computer Network

3 1 0 40 60 100 4

2

02MC406

Management

Information

Systems

3 1 0 40 60 100 4

3 02MC408

Artificial

Intelligence

3 1 0 40 60 100 4

4 02MC409 Mobile Computing

3 1 0 40 60 100 4

5 02MC410

Web Technology

3 1 0 40 60 100 4

6

02MC411

Human Values &

Professional

Ethics

3 1 0 40 60 100 4

LAB

1 02MP410

Web Technology

lab

0 0 4 50 50 100 2

2 02MP412 Mini project

0 0 4 50 50 100 2



Activities

0 0 4 100 100 1

TOTAL 18 6 16 1000 30

Syllabus





Year-III Semester-V S.

NO.


Continuous

Assessment

Final

Exam

Total

L T P

1 03MC511 Dot Net

Framework & c#

3 1 0 40 60 100 4

2 03MC512 Software

Engineering

3 1 0 40 60 100 4

3 03MC513 Neural Network 3 1 0 40 60 100 4

4 03MC514 Image Processing 3 1 0 40 60 100 4

5 03MC515 Big Data 3 1 0 40 60 100 4

LAB

1

03MP511

Dot Net

Framework & c#

Lab

0 0 4 50 50 100 2

2 03MP512 Project Based on

Software

Engineering

0 0 4 50 50 100 2



Activities

0 0 4 100 100 1

TOTAL 15 5 16 900 26

Syllabus





Year-III Semester-VI S.

NO.


Continuous

Assessment

Final

Exam

Total

L T P

1 03MC601 Seminar 0 0 10 100 100 200 3

2 03MC602 Project 0 0 10 200 300 500 5



Activities

0 0 4 100 100 1

TOTAL 0 0 28 900 10

Syllabus


First Semester

PROFESSIONAL COMMUNICATION (01MC101)

Course Objective:

The aim of the course is to provide high level professional communication skills to the students.

It will help the students to increase the ability to work within and across diverse and converging

media environments.

Unit-1 Fundamentals of Communication

Technical Communication: features: Distinction between General and Technical communication;

Language as a tool of communication; Levels of communication: Interpersonal, Organizational,

Mass

Communications; The flow of Communication: Downward, Upward, Lateral of Horizontal (Peer

group): Importance of technical communication; Barriers to Communication.

Unit-II Constituents of Technical Written Communication

Words and Phrases: Word formation. Synonyms and Antonyms; Homophones; Select

vocabulary of about 500-1000 New words; Correct Usage: all Parts of Speech; Modals;

Concord; Articles; Infinitives; Requisites of Sentence Construction: Paragraph Development:

Techniques and Methods- Inductive, Deductive, Spatial, Linear, Chronological etc; The Art of

Condensation-various steps.

Unit-III Business Communication

Principles, Sales & Credit letters; Claim and Adjustment Letters; Job application and Resumes.

Reports: Types; Significance; Structure, Style & Writing of Reports. Technical Proposal; Parts;

Types; Writing of Proposal; Significance. Negotiation & Business Presentation skills.

Unit-IV Presentation Strategies and Listening Skills.

Defining Purpose; Audience & Local; Organizing Contents; Preparing Outline; Audio-visual

Aids; Nuances of Delivery; Body Language; Dimensions of Speech: Syllable; Accent; Pitch;

Rhythm; Intonation; Paralinguistic features of voice; Listening Skills: Active Listening, Passive

Listening. Methods for improving Listening Skills.

Unit-V Value-Based Text Readings

Following essays form the suggested text book with emphasis on Mechanics of writing.

(i) Humanistic and Scientific Approaches to Human Activity by Moody E. Prior

(ii) The Language of Literature and Science by A. Huxley

(iii) Man and Nature by J.Bronowski

(iv) The Social Function of Literature by Ian Watt

(v) Science and Survival by Barry Commoner

(vi) The Mother of the Sciences by A.J.Bahm

(vii) The Effect of Scientific Temper on Man by Bertrand Russell.

Text Book

1. Improve Your Writing ed. V.N.Arora and Laxmi Chandra, Oxford Univ. Press, 2001, New

Delhi..

2. Technical Communication: A Practical Approach: Madhu Rani and Seema Verma- Acme

Learning, New Delhi-2011

3. Technical Communication- Principles and Practices by Meenakshi Raman & Sangeeta

Sharma, Oxford Univ. Press,2007, New Delhi.

Syllabus


Reference Books

1. Communication Skills for Engineers and Scientists, Sangeeta Sharma et.al. PHI Learning

Pvt.Ltd, 2011, New Delhi.

2. Business Correspondence and Report Writing by Prof. R.C.Sharma & Krishna Mohan, Tata

McGraw Hill & Co.Ltd.,2001, New Delhi.

3. Word Power Made Easy by Norman Lewis, W.R.Goyal Pub. &Distributors, 2009,Delhi.

4. Developing Communication Skills by Krishna Mohan, Mecra Bannerji- Macmillan India Ltd.

1990, Delhi.

5. Manual of Practical Communication by L.U.B.Pandey: A.I.T.B.S. Publications India Ltd.;

Krishan

Nagar, 2013, Delhi.

6. English Grammar and Usage by R.P.Sinha, Oxford University Press, 2005, New Delhi.

7. Spoken English- A manual of Speech and Phonetics by R.K.Bansal & J.B.Harrison, Orient

Blackswan, 2013, New Delhi.

8. Business English by Ken Taylor, Orient Blackswan, 2011, New Delhi.

FINANCIAL ACCOUNTING (01MC102)

Course Objective :A business or an organization needs a tool to communicate its results and

position to stakeholders, a tool that is commonly understood by all. For that purpose, accounting

serves as the ‘language of business”. Stakeholders, in return, use this information make sound

decisions. Bearing these in mind,

this course aims to convey sufficient knowledge for an adequate interpretation, analysis and use

the information provided by financial accounting.

Unit I (6 Sessions)

Overview: Accounting concepts, conventions and principles; Accounting Equation, International

Accounting principles and standards; Matching of Indian Accounting Standards with

International Accounting Standards.

Unit II (12 Sessions)

Mechanics of Accounting: Double entry system of accounting, journalizing of transactions;

preparation of final accounts, Trading Account, Manufacturing Accounts, Profit & Loss

Account, Profit & Loss Appropriation account and Balance Sheet, Policies related with

depreciation, inventory and intangible assets like copyright, trademark, patents and goodwill.

Unit III (12 Sessions)

Analysis of financial statement: Ratio Analysis- solvency ratios, profitability ratios, activity

ratios, liquidity ratios, market capitalization ratios ; Common Size Statement ; Comparative

Balance Sheet and Trend Analysis of manufacturing, service & banking organizations.

Unit IV (10 Sessions)

Funds Flow Statement: Meaning, Concept of Gross and Net Working Capital, Preparation of

Schedule of Changes in Working Capital, Preparation of Funds Flow Statement and its analysis ;

Cash Flow Statement: Various cash and non-cash transactions, flow of cash, preparation of Cash

Flow Statement and its

analysis.

Suggested Readings

Syllabus


1) Narayanswami - Financial Accounting: A Managerial Perspective (PHI, 2nd Edition).

2) Mukherjee - Financial Accounting for Management (TMH, 1st Edition).

3) Ramchandran & Kakani - Financial Accounting for Management (TMH, 2nd Edition).

4) Ghosh T P - Accounting and Finance for Managers (Taxman, 1st Edition).

5) Maheshwari S.N & Maheshwari S K – An Introduction to Accountancy (Vikas, 9th Edition)

6) Ashish K. Bhattacharya- Essentials of Financial Accounting (PHI, New Delhi)

7) Ghosh T.P- Financial Accounting for Managers (Taxman, 3rd Edition)

(i) Maheshwari S.N & Maheshwari S K – A text book of Accounting for Management (Vikas,

1st Edition)

(ii) Gupta Ambrish - Financial Accounting for Management (Pearson Education, 2nd Edition)

(iii) Chowdhary Anil - Fundamentals of Accounting and Financial Analysis (Pearson

Education, 1st Edition).

COMPUTER CONCEPTS AND PROGRAMMING IN ‘C’ (01MC103)

Course objective: This course is intended to provide experienced programmers with

an understanding of the basic elements of the C programming language. It will help

students to learn the fundamentals behind how to design, write, test and document

computer programs written in the C programming language.

Unit I: Basics of Computer: Introduction to digital computer, basic operations of computer,

functional components of computer, Classification of computers.

Introduction to operating system: [DOS, windows, linux and android] purpose, function,

services and types, Number system: Binary, octal and hexadecimal number systems, their

mutual conversions, Binary arithmetic.

Basics of programming: approaches to Problem solving, concept of algorithm and flow charts,

types of computer languages: Machine language, assembly language and high level language,

concept of assembler, compiler, loader and linker.

Unit II: Standard I/O in “C”, Fundamental Data Types and Storage Classes: Character types,

Integer, short, long, unsigned, single and double-precision floating point, storage classes,

automatic, register, static and external, Operators and Expressions: Using numeric and

relational operators, mixed operands and type conversion, Logical operators, Bit operations,

Operator precedence and associativity,

Unit III: Conditional Program Execution: Applying if and switch statements, nesting if and

else, restrictions on switch values, use of break and default with switch, Program Loops and

Iteration: Uses of while, do and for loops, multiple loop variables, assignment operators, using

break and continue, Modular Programming: Passing arguments by value, scope rules and

global variables, separate compilation, and linkage, building your own modules. Arrays: Array

notation and representation, manipulating array elements, using multidimensional arrays, arrays

of unknown or varying size,

Unit IV: Arrays: Array notation and representation, manipulating array elements, using multi-

dimensional arrays. Structure, union, enumerated data types, Functions: introduction, types of

functions, functions with array, recursive functions, Pointers: introduction, declaration,

Syllabus


applications File handling, standard C preprocessors, defining and calling macros, conditional

compilation, passing values to the compiler.

Unit V: Concept of OOP: Abstraction, Encapsulation, Inheritance, and Polymorphism in C++.

Text Books:

1. Computer Concepts and Programming in C by Vikas Gupta, Wiley India Publication

2. Computer Concepts and Programming by Anami, Angadi and Manvi, PHI Publication

3. C programming by Kernighan and Ritchie, PHI

4. Computer Fundamentals and Programming in C. Reema Thareja, Oxford Publication

5. Computer Concepts and Programming in C, E Balaguruswami, McGraw Hill

6. Computer Concepts and Programming in C by D.S. Yadav and Rajeev Khanna, New Age

International Publication

7. Programming in C A Practical approach by Ajay Mittal, Pearson Publication

8. Computer Fundamental and C programming by K K Gupta, Acme Learning Publication

Reference:

1. Problem Solving and Program Design in C, by Jeri R. Hanly, Elliot B. Koffman, Pearson

Addison-Wesley, 2006.

2. Computer Science- A Structured Programming Approach Using C, by Behrouz A. Forouzan,

Richard F.Gilberg, Thomson, Third Edition [India Edition], 2007.

3. Object- Oriented Programming In C++ by Rajesh K Shukla

Syllabus


DISCRETE MATHEMATICS (01MC104)

Course objective:

The main objectives of this course are to train the students to read and write mathematical

proofs; to develop the students' mathematical problem solving skills; and to familiarize the

students with standard concepts in discrete mathematics.

Unit-I

Set Theory: Introduction, Size of sets and cardinals, Venn diagrams, Combination of sets,

Multisets,

Ordered pairs and Set identities.

Relations & Functions: Relations - Definition, Operations on relations, Composite relations,

Properties of relations, Equality of relations, Partial order relation. Functions - Definition,

Classification of functions, Operations on functions, Recursively defined functions.

Notion of Proof: Introduction, Mathematical Induction, Strong Induction and Induction with

Nonzero base cases.

Unit-II

Algebraic Structures: Definition, Properties, Types: Semi Groups, Monoid, Groups, Abelian

Groups. Subgroups and order, Cyclic Groups, Cosets, Normal Subgroups, Permutation and

Symmetric groups, Homeomorphisms and isomorphism of Groups, Definition and elementary

properties of Rings and Fields: definition and standard results.

Unit-III

Lattices: Introduction, Partial order sets, Combination of partial order sets, Hasse diagram,

Introduction of lattices, Properties of lattices – Bounded, Complemented, Modular and Complete

lattice.

Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Boolean functions.

Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean

algebra.

Unit-IV

Propositional & Predicate Logic: Propositions, Truth tables, Tautology, Contradiction, Algebra

of propositions, Theory of Inference and Natural Deduction. Theory of predicates, First order

predicate, Predicate formulas, quantifiers, Inference theory of predicate logic.

Unit-V

Trees & Graphs: Trees - Definition, Binary trees, Binary tree traversal, Binary search trees.

Graphs-Definition and terminology, Representation of graphs, Bipartite graphs, Planar graphs,

Isomorphism andHomeomorphism of graphs, Multigraphs, Euler and Hamiltonian paths, Graph

coloring.

Recurrence Relations: Introduction, Growth of functions, Recurrences from algorithms,

Methods of solving recurrences.

Combinatory: Introduction, Counting Techniques, Pigeonhole Principle, Pólya’s Counting

Theory.

Text Books:

(i) Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw-Hill, 2006.

(i) Discrete Mathematical Structures, B. Kolman, R. C. Busby, and S. C. Ross, Prentice Hall,

2004.

Syllabus


(iii) Discrete and Combinatorial Mathematics, R. P. Grimaldi, Addison Wesley, 2004.

(iv) Discrete Mathematical Structures, Y N Singh, Wiley-India, First Edition, 2010.

COMPUTER ORGANIZATION & ARCHITECTURE ( 01MC111)

Course Objective:

This course deals with computer organization and design. It is concerned with the structure and

behavior of the various functional modules of the computer and how they interact to provide the

processing needs of the user. It is concerned with the way the hardware components are

connected together to form a computer system.

Unit-1: Digital Electronics : Data Representation in Computer Systems: Introduction,

Positional Numbering Systems, Converting Between Bases, Signed Integer Representation,

Floating-Point Representation, Character Codes

Arithmetic

Overview, Fixed Point Addition and Subtraction, Fixed Point Multiplication and Division,

Floating Point Arithmetic

Boolean Algebra and Digital Logic Introduction, Boolean Algebra, Boolean Expressions, Boolean Identities, K-Maps & Map

minimization , Logic Gates, Digital Components, Combinational Circuits, Sequential Circuits

Unit-2: Memory, Register and Register transfer: Register Transfer Language, Bus and

Memory Transfers, Bus Architecture, Bus Arbitration, Arithmetic Logic, Shift Micro-operation,

Arithmetic Logic Shift Unit, Design of Fast address, Arithmetic Algorithms (addition,

subtraction, Booth Multiplication), IEEE standard for Floating point numbers Memory

Hierarchy, Main Memory (RAM and ROM Chips), organization of 2D and 21/2D, Auxiliary

memory, Cache memory, Virtual Memory, Memory management hardware

Unit-3: Control Design: Hardwired & Micro Programmed (Control Unit): Fundamental

Concepts (Register Transfers, Performing of arithmetic or logical operations, Fetching a word

from memory, storing a word in memory), Execution of a complete instruction, Multiple-Bus

organization, Hardwired Control, Micro programmed control(Microinstruction, Microprogram

sequencing, Wide-Branch

addressing, Microinstruction with Next-address field, Prefetching Microinstruction).

Unit-4 :

Processor Design: Processor Organization: General register organization, Stack organization,

Addressing mode, Instruction format, Data transfer & manipulations, Program Control, Reduced

Instruction Set Computer.

Input-Output Organization: I/O Interface, Modes of transfer, Interrupts & Interrupt handling,

Programmed I/O, Direct Memory access, Input-Output processor, Serial Communication.

Unit 5:

RISC & CICS Architecture, Basic MIPS Implementation, Pipelining, Instruction-level

Parallelism, Parallel Processing Challenges, Flynn’s Classification, Hardware Multi-threading,

Multicore processing.

Syllabus


Text-Books(TB)

1. Logic and Digital Design, Morris mano and Kimicharels 4th Edition, Prentice Hall.

2. Computer System Architecture, M. Mano(PHI)

3. Computer Organization, Vravice, Zaky&Hamacher (TMH Publication)

Reference Books (RB)

1. Structured Computer Organization, Tannenbaum(PHI)

2. Computer Organization, Stallings(PHI)

3. Computer Organization, John P.Hayes (McGraw Hill)

Professional Communication Lab (01MP101)

Interactive and Communicative Practical with emphasis on Oral Presentation/Spoken

Communication based on International Phonetic Alphabets (I.P.A.)

LIST OF PRACTICALS

1. Group Discussion: Practical based on Accurate and Current Grammatical Patterns.

2. Conversational Skills for Interviews under suitable Professional Communication Lab

conditions with emphasis on Kinesics.

3. Communication Skills for Seminars/Conferences/Workshops with emphasis on

Paralinguistics/ Kinesics.

4. Presentation Skills for Technical Paper/Project Reports/ Professional Reports based on proper

Stress and Intonation Mechanics.

5. Official/Public Speaking based on suitable Rhythmic Patterns.

6. Theme- Presentation/ Key-Note Presentation based on correct argumentation methodologies.

7. Individual Speech Delivery/Conferences with skills to defend Interjections/Quizzes.

8. Argumentative Skills/Role Play Presentation with Stress and Intonation.

9. Comprehension Skills based on Reading and Listening Practicals on a model Audio-Visual

Usage.

Reference Books

1. Bansal R.K. & Harrison: Phonetics in English, Orient Longman, New Delhi.

2. Sethi & Dhamija: A Course in Phonetics and Spoken English, Prentice Hall, New Delhi.

3. L.U.B.Pandey & R.P.Singh, A Manual of Practical Communication, A.I.T.B.S. Pub. India Ltd.

Krishan Nagar, Delhi.

4. Joans Daniel, English Pronouncing Dictionary, Cambridge Univ. Press.

Syllabus


Computer Concept and programming in ‘C’ Lab (01MP103) Write a program in C/ C++ :

1. that accepts the marks of 5 subjects and finds the sum and percentage marks obtained by the

student.

2. that calculates the Simple Interest and Compound Interest. (The Principal, Amount, Rate of

Interest and Time are entered through the keyboard).

3. to calculate the area and circumference of a circle.

4. that accepts the temperature in Centigrade and converts into Fahrenheit using the formula

C/5=(F-32)/9.

5. that swaps values of two variables using a third variable.

6. that checks whether the two numbers entered by the user are equal or not.

7. to find the greatest of three numbers.

8. that finds whether a given number is even or odd.

9. that tells whether a given year is a leap year or not.

10. to demonstrate the use of switch case statement.

11. to understand the concept of pointers.

12. to print the sum of all numbers up to a given number.

13. to find the factorial of a given number.

14. to print sum of even and odd numbers from 1 to N numbers.

15. to print the Fibonacci series.

16. to check whether the entered number is prime or not.

17. to find the sum of digits of the entered number.

18. to find the reverse of a number.

19. to print Armstrong numbers from 1 to 100.

20. to convert binary number into decimal number and vice versa.

21. that simply takes elements of the array from the user and finds the sum of these elements.

22. that inputs two arrays and saves sum of corresponding elements of these arrays in a third

array and prints them.

23. to find the minimum and maximum element of the array.

24. to search an element in a array using Linear Search.

25. to sort the elements of the array in ascending order using Bubble Sort technique.

26. to add and multiply two matrices of order nxn.

27. that finds the sum of diagonal elements of a mxn matrix.

28. to implement strlen (), strcat (),strcpy () using the concept of Functions.

29. to demonstrate the structure and union.

30. to implement different file handling functions.

31. to demonstrate the object oriented concepts.

Syllabus


Second semester

COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES (01MC202)

Course Objective: The objective of this course is to present the foundation of basic mathematical

operations that can be executed through the program and codes on computers.

Unit-I Floating point Arithmetic: Representation of floating point numbers, Operations,

Normalization, Pitfalls of floating point representation, Errors in numerical computation

Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using

Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant

method, Rate of convergence of iterative methods.

Unit-II Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss

Elimination direct method and pivoting, Ill Conditioned system of equations, Refinement of

solution. Gauss Seidal iterative method, Rate of Convergence

Interpolation and approximation: Finite Differences, Difference tables Polynomial

Interpolation: Newton’s forward and backward formula Central Difference Formulae: Gauss

forward and backward formula, Stirling’s, Bessel’s, Everett’s formula.

Interpolation with unequal intervals: Langrange’s Interpolation, Newton Divided difference

formula, Hermite’s Interpolation Approximation of function by Taylor’s series and Chebyshev

polynomial

Unit-III Numerical Differentiation and Integration: Introduction, Numerical Differentiation,

Numerical Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule Euler-

Maclaurin Formula

Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge-

Kutta methods, Predictor-corrector method, Automatic error monitoring, stability of solution.

Unit-IV Curve fitting, Cubic Spline and Approximation: Method of least squares, fitting of

straight lines, polynomials, exponential curves etc

Frequency Chart: Different frequency chart like Histogram, Frequency curve, Pi-chart.

Regression analysis: Linear and Non-linear regression, Multiple regression

Unit-V Time series and forcasting: Moving averages, smoothening of curves, forecasting

models and methods. Statistical Quality Controls methods

Testing of Hypothesis: Test of significance, Chi-square test, t-test, ANOVA, F-Test Application

to medicine, agriculture etc.

References:

1. Rajaraman V., “Computer Oriented Numerical Methods”, PHI

2. Gerald & Wheatley, “Applied Numerical Analyses”, AW

3. Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”,

New Age Int.

4. Grewal B. S., “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi

5. T. Veerarajan, T Ramachandran, “Theory and Problems in Numerical Methods”, TMH

6. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH

7. Francis Scheld, “Numerical Analysis”, TMH

8. Gupta S. P., “Statistical Methods”, Sultan and Sons

Syllabus


INNOVATION & ENTREPRENEURSHIP ( 01MC211)

Course Objective: The objective of innovation and entrepreneurship is to transfer of knowledge,

methodology and practice of technology-based entrepreneurship and support for the creation

of technology based businesses. To create and sustain global links to share best practices in

countries where the university has established programs for technology transfer and

entrepreneurship

Unit-I: Innovation and Entrepreneurship What is innovation and entrepreneurship? Innovation Types and sources, recognizing

opportunities, acting on the opportunities, innovation strategies and management, strengthening

the national innovation system, fostering innovation and entrepreneurship.

Unit II: Entrepreneurship Meaning, Definition and concept of Enterprise, Entrepreneurship

and Entrepreneurship Development, Evolution of Entrepreneurship, Theories of

Entrepreneurship, Characteristics and Skills of Entrepreneurship, Entrepreneurship and

Economic Development; Classification and Types of Entrepreneurs; Entrepreneurial

Competencies; Factor Affecting Entrepreneurial Growth – Economic, Non-Economic Factors;

Concepts of Intrapreneurship, Entrepreneur v/s Intrapreneur, Traits/Qualities of an Entrepreneur;

Manager Vs. Entrepreneur, Problems of Entrepreneurship.

Unit III: Opportunity / Identification and Product Selection: Meaning and concept of

Entrepreneurial Competency, Developing Entrepreneurial Competencies, Entrepreneurial

Culture, Entrepreneurial Mobility, Factors affecting Entrepreneurial mobility, Types of

Entrepreneurial mobility. Entrepreneurial Opportunity Search and Identification; Criteria to

Select a Product; Conducting Feasibility Studies; Project Finalization; Sources of Information

Unit-IV

Role of Government in promoting Entrepreneurship, MSME policy in India,

Agencies for Policy Formulation and Implementation: District Industries Centers (DIC), Small

Industries Service Institute (SISI),Entrepreneurship Development Institute of India (EDII),

National Institute of Entrepreneurship & Small Business Development (NIESBUD), National

Entrepreneurship Development Board (NEDB),

Financial Support System: Forms of Financial support, Long term and Short term financial

support, Sources of Financial support, Development Financial Institutions, Investment

Institutions.

Unit-V

Women Entrepreneurship: Meaning, Characteristic features, Problems of Women

Entrepreneurship in India, Developing Women Entrepreneurship in India, Concept of Social

Enterprise and Social Entrepreneurship, Social Entrepreneurs, Sustainability Issues in Social

Entrepreneurship, Rural Entrepreneurship, Family Business Entrepreneurship

Project Management: Concept, Features, Classification of projects, Issues in Project

Management, Project Identification, Project Formulation, Project Design and Network Analysis,

Project Evaluation, Project Appraisal, Project Report Preparation, Specimen of a Project Report

Case Studies - At least 4 (four) during this Course

Suggested Readings:

1. Lall & Sahai:Entreprenurship(Excel Books )

http://www.ic2.utexas.edu/

Syllabus


2. Couger, C- Creativity and Innovation (IPP, 1999)

3. Kakkar D N - Enterpreneurship Development(Wiley Dreamtech)

4. A.K.Rai – Entrepreneurship Development, (Vikas Publishing)

5. Sehgal & Chaturvedi-Entrepreneurship Development(UDH Publishing )

6. R.V. Badi & N.V. Badi - Entrepreneurship (Vrinda Publications)

7. Holt - Entrepreneurship : New Venture Creation (Prentice-Hall).

8. Barringer M J - Entrepreneurship (Prentice-Hall)

9. Nina Jacob, - Creativity in Organisations (Wheeler, 1998)Desai, Vasant (2003). Small-Scale

Industries and Entrepreneurship. Himalaya Publishing House,Delhi.

10. Kaulgud, Aruna (2003). Entrepreneurship Management. Vikas Publishing House, Delhi.38

11. Cynthia, L. Greene (2004). Entrepreneurship Ideas in Action. Thomson Asia Pvt. Ltd.,

Singapore.

12. Chandra, Ravi (2003). Entrepreneurial Success: A Psychological Study. Sterling Publication

Pvt.Ltd., New Delhi.

13. Balaraju, Theduri (2004). Entrepreneurship Development: An Analytical Study. Akansha

Publishing House, Uttam Nagar, New Delhi.

14. David, Otes (2004). A Guide to Entrepreneurship. Jaico Books Publishing House, Delhi.

Taneja (2004). Entrepreneurship. Galgotia Publishers.

Syllabus


ENVIRONMENT & ECOLOGY (01MC205)

Course Objective: This course provides an introduction to the science of ecology and the

physical and biological processes that affect our environment. Main objective of the course is for

student to learn about the conceptual framework of ecology.

Unit-I: Nature of Environment Introduction to Environmental Science - Definition and scope

and need for public awareness Ecosystems - Concept, structure and functions, restoration of

damaged ecosystems Biodiversity Definition, description at national and global level, threats and

conservation Natural Resources - Renewable and non-renewable and their equitable use for

sustainability, Material cycles– carbon, nitrogen and sulphur cycle. Conventional and Non-

conventional Energy Sources – fossil fuel-based, hydroelectric, wind, nuclear and solar energy,

biomass, biodiesel, hydrogen as an alternative fuel

Unit-II: Impact of Human Activity on Environment Human Population and Environment –

Population growth, population explosion and migration; Impact of farming, housing, mining,

transportation and industrial growth Social Issues Related to Environment– Sustainable

development, urban problems (related to water and energy conservation and waste management),

resettlement and rehabilitation Environmental ethics

Unit-III: Environmental Changes and Human Health Environmental Pollution–Definition,

causes and effects, control measures for water, air, soil, marine, land, noise, thermal pollution,

Climate change– Greenhouse effect and global warming, acid rain, ozone layer formation and

depletion Impact on human health – water and air borne diseases, diseases induced by residual

impurities in drinking water (fluoride and arsenic); Toxic wastes and carcinogens; Nuclear

hazards

Unit- IV: Environmental Protection through Assessment and Education Indicators and

Impact Assessment – Bio-indicators, Natural disasters and disaster management, Impact

assessment through inventorying and monitoring Environmental Protection– Role of individuals,

organizations and government in pollution control Laws, Conventions and Treaties–National

legislation, issues in the enforcement of environmental legislation, initiatives by non-

governmental organizations, global efforts in environmental protection Environmental

education–women and value education

Recommended Textbook:

Environmental Studies, J Krishnawamy , R J Ranjit Daniels, Wiley India.

Recommended Reference Books:

1. Environmental Science, Bernard J. Nebel, Richard T. Right, 9780132854467, Prentice Hall

Professional 1993.

2. Environment and Ecology, R K Khandal, 978-81-265-4277-2, Wiley India.

3. Environmental Science, 8th Ed ISV, Botkin and Keller, 9788126534142, Wiley India.

4. Environmental Studies, R Rajagopalan, 978-0195673937, Oxford University Press

5. Textbook of Environmental Science and Technology, M.Anjireddy, BS Publications

6. Environmental Studies, Soli. J Arceivala, Shyam, R Asolekar, 9781259006050, McGrawHill

India, 2012.

7. Environmental Studies, D.L. Manjunath, 9788131709122 Pearson Education India, 2007

8. Textbook of Environment Ecology , Singh, Acme Learning

9. Perspective in Environmental Studies, Kaushik, New Age International

Syllabus


10. Environmental Studies, B. Joseph, 2nd Ed, 978-0070648134, Tata McGraw Hill

DATA STRUCTURES USING ‘C’ (01MC206)

Course Objective: This course couples work on program design, analysis with an introduction to

the study of data structures. Data structures capture common ways to store and manipulate data,

and they are important in the construction of sophisticated computer programs.

Students will be expected to write C programs, ranging from very short programs to more

elaborate systems. Since one of the goals of this course is to teach you how to write large,

reliable programs.

Emphasize will be given on development of clear, modular programs that are easy to read,

debug, verify, analyze, and modify

Unit –I Introduction: Basic Terminology, Elementary Data Organization, Data Structure

operations, Algorithm Complexity and Time-Space trade-off

Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays,

address calculation, application of arrays, Character String in C, Character string operation,

Array as Parameters, Ordered List, Sparse Matrices, and Vectors.

Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop,

Array Representation of Stack, Linked Representation of Stack, Operations Associated with

Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation

of postfix expression using stack.

Recursion: Recursive definition and processes, recursion in C, example of recursion, Tower of

Hanoi Problem, simulating recursion. Backtracking, recursive algorithms, principles of

recursion, tail recursion, removal of recursion.

Unit – II Queues: Array and linked representation and implementation of queues, Operations on

Queue: Create, Add, Delete, Full and Empty. Circular queue, Deque, and Priority Queue.

Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List,

Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion

to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in

Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and

Compaction.

Unit – III Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic

Expressions, Complete Binary Tree. Extended Binary Trees, Array and Linked Representation of

Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded Binary trees,

Huffman algorithm.

Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash

Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.

Unit ‐ IV Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort,

Sorting on Different Keys, Practical consideration for Internal Sorting.

Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of

Search Algorithm, Path Length, AVL Trees, B-trees.

Syllabus


Unit – V Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs,

Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component

and Spanning Trees, Minimum Cost Spanning Trees.

File Structures: Physical Storage Media File Organization, Organization of records into Blocks,

Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index

Files, B Tree index Files, Indexing and Hashing Comparisons.

Text Books

1. Y. Langsam, M. Augenstin and A. Tannenbaum, Data Structures using C and C++, Pearson

Education Asia, 2nd Edition, 2002.

2. Ellis Horowitz, S. Sahni, D. Mehta Fundamentals of Data Structures in C++, Galgotia Book

Source, New Delhi.

Reference Books

1. S. Lipschutz, Data Structures Mc-Graw Hill International Editions, 1986.

2. Jean-Paul Tremblay, Paul. G. Soresan, An introduction to data structures with

Applications,Tata Mc-Graw Hill International Editions, 2nd edition 1984.

3. A. Michael Berman, Data structures via C++, Oxford University Press, 2002.

4. M. Weiss, Data Structures and Algorithm Analysis in C++, Pearson Education, 2002, 2nd edition.

Syllabus


INTRODUCTION TO AUTOMATA THEORY AND LANGUAGES (01MC207)

Course Objective: The course introduces some fundamental concepts in automata theory and

formal languages including grammar, finite automaton, regular expression, formal language,

pushdown automaton, and Turing machine. Not only do they form basic models of computation,

they are also the foundation of many branches of computer science, e.g. compilers, software

engineering, concurrent systems, etc. The properties of these models will be studied and various

rigorous techniques for analyzing and comparing them will be discussed, by using both

formalism and examples.

Unit-I Basic concepts of Automata Theory: Alphabets, Strings and Languages, Deterministic Finite

Automata (DFA) and Nondeterministic Finite Automata (NFA) – Definition, Representation

using Transition Tables and State Diagrams, Language of DFA and NFA. NFA with ε-

transitions, Language of NFA with ε-transitions, Equivalence of NFA and DFA.

Unit – II

Regular Expressions and Languages: Introduction, Definition of regular expression, Kleen’s

Theorem, Equivalence of regular expression and Finite Automata, Pumping Lemma for regular

Languages, Closure properties of Regular Languages, Decision properties of Regular Languages,

Finite Automata with Output: Moore and Mealy Machine, Equivalence of Moore and Mealy

Machines.

Unit – III

Non-Regular Grammars: Definition of Grammar, Classification of Grammars, Chomosky's

Hierarchy. Context Free Grammars (CFG) and Context Free Languages (CFL) - Definition,

Examples, Derivation trees, Ambiguous Grammars, Simplification of Grammars, Normal forms

of CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs, Pumping

lemma for CFLs. Push Down Automata (PDA): Definition and Description, Language of PDA

and its applications.

Unit – IV

Turing Machines: Introduction, Basic Features of a Turing Machine, Language of a Turing

Machine,Variants of Turing Machine: Multitapes, Nondeterministic Turing Machine, Universal

Turing Machine.Turing Machine as Computer of Integer functions, Halting problem of Turing

Machine, ChurchTuring Thesis.

Unit – V

Undecidability: Introduction, Undecidable problems about Turing Machines, Rice's Theorem,

Post's Correspondence problem (PCP) and Modified PCP. Tractable and Intractable Problems: P

and NP, NPComplete Problems, Introduction to recursive function theory.

Text Books:

1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and

Ullman. 2nd edition, Pearson Education Asia

2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw

Hill

3. Elements and Theory of Computation, C Papadimitrou and C. L. Lewis, PHI

4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age International

Syllabus


COMP. BASED NUMERICAL & STATISTICAL TECHNIQUES LAB (01MP202) Write a program in C:

1. to demonstrate the errors produced during numerical computations with floating point numbers.

2. to find roots of algebraic / trancedental equations using Bisection, Newton Raphson, regul-falsi

methods.

3. to determine interpolating polynomial using Langrange method, Newton’s divided difference

method

of interpolation

4. to implement method of least square curve fitting.

5. to determine numerical differentiation.

6. to implement numerical integration using Trapezoidal rule and Simpson’s 3/8 rules.

7. to implement Runge-Kutta second order and fourth order method for solving differential equations

8. to implement Predictor-Corrector method for solving differential equations

9. to display various types of frequency chart

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified

manner.

DATA STRUCTURES LAB (01MP206)

Write a Program in C or C++ for:

1. Sorting: Bubble sort, Selection sort and Quick sort.

2. Searching : Linear Search and Binary Search.

3. Array implementation of Stack and Circular Queue.

4. Dynamic implementation of Stack, Linked List and Circularly Linked List.

5. to realize the creation of Binary Search Tree.

6. for post order tree traversal.

7. to realize graph data structure.

8. to obtain minimum cost spanning tree of a given weighted graph.

9. to find shortest path using Warshal’s algorithm and Dijikstra algorithm.

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a

justified manner.

Syllabus


Third Semester

INTERNET AND CORE JAVA (02MC301)

Course Objective: Java is a powerful object-oriented programming language with simple code

structure. You can create applications and applets with graphics and user interfaces because Java

has built-in application programming interface (API) and due to its rich set of interfaces java has

a platform in itself. Java provides errorless programming with platform independent feature. Java

developers tried to write the code structure similar to the syntax of C++ so it would be easy for

C++ programmers to learn java. In comparison to C++, Java handles many operations like

creation and deletion of memory automatically; it helps to make bug-free code in Java

application.

Unit-1

Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an

ISP, Introduction to Internet services, E-Mail concepts, Sending and Receiving secure E-Mail,

Voice and Video Conferencing.

Unit-2

Core Java: Introduction, Operator, Data type, Variable, Arrays, Control Statements, Methods &

Classes, Inheritance, Package and Interface, Exception Handling, Multithread programming, I/O,

Java Applet, String handling, Networking, Event handling, Introduction to AWT, AWT controls,

Layout managers, Menus, Images, Graphics.

Unit-3

Java Swing: Creating a Swing Applet and Application, Programming using Panes, Pluggable

Look and feel, Labels, Text fields, Buttons, Toggle buttons, Checkboxes, Radio Buttons, View

ports, Scroll Panes, Scroll Bars, Lists, Combo box, Progress Bar, Menus and Toolbars, Layered

Panes, Tabbed Panes, Split Panes, Layouts, Windows, Dialog Boxes, Inner frame.

JDBC: The connectivity Model, JDBC/ODBC Bridge, (5) java.sql package, connectivity to

remote database, navigating through multiple rows retrieved from a database.

Unit-4

Java Beans: Application Builder tools, The bean developer kit(BDK), JAR files, Introspection,

Developing a simple bean, using Bound properties, The Java Beans API, Session Beans, Entity

Beans, Introduction to Enterprise Java beans (EJB),

Introduction to RMI (Remote Method Invocation): A simple client-server application using

RMI.

Unit-5

Java Servlets: Servlet basics, Servlet API basic, Life cycle of a Servlet, Running Servlet,

Debugging Servlets, Thread-safe Servlets, HTTP Redirects, Cookies, Introduction to Java Server

pages (JSP).

References:

1. Margaret Levine Young, “The Complete Reference Internet”, Tata Mcgraw-hill Education

Pvt. Ltd.

2. Thampi, “Object Oriented Programming in JAVA” Wiley Dreamtech Publication.

3. Balagurusamy E, “Programming in JAVA”, Tata Mcgraw-hill Education Pvt. Ltd.

4. Dustin R. Callway, “Inside Servlets”, Addison Wesley.

Syllabus


5. Mark Wutica, “Java Enterprise Edition”, QUE.

6. Steven Holzner, “Java2 Black book”, Wiley Dreamtech Publication.

7. Liang, “Introduction to Java Programming, Comprehensive Version”, Pearson Education.

8. Deitel and Deitel, “Java: How to Program” PHI Learning Private Limited, Delhi India.

DATA BASE MANAGEMENT SYSTEM (02MC302)

Course Objective: A Database Management System (DBMS) is a plant of computer programs

that assures the beginning. The objective of this syllabus is to provide broad introduction to the

concepts of database system and relational systems in particulars. It also introduce the standard

database language SQL Structured Query Language and the description of relational model

which are fundamental of relational system and we also concerned with transaction management

system

Unit- I

Introduction: An overview of database management system, Database System Vs File System,

Database system concepts andarchitecture, data models schema and instances, data independence

and data base language and interfaces, Data definitions language,DML, Overall Database

Structure.

Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER

diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key,

Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model,

relationships of higher degree.

Unit- II

Relational data Model and Language: Relational data model concepts, integrity constraints:

entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra,

relational calculus, tuple and domain calculus.

Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals,

Types of SQL commands, SQL operators and their procedure, Tables, views and indexes,

Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins,

Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and clusters.

Unit- III

Data Base Design & Normalization: Functional dependencies, normal forms, first, second,

third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization

using FD, MVD, and JDs, alternative approaches to database design.

Unit- IV

Transaction Processing Concepts: Transaction system, Testing of serializability, Serializability

of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction

failures, log based recovery, checkpoints, deadlock handling.

Unit- V

Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency

control, Time stamping protocols for concurrency control, validation based protocol, multiple

granularity, Multi-version schemes, Recovery with concurrent transaction. Transaction

Syllabus


Processing in Distributed system, data fragmentation. Replication and allocation techniques for

distributed system, overview of concurrency control and recovery in distrusted database.

References

1. Date C J, “An Introduction To Database System”, Addision Wesley

2. Korth, Silbertz, Sudarshan, “Database Concepts”, Tata Mcgraw-hill Education (India) Pvt.

Ltd.

3. Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Education New Delhi India.

4. G.K. Gupta, “Database Management System”, Tata Mcgraw-hill Education (India) Pvt. Ltd.

5. Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication Pvt. Ltd. New

Delhi.

6. Majumdar & Bhattacharya, “Database Management System”, Tata Mcgraw-hill Education

(India) Pvt. Ltd.

7. Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill (India) Pvt Ltd. New

Delhi.

8. Chakravarti, “Advanced Database Mnagement System” Wiley Dreamtech Publications.

OPERATING SYSTEM (02MC303)

Course Objective: The objective of this course is to provide overview of computer system and

operating system.The concept of process management, memory management, storage

management and protection and security issues.

Unit-I

Introduction: Definition and types of operating systems, Batch Systems, multi programming,

time–sharing parallel, distributed and real-time systems, Operating system structure, Operating

system components and services, System calls, system programs, Virtual machines.

Unit-II

Process Management: Process concept, Process scheduling, Cooperating processes, Threads,

Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multiple

processor scheduling, Real-time scheduling and Algorithm evaluation.

Unit-III

Process Synchronization and Deadlocks: The Critical-Section problem, synchronization

hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors,

Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and

Detection, Recovery from deadlock, Combined approach to deadlock handling.

Unit-IV

Storage management: Memory Management-Logical and Physical Address Space, Swapping,

Contiguous Allocation, Paging, Segmentation with paging in MULTICS and Intel 386, Virtual

Memory, Demand paging and its performance, Page replacement algorithms, Allocation of

frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems,

secondary Storage Structure, File concept, access methods, directory implementation, Efficiency

and performance, recovery, Disk structure, Disk scheduling methods, Disk management,

Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space

management, Disk reliability.

Syllabus


Unit-V

Security & Case Study: Protection and Security-Goals of protection, Domain of protection,

Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based

protection, The Security problem, Authentication, One Time passwords, Program threats, System

threats, Threat Monitoring, Encryption. Windows NT-Design principles, System components,

Environmental subsystems, File system, Networking and program interface, Linux system-

design principles, Kernel Modules, Process Management, Scheduling, Memory management,

File Systems, Input and Output, Interprocess communication, Network structure, security

References

.1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts”, Addision-Wesley

2. Milan Milankovic, “Operating Systems, Concepts and Design”, Tata McGraw-Hill.

3. Harvey M Deital, "Operating Systems", Addison Wesley

4. Richard Peterson, “Linux: The Complete Reference”, Osborne Tata McGraw-Hill.

5. SibsankarHalder and Alex A Aravind, “Operating Systems”, Pearson Education

6. D M Dhamdhere, “Operating Systems : A Concept basedApproach”, McGraw Hill.

7. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill

Education”.

DESIGN AND ANALYSIS OF ALGORITHMS (02MC304)

Course Objective: The objective of this syllabus is to provide an overview of algorithms and

their complexity and their place in modern computing system .The algorithms are described in

pseudo codes which are not any conventional programming language

Unit-I

Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of

Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution methods.

Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort Sorting in

Linear Time: Counting sort, Radix Sort, Bucket Sort, Medians and order statistics

Unit-II

Advanced Data Structure: Red Black Trees, Augmenting Data Structure, Binomial Heap, B-

Tree, Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of Algorithms on these data

structures, Dictionaries and priority Queues, mergeable heaps, concatenable queues

Unit-III

Advanced Design and Analysis Techniques: Dynamic programming, Greedy Algorithm,

Backtracking, Branch-and-Bound, Amortized Analysis

Unit-IV

Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search,

Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single Source Shortest

Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem

Unit-V

Randomized Algorithms, String Matching, NP-Hard and NP-Completeness, Approximation

Algorithms, Sorting Network, Matrix Operations, Polynomials and FFT, Number Theoretic

Algorithms

Syllabus


References

1. Thomas H Cormen Leiserson “Introduction to Algorithms”, PHI Learning Private Limited,

Delhi India.

2. Sara Baase and Allen Van Gelder ,Computer Algoritms : “Introduction to Design and

Analysis”, Pearson Education

3. Jon Kleinberg and Eva Tardos “Algorithm Design”, Pearson Education

4. Brassard Bratley “Fundamental of Algorithms”, PHI Learning Private Limited, Delhi India.

5. M T Goodrich “Algorithms Design”, John Wiley

6. Aho, “Design and Analysis of Computer Algorithms”, Pearson Education.

7. Horowitz and Sahani ,“Fundamentals of Computer Algorithms”, Galgotia Publications Pvt Ltd

Delhi India.

COMPUTER BASED OPTIMIZATION TECHNIQUES (02MC306)

Course Objective: The course aims at integrating traditional design methodologies with concepts and techniques of

modern optimization theory and practice. In the course the student will learn to create an

appropriate mathematical description (a simulation model) of the design problem, to formulate the

optimization problem and finally to use numerical optimization techniques and computer support

tools in order to solve the problem. The course has an emphasis on system design where “design"

is defined in a broad context, and therefore students from diverse disciplines are welcome to

attend the course.

Unit I

Preliminaries: Inventory Models and Replacement problems: Inventory models –various

costs-deterministic inventory models, Single period inventory model with shortest cost,

stochastic models, Application of inventory models, Economic lot sizes-price breaks,

Replacement problems-capital equipment-discounting costs-replacement in anticipation of

failure- group replacement-stochastic nature underlying the failure phenomenon.

Unit II

Linear Programming Problems (LPP): Definition of LPP, Graphical Solutions of Linear

Programming Problems, Simplex Method, and Artificial Variable Method, Two Phase Method,

Charnes’ Big-M Method, Sensitivity Analysis, Revised Simplex Method, Duality, Dual Simplex

Method

Unit III

Integer Linear Programming Problems: Integer Linear Programming Problems, Mixed

Integer Linear Programming Problems, Cutting Plane Method, Branch and Bound Method, 0-1

integer linear programming problem.

Transportation Problems: Introduction to Transportation Model, Matrix Form of TP,

Applications of TP Models, Basic Feasible Solution of a TP, Degeneracy in TP, Formation of

Loops in TP, Solution Techniques of TP, Different Methods for Obtaining Initial Basic Feasible

Solutions viz. Matrix Minima Method, Row Minima Method, Column Minima Methods, Vogel’s

Approximation Method, Techniques for Obtaining Optimal Basic Feasible Solution.

Assignment Problems: Definition, Hungarian Method for AP.

Syllabus


Unit IV

Introduction to NLP: Definition of NLP, Convex Programming Problems, Quadratic

Programming Problems, Wolfe’s Method for Quadratic Programming, Kuhn-Tucker Conditions,

Geometrical Interpretation of KT-Conditions, KT-Points etc.

Dynamic Programming: Bellman’s Principle of optimality of Dynamic Programming,

Multistage decision problem and its solution by Dynamic Programming with finite number of

stages, Solution of linear programming problems as a Dynamic Programming problem

Unit V

Queuing Theory Introduction to Queues, Basic Elements of Queuing Models, Queue

Disciplines, Memoryless Distribution, Role of Exponential and Poisson Distributions, Markovian

Process, Erlang Distribution, Symbols and Notations, Distribution Of Arrivals, Distribution of

Service Times, Definition of Steady and Transient State, Poisson Queues.

References:

1. Hadley, G.,”Linear Programming, and Massachusetts”, Addison-Wesley .

2. Taha, H.A, ”Operations Research – An Introduction”, Macmillian

3. Hiller, F.S., G.J. Lieberman, ” Introduction to Operations Research”, Holden-Day.

4. Harvey M. Wagner, “Principles of Operations R esearch with Applications to Managerial

Decisions”, Prentice Hall of India Pvt. Ltd.

5. Swarup K , “Operation Research”, S. Chand New Delhi.

CYBER SECURITY (02MC308)

Course Objective: The objective of the course is to groom experts in the field of Information

Security for taking up responsibilities such as Security Professional/ Security Analyst/ Network

& System Administrator/ Security Auditor/Ethical hackers.

Unit-I

Introduction to information systems, Types of information Systems, Development of Information

Systems, Introduction to information security, Need for Information security, Threats to

Information Systems, Information Assurance, Cyber Security, and Security Risk Analysis.

Unit-II

Application security (Database, E-mail and Internet), Data Security Considerations-Backups,

Archival Storage and Disposal of Data, Security Technology-Firewall and VPNs, Intrusion

Detection, Access Control. Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors,

Spoofs, E-mail viruses, Macro viruses, Malicious Software, Network and Denial of Services

Attack, Security Threats to E-Commerce- Electronic Payment System, eCash, Credit/Debit

Cards. Digital Signature, public Key Cryptography.

Unit-III

Developing Secure Information Systems, Application Development Security, Information

Security Governance & Risk Management, Security Architecture & Design Security Issues in

Hardware, Data Storage & Downloadable Devices, Physical Security of IT Assets,

Access Control,CCTV and intrusion Detection Systems, Backup Security Measures.

Syllabus


Unit-IV

Security Policies, Why Policies should be developed, WWW policies, Email Security policies,

Policy Review Process-Corporate policies-Sample Security Policies, Publishing and Notification

Requirement of the Policies. Information Security Standards-ISO, IT Act, Copyright Act, Patent

Law, IPR. Cyber Laws in India; IT Act 2000 Provisions,Intellectual Property Law: Copy Right

Law, Software License, Semiconductor Law and Patent Law.

References :

1. Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security ”, Pearson

Education India.

2. V.K. Pachghare, “Cryptography and information Security”, PHI Learning Private Limited,

Delhi India.

3.Dr. Surya Prakash Tripathi, Ritendra Goyal, Praveen kumar Shukla ,”Introduction to

Information Security and

Cyber Law” Willey Dreamtech Press.

4. Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill.

5. CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private Limited

,Delhi ,India

CORE JAVALAB (02MP301)

1. Write a program in Java for illustrating, overloading, over riding and various forms of

inheritance.

2. Write programs to create packages and multiple threads in Java.

3. Write programs in Java for event handling Mouse and Keyboard events.

4. Using Layout Manager create different applications.

5. Write programs in Java to create and manipulate Text Area, Canvas, Scroll Bars, Frames and

Menus using swing/AWT.

6. Using Java create Applets.

7. Use Java Language for Client Server Interaction with stream socket connections.

8. Write a program in java to read data from disk file.

Syllabus


DATA BASE MANAGEMENT SYSTEM LAB (02MP302)

The programme to be implemented using SQL

1. Create Table, SQL for Insertion, Deletion, Update and Retrival using aggregating functions.

2. Write Programs in PL/SQL, Understanding the concept of Cursors.

3. Write Program for Join, Union & intersection etc.

4. Creating Views, Writing Assertions, Triggers.

5. Creating Forms, Reports etc.

6. Writing codes for generating read and update operator in a transaction using different

situations.

7. Implement of 2PL concerning central algorithm.

8. Developing code for understanding of distributed transaction processing.

Students are advised to use Developer 2000 Oracle 8+ version for above experiments. However,

depending on the availability of Software’s students may use power builder/SQL Server/DB2

etc. for implementation.

Syllabus


Fourth Semester

COMPUTER NETWORK (02MC403)

Course Objective:

This course provides students with the skills and knowledge in data communications and

networking to set-up, maintain and troubleshoot local area networks (LAN), data communication

systems, microcomputers and peripherals including maintaining programs on the World Wide

Web. Basic objective is to provide a conceptual foundation for the study of data communications

using the open systems interconnect (OSI) model for layered architecture and to develop an

understanding in basic hardware and software environments for data communications and

computer networks.

Unit-I

Introductory Concepts: Goals and Applications of Networks, Network structure and

architecture, the OSI reference model, services, networks topology, Physical Layer-

transmission, switching methods, Integrated services digital networks, terminal handling.

Unit-II

Medium access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure

ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision

Detection, Collision free Protocols, IEEE standards, Ethernet, FDDI, Data Link Layer- basic

design issues, error correction & detection algorithms, elementary data link layer protocols,

sliding window protocols, error handling, High Level Data Link Control

Unit-III

Network Layer: Point-to Point networks, concept of virtual circuit and LAN, routing

algorithms, congestion control algorithms, internetworking, TCP/IP protocol, IP addresses, IPv6.

Unit-IV

Transport Layer: Design issues, connection management, Internet Transport Protocol (UDP),

Ethernet transport Protocol, Transmission Control Protocol. (TCP)

Unit-V

Application Layer: Domain Name System, Simple Network Management Protocol, Electronic

mail, File Transfer Protocol, Hyper Text Transfer Protocol, Introduction to Cryptography and

Network Security (DES, RSA algorithms), Communication Security (IPSec,

Firewalls), Authentication protocols such as authentication based on shared key (Diffie Helleman

Key exchanger), Introduction to

multimedia and compression Techniques.

References

1. A. S Tanenbaum, “Computer Networks”, Pearson Education.

2. W. Stallings, “Data and Computer Communication”, Macmillan Press.

3. Comer, “Computer Networks & Internet with Internet Applications” Pearson Education

4. Douglas Comer “Internetworking with TCP/IP” PHI Learning Private Limited, Delhi India.

5. Forouzan, “Data Communication and Networking” Tata Mcgraw-hill Education Pvt. Ltd.

6. W Stallings, “Computer Networks with Internet Protocols”, Pearson Education

7. W Stallings, “Local and Metropolitan Area Networks”, Pearson Education

Syllabus


MANAGEMENT INFORMATION SYSTEMS (02MC406)

Course Objective: The objective of this syllabus is to familiar students with information system

used in management and to explore MIS subsystems and technologies including software

and networking, however the coursework focuses on technology management not on

engineering. The course emphasizes management skills such as planning, Control, ERP, CRM,

project management, quality and efficiency management in IS projects.

Unit 1: Foundation of Information Systems: Introduction to information system in business,

fundamentals of information systems, Solving business problems with information systems,

Types of information systems, Effectiveness and efficiency criteria in information system.

Unit 2: An overview of Management Information Systems: Definition of a management

information system, MIS versus Data processing, MIS & Decision Support Systems, MIS &

Information Resources Management, End user computing, Concept of an MIS, Structure of a

Management information system.

Unit 3: Concepts of planning & control: Concept of organizational planning, The Planning

Process, Computational support for planning, Characteristics of control process, The nature of

control in an organization.

Unit 4: Business applications of information technology: Internet & electronic commerce,

Intranet, Extranet & Enterprise Solutions, Information System for Business Operations,

Information System for Managerial Decision Support, Information System for Strategic

Advantage.

Unit 5: Managing Information Technology: Enterprise & global management, Security &

Ethical challenges, Planning & Implementing changes.

Advanced Concepts in Information Systems: Enterprise Resource Planning, Supply Chain

Management, Customer Relationship Management, and Procurement Management.

References

1. Brian, “Management Information System”, Tata Mcgraw-hill Education Pvt. Ltd.

2. Gordon B. Davis & Margrethe H. Olson, “Management Information System”, Tata Mcgraw-

hill Education Pvt. Ltd.

3. Brian, “Introduction to Information System”, Tata Mcgraw-hill Education Pvt. Ltd.

4. Murdick, “Information System for Modern Management”, PHI Learning Private Limited,

Delhi India.

5. Jawadekar, “ Management Information System”, Tata Mcgraw-hill Education Pvt. Ltd.

6. Jain Sarika, “Information System”, PPM Publication.

7. Davis, “Information System”, Palgrave Macmillan.

Syllabus


ARTIFICIAL INTELLIGENCE (02MC408)

Course Objective:

This course examines the concepts, techniques, applications, and theories of Artificial

Intelligence. The focus of the course is on the theory and application of artificial intelligence.

This course will focus on issues of search, knowledge representation, reasoning, decision

making, and learning from the perspective of an intelligent agent.

Unit-I

Introduction : Introduction to Artificial Intelligence, Foundations and History of Artificial

Intelligence, Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent

Agents. Computer vision, Natural Language Possessing.

Unit-II

Introduction to Search : Searching for solutions, Uniformed search strategies, Informed search

strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for

games, Alpha - Beta pruning.

Unit-III

Knowledge Representation & Reasoning: Propositional logic, Theory of first order logic,

Inference in First order logic, Forward & Backward chaining, Resolution, Probabilistic

reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks.

Unit-IV

Machine Learning : Supervised and unsupervised learning, Decision trees, Statistical learning

models, Learning with complete data - Naive Bayes models, Learning with hidden data - EM

algorithm, Reinforcement learning,

Unit-V

Pattern Recognition : Introduction, Design principles of pattern recognition system, Statistical

Pattern recognition, Parameter estimation methods - Principle Component Analysis (PCA) and

Linear Discriminant Analysis (LDA), Classification Techniques – Nearest Neighbor (NN) Rule,

Bayes Classifier, Support Vector Machine (SVM), K – means clustering.

References:

1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson

Education

2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata Mcgraw-hill Education Pvt. Ltd.

3. E.Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson Education

4. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India.

Syllabus


MOBILE COMPUTING (02MC409)

Course Objective: The aim of this course is to respond to the growing demand for mobile

application engineers; the specialist architects, designers and implementers of mobile internet

and enterprise, Mobile computing is an IT course that aims to develop graduates with the

necessary understanding and skills to build mobile internet and business computing applications

using the latest technologies and to provide basics for various techniques in Mobile

Communications and Mobile Content services.

Unit – I

Introduction, issues in mobile computing, overview of wireless telephony: cellular concept,

GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical, handoffs,

channel allocation in cellular systems, CDMA, GPRS.

Unit - II

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,

Wireless multiple access protocols, TCP over wireless, Wireless applications, data broadcasting,

Mobile IP, WAP: Architecture, protocol stack, application environment, applications.

Unit – III

Data management issues, data replication for mobile computers, adaptive clustering for mobile

wireless networks, File system, Disconnected operations.

Unit - IV

Mobile Agents computing, security and fault tolerance, transaction processing in mobile

computing environment.

Unit – V

Adhoc networks, localization, MAC issues, Routing protocols, global state routing (GSR),

Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc

on demand distance vector routing (AODV), Temporary ordered routing algorithm (TORA),

QoS in Ad Hoc Networks, applications.

References:

1. J. Schiller, “Mobile Communications”, Addison Wesley.

2. Charles Perkins, “Mobile IP”, Addison Wesley.

3. Charles Perkins, “Ad hoc Networks”, Addison Wesley.

4. Upadhyaya, “Mobile Computing”, Springer New York.

Syllabus


WEB TECHNOLOGY (02MC410)

Course Objective The aim of this subject is to cover current and future web technologies and

the design, development and management of web-based systems. It introduce the students to the

fundamentals various web development technologies like HTML, XML etc.

Unit I: Introduction:

Introduction to web, protocols governing the web, web development strategies, Web

applications, web project, web team.

Unit II: Web Page Designing:

HTML: list, table, images, frames, forms, CSS; XML: DTD, XML schemes, presenting and

using XML

Unit III: Scripting:

Java script: Introduction, documents, forms, statements, functions, objects; event and event

handling; introduction to AJAX, VB Script

Unit IV: Server Site Programming:

Introduction to active server pages (ASP),ASP.NET, java server pages (JSP), JSP application

design, tomcat server, JSP objects, declaring variables, and methods, debugging, sharing data

between JSP pages, Session, Application: data base action , development of

java beans in JSP, introduction to COM/DCOM.

Unit V: PHP (Hypertext Preprocessor):

Introduction, syntax, variables, strings, operators, if-else, loop, switch, array, function, form

,mail, file upload, session, error, exception, filter, PHP-ODBC.

References

1.Xavier, C, “ Web Technology and Design” , New Age International.

2.Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication.

3.Ramesh Bangia, “Internet and Web Design” , New Age International

4.Bhave, “Programming with Java”, Pearson Education

5.Ullman, “PHP for the Web: Visual QuickStart Guide”, Pearson Education

6.Deitel, “Java for programmers”, Pearson Education

Syllabus


HUMAN VALUES AND PROFESSIONAL ETHICS (02MC411)

Course Objective: This course aims at helping students to think about some of the important

ethical implications of the day-to-day happenings and practices of Indian industry and business.

It is designed to stimulate discussion and debate rather than to formulate principles, and to raise

further questions rather than to dictate answers. The following objectives are underlined: To

improve ethical reasoning by correlating moral concepts to business practices - clarification of

the values that determine managerial behavior. To understand Indian Ethos & Values is an

important feature of this paper.

Unit-I

Business Ethics: Nature, scope and purpose of ethics; Relevance of values; Importance of Ethics

& moral standards; Ethics & Moral Decision Making.

Values impact in Business: Indian Value System and Values, Teaching from scriptures and

tradition (Geeta , Mahabharata)

Unit- II

Corporate Social Responsibility: Nature, scope & Importance; Corporate Governance: Concept,

Importance for Industry; Ethical Issues related with Advertisements, Finance, Investment,

Technology; Spiritual Values in Management; Work ethics: concept of Swadhrama.

Unit -III

Gandhian approach in Management & Trusteeship: Gandhiji’s doctrine of Satya & Ahinsa,

Concept, importance & relevance of Trusteeship principle in modern business.

Unit- IV

Need, purpose & relevance of Indian Ethos; Salient features; MBA model: Manas, Buddhi,

Ahunmkar Holistic and Spiritual, Brainstorming Relevance of Bhagvad Gita: Doctrine of Karma

i..e Nishkama Karmayoga, Guna Theory (SRT i.e. Sat, Raj & Tam Model), Theory of Sanskaras,

Bhagvad Gita & Self Management.

Unit- V

Corporate Strategy: Global industrial competition, Information Technology, Competitive

Strategy, Benchmarking, Total Quality Management, Brand Building, Promotional Strategies,

Corporate Restructuring, Corporate Governance System Worldwide, Corporate Disclosure and

Investor Protection in India.

Reference Books:

1. Western doors and eastern windows- Subhash Sharma

2. Corporate corridor- Subhash Sharma

3. Human Values for managers- S K Chakarborty by Wheeler Publishing House.

4. Management Concepts in Ancient Indian Psycho-Philosophic thoughts and their

significance from present day organization- Wisdom, Banasthali Vidhyapith.

5. A History of Indian Economics Thoughts- Routlege, London.

Syllabus


WEB TECHNOLOGY LAB (02MP410)

1. Program to illustrate body and pre tags

2. Program to illustrate text Font tag

3. Program to illustrate comment,h1….h6, and div tag

4. Program to illustrate text formatting tags

5. Write a program to set a background image for both the page and single elements on the

page.

6. Program, in java script to perform all arithmetic operation

7. Program, in java script to check whether a given number is prime or not

8. Program, in java script to search an element in an array of size “n”

9. Program, in java script to illustrate a subroutine

10. Program, in java script to compute the gcd of 2 numbers using function.

11. Java script to check whether the given integer is palindrome

12. Java script to illustrate different in-built string function.

13. Create the Sign In, Sign Up and Update Application

14. Extend the user Profile Application in which user is Allowed to select the Date of Birth

from the Calendar Control.

Study of the Master Page, Content Page and Nested Master Page and their events

MINI PROJECT (02MP412)

Guidelines & General Instructions:

Every student is required to carry out project work under the supervision of a faculty

member of the department. However, a student may also opt to pursue his project work

in a reputed industry/institution with the consent of Department/Institute. In such cases, the

department must look into the suitability of the projects and assign one internal guide/supervisor.

The internal supervisor shall monitor progress of the student continuously.

A candidate is required to present the progress of the project work (at least twice) during the

semester at an appropriate time decided by the Department. There will a final presentation of the

project work at the end of the semester.

Syllabus


Fifth Semester

DOT NET FRAMEWORK & C# (03MC511) Course Objective: The main objective is of the course is to introduce the students to the

fundamentals of C#, .NET. Framework, databases and Web application development with

ASP.NET. Students will learn how to build dynamic data-driven Web applications with SQL

Server and ASP.NET .After completion of this course student will able to create a web page

using .NET and C# and able to access database using SQL with ADO.NET.

Unit-1

The .Net framework: Introduction, The Origin of .Net Technology, Common Language

Runtime (CLR), Common Type System (CTS), Common Language Specification (CLS),

Microsoft Intermediate Language (MSIL), Just-In –Time Compilation, Framework Base Classes.

Unit-II

C -Sharp Language (C#): Introduction, Data Types, Identifiers, Variables, Constants, Literals,

Array and Strings, Object and Classes, Inheritance and Polymorphism, Operator Overloading,

Interfaces, Delegates and Events. Type conversion.

Unit-III

C# Using Libraries: Namespace- System, Input-Output, Multi-Threading, Networking and

sockets, Managing Console I/O Operations, Windows Forms, Error Handling.

Unit-IV

Advanced Features Using C#: Web Services, Window Services, Asp.net Web Form Controls,

ADO.Net. Distributed Application in C#, Unsafe Mode, Graphical Device interface with C#.

Unit-V

.Net Assemblies and Attribute: .Net Assemblies features and structure, private and share

assemblies, Built-In attribute and custom attribute. Introduction about generic.

References

1. Wiley,” Beginning Visual C# 2008”,Wrox

2. Fergal Grimes,” Microsoft .Net for Programmers”. (SPI)

3. Balagurusamy,” Programming with C#”, (TMH)

4. Mark Michaelis, “Essential C# 3.0: For .NET Framework 3.5, 2/e, Pearson Education

5. Shibi Parikkar, “ C# with .Net Frame Work” , Firewall Media.

Syllabus


SOFTWARE ENGINEERING (03MC512) Course Objective: The course should provide an introduction to the fundamentals principles of

software engineering. The present course should seek to equip the student with a repertoire of

principles, tools and techniques and make him/her appreciate that software engineering is, after

all, an exercise in making compromises. Unit-I: Introduction

Introduction to Software Engineering, Software Components, Software Characteristics, Software

Crisis, Software Engineering Processes, Similarity and Differences from Conventional

Engineering Processes, Software Quality Attributes. Software Development Life Cycle (SDLC)

Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary Development Models,

Iterative Enhancement Models.

Unit-II: Software Requirement Specifications (SRS)

Requirement Engineering Process: Elicitation, Analysis, Documentation, Review and

Management of User Needs, Feasibility Study, Information Modeling, Data Flow Diagrams,

Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE Standards for SRS.

Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software Quality

Frameworks, ISO 9000 Models, SEI-CMM Model.

Unit-III: Software Design

Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization,

Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design

Strategies: Function Oriented Design, Object Oriented Design, Top-Down and Bottom-Up

Design. Software Measurement and Metrics: Various Size Oriented Measures: Halestead’s

Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity Measures:

Control Flow Graphs.

Unit-IV: Software Testing

Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression

Testing,Testing for Functionality and Testing for Performance, Top-Down and Bottom-Up

Testing

Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional

Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of Products.

Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code

Inspection, Compliance with Design and Coding Standards.

Unit-V: Software Maintenance and Software Project Management

Software as an Evolutionary Entity, Need for Maintenance, Categories of Maintenance:

Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-

Engineering, Reverse Engineering. Software Configuration Management Activities, Change

Control Process, Software Version Control, An Overview of CASE Tools. Estimation of Various

Parameters such as Cost, Efforts, Schedule/Duration, Constructive Cost Models (COCOMO),

Resource Allocation Models, Software Risk Analysis and Management.

References:

1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.

2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.

3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers.

Syllabus


4. Pankaj Jalote, Software Engineering, Wiley

5. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI

Publication.

6. Ian Sommerville, Software Engineering, Addison Wesley.

Syllabus


NEURAL NETWORKS (03MC513) Course Objective: Understanding the whole structure of the network even with the very small

parts of the network and how they communicate with each other. Neural networks used in

artificial intelligence, have traditionally been viewed as simplified models of neural processing

in the brain.

Unit-I:

Neurocomputing and Neuroscience Historical notes, human Brain, neuron Mode l, Knowledge

representation, Al and NN. Learning process: Supervised and unsuperv ised learning, Error

correction learning,competitive learning, adaptation, statistical nature of the learning process.

Unit-II:

Data processing Scaling, normalization, Transformation (FT/FFT), principal component analysis,

regression, covariance matrix, eigen values & eigen vectors. Basic Models of Artificial neurons,

activation Functions, aggregation function, single neuron computation, multilayer perceptron,

least mean square algorithm, gradient descent rule, nonlinearly separable problems and bench

mark

problems in NN.

Unit-III

Multilayered network architecture, back propagation algorithm, heuristics for making

BPalgorithm performs better. Accelerated learning BP (like recursive least square, quick prop,

RPROP algorithm), approximation properties of RBF networks and comparison with multilayer

perceptran.

Unit-IV

Recurrent network and temporal feed-forward network, implementation with BP, self-organizing

map and SOM algorithm, properties of feature map and computer simulation. Principal

component and Independent component analysis, application to image and signal processing.

Unit-V

Complex valued NN and complex valued BP, analyticity of activation function, application in

2D information processing. Complexity analysis of network models. Soft computing. Neuro-

Fuzzy-genetic algorithm Integration.

References:

1. J.A. Anderson, An Intoduction to Neural Networks, MIT

2. Hagen Demuth Beale, Neural Network Design, Cengage Learning

3. R.L. Harvey, Neural Network Principles, PHI

4. Kosko, Neural Network and Fuzzy Sets, PHI

Syllabus


IMAGE PROCESSING (03MC514) Course Objective: The course offers a good understanding of computer algorithms to

perform image processing on digital images. Course provides a wide range of algorithms to be

applied to the images and pixels and provide solution for the problems such as the build-up of

noise and signal distortion during processing. Unit-I

Introduction and Fundamentals

Motivation and Perspective, Applications, Components of Image Processing System, Element of

Visual Perception, A Simple Image Model, Sampling and Quantization.

Image Enhancement in Frequency Domain

Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters Low-pass,

High-pass; Correspondence Between Filtering in Spatial and Frequency Domain; Smoothing Frequency

Domain Filters – Gaussian Lowpass Filters; Sharpening Frequency Domain Filters – Gaussian Highpass

Filters; Homomorphic Filtering.

Unit-II

Image Enhancement in Spatial Domain

Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions: Contrast

Stretching; Histogram Specification; Histogram Equalization; Local Enhancement; Enhancement using

Arithmetic/Logic Operations – Image Subtraction, Image Averaging; Basics of Spatial Filtering;

Smoothing - Mean filter, Ordered Statistic Filter; Sharpening – The Laplacian.

Unit-III

Image Restoration

A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-Spatial

Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic Filters Median

Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain Filtering – Bandpass Filters;

Minimum Mean-square Error Restoration.

Unit-IV Morphological Image Processing

Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and Closing,

Morphological Algorithms – Boundary Extraction, Region Filling, Extraction of Connected Components,

Convex Hull, Thinning, Thickening

Unit-V Registration

Introduction, Geometric Transformation – Plane to Plane transformation, Mapping, Stereo Imaging –

Algorithms to Establish Correspondence, Algorithms to Recover Depth

Segmentation

Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local Thresholding,

Region-based Approach, Edge and Line Detection: Edge Detection, Edge Operators, Pattern Fitting

Approach, Edge Linking and Edge Following, Edge Elements Extraction by Thresholding, Edge Detector

Performance, Line Detection, Corner Detection.

References:

1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E. Woods. Published by:

Pearson Education.

2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley and Sons,.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall, Upper Saddle River,

NJ.

Syllabus


BIG DATA (03MC515) Course Objective: This course provide us the understanding related to big data and various

challenges associated with big data. This course provides us detail about its architecture,

applications, and various tools available to handle big data.

Unit-I

UNDERSTANDING BIG DATA

What is big data,why big data,convergence of key trends, unstructured data, industry examples

of big data, web analytics,big data and marketing,fraud and big data,risk and big data ,credit risk

management, big data and algorithmic trading,big data and healthcare,big data in

medicine,advertising and big data,big data technologies, introduction to Hadoop,open source

technologies,cloud and big data mobile business intelligence,Crowd sourcing analytics ,inter and

trans firewall analytics Unit-II

NOSQL DATA MANAGEMENT

Introduction to NoSQL , aggregate data models ,aggregates ,key-value and document data

models, relationships, graph databases, schema less databases ,materialized views,distribution

models ,sharding , masterslave replication , peer-peer replication , sharding and replication ,

consistency , relaxing consistency , version stamps , mapreduce , partitioning and combining ,

composing map-reduce calculations Unit-III

BASICS OF HADOOP

Data format , analyzing data with Hadoop , scaling out , Hadoop streaming , Hadoop pipes ,

design of Hadoop distributed file system (HDFS) , HDFS concepts , Java interface , data flow

,Hadoop I/O , data integrity , compression , serialization , Avro file-based data structures Unit-IV

MAP REDUCE APPLICATIONS

Map Reduce workflows , unit tests with MRUnit , test data and local tests – anatomy of Map

Reduce job run , classic Map-reduce , YARN , failures in classic Map-reduce and YARN , job

scheduling , shuffle and sort , task execution , MapReduce types , input formats , output formats Unit-V

HADOOP RELATED TOOLS

Hbase,data model and implementations, Hbase clients ,Hbase examples – praxis.Cassandra

,cassandra data model , cassandra examples , cassandra clients , Hadoop integration. Pig , Grunt ,

pig data model , Pig Latin , developing and testing Pig Latin scripts. Hive , data types and file

formats , HiveQL data definition , HiveQL data manipulation – HiveQL queries.

Text Books:

1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging

Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.

2. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of

Polyglot Persistence", Addison-Wesley Professional, 2012.

3. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.

4. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.

5. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.

Syllabus


6. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.

7. Eben Hewitt, "Cassandra: The Definitive Guide", O'Reilley, 2010.

8. Alan Gates, "Programming Pig", O'Reilley, 2011

Syllabus


Sixth Semester

SEMINAR

03MC601


The aim of the subject is to develop ability of a student to carry out literature survey

& independent study of an advanced subject/topic/matters in the field of Computer

Science and Information technology.

At the beginning of semester a list of colloquium topic should be displayed on the notice board

by the department and/or on the institution web site. Every Student must select a topic of his

choice. The student is required to conduct rigorous study/survey on the subject under the

supervision of the faculty member of the department, prepare a report and present this in

presence of all the students of his class at the end of semester. The comments & criticism of the

topic/subject will be discussed for the benefit of all the students. The evaluation will be carried

out by the department based on the presentation.

PROJECT

03MC602


Every student is required to carry out project work under the supervision of a faculty

member of the department. However, a student may also opt to pursue his project work

in a reputed industry/institution with the consent of Department/Institute. In such cases, the

department must look into the suitability of the projects and assign one internal guide/supervisor.

The internal supervisor shall monitor progress of the student continuously.

A candidate is required to present the progress of the project work (at least twice) during the

semester at an appropriate time decided by the Department. There will a final presentation of the

project work at the end of the semester.

Documents

Department of Computer Science & Engineering · Master of Computer Application Page 3 Dr. K N Modi University, Newai Objective of the course Master of Computer Applications (MCA)