(an autonomous institution affiliated to...

(An Autonomous Institution Affiliated to VTU)

Accredited by NAAC with ‘A’ Grade

Department of Master of Computer Applications

First & Second Semester MCA

Scheme and Syllabus

ACADEMIC YEAR 2017-18

CONTENTS

1. Vision, Mission of the College and Department 3

2. Program Educational Objectives (PEO) , Program Specific Objectives

& PEO to Mission Statement Mapping 4

3. Program Outcomes (PO) with Graduate Attributes 5

4. Mapping of POs with PEOs 5

5. Course Credit Structure 6

SCHEME

6. Scheme of First Semester MCA 7

7. Scheme of Second Semester MCA 8

SYLLABUS

8. Syllabus of First Semester MCA: 9

a) MCA11 Problem Solving using C

10

b) MCA12 Discrete Mathematics 16

c) MCA13 Computer Organization 19

d) MCA14 Unix Programming 22

e) MCA15 Web Technologies &Its Applications 27

f)MCA16 Life Skills for Professionals-I 30

9. Syllabus of Second Semester MCA:

32

a) MCA21 Data Structures using C

33

b) MCA22 Operating Systems 37

c) MCA23 System Programming 40

d) MCA24 Object Oriented Programming using C++ Programming Using C++

43

e) MCA25 Software Engineering 48

f) MCA26 Mini Project on Data Structures Using C 51

3

NEW HORIZON COLLEGE OF ENGINEERING

VISION

To emerge as an institute of eminence in the fields of engineering, technology and management in

serving the industry and the nation by empowering students with a high degree of technical,

managerial and practical competence.

MISSION

To strengthen the theoretical, practical and ethical dimensions of the learning process by fostering a

culture of research and innovation among faculty members and students.

To encourage long-term interaction between the academia and industry through their involvement

in the design of curriculum and its hands-on implementation

To strengthen and mould the student in professional, ethical, social and environmental dimensions

by encouraging participation in co-curricular and extracurricular activities.

QUALITY POLICY

To provide services of the highest quality both curricular and co-curricular; so that our students can

integrate their skills and serve the industry and society equally well at a global level.

DEPARTMENT OF MCA

VISION

To be the source in bringing Competent Computing Professionals, Innovators,

Researchers, Entrepreneurs and Leaders to serve the Industry, Nation and Society.

MISSION

To provide world class computer education and cultivating technical skills to meet

the challenging global needs and emerging trends in the industry.

To enable students in acquiring strong academic skills and enhance knowledge

towards innovation in research and development.

To inculcate the professional behavior and leadership qualities with ethical

responsibilities for the betterment of the society and empower them to become

entrepreneurs.

4

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO 1: To develop the ability to plan, analyze, design, code, test, implement and

maintain the software product for real time systems.

PEO 2: To excel in problem solving and programming skills in computing fields of IT

industries.

PEO 3: To practice effectively as individuals and as team members in multidisciplinary

projects involving technical, managerial, economical and social constraints.

PEO 4: To encourage students capability to set up their own enterprise in various

sectors of Computer Applications.

PEO 5: To prepare the students to pursue higher studies in computing and related fields

and to work in the fields of teaching and research.

PROGRAM SPECIFIC OUTCOME (PSOs)

PSO1: Understand and apply the computing techniques with mathematics and industrial

concepts for solving the real time industrial problems

PSO2: Analyze, design, develop, test, and maintain the software applications with latest

computing tools and technologies

PEO to Mission Statement Mapping

Mission Statements PEO1 PEO2 PEO3 PEO4 PEO5 To nurture students with a holistic approach, to inculcate knowledge, expertise and attitude with the ability to think critically, rationally and innovatively.

3 3 3 2 2

To bring awareness in the latest trends in the Industry. To make the student to realize the positive transformations happening in them.

3 3 2 3 2

To impart excellence in the art of education both curricular and co-curricular, as a result of which our students learn to blend technical proficiency and humanity in serving the industry and society equally well at the global level.

3 2 3 3 3

Correlation: 3- High, 2-Medium, 1-Low

5

Program Outcomes (PO) with Graduate Attributes

Graduate Attributes

Program Outcomes (POs)

1 Scholarship of Knowledge

PO1: Understand and apply the fundamental principles of mathematics, science, knowledge of computer science for solving complex problems.

2

Critical Thinking PO2:Identify, analyze, and formulate the real world requirements in computing domain for solving problems.

3 Problem

Solving

PO3: Design and estimate the computer system components, sub-systems, COTs and appropriate tools for developing solutions for complex problems.

4 Research Skill PO4: Use latest tools and technique needed for hard computing practices

5 Usage of modern tools

PO5: Use right platform on design and execution for performance.

6

Collaborative and Multidisciplinary work

PO6: Customize and fit the software solutions on society and environment

7

Project Management and Finance

PO7: Work effectively as an individual as well as a member / leader in a team.

8

Communication

PO8: Understand and commit ethical , cyber regulations and management practices in computing field for managing software projects from diverse environments and act accordingly

9

Life-long Learning

PO9: Understand the societal, environmental, health, legal, ethical issues and its impact with respect to computing and professional practice .

10

Ethical Practices and Social Responsibility

PO10: Discover openings and use novel thoughts for creating value and wealth for the betterment of the individual and society

11

Independent and Reflective Learning

PO11: Design, execute and interpret the software with real time data and synthesis the information to reach suitable conclusions. .

Mapping of POs To PEOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11

PEO1 3 2 2 2 2 2 1 1 1 1 1

PEO2 3 3 3 3 2 2 1 2 2 1 3

PEO3 2 3 3 3 3 3 3 3 3 3 3

PEO4 3 3 3 2 3 3 3 3 3 2 1

PEO5 1 2 2 2 3 2 3 3 3 3 3

Correlation: 3- High, 2-Medium, 1-Low

6

Master of Computer Applications

Credit Allocation

I to VI Semesters

BATCH 2017-20

Semester Core

Course

Credit

Electives

Credits

Project

Works

Credits/

Industrial

Internships

Seminar Total

Credit Per

Semester

1

25

0

0

0

25

2

24

0

3

0

27

3

10

12

3

0

25

4

12

10

3

0

25

5

10

15

3

0

28

6

0

0

18

2

20

Total

81

37

30

2

150

7

New Horizon College of Engineering


Scheme of First Semester MCA Program

S. No

Course Code

Course

Credit Distributio

n

Overall Credits

Contact Hours

(Theory

Contact Hours (Lab)

Marks

L P T S CIE SEE Total

1 MCA11 Problem Solving using C 3 2 0 0 5 3 4 75 75 150

2 MCA12 Discrete Mathematics 4 0 1 0 5 5 0 50 50 100

3 MCA13 Computer Organization

4 0 0 1 5 4 0 50 50 100

4 MCA14 Unix Programming 3 2 0 0 5 3 4 75 75 150 5 MCA15 Web Technologies &

Its Applications

3 2 0 0 5 3 4 75 75 150

6 MCA16 Life Skills for Professionals-I

Mandatory Course

0 2 0 25 25 50

Total 17 6 1 1 25 20 12 350 350 700

U

15

20

25

20

1010

Remember

Understand

Apply

Analyze

Evaluate

Create

Average Assessmentof variousBloom's levels (%)

8

New Horizon College of Engineering


Scheme of Second Semester MCA Program

S.No

Course

Code

Course

Credit

Distribution

Overall

Credits

Contact

Hours

(Theory

Contact

Hours

(Lab)

Marks

L P T S CIE SEE Total

1 MCA21 Data Structures Using C 3 2 0 0 5 3 4 75 75 150

2

MCA22

Operating Systems

4

0

1

0

5 5

0

50

50

100

3

MCA23

System Programming

4

0

0

0

4 4

0

50

50

100

4

MCA24 Object Oriented

Programming Using C++

3

2

0

0

5

3

4

75

75

150

5 MCA25 Software Engineering 4 0 0 1 5 4 0 50 50 100

6

MCA26

Mini Project on Data

Structures using C

0

3

0

0

3

0

6

50

50

100

Total

18

7

1

1

277

20

14

350

350

700

3 1 1

Core Course

Mini Project

Self Study

22 Tutorial

Average Assessmentof various Bloom's levels (%)

10 15

10 Remember

20 Understand

20 Apply

Analyze 25 Evaluate

Create

9

First Semester

MCA Syllabus

10

CO1 Understand the basic concepts of algorithms, flowcharts , constants, variables , data types , operators and expressions and be able to design and solve complex problems.

CO2 Learn how to manage the Input and output Operations in C with the various control structures and looping statements for transforming a problem solution into programs involving programming constructs.

CO3 Study thoroughly the arrays , character arrays and strings

CO4 Learn and write programs using pre-defined functions and user defined functions for breaking a problem into logical modules that can be solved structures , unions and pointers for solving computational problems.

CO5 Introduce modularity using functions and pointers which permit run-time polymorphism

CO6 Understand how the files can be managed and dynamically how the memory can be allocated.

PROBLEM SOLVING USING C

Course Code : MCA11 Credits : 05

L:P:T:S : 3:2:0:0 CIE Marks : 50+25

Exam Hours : 3+3 SEE Marks : 50+25

Course Outcomes: At the end of the Course, the Student will be able to:

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 2 - 3 - - - - - - - - 3 -

CO2 2 2 3 3 - - - - - - - 3 -

CO3 2 2 3 3 - - - - - - - 3 -

CO4 - 2 3 3 - - - - - - - 3 -

CO5 - 2 3 3 - - - - - - - 3 -

CO6 - 2 3 3 - - - - - - - 3 -

11

Syllabus

Module Contents of the Module Hours Cos

1 Algorithms and Flowcharts The meaning of algorithms, Flowcharts and their need, Writing algorithms and drawing flowcharts for simple exercises Constants, Variables and Data Types Character set, C tokens, keywords & identifiers, structure of C program, executing a C program. Constants,variables, data types, declaration of variables, declaration of storage classes, assigning values to variables defining symbolic constants, declaring a variable as constant, declaring a variable as volatile, overflow and underflow of data. Operators and Expressions Arithmetic operators, relational operators, logical operators, assignment operator, increment and decrement operator, conditional operator, bitwise operators, comma operator, special operators, arithmetic expressions, evaluation of expressions, precedence of arithmetic operators, type conversions in expressions, operator precedence and associatively, mathematical functions.

9

CO1

List of Experiments 1. Sum of two Numbers 2. Finding a factorial value of a given number 3. Displaying the Fibonacci Sequence 4. Find the biggest among three numbers 5. Sum of First N positive numbers 6. Find the Simple and Compound Interest

8

2 Managing Input and Output Operations The scanf() &printf() functions for input and output operations, reading a character, writing a character, (thegetchar() &putchar() functions) , the address operator(&), formatted input and output using formatspecifiers, Writing simple complete C programs. Control Statements Decision making with if statement, simple if statement, the if..elsestatement, nesting of if..elsestatements,the else..ifladder, the switch statement, the ?: operator, the gotostatement, the break statement,programming examples Loop Control Structures The while statement, the do..while statement, the for statement, nested loops, jumps in loops, the continuestatement, programming examples

9

CO2

List of Experiments 7. Convert degrees into Fahrenheit and vice versa 8. Calculate the salary of an employee given his basic pay,

HRA = 10% of basic pay,TA=5% of his basic pay and deductions IT = 2.5% of his basic pay

8

12

9. Check whether the given number is perfect numberDefn: A perfect number is aositive integer that is equal to the sum of its properpositive divisors, that is, the sum of its positive divisors excluding the number itself.

10. Solve quadratic equations for the given values of a,b,c. 11. Generate all Amstrong numbers upto n.

3 Arrays The meaning of an array, one dimensional and two dimensional arrays, declaration and initialization of arrays, reading , writing and manipulation of above types of arrays, multidimensional arrays, dynamic arrays, programming examples. Character Arrays and Strings Declaring and initialing string variables, reading string from terminal, writing string to screen, arithmetic operations on characters, putting strings together, comparison of two strings, string handling functions, table of strings, other features of strings, programming examples.

9

CO3

List of Experiments 12. Convert a decimal number to a hexadecimal number. 13. Write a menu driven C program to Insert an element into

an array and Delete an element from the array (first occurrence)

14. Write a Menu Driven C Program to a. Accept a string from the user b. Encode the string. c. Decode the string

15. Apply the following procedure to encode it. a. Convert each character in a string to

its ASCI value. b. Add an integer value to it and display

the encoded string c. Decode the string using reverse

procedure and display. 16. Write a C program to multiply two matrices that satisfy

the constraint of matrix multiplication 17. Sort the given numbers in ascending or descending order 18. Sort the given names in alphabetical order

8

4 User Defined Functions Need for user defined functions, a multi- function program, elements of User defined functions, defining functions, return values and their types, function calls, function declaration, category of functions, recursion, passing arrays to functions, passing string to functions, programming examples.

9

13

Structures and Unions Defining a structure, declaring structure variables, accessing structure members, structure initialization, copying and comparing structure variables, operations on individual members, array of structures, structures within structures, structures and functions, Unions, size of structures, bit fields, programming examples Pointers Understanding pointers, accessing the address space of a variable, declaring and initialization pointer variables, accessing a variable through its pointer, chain of pointers, pointer expressions, pointers and arrays, pointer and character strings, array of pointers, pointer as function arguments, functions returning pointers, pointers to functions, pointers and structures, programming examples

CO3,

CO4

List of Experiments 19. Write a Menu driven C program to

a. Accept two numbers n and m b. Sum of all integers ranging from n to

m c. Sum of all odd integers ranging from

n to m d. Sum of all even integers ranging from

n to m e. Display an error message if n > m.

Create functions for each of the options

20. Create a structure Complex Number having real and imaginary part as properties. Write functions to add and subtract the two complex numbers.

21. Define a structure called student having the properties of student_id, student name and branch of the student with a sub structure of marks of 3 subjects. Write a Menu Driven C Program to

a. Add new student detail b. Delete a student detail c. Display all student details d. Display the student name with best mark

8

5 File Management in C Defining and opening a file, closing a file, input/output operations on files, error handling during I/Ooperations, random access files, command line arguments, programming examples. Dynamic Memory Allocation Dynamic memory allocation:malloc,calloc, Free,realloc, programming examples

9

CO5

CO6

14

List of Experiments 22. Find whether a given word exists in the file. If it exists

display the location of the word 23. Write a C program to copy one file content to another file

without using inbuilt functions.

8

TEXT BOOKS:

1. Balagurusamy: Programming in ANSI C, 6th Edition, Tata McGraw Hill, 2015, Chapters: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13.1-13.6.

2. V Rajaraman: Computer Programming in C, PHI, 2013.

REFERENCE BOOKS

1. Behrouz A Forouzan and Richard F Gilberg: Structured Programming Approach C, 2nd

Edition, Thomson, 2005. 2. M G Venkateshmurthy: Programming Techniques through C, Pearson Education, 2005. 3. Ivor Horton: Beginning C from Novice to Professional, 4th Edition, Springer, 2005. 4. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Education, 2002. 5. K R Venugopal, S R Prasad: Mastering C, Tata McGraw Hill, 2006.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks) THEORY

Bloom’s Taxonomy

Tests Assignments Quizzes

Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2

15

SEE- Semester End Examination (50 Marks) THEORY

Bloom’s Category Tests

Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

CIE- Continuous Internal Evaluation (25Marks) PRACTICAL

Bloom’s Taxonomy


Marks 15 5 5

Remember 5 1

Understand 2 1 1

Apply 2 1 1

Analyze 2 1 1

Evaluate 2 1 1

Create 2 1

SEE- Semester End Examination (25 Marks) PRACTICAL

Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

16

Discrete Mathematics

Course Code L:P:T:S Exam Hours

: MCA12 : 4:0:1:0 : 03

Credits CIE Marks SEE Marks

: 05 : 50 : 50


CO1 Use the discrete methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering and computer systems.

CO2 Reason mathematically about basic data types and structures used in computer algorithms and systems; distinguish rigorous definitions and conclusions from merely plausible ones; synthesize elementary proofs, especially proofs by induction.

CO3 Demonstrate an appreciation for the power of mathematics, Create mathematical models for a variety of problems

CO4 Be exposed to concepts and properties of algebraic structures such as semi groups, monoids and groups.

CO5 Be aware of a class of functions which transform a finite set into another finite set which relates to input output functions in computer science.

CO6 Demonstrate the capacity to engage in logical thinking and Critically read technical information. Define, evaluate and perform operations on functions.



CO1 3 3 - - - 2 - - - 2 2 3 -

CO2 3 3 - - - 2 - - - 2 2 3 -

CO3 3 3 - - - 2 - - - 2 2 3 -

CO4 3 3 - - - 2 - - - 2 2 3 -

CO5 3 3 - - - 2 - - - 2 2 3 -

CO6 3 3 - - - 2 - - - 2 2 3 -

Syllabus


1 Set Theory Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, Principles of Inclusion and Exclusion, The rules of sum and product, Permutations and combinations. Properties of Integers and Recurrence Mathematical Induction,

9

CO1 CO2

17

Recursive definitions, The Greatest Common Divisor Euclidian Algorithms, The first order Linear recurrence relation

2 Fundamentals of Logic Basic Connectives and Truth Tables, Logic Equivalence: The laws of Logic. Logical Implications Logical Implications: Rules of Inference, The use of Quantifiers, Quantifier Definitions, Proofs of Theorems.

9

CO6

3 Relations Cartesian products and Relations, Functions-Plain and One- to-One, Onto. Functions Stirling Numbers and the Second Kind, The Pigeon-hole principle.

9

CO5 CO3

4 Functions Function composition and inverse functions. Properties of Relations, Computer recognition-Zero One Matrices and Directed graphs Posets and Hasse Diagrams, Equivalence relation and Partitions, lattices.

9

CO6

5 Algebraic Structures Algebraic systems- Groups, Subgroups, Semi groups, monoids, submonoid, homomorphisms, isomorphism, cyclic group, Cosets and Lagrange’s theorem

9 CO4

Text Books: 1. Logic and Discrete Mathematics: A Concise Introduction, Willem Conradie, Valentin

Goranko, Wiley publication, 2015 2. Introduction to Graph Theory, D.B. West, New Delhi: Prentice-Hall of India, 2011.

Reference books:

1. Ralph P Grimaldi, B.V.Ramana, “Discrete & Combinatorial Mathematics, An Applied Introduction” 5th Edition, Pearson Education, 2004

2. Eric Gosset “Discrete Mathematics with Proof” Wiley India, 2nd edition 3. Kenneth H Rosen, “Discrete Mathematics & its Applications” 7th edition, McGraw- Hill,

2010 4. Y N Singh “Discrete Mathematical Structures” Wiley India, 1st edition, 2010 5. Jayant Ganguly: A Treatise on Discrete Mathematical Structures” Pearson, 2010 6. D.S. Malik & M.K Sen: Discrete Mathematical Structures: Theory & Applications, Cengage

Learning, 2004

http://as.wiley.com/WileyCDA/Section/id-302477.html?query=Willem+Conradie

http://as.wiley.com/WileyCDA/Section/id-302477.html?query=Valentin+Goranko

http://as.wiley.com/WileyCDA/Section/id-302477.html?query=Valentin+Goranko

18

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Taxonomy


Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2

SEE- Semester End Examination (50 Marks)


Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

19

Computer Organization


L:P:T:S : 4:0:0:1 CIE Marks : 50

Exam Hours : 03 SEE Marks : 50


CO1 Impart the knowledge in the digital fundamentals, computer organization and to understand about the various components of a computer and its internals.

CO2 Recognize different types of number systems as they relate to computers.

CO3 Construct and recognize truth tables and circuits using logic gates and simple combinations of them.

CO4 Understand K-Maps and arithmetic circuits design.

CO5 Understand about instruction execution, memory, addressing modes and types. CO6 Apply, Design and realize the functionality of the computer with basic gates and other

components using combinational and sequential logic.



CO1 3 3 - - 2 2 - - - 2 2 3 -

CO2 3 3 - - 2 2 - - - 2 2 3 -

CO3 3 3 - - 2 2 - - - 2 2 3 -

CO4 3 3 - - 2 2 - - - 2 2 3 -

CO5 3 3 - - 2 2 - - - 2 2 3 -

CO6 3 3 - - 2 2 - - - 2 2 3 -

Syllabus

Module Content of the Module Hours Cos

1

Binary Systems and Digital Fundamentals: Number Systems, Digital Computers and Digital Systems, Binary, Octal and Hexadecimal Numbers, Number Base Conversion, subtraction using r’s and r-1 complements, Binary Code, Binary Storage and Registers, Binary Logic, Integrated Circuits. Digital Logic Gates, Basics, NAND gate as universal gate, Drawing circuits from expressions. Combinational Logic: Axiomatic Definition of Boolean Algebra, Basic Theorems and Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms.

9

CO1, C02, C03

2

Minimization of Boolean Functions using K Maps: The map Method, K Map – Two, Three and four variables, Product of Sums Simplification, Don’t Care Conditions. Arithmetic Circuits: Adders, Subtractors, Binary multiplication, Decoders, Multiplexers, binary

9

CO1,CO3,CO4

20

multipliers, 2s complement notation, BOOTH algorithm for signed numbers with example.

3

Sequential Logic: Introduction, different types of Flip – Flops, Registers, Shift Registers. Basic Structure of Computers: Computer Types, Functional Units, Basic Operational Concepts, Bus structure, Software, Performance, Multiprocessing and Multicomputers, Introduction to Assemblers and Compilers.

9

CO1, CO3,CO6

4

Machine Instructions: Memory Locations and Addresses, Memory Operations. Addressing Modes and Programs: Instructions and Instruction Sequencing, Addressing Modes, Examples from Assembly Language Programming

9

CO1, CO5

5

I/O Organization: Accessing I/O Devices, Interrupts, DMA, Buses. The Memory System: Some Basic Concepts, Semiconductor RAM Memories, Read – Only Memories, Speed, Size, and Cost, Cache Memories, Virtual Memories, Memory Management Requirements, Secondary Storage.

9

C01,CO5,CO6

TEXT BOOKS:

1. M. Morris Mano, “Digital Logic and Computer Design”, Pearson, 2012. 2. Carl Hamacher, Zvonko Vranesic Safwat Zaky, ”Computer Organization”, 5th edition, Tata McGraw-Hill,

2011.

REFERENCE BOOKS: 1. Tokheim, Digital Electronics Principles and Applications, McGrawHill, 6th Edition, 2004. 2. John P. Hayes, “Computer Architecture and Organization”, Tata McGraw – Hill, 3rdEdition, 2012. 3. Soumitrs Kumar Mandal, “Digital Electronics – Principles and Applications”, TMH, 2010.

21

Assessment Pattern


Bloom’s Taxonomy

Tests Self Study Assignments Quizzes

Marks 20 10 10 10

Remember 5 2

Understand 5 2 2 2

Apply 5 2 2 2

Analyze 5 2 2 2

Evaluate 2 2 2

Create 2 2



Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

22

UNIX PROGRAMMING


L:P:T:S : 3:2:0:0 CIE Marks : 50+25

Exam Hours : 3+3 SEE Marks : 50+25


CO1

To make the students understand the basic Unix structure, commands and utilities of the UNIX operating system and to work confidently in Unix/Linux environment and open systems

CO2 To write simple and complex shell scripts to automate various tasks using shell programming

CO3 To familiarize students with the file and file and process related commands

CO4 To master the students in the art of usage of simple and advanced filters and framing of regular expressions

CO5 To learn to write simple programs using awk advanced filters

CO6 To make the students familiar with basic administration commands



CO1 3 3 2 2 2 2 3 -

CO2 3 3 2 2 2 2 3 -

CO3 3 3 2 2 2 2 3 -

CO4 3 3 2 2 2 2 3 -

CO5 3 3 2 2 2 2 3 -

CO6 3 3 2 2 2 2 3 -

Syllabus


1 Introduction to UNIX: Introduction, History, Architecture, Experience the Unix environment Basic commands – passwd, who, w, tty, lock, 31om, script, clear, uname, date, cal, calendar, bc, echo

UNIX File System: The file, what’s in a filename? The parent-child relationship, pwd – the Home directory, absolute pathnames – using absolute pathnames for a command, cd, Relative Path Names (.& ..), mkdir, rmdir, cp, rm, mv, cat

9

CO1 List of Experiments

1. Write a shell script that takes a valid directory name as an argument and recursively descend all the sub-directories, finds the maximum length of any file in that hierarchy and writes this maximum value to the standard output.

2. Write a shell script that accepts a path name and creates all the components in that path name as directories. For

8

23

example, if the script is named mpc, then the command mpc a/b/c/d should create directories a, a/b, a/b/c, a/b/c/d.

3. Write a shell script that accepts two file names as arguments, checks if the permissions for these files are identical and if the permissions are identical, output common permissions and otherwise output each file name followed by its permissions.

4. Write a shell script which accepts valid log-in names as arguments and prints their corresponding home directories, if no arguments are specified, print a suitable error message

2 Introduction to the Shell: Introduction to Shell Scripting, Shell Variables, Shell Scripts, read, Positional Parameters, Command Line Arguments, Exit Status of a Command, The Logical Operators && and ||, exit, if, test and [ ], case conditions, expr, sleep and wait, while, until, for Advanced Shell Programming: Assigning values to positional parameters using set, IFS variable, shift, here document, let, redirection, export, Conditional Parameter Substitution, Shell Functions, eval, exec, set –x, trap

9

CO2

List of Experiments

5. Write shell script to implement terminal locking (similar to the lock command). It should prompt the user for a password. After accepting the password entered by the user, it must prompt again for the matching password as confirmation and if match occurs, it must lock the keyword until a matching password is entered again by the user. Note that the script must be written to disregard BREAK, Control- D. No time limit need be implemented for the lock duration.

6. Write a shell script to list all the files in a directory whose filename is at least 10 characters. (use expr command to check the length)

7. Write a shell script that gets executed displays the message either “Good Morning” or “Good Afternoon” or “Good Evening” depending upon time at which the user logs in.

8. Write a shell script that accept one or more filenames as argument and convert all of them to uppercase, provided they exist in current directory.

8

3 File Attributes: ls, Is – l, ls –d, File Permissions, chmod, Directory Permissions, umask, File Ownership, Changing ownership and group – chown & chgrp, File Modification and Access Times, touch, More file attributes: hard link, symbolic link, find The Process: Process basics, login shell, init process, internal and external commands, ps, running jobs in background (& and nohup), introduction to signals, nice, at and batch, cron, time commands

9

CO3

24

List of Experiments

9. Write a shell script that accepts filename as argument and display its creation time if file exists and if it does not output error message.

10. Create a script file called file-properties that reads a file name entered and outputs it properties.

11. Write a shell script that displays all the links to a file specified as the first argument to the script. The second argument, which is optional, can be used to specify in which the search is to begin. If this second argument is not present, the search is to begin in current working directory. In either case, the starting directory as well as all its subdirectories at all levels must be searched. The script need not include any error checking.

8

4 Simple Filters: more, wc, od, pr, cmp, diff, 33omm., head, tail, cut, paste, sort, tr, uniq, spell and ispell commands

Filters Using Regular Expression: Filters using Regular Expressions: grep and sed, usage of *,. , ^, $, Line Addressing, Context addressing, Editing Text, Substitution, Regular Expressions IRE & TRE

9

CO4

List of Experiments

12. Write a shell script that accept a list of filenames as its argument, count and report occurrence of each word that is present in the first argument file on other argument files.

13. Write a shell script to display the calendar for current month with current date replaced by * or ** depending on whether the date has one digit or two digits.

14. Write a shell script that accept the file name, starting and ending line number as an argument and display all the lines between the given line number.

15. Write a shell script that folds long lines into 40 columns. Thus any line that exceeds 40 characters must be broken

after 40th, a “\” is to be appended as the indication of folding and the processing is to be continued with the residue. The input is to be supplied through a text file created by the user.

8

5 Awk-Advanced Filters: Simple awk Filtering, Splitting a Line into Fields, printf, Comparison Operators, Number Comparison, Number Processing, Variables, The –f option, BEGIN and END Sections, Positional Parameters, get line, Built-in variables, Arrays, Functions, Interface with the Shell, Control Flow, Looping

System Administration: Essential System Administration Commands root, administrator’s privileges, maintaining user accounts, startup & shutdown

9

CO5 CO6

25

List of Experiments

16. Write an awk script that accepts date argument in the form of dd-mm-yy and displays it in the form if month, day and year. The script should check the validity of the argument and in the case of error, display a suitable message.

17. Write an awk script to delete duplicated line from a text file. The order of the original lines must remain unchanged.

18. Write an awk script to find out total number of books sold in each discipline as well as total book sold using associate array down table as given below. Electrical 34, Mechanical 67, Electrical 80, Computer Science 43 Mechanical 65, Civil 98, Computer Science 64

8

Text Books: 1. Your UNIX-The Ultimate Guide, Sumitabha Das, 3rd Edition, Tata McGraw Hill Edition 2012 2. “Unix Shell Programming”, Yashwant Kanetkar,1st edition 2003

Reference books: 1. “Beginning Shell Scripting”, Eric Foster –Johnson, John C Welch, Micah Anderson, Wrox publication. 2. “The Design of the UNIX Operating System”, Maurice J. Bach, 1st Edition

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks) THEORY

Bloom’s

Taxonomy


Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2



Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

https://www.amazon.com/Maurice-J.-Bach/e/B001IO8CDO/ref=dp_byline_cont_book_1

26


Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5


Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

27

CO1 Understand the basic concepts of world wide web. CO2 Understand the application of world wide web

CO3 Understand designing professional web pages with styles

CO4 Understand the concept of web pages with scripting

CO5 Understand the concept of dynamic web pages

CO6 Understand the applications of Perl Scripting & CGI programming


CO1 3 3 - - 1 1 - - - 1 1 3 -

CO2 3 3 - - 1 1 - - - 1 1 3 -

CO3 3 3 - - 1 1 - - - 1 1 3 -

CO4 3 3 - - 1 1 - - - 1 1 3 -

CO5 3 3 - - 1 1 - - - 1 1 3 -

CO6 3 3 - - 1 1 - - - 1 1 3 -

WEB TECHNOLOGIES AND ITS APPLICATIONS

Course Code MCA15 Credits: 5

L: P: T: S: 3: 2: 0: 0 CIE Marks: 50+25

Exam Hours: 3 + 3 SEE Marks: 50+25



SYLLABUS


1

1.1 Fundamentals: Internet, WWW, Web Browsers and Web Servers, URLs, MIME, HTTP, Security, Introduction to HTML 5.

9

CO2

1.2 Introduction to XHTML: Basic syntax, Standard structure, Basic text markup, Images, Hypertext Links. Lists, Tables, Forms.

List of Experiments 1. Create an XHTML page to demonstrate the usage of:

a. Text Formatting tags b. Images c. Tables

8

2

2.1 Cascading Style Sheets: Introduction, Levels of style sheets, Style specification formats, Selector forms, Property value forms Font properties, List properties, Color, Alignment of text, The bo model, Background images, The <span> and <div> tags, Conflict resolution. Introduction to CSS3.

9

CO3 2.2 Introduction to XML: Introduction, Syntax, Document structure, Document type definitions, Namespaces , XML schemas. List of Experiments 1. Develop and demonstrate the usage of style sheets using CSS.

8

3

3.1 The Basics of JavaScript: Overview of JavaScript, Object orientation and JavaScript, Syntactic characteristics, Primitives, operations, and expressions, Screen output and keyboard input, Control statements, Object creation and modification, Arrays,

9

CO4

28

Functions, Constructors, Pattern matching using regular expressions, Errors in scripts, Examples.

3.2 JavaScript with HTML Documents: The JavaScript Execution Environment, The Document Object Model, Elements Access in Java Script, Events and Event Handling, Handling Events from Body Elements, Handling Events from Text Box and password Elements, The navigator Object. List of Experiments

iv. Develop and demonstrate a XHTML file that includes JavaScript script for the following problem:

Input: A number n obtained using prompt Output: The first n Fibonacci numbers

2. Develop and demonstrate using JavaScript, a XHTML document that displays random numbers (integers).

8

4

4.1 Dynamic Documents with JavaScript: Introduction, Positioning Elements, Moving Elements, Element Visibility, Changing Colors and Fonts, Dynamic Content, Stacking Elements Locating the Mouse Cursor, Reacting to a Mouse Click, Slow Movement of Elements, Dragging and Dropping Elements.

9

CO5

4.2 The Basics of Perl: Origins and uses of Perl, Scalars and their operations, Assignment statements and simple input and output Control statements, Fundamentals of arrays. List of Experiments 1. Develop using JavaScript script, an XHTML document that use of onload and onfocus events. 2. Write a Perl program which demonstrates the usage of scalar variables and arrays.

8

5

5.1 Advanced concepts of Perl: Hashes, References, Functions, Pattern matching, File input and output; Examples.

9

CO6

5.2 Using Perl for CGI Programming: The Common Gateway Interface; CGI linkage; Query string format; CGI.pm module.

List of Experiments 1. Write a Perl program to display various Server information like Server Name, Server Software, Server protocol, CGI Revision etc. 2. Write a Perl program to display a digital clock which displays the current time of the server. 3. Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of 4 greeting messages.

8

Text Books 1. Programming the World Wide Web, Robert W. Sebesta, 7th Edition, Pearson Education, 2012. 2. Web Programming Building Internet Applications, Chris Bates, 3rd Edition, Wiley India, 2012.

Reference Books 1. Internet & World Wide Web How to program, M. Deitel, P.J. Deitel, A. B. Goldberg, 3rd Edition,

Pearson Education / PHI, 2011. 2. The Web Warrior Guide to Web Programming, Xue Bai et al, Thomson, 2012. 3. PHP and MySQL, Joel Murach, First Edition, Mauch’s Publications, 2012.

29

Assessment Pattern CIE- Continuous Internal Evaluation (50 Marks) THEORY

Bloom’s Taxonomy


Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2



Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5


Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5


Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

30


CO1 3 3 1 1 1 1 √

CO2 3 3 1 1 1 1 √

CO3 3 3 1 1 1 1 √

CO4 3 3 1 1 1 1 √

LIFE SKILLS FOR PROFESSIONALS –I


L:P:T:S : 0:0:0:0 CIE Marks : 25



CO1 Create awareness on the importance of English Language

CO2 Equip students with professional communication competencies

CO3 Enhance the knowledge of English grammar and vocabulary

CO4 Identify and apply communication abilities to face corporate challenges


Module Contents of Module Hrs Cos

1

Communication: Introduction and importance of English Grammar-Relevance of English in the Present corporate scenario-Significance of acquiring communication skills, namely Reading, Writing, Speaking and Listening

4

CO1

2

Professionalism in communication, : Definition – skills – Purpose of professionalism in communication-workplace communication-Importance of Professionalism in workplace-Types of workplace communication maintaining professionalism in communication

4

CO2

3

Grammar and Vocabulary: Tenses, Punctuations, Prepositions, Articles Collocations: Vocabulary building, Degrees of comparison, One word substitution, Subject Verb Agreement, Homophones/ Homonyms. Common errors in the usage of language

4

CO3

4

Oral communication Pronunciation, Public Speaking Skills – to come out of comfort zone, Tips on how to eliminate mother tongue influence, Regular practice to understand neutralize accent, Situational and Business situational communication. Public speaking

5

CO4

5

Corporate orientation and communication: Written Communication; Business letter writing; Job Application letter writing; Email writing; CV writing expansion of ideas, Report writing and Review/Progress Report writing, Presentation Skills

5 CO4

Text Books:

1. Grammar Practice Activities- Penny Ur, Cambridge University Press 2. Basic Business Communication: Skills for Empowering the Internet Generation-Flately and Lesikar, Tata

mc Graw Hill, 10th Edition, 2005

31

Reference books:

1. Wren, P.C.; Martin, H; Prasad Rao, N.D. V (1973-2010) High School English Grammar & Composition, NewDelhi: S. Chand. ISBN 81-219-2197-X 2. The Skills of Communicating-Bill Scott-Jaico

Assessment Pattern

CIE- Continuous Internal Evaluation

Bloom’s Category Tests Assignments Presentation

Marks (out of 25) 10 10 5

Remember 1

Understand 2

Apply 3 5

Analyze 2

Evaluate

Create 2 5 5



Remember 5

Understand 5

Apply -

Analyze 5

Evaluate 5

Create 5

NOTE: BEING A LIFE SKILLS COURSE IT IS PROPOSED TO CONDUCT THE TERM END ASSESSMENT THROUGH A

STRUCTURED GROUP DISCUSSION/ PRESENTATION WHICH WILL PROVIDE AN OPPORTUNITY TO TEST STUDENTS IN

ALL LEVELS OF BLOOMS TAXONOMY

32

Second Semester

MCA Syllabus

33


CO1 3 3 - - - - - - - - - √ CO2 3 3 - - - - - - - - - √ CO3 3 3 - - - - - - - - √ CO4 3 3 - 2 2 - 3 - - - - √ CO5 3 3 - 2 2 - 3 - - - 1 √ CO6 3 3 - - - 3 - - - - √

DATA STRUCTURES USING C

Course Code : MCA21 Credits : 05 L:P:T:S : 3:2:0:0 CIE Marks : 50 + 25 Exam Hrs : 3+3 SEE Marks :50 + 25


CO1 Understand about linear and non linear data structures for solving problems and also to

know about various data structure design techniques in real time applications

CO2 Understand and recognize the abstract data types as relate to various data structures and

to review on pointers, arrays, string handling functions and recursion

CO3 Apply the concepts of stack with operations and to analyze, evaluate different types of expressions with their conversions

CO4 Apply and analyze on various types of queues and linked lists with their implementation procedures CO5 Analyze various types of sorting, searching and hashing techniques

CO6 Design different types of tree constructions and tree traversals


Syllabus


1

Information and its meaning: Abstract Data

Types, Data Types, Pointers and review of

Pointers, Data Structures and C.

Arrays: Array as an ADT, Using One-dimensional

Arrays, Implementing One-Dimensional Arrays,

Handling of Character Strings in C.

9

CO1, C02

List of Experiments:

1. Example programs on arrays 2. Example programs on String functions

8

34

2

Stack: Definition and examples, Primitive operations, The stack as an ADT, Implementing push and pop operations. Expressions: Infix, postfix, and prefix expressions, Basic definitions and Examples, Converting an expression from infix to postfix, Program to convert an expression from infix to postfix, Program to evaluate a postfix expression.

Recursion: Recursive definition and processes, Factorial function, Multiplication of natural numbers, Fibonacci sequence, Properties of recursive definition or algorithm, Towers of Hanoi problem.

9

CO1, CO2, CO3

List of Experiments: 1. Conversion of an infix expression to

postfix notation 2. Evaluating the postfix expression and its

values for the variables 3. Using recursion

a. Calculation of GCD and LCM of 3 integer Numbers

b. Solving Towers of Hanoi Problem c. Calculating the sum for a given number ‘n’

from 1 to n.

8

3

Queues: The queue and its sequential representation, the queue as ADT, Queue operations, circular queue operations, double ended queue with operations.

Lists: Linked lists, Inserting and removing nodes in a list, getnode and Freenode operations, Linked implementations of stack and queue, Header nodes, Other list structures: Circular lists, doubly linked lists

9

CO1,

CO4

List of Experiments:

1. Simulating the working of circular queue providing the following operations.

Insert, Delete and Display.

2. Simulate the working of a dequeue. 3. Simulate the working of a linked list to

implement stack and queue.

8

4

Sorting Types: Bubble sort, Quick sort, Selection sort, Heap Sort, Insertion sort, Shell Sort, Merge and Radix Sort.

Searching: Basic Search Techniques: Algorithmic Notations, Sequential searching, Binary search,

9

CO1, CO5

35

Interpolation search, Tree searching, Hashing, Resolving hash clashes by open addressing, Choosing a hash Function.

List of Experiments: 1. Implement the techniques of

a. Selection Sort b. Insertion Sort

2. Implementation of quick sort. 3. Implementing the search techniques of

a. Linear Search b. Binary Search

8

5

Tree traversals, Binary Search Tree and Operations, AVL Tree and Operations, Red-Black Tree, Threaded binary trees.

9

C01,CO6 List of Experiments: 1. Implementation of Heap sort. 2. Constructing a binary search tree and

implementing the tree traversal techniques of inorder, preorder and postorder.

8

TEXT BOOKS:

1. Data Structures Using C and C++ by YedidyahLangsam and Moshe J. Augenstein and Aaron

M Tenanbanum, 2nd Edition, Pearson Education Asia, 2002.

REFERENCE BOOKS:

1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition, Pearson Education Asia, 1997.

2. Richard F Giberg and Behrouz A Forouzan: Data Structures – A Pseudo code Approach with C, 2nd

Edition, Cengage Learning 3. Robert Kruse, C L Tondo, Bruce Leung and ShashiMogalla: Data Structures and Program Design in C,

2nd Edition, Pearson Education

36

Assessment Pattern

CIE- Continuous Internal Evaluation: Theory (50 Marks)

Bloom’s Taxonomy


Marks 30 10 10

Remember 5 - 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2 -

SEE- Semester End Examination: Theory (50 Marks)


Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

CIE- Continuous Internal Evaluation: Lab (25Marks)

Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

SEE- Semester End Examination: Lab (25 Marks)

Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

37

OPERATING SYSTEMS


: MCA22 : 4:0:1:0 : 03


: 05 : 50 : 50


CO1 Understand the basic elements of Computer, different operating systems, system

components and system calls. CO2 Distinguish between a program and a process and understand 3-state and 5-state process

model and Scheduling algorithms CO3 Analyze the behaviour of critical resources and semaphores and apply the techniques for

achieving synchronisation in an operating system. To understand deadlock and use bankers

algorithm for the avoidance of the deadlock

CO4 To understand memory allocation, page replacement algorithms and apply the page

replacement algorithms for a set of frames.

CO5 To analyze how files are stored in secondary storage and the different allocation methods

CO6 Analyze the different components and functionalities in Operating Systems.



CO1 3 - - - - - - - - - - - -

CO2 3 3 3 3 3 - - - - - - 3 3

CO3 3 3 3 3 3 - - - - - - 3 3

CO4 3 3 3 3 3 - - - - - - 3 3

CO5 3 3 3 3 3 - - - - - - 3 3

CO6 3 3 3 3 3 - 1 - - - 1 3 3

Syllabus


1 Introduction: Computer and Operating Systems

Basic Elements, Processor Registers, Instruction Execution,

Interrupts, The Memory Hierarchy, Cache Memory, I/O

Communication Techniques, Introduction to Operating

System, Mainframe Systems, Desktop Systems, Multiprocessor

Systems, Distributed Systems, Clustered Systems, Real Time

Systems, Handheld Systems.

Operating System Structures: System Components, operatin

9

g

CO1

CO2

38

system services, system calls, system programs, OS design

Implementation and structure, Virtual machines.

2 Process Management : Process, Process States, Process

Description, Process Control, Execution of the Operating System,

Security Issues, Symmetric Multiprocessing (SMP), Micro

kernels, CPU Scheduler and Scheduling

9

CO2

CO3

3 Mutual Execution and Synchronization : Principles of

Concurrency, Mutual Exclusion: Hardware Support,

Semaphores, Classic problems of synchronization.

Deadlock and Starvation : Principles of Deadlock, Deadlock

Prevention, Deadlock Avoidance, Bankers Algorithm, Deadlock

Detection and Recovery from Deadlock

9

CO3

CO4

4 Memory Management – Swapping, Contiguous Memory

Allocation, Paging, Segmentation, Segmentation with Paging,

Demand Paging, Page Replacement Algorithms, Allocation of

Frames, Thrashing

9

CO3

CO5

5 File System Interface and Implementation – File Concept,

Access Methods, Directory Structure, File System Mounting,

File System Implementation, Directory Implementation,

Allocation Methods, Free Space Management.

Secondary Storage, Computer Security – Disk Structure, Disk

Scheduling, Disk Management, The Security Problem, User

Authentication, Program Threats, System Threats.

Case study of Windows XP: History, Design principles, system

components, environmental subsystems, file systems.

9

CO1

CO6

TEXT BOOKS

1. Operating System Principles – Sixth & Seventh Edition, Abraham Silberschatz, Peter Baer Galvin, Greg

Gagne, John Wiley & Sons Inc. 2. William Stallings, “Operating Systems – Internals and Design Principles” Pearson, 6th

edition 2012

REFERENCE BOOKS

1. Dhananjay M. Dhamdhere, “Operating Systems – A Concept – Based Approach”, Tata McGraw – Hill,

3rd Edition, 2012 2. Elmasri, Carrick, Levine, “Operating Systems – A spiral Approach”, Tata McGraw – Hill, 2012

39


Bloom’s Taxonomy


Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2



Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

40

SYSTEM PROGRAMMING


: MCA23 : 4:0:0:0 : 03


: 04 : 50 : 50


CO1 Understand the relationship between system software and machine architecture

CO2 Understand the functions of assembler Create the object code

CO3 Analyze the design of different types of assemblers

CO4 Understand the functions of loader and linkers and analyze its design Understand the components and working of text editor

CO5 A nalyze the functions of debugging systems

Understand the importance of macros and analyze the design of macro processors

CO6 Understand the structure of Lex and Yacc

Apply it for creating lex and yacc specification



CO1 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 2 3

CO6 3 3 3 1 3 2 3

Syllabus


1 Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer(SIC) – SIC Machine Architecture, SIC/XE Machine Architecture Assemblers-I: Basic Assembler Function – A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features – Instruction Formats & Addressing Modes, Program Relocation.

9

CO1,

CO2

2 Assemblers-II: Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Operations – One-Pass Assembler, Multi-Pass Assembler.

9

CO3

3 Loaders and Linkers: Basic Loader Functions – Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent

9

C04

41

Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features – Automatic Library Search, Loader Options, Loader Design Options – Linkage Editor, Dynamic Linkage, Bootstrap Loaders Editors: Text Editors – Overview of Editing Process, User Interface, Editor Structure

4 Debugging Systems: Interactive Debugging Systems – Debugging Functions and Capabilities, Relationship With Other Parts Of The System, User-Interface Criteria Macro Processor: Basic Macro Processor Functions – Macro Definitions and Expansion, Macro Processor lgorithm and Data Structures, Machine-Independent Macro Processor Features – Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options – Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators

9

CO5

5 Lex and Yacc – The Simplest Lex Program, Recognizing Words With LEX, Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, Using LEX – Regular Expression, Examples of Regular Expressions, A Word Counting Program. Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser – The Definition Section, The Rules Section, Symbol Values and Actions,The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity.

9 CO6

TEXT BOOKS:

1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997. 2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O’Reilly, SPD, 1998.

REFERENCE BOOKS: 1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata McGraw – Hill,

1999. 2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000. 3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000

42

Assessment Pattern CIE- Continuous Internal Evaluation (50 Marks) THEORY

Bloom’s

Taxonomy


Marks 30 10 10

Remember 5 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2



Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

43

OBJECT ORIENTED PROGRAMMING USING C++


L:P:T:S :3:2:0: 0 CIE Marks : 50+25

Exam Hou rs : 3+3 SEE Marks : 50+25


CO1 Impart the knowledge in object-oriented design for small/medium scale problems and

to demonstrate the differences between traditional imperative design and object-

oriented design

CO2 understand class structures as fundamental, modular building blocks

CO3 understand the role of inheritance, polymorphism, dynamic binding and generic

structures in building reusable code

CO4 Understand and to use fundamental data structures: collections, sets, dictionaries, lists,

stacks, queues, trees, graphs.

CO5 Understand file handling and exceptions.

CO6 Develop applications using Object Oriented Programming Concepts, also Implement features of object oriented programming to solve real world problems.



CO1 3 3 - 2 2 - - - - 2 2 √

CO2 3 3 - 2 2 - - - - 2 2 √

CO3 3 3 - 2 2 - - - - 2 2 √

CO4 3 3 - 2 2 - - - - 2 2 √

CO5 3 3 - 2 2 - - - - 2 2 √

CO6 3 3 - 2 2 - - - - 2 2 √

Syllabus


1

Introduction Object Oriented paradigm, Structured vs. Object Oriented Paradigm. Elements of Object Oriented Programming: Object, Classes, Encapsulation & data abstraction, Inheritance, Polymorphism etc., C++ Overview, different data types, operators, expressions, arrays and strings, reference variables.

Modular Programming with Functions Function components, argument passing, inline functions, function overloading, function

9

CO1, C02

52

44

templates, recursive functions.

List of Experiments: 1. Example programs on arrays 2. Example programs on String functions

8

2

Classes & Objects Introduction, Class Specification, Class Objects, access members, defining member functions, data hiding, constructors, destructors, parameterized constructors.

Classes & Objects advanced concepts Static data members, functions, scope resolution operator, passing objects as arguments, returning objects, arrays of objects, Dynamic objects – Pointers to objects, Class members.

9

CO1,CO3

List of Experiments: 1. Define a STUDENT class with USN, Name,

and Marks in 3 tests of a subject. Declare an array of 10 STUDENT objects. Using appropriate functions, find the average of the two better marks for each student. Print the USN, Name and the average marks of all the students.

2. Write a C++ program to create a class called

LIST (linked list) with member functions to insert an element at the front and delete an element from the front of the list. Demonstrate all the functions after creating a LIST object.

8

3

Friend functions & classes, Operator overloading Friend functions & classes, basics of operator overloading, Operator overloading using friend functions such as ++, --, [ ] etc. Templates Basics of templates, Function templates, class templates.

9

CO1, CO4

List of Experiments: 1. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number: (i) ADD (a, s2) – where ‘a’ is an integer (real part) and s2 is a complex number (ii) ADD (s1, s2) – where s1 and s2 are complex numbers

2. Write a C++ program to create a class called STACK using an array of integers. Implement

8

45

the following operations by overloading the operators ‘+’ and ‘–‘: (i) s1 = s1 + element; where s1 is an object of the class STACK and element is an integer to be pushed on the top of the stack (ii) s1 = --s1 ; where s1 is an object of the class STACK. ‘–‘operator pops the element. Handle the STACK empty and full conditions. Also display the contents of the stack after each operation, by overloading the << operator. (iii)Create a class called MATRIX using two- dimensional array of integers. Implement the following operations by overloading the operator ++ which checks the compatibility of two matrices to be added and subtracted. Perform the addition and subtraction by overloading the + and – operators respectively. Display the results by overloading the operator <<. If (m1==m2) then m3 = m1+m2 and m4 = m1-m2 else display error. 4. Write a C++ program to create a template function for Bubble Sort and demonstrate sorting of integers and doubles. 5. Write a C++ program to create a class template called QUEUE with member functions to add an element and to delete an element from the queue. Using the member functions, implement a queue of integers and double. Demonstrate the operations by displaying the contents of the queue after every operation.

4

Inheritance Base Class, Inheritance & protected members, protected base class inheritance, inheriting multiple base classes, Constructors, Destructors & Inheritance. Passing parameters to base Class Constructors, Granting access, Virtual base classes.

Virtual functions & Polymorphism Virtual function –Calling a Virtual function through a base class reference, Virtual attribute is inherited, Virtual functions are hierarchical. Pure virtual functions, abstract classes, using Virtual functions, Early & late binding.

9

CO1, CO5

List of Experiments: 1. Write a C++ program to create a class called STUDENT with data members USN, Name and Age. Using inheritance, create the classes UGSTUDENT and PGSTUDENT having fields as Semester, Fees and Stipend. Enter the data for at least 5 students.

8

46

Find the semester wise average age for all UG and PG students separately. 2. Define a base class STACK1 which performs only push, pop, display operations. Override the above operations through a derived class STACK2 which takes care of STACK FULL & STACK EMPTY situations. Show how the objects of these classes use the above functions in a main function. 3. Create an abstract base class EMPLOYEE with data members: Name, EmpID and BasicSal and a pure virtual function Cal_Sal().Create two derived classes MANAGER (with data members: DA and HRA) and SALESMAN (with data members: DA, HRA and TA). Write appropriate constructors and member functions to initialize the data, read and write the data and to calculate the net salary. The main() function should create array of base class pointers/references to invoke overridden functions and hence to implement run-time polymorphism.

5

I/O Streams IO Stream basics, output operator <<, input >>, additional I/O operators, overloading the output operator <<, overloading the input operator >>, file input & output, formatted I/O, manipulators.

Exception Handling: Exception handling fundamentals, Exception handling options.

9

C01,CO6

List of Experiments: 1. Example programs on file input & output. 2. Example programs on formatted I/O

8

Text Books: 1. Herbert Schildt: C++ The Complete Reference, 4th Edition, Tata McGraw Hill, 2007.

Reference Book: 1. Stephen Prata : C++ Primer Plus, 6th Edition, Person Education. 2. Al Stevens: C++ Programming, 7th Edition, Wiley India Publications 3. Stanley B.Lippmann, Josee Lajore: C++Primer, 4th Edition, Addison Wesley, 2005. 4. Deitel & Deitel, C++ How to program, Pearson Education Asia, 6th Edition, 2010. 5. Object oriented programming with C++, E. Balaguruswamy, TMH.

47

Assessment Pattern

CIE- Continuous Internal Evaluation: Theory (50 Marks)

Bloom’s Taxonomy


Marks 30 10 10

Remember 5 - 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2 -

SEE- Semester End Examination: Theory (50 Marks)


Remember 5

Understand 5

Apply 10

Analyze 10

Evaluate 10

Create 10

CIE- Continuous Internal Evaluation: Lab (25Marks)

Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

SEE- Semester End Examination: Lab (25 Marks)

Bloom’s Taxonomy

Tests

Marks 25

Remember 5

Understand 5

Apply 5

Analyze 2

Evaluate 3

Create 5

48

SOFTWARE ENGINEERING


L:P:T:S : 4:0:0:1 CIE Marks : 50



CO1 Provide an insight into the processes of software development

CO2 Understand and practice the various fields such as analysis, design, development, testing of Software Engineering

CO3 Develop skills to construct software of high quality with high reliability

CO4 Apply metrics and testing techniques to evaluate the software

CO5 Understand the Software Configuration Management

CO6 Understand the Software Maintenance Strategies and CASE Tools



CO1 2 2 3 -

2 1 - - -

3 1 3 -

CO2 2 2 3 -

2 1 - - -

3 1 3 -

CO3 2 2 3 -

2 1 - - -

3 1 3 2

CO4 2 2 3 -

2 1 - - -

3 1 3 2

CO5 2 2 3 -

2 1 - - -

3 1 3 2

CO6 2 2 3 -

2 1 - - -

3 1 3 -

Syllabus


1 INTRODUCTION Software Engineering paradigms – Waterfall Life cycle model – Spiral Model – Prototype Model – fourth Generation Techniques – Planning – Software Project Scheduling, – Risk analysis and management – Requirements and Specification – Case Study for Project Plan and SRS

9

CO1

49

2 SOFTWARE DESIGN

Abstraction – Modularity – Software Architecture – Cohesion – Coupling – Various Design Concepts and notations – Real time and Distributed System Design – Documentation – Dataflow Oriented design – Jackson System development – Designing for reuse – Programming standards – Case Study for Design of any Application Project.

9

CO2

3 SOFTWARE TESTING AND MAINTENANCE

Software Testing Fundamentals – Software testing strategies – Black Box Testing – White Box Testing – System Testing – Object Orientation Testing – State based Testing – Testing Tools – Test Case Management – Software Maintenance Organization – Maintenance Report – Types of Maintenance – Case Study for Testing Techniques.

9

CO3,

4 SOFTWARE METRICS Scope – Classification of metrics – Measuring Process and Product

attributes – Direct and Indirect measures – Cost Estimation –

Reliability – Software Quality Assurance – Standards – Case Study

for COCOMO model.

9

CO3,

CO4

5 SCM & WEB ENGINEERING

Need for SCM – Version Control – SCM process – Software

Configuration Items – Taxonomy – CASE repository – Features –

Web Engineering.

9 CO5

CO6

TEXT BOOKS

1. Roger S. Pressman, “Software Engineering: A Practitioner Approach”, Seventh edition, McGrawHill, 2010.

2. Richard Fairley, “ Software Engineering Concepts”, Tata McGraw Hill Edition, 2008 REFERENCES

1. Ali Behforroz, Frederick J.Hudson, “Software Engineering Fundamentals”, Oxford Indian Reprint, 2012

2. Sommerville, “Software Engineering”, Sixth Edition, AddisonWesley-Longman, 2004. 3. Kassem A. Saleh, “Software Engineering”, First Edition, J.Ross Publishing, 2009. 4. Pankaj Jalote, “An Integrated approach to Software Engineering”, Third Edition, Springer Verlag,

2005. 5. Roger S. Pressman, David Lowe, “Web Engineering: A Practitioner’s Approach”, Special Indian

edition, McGrawHill, 2008. 6. Jibitesh Mishra, Ashok Mohanty, “Software Engineering”, Pearson Education, First Edition, 2012

50

Assessment Pattern (Please Exclude Self Study, Mini Project, Seminar Etc if they are not applicable to the course)


Bloom’s Taxonomy

Tests Self Study Assignments Quizzes

Marks 20 10 10 10

Remember 5 2 - 2

Understand 5 2 2 2

Apply 3 2 2 2

Analyze 2 2 2 2

Evaluate 3 2 2 2

Create 2 - 2 -



Remember 10

Understand 10

Apply 10

Analyze 5

Evaluate 5

Create 10

51

MINI PROJECT USING DATA STRUCTURES AND OPERATING SYSTEM


L: P: T: S : 0 :3: 0: 0 CIE Marks : 50

Exam Hours : 3 Hrs SEE Marks : 50

COURSE OBJECTIVES

To get depth knowledge of Data Structure and C. To get exposure in developing an applications based on Data Structures concepts using C.

MINI PROJECT WORK: This mini project is based on subject data structure using C in semester II. Simple projects such as

Sample Project Titles in Data Structures

1. Binary Tree Class 2. Implementation of Recursion and Tracing its Stack 3. Image Compression 4. Student Prerequisite Subjects Management System 5. Online Shopping Store 6. Job scheduling 7. Hardware interface etc.,

Sample Project Titles in Operating System

Scheduling Algorithms

Memory Management Schemes

Interrupt Processing

Intelligent I/O

Multiprocessor Systems

Locality-Aware Scheduling Unified I/O Buffering

Resource Management

Kernel Structure Real-Time Issues in OS etc.,

Project must be done in a group of 2 to 3 students.

Final evaluation will be done by: Project Demonstration

The marks of the mini project would be given on the basis of CIE and SEE of the project as given in the Course Structure

COURSE OUTCOMES

Students will get depth knowledge of Data Structures and C. Students will get exposure in Developing an applications based on Data Structure using C

52

Assessment Method:


Bloom’s Taxonomy

Tests

Marks 50

Remember 5

Understand 5

Apply 10

Analyze 10

Evaluate 10

Create 10



Remember 5

Understand 5

Apply 10

Analyze 10

Evaluate 10

Create 10