i & ii semester course diary 2011-12

MASTER OF COMPUTER APPLICATIONS

CCOOUURRSSEE DDII AARRYY

(ACADEMIC YEAR 2011-12)

II // II II SSEEMM EESSTTEERR Name : _____________________________________________ USN : _____________________________________________ Semester & Section : _____________________________________________

The Mission

“The mission of our institutions is to provide

world class education in our chosen fields and

prepare people of character, caliber and vision

to build the future world”

MCA I/II Semester Course Diary (2011-12) MVJCE 2

SCHEME OF TEACHING AND EXAMINATION

MASTER OF COMPUTER APPLICATIONS

I SEMESTER

S.N Subject Code

Title

Teaching Hrs / Week

Examination

Theory Practical Duration Marks

IA Exam Total

1 10MCA11 Problem Solving using C 04 - 03 50 100 150

2 10MCA12 Discrete Mathematics 04 - 03 50 100 150

3 10MCA13 Fundamentals of Computer Organization

04 - 03 50 100 150

4 10MCA14 Introduction to Unix 04 - 03 50 100 150

5 10MCA15 Professional Communication & Ethics

04 - 03 50 100 150

6 10MCA16 C Programming Laboratory - 03 03 50 50 100

7 10MCA17 Unix Laboratory - 03 03 50 50 100

8 10MCA18 IT and Digital Electronics Laboratory

- 03 03 50 50 100

Total 20 09 400 650 1050


I SEMESTER

PROBLEM SOLVING USING C

Subject Code: 10MCA11 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3

Algorithms and Flowcharts 2 Hours The meaning of algorithms, Flowcharts and their need, Writing algorithms and drawing flowcharts for simple exercises like finding biggest of three numbers, to find roots of given quadratic equation, to find the biggest and smallest of given set of numbers and such other simple examples Constants, Variables and Data Types 4 Hours 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 3 Hours 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 associativity, mathematical functions Managing Input and Output Operations 4 Hours The scanf() & printf() functions for input and output operations, reading a character, writing a character, (the getchar() & putchar() functions) , the address operator(&), formatted input and output using format specifiers, Writing simple complete C programs. Control Statements 4 Hours Decision making with if statement, simple if statement, the if..else statement, nesting of if..else statements, the else..if ladder, the switch statement, the ?: operator, the goto statement, the break statement, programming examples Loop Control Structures 3 Hours The while statement, the do..while statement, the for statement, nested loops, jumps in loops, the continue statement, programming examples Arrays 3 Hours 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 3 Hours 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.


User Defined Functions 6 Hours 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, no arguments and no return values, arguments but no return values, arguments with return values, no arguments with return value, functions that return multiple values, nesting of functions, recursion, passing arrays to functions, passing string to functions, programming examples. Structures and Unions 3 Hours 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 5 Hours 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 File Management in C 6 Hours Defining and opening a file, closing a file, input/output operations on files, error handling during I/O operations, random access files, command line arguments, programming examples. Dynamic Memory Allocation 4 Hours Dynamic memory allocation, allocating a block of memory: malloc, allocating multiple blocks of memory: calloc, releasing the used space: Free, altering the size of a block: realloc, programming examples The Preprocessor 2 Hours Introduction, macro substitution, files inclusion, compiler control directives, ANSI additions, programming exercises. Text Books: 1. Balagurusamy: Programming in ANSI C, 4th Edition, Tata McGraw Hill, 2008.

(Chapters: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13.1-13.6 & 14) 2. V Rajaraman: Computer Programming in C, PHI, 2000.

(Chapters: 1.1, 1.3, 2.1, 2.3, 3.1, 3.2 and 3.3) 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.


MVJ COLLEGE OF ENGINEERING, BANGALORE-67 DEPARTMENT OF MCA

LESSON PLAN Subject Name: Problem Solving Using C Subject Code: 10MCA11

Total No. of Classes: 62

Algorithms and flowcharts 1. The meaning of algorithms, flowcharts and their need, writing algorithms and drawing

flowcharts for simple exercises like finding biggest of three numbers

2. To find roots of given quadratic equation, to find the biggest and smallest of given set of

numbers and such other simple examples.

Constants, Variables and data types

3. Character set, C tokens, keywords & identifiers.

4. Structures of C program, executing a C program.

5. Constants, variables, data types, declaration of variables, declaration of storage classes

6. Assigning values to variables defining symbolic constants, declaring a variable as constant

7. Declaring a variable as volatile, overflow and underflow of data.

Operators and Expressions

8. Arithmetic operators, relational operators, logical operators, assignment operator, increment

and decrement operator.

9. Conditional operator, Bit wise operator, comma operator, special operator, arithmetic

expressions.

10. Evaluation of expressions, precedence of arithmetic operators.

11. Type conversions in expressions, operator precedence and associatively, mathematical

functions.

Managing Input and Output Operations

12. The scanf() & printf() functions for input and output operations, reading a character

13. Writing a character (the getchar() & putchar() functions)

14. The address operator (&), formatted input and output using format specifiers

15. Writing simple complete C programs.

Control Statement

16. Decision making with if statement, simple if statement

17. The if..else statement, nesting of if..else statements

18. The else..if ladder, the switch statement, the ?: operator

Class. No Topics to be covered


19. The goto statement, the break statement, programming examples.

Loop Control Structures

20. The while statement, the do..while statement

21. The for statement, nested loops.

22. Jumps in loops,the continue statement.

23. Programming examples.

Arrays

24. The meaning of an array, one dimensional and two dimensional arrays.

25. Declaration and initialization of arrays

26. Reading, writing and manipulation of above types of arrays, multidimensional arrays.

27. Dynamic arrays, programming examples.

Character Arrays and Strings

28. Declaring and initialing string variables, reading string from terminal, writing string to

screen,

29. Arithmetic operations on characters, putting strings together, comparison of two strings.

30. String handling functions, table of strings.

31. Other features of strings, programming examples.

User Defined Functions

32. Need for user defined functions, a multi function program, elements of user defined functions

33. Defining functions, return values and their types, function calls.

34. Function declaration, category of functions, no arguments and no return values, arguments

but no return values

35. Arguments with return values, no arguments with return value.

36. Functions that return multiple values, nesting of functions.

37. Recursion, passing arrays to functions

38. Passing string to functions, programming examples.

Structures and Unions

39. Defining a structure, declaring structure variable.

40. Accessing structure members, structure initialization

41. Copying and comparing structure variables, operations on individual members.

42. Array of structures, structures within structures.

43. Structures and functions, Unions.

44. Size of structures, bit fields, programming examples.


Pointers

45. Understanding pointer, accessing the address space of a variable, declaring and initialization

pointer variables

46. Accessing a variable through its pointer, chain of pointer, pointer expressions.

47. Pointers and arrays, pointer and character strings.

48. Array of pointers, pointer as function arguments.

49. Functions returning pointers, pointers to functions.

50. Pointer and structures, programming examples.

File Management in C

51. Defining and opening a file, closing a file

52. Input/output operations on files

53. Error handling during I/O operations

54. Random access files,

55. Command line arguments,


Dynamic Memory Allocation

57. Dynamic memory allocation, allocating a block of memory: malloc

58. Allocating multiple blocks of memory: calloc

59. Releasing the used space: Free, altering the size of a block: realloc


The Preprocessor

61. Introduction, macro substitution, files inclusion, complier control directives

62. ANSI additions, programming exercises.


QUESTION BANK

PROBLEM SOLVING USING C – 10MCA11

1. Write a program to find the roots of a given quadratic equation.

2. Draw a flowchart for finding the biggest and smallest of given set of numbers. Also justify the need for having a flowchart?

3. What is a variable? List the rules for naming variables? Give at least two examples for each valid and invalid variable names.

4. Explain the different storage classes in C.

5. Find the value of x in following program

i) int a; ii) int a;

float x; float x;

a = 1600/1000 + 2.5; a=4*3%5+8/3*2;

x= 1600/1000 +2.5; x=4*3%5+8/3*2;

printf(“%d %f\n” ,a,x);

6. Explain the bitwise operators with examples

7. What are math functions? Write any six math function.

8. Write a program to accept a string and count the number of vowels and consonants in the string.

9. Explain the execution of switch statements and give an example.

10. Explain the simple if and if-else statements with examples.

11. Differentiate between normal exit and abnormal exit from a loop.

12. What are nested loops? Give the rules for nesting loops.

13. Differentiate between break and continue statements in C

14. Write a program to find whether a given string is a palindrome or not.

15. Write a program to find the multiplication of two matrices.

16. Define an array? how the array elements are accessed? Explain the same with an example.

17. Write a program to concatenate given two strings.

18. Explain the various String functions in detail

19. What are recursive functions?

20. What is the difference between call by value and call by reference.

21. Explain the difference between structure and union with examples.

22. Declare a structure to represent a complex number. Using the structure write a function to add 2 complex numbers.

23. What is a pointer? How it is declared in a program?

24. Write a program to find the sum of five integers stored in an array using pointers.

25. Explain any six file oriented input/output functions with syntax.

26. Explain dynamic memory allocation functions.

27. What is a preprocessor? Explain the three different types of preprocessors available in C.


DISCRETE MATHEMATICS Subject Code: 10MCA12 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 Set Theory 6 Hours Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, A First Word on Probability, Countable and Uncountable Sets Fundamentals of Logic 13 Hours Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic, Logical Implication – Rules of Inference; The Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems Properties of the Integers 7 Hours Mathematical Induction, The Well Ordering Principle – Mathematical Induction, Recursive Definitions Relations and Functions 14 Hours Cartesian Products and Relations, Functions – Plain and One-to-One, Onto Functions – Stirling Numbers of the Second Kind, Special Functions, The Pigeon-hole Principle, Function Composition and Inverse Functions; Properties of Relations, Computer Recognition – Zero-One Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions Groups, Coding Theory and Rings 6 Hours Definitions, Examples, and Elementary Properties, Homomorphisms, Isomorphisms, and Cyclic Groups, Cosets, and Lagrange’s Theorem Elements of Coding Theory, The Hamming Metric, The Parity Check, and Generator Matrices Group Codes, Rings and Modular Arithmetic 6 Hours Decoding with Coset Leaders, Hamming Matrices The Ring Structure – Definition and Examples, Ring Properties and Substructures, The Integers Modulo n Text Book:

1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5th Edition, Pearson Education, 2004. (Chapter 3.1, 3.2, 3.3, 3.4, Appendix 3, Chapter 2, Chapter 4.1, 4.2, Chapter 5.1 to 5.6, Chapter 7.1 to 7.4, Chapter 16.1, 16.2, 16.3, 16.5 to 16.9, and Chapter 14.1, 14.2, 14.3).

Reference Books:

1. Kenneth H. Rosen:, Discrete Mathematics and its Applications, 6th Edition, McGraw Hill, 2007.

2. Jayant Ganguly: A Treatise on Discrete Mathematical Structures, Sanguine-Pearson, 2010. 3. D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications,

Thomson, 2004. 4. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.



LESSON PLAN Subject Name: Discrete Mathematics Subject Code: 10MCA12


Sets, Proof Templates and Induction

1. Basic Definitions


3. Operations on Sets



6. The Principles of inclusion and Exclusion Mathematical Induction




10. Exercises

Formal Logic

11. Introduction to propositional logic

12. Introduction to propositional logic

13. Truth and logical

14. Truth and logical truth

15. Normal Forms

16. Normal Forms

17. Predicates and Quantification

18. Exercises.

Relations

19. Binary Relations

20. Exercises

21. Operations on binary relations

22. Exercises

23. Special types of relations

24. Equivalence relations

25. Equivalence relations

26. Ordering relations.

Class. No

Topics to be covered


Ordered Sets and Lattices

27. Introduction

28. Ordered sets

29. Hasse-diagrams of partially ordered sets

30. Consistent enumeration

31. supremum and infimum,

32. Isomorphic ordered sets

33. Well-Orders sets,

34. Lattices. Functions


36. Operations on functions

37. Exercises

38. Sequences and sub sequences

39. The Pigeon-Hole principle

40. The Pigeon-Hole principle

41. Countable

42. Uncountable sets

43. Exercises.

44. Exercises.

Graph Theory

45. Introduction

46. Data structures

47. Graphs and Multi graphs

48. Sub graphs

49. Isomorphic and Homomorphic graphs

50. Paths

51. Connectivity

52. The bridge of Konigsberg

53. Traversable multi graphs

54. Labeled and weighed graphs

55. Complete

56. Regular and biperted graphs

57. Tree graphs, planar graphs, graph coloring,

58. Representing graphs in computer memory, graph algorithm. Algebraic Systems

59. Introduction

60. Operations

61. Semi groups, groups, sub groups

62. Normal sub group and homomorphisms


QUESTION BANK

DISCRETE MATHEMATICS-10MCA12

1. Define the following with an example:

(i) Sets with the help of Venn diagram.

(ii) Symmetric difference of two sets.

2. Prove that A∪B∪C= A+ B+ C- A∩B- B∩C- A∩C+ A∩B∩C

3. Prove that 12+32+52+ … + (2n-1) 2= (1/3) n (2n-1) (2n+1)

4. Construct a truth table to show that (p->q) <-> (¬p∨q) is a Tautology

5. Obtain CNF equivalent of the formula (( p∨q) -> r) ∧ (r->¬(p∨q)) with combinatorial

circuit

6. Let A = {1,2,3,4}. Find the Matrix of Transitive closure for the following relational matrix

1 0 0 1

1 1 0 0

MR = 0 0 1 0

0 0 0 1

7. Let A={a,b,c.d,e,f} determine the relation R ⊆ A×A and draw the directed graph G

associated with R for the following relational matrix

a b c d e f

M(R)= a 1 0 0 1 0 0 b 0 0 1 0 0 1 c 1 1 1 0 0 1 d 0 0 1 0 0 0 e 0 0 0 0 1 1

f 0 1 1 0 0 1 8. Define the following with an example (i) Poset (ii) Lattice (iii) Principle of duality

9. Draw the Hasse diagram of Poset and obtain Maximal &Minimal elements A= {1,2,3,4}

R={(1,1),(1,2),(2,2),(2,4),(1,3),(3,3),(3,4),(1,4),(4,4)}

10. Explain the Pigion-Hole principle in any set of 29 persons at least five persons must have

been born on the same day of the week

11. Let f:R->R, g:R->R be defined by f(x)=x2,g(x)=x+5 then find (i) (gof)(x) (ii) (fog)(x)

12. Write an algorithm to find the spanning tree for a graph with an example

13. Define (i) Semi groups (ii) Groups (iii) Sub groups with an example each

14. Show that in a group (G,∗) (i) The identity element is unique (ii) Every element of G has an

unique inverse

15. Define the following with an example (i) Multigraph (ii) Null graph (iii) Planar graph (iv)

Bipartite


FUNDAMENTALS OF COMPUTER ORGANIZATION Subject Code: 10MCA13 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 Number Systems and Logic Gates 7 Hours Counting in Decimal and Binary, Place Value, Binary to Decimal Conversion, Decimal to Binary Conversion, Hexadecimal Numbers, Octal Numbers, Bits, Bytes, Nibbles, and Word Size, The AND Gate, The OR gate, The inverter and Buffer, The NAND gate, the NOR Gate, The exclusive OR gate, The Exclusive NOR Gates, The NAND Gate as an universal Gate, Gates with More than two inputs, Using Inverters to convert gates. Combining Logic Gates and Arithmetic Circuits 9 Hours Constructing Circuits from Boolean Expression, Drawing a circuit from a Maxterm Boolean Expression, Truth Tables and Boolean Expressions, Sample Problem Simplifying BooleanExpression, Karnaugh Maps, Karnaugh Maps with three variables, Karnaugh Maps with four variables, more Karnaugh Maps, using Demorgan’s Theorem, Binary Addition, Half Adders, Full Adders, Three Bit Adders, Binary Subtraction, Parallel Subtractors, IC Adders, Binary Multiplication, Binary Multipliers, 2s Complement Notation, Addition and Subtraction, 2s Complement adders/subtractor Basic Structure of Computer 6 Hours Computer Types, Functional Units, Basic Operational Concepts, Bus structures, Performance, Memory Location and Addresses Machine Instruction and Programmes 8 Hours Memory Operations, Instructions & Instruction Sequencing, Addressing Modes, Assemble Language, Basic Input/Output Operations Input/Output Organization 8 Hours Accessing I/O Devices, Interrupts, Direct Memory Accesses, Buses 240, Interface Circuits Memory Systems 8 Hours Some Basics concepts, Semiconductors RAM Memories, Read-Only Memories, Cache Memories, Virtual Memories Arithmetic Unit 6 Hours Addition & subtraction of Signed Numbers, Design of Fast adders, Multiplication of Positive Numbers, Signed-Operand Multiplication, Fast Multiplication, Integer division Floating-Point Numbers & Operations Text Books:

1. Tokheim: Digital Electronics Principles and Applications, McGraw Hill, 6th Edition, 2004. (Chapters: 2.1 to 2.4, 2.6 to 2.8, 3.1 to 3.10, 4.1 to 4.9, 4.16, 10.1 to 10.11)

2. Carl Hamacher, Z Varnesic and S Zaky: Computer Organization, 5th Edition, McGraw Hill, 2002. (Chapters: 1.1 to 1.4, 1.6, 2.2 to 2.7, 4.1, 4.2, 4.4 to 4.6, 5.1 to 5.5, 5.7, 6.1 to 6.7)

Reference Books:

1. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson, 2008. 2. Morris Mano, and Charles R Kime: Logic and Computer Design Fundamentals, 2nd Edition,

Pearson Education, 2001.



LESSON PLAN

Subject Name: Fundamentals of Computer Organization Sub Code: 10MCA13


Class. No Topics to be Covered

1. NUMBER SYSTEMS AND LOGIC GATES

1. Counting in Decimal and Binary, Place Value, Binary to Decimal Conversion

2. Decimal to Binary Conversion, Hexadecimal Numbers, Octal Numbers

3. Decimal to Binary Conversion, Hexadecimal Numbers, Octal Numbers

4. Bits, Bytes, Nibbles and word size, The AND gate, The OR gate

5. The inverter and Buffer, The NAND gate, the NOR gate

6. The exclusive OR gate. The Exclusive NOR gates.

7. The NAND gate as an universal gate. Gates with more than two inputs

8. Using Inverters to convert gates.

2. COMBINING LOGIC GATES AND ARITHMETIC CIRCUITS

9. Constructing Circuits fro Boolean Expression

10. Drawing a circuit from a Maxterm Boolean Expression

11. Truth Tables and Boolean Expressions,

12. Sample Problem Simplifying Boolean Expression

13. Karnaugh Maps, Karnaugh Maps with three variables

14. Karnaugh Maps with four variables, more Karnaugh Maps, using Demorgan’s Theorem

15. Binary Addition, Half Adders, Full Adders

16. Three Bit Adders, Binary Subtraction, Parallel Subtractors

17. IC Adders, Binary Multiplication,

18. Binary Multipliers, 2s Complement Notation

19. Addition and Subtraction, 2s Complement adders/subtractors.

3. BASIC STRUCTURE OF COMPUTER

20. Computer Types

21. Functions Units

22. Basic Operational Concepts

23. Bus structures

24. Performance

25. Memory Location and Addresses

26. Memory Location and Addresses

4. MACHINE INSTRUCTION AND PROGRAMMES

27. Memory Operations Instructions & Instruction Sequencing


5. INPUT/OUTPUT ORGANIZATION

36. Accessing I/O Devices

37. Accessing I/O Devices

38. Interrupts

39. Interrupts

40. Direct Memory Accesses

41. Direct Memory Accesses

42. Buses 240

43. Buses 240

44. Interface Circuits

45. Interface Circuits

6. MEMORY SYSTEMS

46. Some Basic concepts

47. Semiconductors

48. Semiconductors

49. RAM Memories

50. RAM Memories

51. Read-only Memories

52. Cache Memories

53. Cache Memories

54. Virtual Memories

55. Virtual Memories

7. ARITHMETIC UNIT

56. Addition & Subtraction of Signed Numbers

57. Design of Fast adders

58. Multiplication of positive numbers

59. Signed-Operand Multiplication

60. Fast Multiplication,

61. Integer division

62. Floating-Point Numbers & Operations.

28. Memory Operations Instructions & Instruction Sequencing,

29. Addressing Modes

30. Addressing Modes

31. Assemble Language

32. Assemble Language

33. Basic Input/Output Operations.




QUESTION BANK

FUNDAMENTALS OF COMPUTER ORGANIZATION-10MCA13

1. Convert the following numbers from the given base to the indicated.

11010111.110 (2) = (?)10

10110.0101 (2) = (?)16

0.85 (10) = (?)2

13.32(8) = (?)10

2. Convert the hexadecimal number C0CA to binary, Octal and Decimal number system

3. Design full adders using NAND gates

4. Minimize the following using K-map.

F(A,B,C,D)=∑(0,3,4,5,7)+d(8,9,10,11,12,13,14,15)

F(A,B,C)= ∑(0,1,8,9,10)+d(2,3,4,5,6)

F(A,B,C,D)=∏(0,3,4,5,6,7,11,13,14)

5. State and prove Demorgan’s Theorem

6. Prove that

i) A’BC+AB’C+ABC’+ABC=AB+BC+CA

ii) (A+C+D)(A+C+D)(A+C+D)(A+B’)=(A+B’CD)

7. Explain the working of IC-Adders with the help of an example.

8. Solve by postulates and theorems

i) xy’z+xyz’+x’yz+xyz

ii) xy+x’y’z’+x’yz’

9. Solve by truth table methods

i) x+xy=x

ii) (x+y)’=x’y’

10. Briefly describe functional units of a digital computers.

11. Explain any five addressing modes commonly found in digital computers with examples

12. Explain cache memory concept with neat diagram.

13. Define Interrupts. Explain how multiple devices are handled in interrupts.

14. Explain little-endian and big-endian assignments.

15. With the help of neat diagrams explain the accessing of I/O devices

16. What is DMA? Explain the use of DMA controllers in a computer system.

17. Explain the design of fast adders.

18. With the help of the neat diagram explain sequential circuit for

binary multiplication.

19. With the help of a neat diagram explain sequential circuit for binary division by non restoration.

20. Write short notes on the following.

a) Flash Memory b) IEEE representation of floating point numbers

c) Booths algorithm d) Universal gates


INTRODUCTION TO UNIX Subject Code: 10MCA14 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 10 Hours General Purpose Utilities: banner, cal, date, calendar, who, printf, tty, stty, uname, passwd, lock, echo, tput, bc, script, spell and ispell. Navigating the 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, mkdir, rmdir, Relative pathnames, The UNIX file system Handling Ordinary Files: cat, cp, rm, mv, more, lp, file, wc, od, split, cmp, comm., diff. 6 Hours The vi editor: The Three Modes, Input Mode, Saving, The Repeat Factor, Command Mode, Deletion, Navigation, Pattern Search, Joining lines, Repeating the Last command, undoing the Last Editing Instructions, Search and Replace. Basic File Attributes: ls –l, the –d option, File Permissions, chmod. Security and File Permission: users and groups, security level, changing permission, user masks, changing ownership and group 6 Hours Shell Programming: Shell Scripts, read, Command Line Arguments, Exit Status of a Command, The Logical Operators && and ||, exit, if, and case conditions, expr, sleep and wait, while, until, for, $, @, redirection, The here document, set, trap, Sample Validation and Data Entry Scripts. The Process: process basics, PS, internal and external commands, running jobs in background, nice, at and batch, cron, time commands Customizing the Environment: System Variables, profile, sty, PWD, Aliases, Command History, On-Line Command Editing 8 Hours More file attributes: hard link, symbolic link, umask, find Simple filters: PR, head, tail, cut, paste, sort, uniq, tr commands

7 Hours Filters using Regular Expression and the grep Family: grep, Regular Expression, egrep, fgrep, a sed instruction, Line Addressing, Inserting and Changing Test, Context addressing, writing selected lines to a file, The –f option, Substitution, Properties of Regular Expressions

7 Hours Essential Shell Programming: shell script, read, exit, the if conditional, using Tests and [] to evaluate expression, the case conditional expr, while: looping, for: looping with a list, set and shift, trap, debugging shell scripts with Set - X. Essential System Administration: root, administartor’s privileges, startup & Shutdown, managing disk space, cpio, tar 6 Hours awk-Advanced Filters: Simple awk Filtering, Splitting a Line in to Fields, printf, the Logical and Relational Operators, Number Processing, Variables, The -f option, The BEGIN and END Positional Parameters, get line, Built-in variables, Arrays, Functions, Interface with the Shell, Control Flow.


Advanced Shell Programming: The sh command, export, cd, the Command, expr, Conditional Parameter Substitution, Merging Streams, Shell Functions, eval, Exec Statement. 2 Hours Advanced vi: Operators, the ex mode, named buffered , Numbered Buffers, Entering Control Characters, Searching for a Character, Marking Text Customizing, vi Text Books:

1. Sumitabha Das: UNIX Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006. (Chapters: 1.2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 21, 20, 21)

2. Behrouz A Forouzan and Richard F Gilberg: UNIX and Shell Programming, Thomson Course Technology, 2005. (Chapter: 4)

Reference Books:

1. Kenneth Roson et al: UNIX - The Complete Reference, Osborne/McGraw Hill, 1999. 2. Steve Montsugu: Using UNIX, 2nd Editon, Prentice Hall India, 1999. 3. M G Venkateshmurthy: UNIX and Shell Programming, Pearson Education, 2005.


MVJ COLLEGE OF ENGINEERING, BANGALORE – 67 DEPARTMENT OF MCA

LESSON PLAN

Subject Name: Introduction to Unix Subject Code: 10MCA14

Total No. of Classes : 62 Class.

No Topics to be covered

General purpose utilities 1. Banner, cal, date, calendar, who

2. Printf, tty, uname, paswd,

3. Lock, echo, tput, bc, script, spell and ispell.

Navigating the file system 4. The file, what’s in a file(name)?

5. The parent-child Relationship

6. pwd.the Home Directory, Absolute path names

7. Using the absolute pathname for a command,

8. cd, mkdir, rmdir

9. Relative pathnames , the UNIX file system

Handling ordinary files

10. cat, cp, rm, mv, more, lp, file

11. Handling ordinary files wc, od, split,

12. cmp, comm., diff

The vi editor 13. The Three modes, Input modes, Saving, The Repeat Factor

14. Command Mode, Deletion, Navigation

15. Pattern Search, Joining lines; Repeating the Last command,

16. Undoing the last Editing Instructions, Search and Replace

Basic File Attributes

17. ls -1,The-d Option, File permission, chmod

Security and File Permission 18. Users and groups, security level, changing permissions, 19. user masks, changing ownership and group

Shell Programming 20. Shell Scripts, read, Command Line Arguments, Exit Status of a command 21. The Logical Operators && and ||, exit, if and case conditionals,

22. expr, sleep and wait, while, until, for, $, @, Redirection

23. The here document, set, trap, Sample Validation and Data Entry Scripts. The Process

24. Process basics, PS, Internal and External commands 25. Running Jobs in background, nice, 26. at and batch, cron, time commands

27. Customizing the Environment: System Variables, profile, sty, PWD,


28. Aliases, Command History, On-Line Command Editing More File Attributes

29. Hard link 30. Symbolic link 31. Umask 32. Find

Simple Filters 33. PR, head 34. tail, cut, paste 35. sort, uniq 36. tr command

Filters using Regular Expression and the grep Family: 37. grep. Regular Expression 38. egrep, fgrep 39. a sed instruction, Line Addressing 40. Inserting and changing Text, Context addressing 41. Writing Selected Lines to a File 42. The –f option, Substitution 43. properties of Regular Expressions

Essential Shell Programming 44. shell script, read, exit 45. the if conditional, using Tests and [ ] to evaluate expression, the case conditional expr 46. while:looping, for: looping with a list 47. set and shift, trap 48. debgging shell scripts with Set – X

Essential System Administration 49. root – administrator’s Privileges, startup & Shutdown 50. Managing Disk Space, cpio, tar

awk-Advanced Filters 51. Simple awk Filtering, Splitting a line into Fields, 52. printf, the Logical and Relational operators 53. Number processing, Variables, the –f option, 54. The BEGIN and END positional Parameters, getline, Built in variables 55. Arrays, Functions 56. Interface with the shell, Control Flow.

Advanced Shell programming 57. The sh Command, export, cd, The, command, expr 58. conditional parameter Substitution, Merging Streams, 59. Shell Functions, eval, exec statement

Advanced vi 60. Operators, the ex Mode, named buffered, Numbered Buffers 61. Entering Control Characters, Searching for a character, 62. Making Text, Customizing vi


QUESTION BANK

INTRODUCTION TO UNIX - 10MCA14 1. Give the history of Unix.

2. Mention the different category of files that exist in UNIX. Explain each briefly.

3. What are commands? Explain with few examples.

4. Explain the Important Features of UNIX

5. Explain echo and tput Commands.

6. Differences between External and internal commands.

7. List few Utilities of UNIX.

8. Discuss the organizational structure of files in UNIX. Give the meaning of (.) and (..)

9. Directory names.

10. What are the different types of files in UNIX

11. Explain the following file handling commands(i)bc(ii)wc(iii)split.

12. Give an overview of relative and Absolute Path.

13. What do u mean by I/O redirection? with the aid of necessary illustrations explain

14. How redirection is accomplished in UNIX.

15. Explain the differences between External and Internal Commands.

16. Explain the tee command.

17. What are shell variables? How are shell variables used.

18. Explain the different modes in which vi-editor works.

19. What are System Variables? Explain (i)SHELL(ii)PATH(iii)The variables PS1 and PS2 .

20. Explain the .profile command.

21. Give the different permissions of a file? Explain chmod command.

22. Explain the use of Filters.

23. Mention the different member of the grep family of commands and Explain each one of them briefly.

24. What is a Process? Explain the Process Creation mechanism.

25. How are shell scripts debugged? Discuss.

26. Explain Special files.

27. What are arrays and lists in Perl? Discuss.

28. What is $ed instruction? Explain the following w.r.t $ed

1.Repeated Pattern.

29. Discuss the importance of .exrc file.

30. What are Inodes? What information do they contain.


PROFESSIONAL COMMUNICATION AND ETHICS Subject Code: 10MCA15 I.A. Marks: 50 Hours/Week : 4 Exam Marks: 100 Total Hours : 52 Exam Hours: 3 Professional / Technical Communication Basics of Technical Communication 5 Hours Introduction, Process of Communication, Language as a Tool, Levels of Communication, Levels of Communication, Communication Networks, Importance of Technical Communication Barriers to Communication 3 Hours Definition of Noise, Classification of Barriers Technology in Communication 4 Hours Impact of Technology, Software for Creating Messages, Software for Writing Documents, Software for Presenting Documents, Transmitting Documents, Effective use of Available Technology Active Listening 3 Hours Introduction, Types of Listening, Traits of good Listener, Active versus passive listening, implications of effective listening Effective Presentation Strategies 5 Hours Introduction, Defining purpose, Analyzing Audience and Locale, Organizing Contents, preparing outline, Visual Aids, Understanding Nuances of Delivery, Kinesics, Proxemics, Paralinguistic’s, Chronemics, Sample speech Group Communication 5 Hours Introduction, Group Discussion, Organizational Group discussion, Group discussion as part of selection process Meetings, conferences. Research paper, Dissertation and Thesis 4 Hours Introduction, Research paper, Dissertation, Thesis Ethics: An Overview of Ethics 3 Hours What are Ethics? Ethics in the Business World, Ethics in Information Technology (IT) Ethics for IT Professionals and IT users IT professionals, The Ethical behavior of IT professionals, IT Users 4 Hours Privacy 3 Hours Privacy Protection and the Law, Key Privacy and Anonymity Issues Software Development 3 Hours Strategies to Engineer Quality s/w, Key Issues Employer/Employee Issues 3 Hours Use of Nontraditional workers, Whistle Blowing


Case Studies and Discussion 7 Hours Text Books:

1. Meenakshi Raman and Sangeeta Sharma: Technical Communication - Principles and Practices, Oxford University Press, 2004. (Chapters: 1, 2, 3, 4, 5, 7, 16)

2. George Reynolds: Ethics in Information Technology, 2nd Edition, Thomson Course Technology, 2007. (Chapters: 1, 2, 4, 7, 8)

Reference Books:

1. M.Ashraf Rizivi: Effective Technical Communication, Tata McGraw Hill, 2005. 2. Mike W Martin and Ronald Schinzinger: Ethics in Engineering, 3rd Edition, Tata McGraw

Hill, 2007.



LESSON PLAN

Subject Name: Professional Communication and Ethics Subject Code: 10MCA15

Total No. of Classes : 62

Professional / Technical Communication Basics of Technical Communication

1. Introduction 2. Process of Communication 3. Language as a Tool 4. Levels of Communication 5. Levels of Communication 6. Communication Networks 7. Importance of Technical Communication.

Barriers to Communication

8. Definition of Noise 9. Classification of Barriers 10. Classification of Barriers

Technology in Communication

11. Impact of Technology 12. Software for Creating Messages 13. Software for Writing Documents 14. Software for Presenting Documents 15. Transmitting Documents 16. Effective use of Available Technology.

Active Listening

17. Introduction 18. Types of Listening 19. Traits of good Listener 20. Active versus passive listening 21. Implications of effective listening.

Effective Presentation Strategies

22. Introduction 23. Defining purpose 24. Analyzing Audience and Locale 25. Organizing Contents 26. Preparing outline 27. Visual Aids, 28. Understanding Nuances of Delivery 29. Kinesics 30. Proxemics, Paralinguistic’s, Chronemics, Sample speech.

Class. No Topics to be covered


Group Communication 31. Introduction, Group Discussion 32. Organizational Group discussion 33. Group discussion as part of selection process Meetings 34. Group discussion as part of selection process Meetings 35. Conferences.

Research paper, Dissertation and Thesis

36. Introduction 37. Research paper 38. Dissertation 39. Thesis

Ethics: An Overview of Ethics

40. What are Ethics? 41. Ethics in the Business World 42. Ethics in Information Technology (IT) 43. Ethics in Information Technology (IT)

Ethics for IT Professional and IT users

44. IT professionals 45. The Ethical behavior of IT professionals 46. The Ethical behavior of IT professionals 47. IT Users

Privacy

48. Privacy Protection and the Law 49. Key Privacy and Anonymity Issues. 50. Key Privacy and Anonymity Issues.

Software Development

51. Strategies to Engineer Quality s/w 52. Strategies to Engineer Quality s/w 53. Key Issues

Employer/Employer Issues

54. Use of Non traditional workers 55. Use of Non traditional workers 56. Whistle Blowing

56 to 62: Case Studies and Discussion


QUESTION BANK

PROFESSIONAL COMMUNICATION ETHICS - 10MCA15

1. Define Communication. Differentiate between technical and general communication

2. According to Noam Chomsky and Ferdinand de Saussure, explain the different characteristics of language

3. Explain the importance of technical communication

4. Explain the following terms with reference to communication barriers and give two examples for each term i. semantic gap ii negative attitude iii. absence of common frame of reference iv. information overload v. “know it all”

5. Explain the steps involved in creating a technical message and the tools used in each step

6. Discuss active versus passive listening

7. List out the Do’s for effective listening

8. Explain any two Nuances of delivery with their advantages and disadvantages

9. Explain different techniques in organizational group discussion

10. Assuming that you have chosen a topic related to your area of dissertation write a research paper based on it

11. Write a note on ethics in information technology

12. Why are corporation’s interested in promoting good business ethics?

13. What are some common ethical issues encountered by IT users? What negative impact does unethical behavior in these areas have?

14. Explain the right of privacy and state the basis for protecting personal privacy under law.

15. Why do employers monitor workers? Do you think they should be able to do so?

16. What is safety critical system. What additional precautions must be taken during the development of such a system.

17. What are contingent workers and how they are frequently employed in the IT industry?

18. What is offshore outsourcing and list out the advantages of this approach

19. Explain the different communication networks in an organization

20. Distinguish between horizontal and diagonal communication

21. Define Kinesics. Explain how the different Kinesics of the speakers contribute to the message

22. Discuss the major forms of group communication

23. Compare and contrast Dissertation and Thesis

24. Define Ethics. Briefly discuss a seven step approach for ethical decision making

25. Explain the fundamental forms of data encryption


C PROGRAMMING LABORATORY Subject Code: 10MCA16 I.A. Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3

PART A

1. a. Write a program to find the area of a triangle (Given the three sides).

b. Write a program to find the area of a circle (Given the radius).

2. Write a program to find the Simple interest, given the principle, time and rate of interest with appropriate validations.

3. Write a program to find out whether a given year is a leap year or not.

4. Write a program to find the roots of a quadratic equation with appropriate error messages.

5. Write a program to display the following files of current directory.

i) .EXE files ii) .BAT files iii) .OBJ files iv) .BAK files. By using system DOS command.

6. Write a program to find GCD and LCM of given two numbers.

7. Write a program to find the value of Sin (x) using the series. Sin (x) = x – x3/3! + x5/5! – x7/7! + …………….

8. Write a program to print all prime numbers between m and n. .

9. Write a program to reverse a number and check whether it is palindrome or Not.

10. Write a program to generate and print first n Fibonacci numbers using function.

11. Write a program to find a factorial of a given number using recursive function.

12. Write a program to convert UPPERCASE alphabets to LOWERCASE alphabets in a given string and vice-versa.

13. Write a program to read two strings and concatenate them (without using library functions).

14. Write a program to read a sentence and count the number of vowels and constants.

PART - B

1. Write a program to read N integers (zero, + ve and –ve) into an array and find sum of

positive numbers, sum of negative numbers and average of all input numbers.


2. Write a program to input N real numbers and to find the mean, variance and standard deviation, where,

3. Write a program to input N numbers (integers or real) and store them in an array. Conduct a Linear search for a given key number and report success or failure in the form of a suitable message.

4. Write a program to sort N numbers in ascending or descending order using bubble sort.

5. Write a program to accept N numbers sorted in ascending order and search for a given number using binary search. Report success or failure in the form of suitable messages.

6. Write a program to read two matrices A and B of size M x N and perform product of two given matrices.

7. Write a program to list the names of students who have scored more than 60% of total marks in three subjects using structure variables.

8. Write a program to compute the sum of two complex numbers – passing a structure to a function.

9. Define a book structure having title of the book, ISBN, author, price and month and year of publication as its members. Use a substructure to store the month and year of Publication information. Develop a program to accept a date (in the form of month and year) and list out all the book titles (along with price and ISBN) published during that date.

10. Define a student structure having the name, USN (university seat number), marks in five subjects, total and percentage of marks as its members. Marks of all the subjects are to be stored in an array. Develop a program to list the names of all the students who have failed.

11. Write a program to read N integers and store them in an array, find the sum of all these elements using pointer. Output the given array and the computed sum with suitable heading.

12. Write a program to read and write to a file.

13. Write a program to Create and count number of characters in a file.

14. Write a program to handle files with mixed data type.

Note: Students are required to execute one question from Part A and one from Part B

Mean = Σxi / N Σ(xi – mean)2 Variance = ---------------- N Deviation = √variance and 0 ≤ i < n



LESSON PLAN

Subject Name: ‘C’ Programming Laboratory Sub Code: 10MCA16

Total No. of Hours: 42

Hour.No Topics to be covered

PART A

1. a. Write a program to find the area of a triangle (Given the three sides). b. Write a program to find the area of a circle (Given the radius).

2. Write a program to find the Simple interest, given the principle, time and rate of interest with appropriate validations.

3. Write a program to find out whether a given year is a leap year or not.

4. Write a program to find the roots of a quadratic equation with appropriate error messages.

5. Write a program to display the following files of current directory.

i) .EXE files ii) .BAT files iii) .OBJ files iv) .BAK files. By using system DOS command.

6. Write a program to find GCD and LCM of given two numbers.

7. Write a program to find the value of Sin (x) using the series. Sin (x) = x – x3/3! + x5/5! – x7/7! + …………….

8. Write a program to print all prime numbers between m and n. .

9. Write a program to reverse a number and check whether it is palindrome or Not.

10. Write a program to generate and print first n Fibonacci numbers using function.

11. Write a program to find a factorial of a given number using recursive function.

12. Write a program to convert UPPERCASE alphabets to LOWERCASE alphabets in a given string and vice-versa.

13. Write a program to read two strings and concatenate them (without using library functions).

14. Write a program to read a sentence and count the number of vowels and constants.

PART - B

1. Write a program to read N integers (zero, + ve and –ve) into an array and find sum of

positive numbers, sum of negative numbers and average of all input numbers.


2. Write a program to input N real numbers and to find the mean, variance and standard deviation, where,

3. Write a program to input N numbers (integers or real) and store them in an array. Conduct a Linear search for a given key number and report success or failure in the form of a suitable message.

4. Write a program to sort N numbers in ascending or descending order using bubble sort.

5. Write a program to accept N numbers sorted in ascending order and search for a given number using binary search. Report success or failure in the form of suitable messages.

6. Write a program to read two matrices A and B of size M x N and perform product of two given matrices.

7. Write a program to list the names of students who have scored more than 60% of total marks in three subjects using structure variables.

8. Write a program to compute the sum of two complex numbers – passing a structure to a function.

9. Define a book structure having title of the book, ISBN, author, price and month and year of publication as its members. Use a substructure to store the month and year of Publication information. Develop a program to accept a date (in the form of month and year) and list out all the book titles (along with price and ISBN) published during that date.

10. Define a student structure having the name, USN (university seat number), marks in five subjects, total and percentage of marks as its members. Marks of all the subjects are to be stored in an array. Develop a program to list the names of all the students who have failed.

11. Write a program to read N integers and store them in an array, find the sum of all these elements using pointer. Output the given array and the computed sum with suitable heading.

12. Write a program to read and write to a file.

13. Write a program to Create and count number of characters in a file.

14. Write a program to handle files with mixed data type.

Mean = Σxi / N Σ(xi – mean)2 Variance = ---------------- N Deviation = √variance and 0 ≤ i < n


UNIX PROGRAMMING LABORATORY Subject Code: 10MCA17 I.A. Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3 1. a. Write a non-recursive shell script which accepts any number of arguments and prints

them in the reverse order (For example, if the script is named rags, then executing args A B C should produce C B A on the standard output).

b. 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.

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

b. Write a shell script that accepts a path name and creates all the components in that path name as directories. For 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. a. 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.

b. 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.

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

properties. b. 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.

5. a. 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.

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

6. a. 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. b. Write a shell script to find smallest of three numbers that are read from keyboard.

7. a. Write a shell script using expr command to read in a string and display a suitable message if it does not have at least 10 characters.

b. Write a shell script to compute the sum of number passed to it as argument on command line and display the result.


8. a. Write a shell script that compute gross salary of an employee, accordingly to rule

given below. If basic salary is < 15000 then HRA=10% of basic 7 DA=90% of basic. If basic salary is >=15000 then HRA=500 of basic & DA=98% of basic.

b. Write a shell script that delete all lines containing a specific word in one or more file supplied as argument to it.

9. a. 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.

b. 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.

10. a. Write a shell script that determine the period for which a specified user is working on system. b.Write a shell script that reports the logging in of a specified user within one minute after

he/she log in. The script automatically terminate if specified user does not log in during a specified period of time.

11. a. Write a shell script that accepts two integers as its argument and compute the value of first number raised to the power of second number.

b. 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.

12. a. 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.

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

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

b. 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.

i. Electrical 34 ii. Mechanical 67 iii. Electrical 80 iv. Computer Science 43 v. Mechanical 65

vi. Civil 198 vii. Computer Science 64

14. Write an awk script to compute gross salary of an employee accordingly to rule given below.

If basic salary is < 10000 then HRA=15% of basic & DA=45% of basic. If basic salary is >=10000 then HRA=20% of basic & DA=50% of basic.

Note: In the examination each student picks one question from a lot of all the 14 questions.



LESSON PLAN

Subject Name: Unix Programming Laboratory Sub Code: 10MCA17


Hour.No Topics to be covered

1. a. Write a non-recursive shell script which accepts any number of arguments and prints them in the reverse order (For example, if the script is named rags, then executing args A B C should produce C B A on the standard output).

c. 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.

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

c. Write a shell script that accepts a path name and creates all the components in that path name as directories. For 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. a. 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.

b. 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.

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

properties. b. 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.

5. a. 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.

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

6. a. 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. b. Write a shell script to find smallest of three numbers that are read from keyboard.

7. a. Write a shell script using expr command to read in a string and display a suitable message if it does not have at least 10 characters.


b. Write a shell script to compute the sum of number passed to it as argument on command line and display the result.

8. a. Write a shell script that compute gross salary of an employee, accordingly to rule given below.

If basic salary is < 15000 then HRA=10% of basic 7 DA=90% of basic. If basic salary is >=15000 then HRA=500 of basic & DA=98% of basic.

b. Write a shell script that delete all lines containing a specific word in one or more file supplied as argument to it.

9. a. 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.

b. 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.

10. a. Write a shell script that determine the period for which a specified user is working on system.

b. Write a shell script that reports the logging in of a specified user within one minute after he/she log in. The script automatically terminate if specified user does not log in during a specified period of time.

11. a. Write a shell script that accepts two integers as its argument and compute the value of first number raised to the power of second number.

b. 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.

12. a. 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.

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

13. a. Write an awk script to delete duplicated line from a text file. The order of the original

lines must remain unchanged. b. 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. i. Electrical 34

ii. Mechanical 67 iii. Electrical 80 iv. Computer Science 43 v. Mechanical 65

vi. Civil 198 vii. Computer Science 64

14. Write an awk script to compute gross salary of an employee accordingly to rule given below.

If basic salary is < 10000 then HRA=15% of basic & DA=45% of basic. If basic salary is >=10000 then HRA=20% of basic & DA=50% of basic.


IT AND DIGITAL ELECTRONICS LABORATORY Subject Code: 10MCA18 I.A. Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3

PART - A Exercises on Office Tools 21 Hours Note: Exercises on the following topics to be conducted in the laboratory using any of the very

widely used current software packages Word Processing Preparation of business letters, project proposals, etc. Experimenting with all manipulation facilities like bold facing, Italicizing, Alignment cut and paste, spell checking including headers and footers, etc., Use of Mail-merge facility. Computer Presentation Learning commands, Preparation of slides, inserting texts, graphs, etc., color changing, automatic presentation of slides, changing time settings, object linking and embedding, etc Database Management System Creation of Database -Tables, fields, keys, Basic queries - insert, delete, update, design of data entry forms

PART - B Exercises on Digital Electronics 21 Hours

1. Realization of X-OR and X-NOR operations using basic gates. 2. Design of Half Adder and Full adder using 2-input NAND gates. 3. Verify addition of two binary numbers using 4-bit adder chip. 4. Design and implement Excess-3 to BCD code converter using 4-bit adder chip. 5. Construct and Implement the Boolean expression using AND,OR and NOT gates

(A+B).(C’+D’).(A’+C) = Y 6. Construct and Implement the Boolean expression using only NAND gates

A’BC’D’+A’B’C ’D+A’B’CD+A’BCD’+AB’C’D+AB’CD = Y Note: Students are required to execute one question from Part A and one from Part B



LESSON PLAN

Subject Name : IT and Digital Electronics Laboratory Subject Code : 10MCA18

Total No. of Hours : 42

1. WORD PROCESSING: a) Preparation of Business letters b) Preparation of Project proposals

2. WORD PROCESSING: c) Mail Merge facility

3. WORD PROCESSING: d) Headers and footers

4. WORD PROCESSING: e) Experimenting with all manipulation facilities like bold facing, italicizing, alignment, cut and paste, spell check

5. COMPUTER PRESENTATION: a) Learning commands b) Preparation of slides c) Inserting texts, graphs, etc…….. d)Color changing, Automatic presentation of slides e) Changing time settings, Object linking and embedding etc…

6.

DATABASE MANAGEMENT SYSTEM: Creation of Databases-Tables, Fields & Keys

7. BASIC QUERIES – Insert, delete, update, design of data entry forms

8. Realization of X-OR and X-NOR operations using Basic gates

9. Design Half Adder & Full Adder using NAND gate only.

10. Verify addition of two binary numbers using 4-bit adder chip.

11. Design and implement Excess-3 to BCD code converter using 4 bit Adder chip.

12. Construct and Implement the Boolean expression using AND,OR, and NOT gates (A+B).(C’+D’).(A’+C) = Y

13. Construct and Implement the Boolean expression using NAND gates A ’BC’D’+A’B’C ’D+A’B’CD+A’BCD’+AB’C’D+AB’CD = Y

14. Revision

Hour. No



SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS

II SEMESTER

S.N Subject Code

Title

Teaching Hrs / Week

Examination

Theory Practical Duration Marks

IA Exam Total

1 10MCA21 Business Data Processing with COBOL

04 - 03 50 100 150

2 10MCA22 Object Oriented Programming with C++

04 - 03 50 100 150

3 10MCA23 Data Structures using C 04 - 03 50 100 150

4 10MCA24 Management Information Systems

04 - 03 50 100 150

5 10MCA25 Operations Research 04 - 03 50 100 150

6 10MCA26 COBOL Programming Laboratory

- 03 03 50 50 100

7 10MCA27 Data Structures Using C Laboratory

- 03 03 50 50 100

8 10MCA28 Object Oriented Programming with C++ Laboratory

- 03 03 50 50 100

Total 20 09 400 650 1050


II SEMESTER

BUSINESS DATA PROCESSING WITH COBOL

Subject Code: 10MCA21 IA Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 The Basics 12 Hours An introduction to structured program design in COBOL: The nature of COBOL, A history of COBOL and their ANS versions. The Identification and Environment Divisions: Basic Structure of a COBOL program, coding requirements of the Identification Division, the Sections of the Environment Division, Assigning files to Devices in the Environment Division. The Data division: Forming data-names, the file section of the data division, Types of data, the working-storage section of the data division. Coding complete COBOL programs: The format of the procedure division, Statements typically coded in the main module of batch programs, Statement typically coded in fully interactive programs, Statement typically coded for processing batch files. Designing Structured programs 17 Hours Moving data, Printing information and displaying output interactively: The instruction formats of the MOVE statements, Numeric MOVE, Non-numeric or Alphanumeric numeric MOVE , Other options of the MOVE statements, producing printed output and screen displays, Displaying output interactively using screen input and output, Discussion of an interactive solution to programming assignments. Computing in COBOL: The basic arithmetic verbs, options available with arithmetic verbs, the compute statements, Use of signed numbers in arithmetic operations, intrinsic functions Decision making using the IF and EVALUATE statements: Selection using a simple IF statement, selection using other options of the IF statements, using IF statements to determine leap years, Condition names, EVALUATE statements. Iteration: the simple PERFORM revived, Iteration using other types of PERFORM, Using nested PERFORM VARYING statements, The PERFORM WITH TEST OPTION, Writing High Level COBOL Programs 8 Hours Array processing and Table handling, An introduction to Single level OCCURS CLAUSES, Processing data stored in an array, Using an OCCURS Clauses for table handling use of the Search Statements for Table and array processing. The Search with VARYING option, the SEARCH ALL statements, Multiple-Level OCCURS Clause File Maintenance 12 Hours Sequential file processing: Systems overview of sequential file processing, Sequential file updating-Creating new master file using a previous master file and transaction file, Validity checking in update procedures, Update procedures with multiple transaction records for each master record, The balanced line algorithm for sequential file updating, Sequential File updating-reviewing records on disk, The REWRITE statement for a disk file opened as I-O, Using an activity status field for designing records to be deleted,


The EXTEND option for adding records to the end of a sequential file, File management tips, Matching files for checking purposes, Interactive updating of a sequential file. Sorting and Merging: The SORT Feature an Overview, Processing data before AND/OR after Sorting, the MERGE statement Indexed and relative file processing : Systems consideration for organizing disk files, Features of Magnetic Disks and Disk Drives, Processing Indexed disk Files ,Additional Options for Indexed file processing ,Processing Relative Disks Files, Converting a key filed to a relative key . Advanced Topics 3 Hours Improving program productivity using the COPY, CALL and other statements: COPY statement, CALL statement, Text Manipulation with the STRING and UNSTRING statements. The Report Writer Module: The benefits of report writer module, the report section in the data division, Procedure Division statements. Text Books: 1. Nancy Stern and Robert A Stern: Structured COBOL Programming, 11th Edition, Willey India, 2006. (Chapters: 1 to 4, 6 to 9, 12 to 17) Reference Books: 1. M K Roy and D Ghosh Dastidar: COBOL Programming Including MS COBOL and COBOL- 85, 2nd Edition, Tata McGraw Hill, 2001. 2. Shelly Cashman Foreman: Structural COBOL Programming, 2nd Edition, Cengage Learning. 3. David M. Collopy: Introduction to COBOL, A Guide to Modular Structured Programming, Pearson Education, 2000.



LESSON PLAN

Subject Name: Business Data Processing with COBOL Subject Code: 10MCA21


Hour. No Topics to be covered

01 The Basics: An introduction to structured program design in COBOL. The nature of COBOL, A history of COBOL and their ANS Versions

02 IDENTIFICATION AND ENVIRONMENT DIVISION: Basic structure of COBOL program.

03 Coding requirements of the Identification Division

04 The Sections of Environment Division

05 Assigning files to Devices in the Environment Division.

06 THE DATA DIVISION Forming data names, the file section of the data division,

07 File Description Entries, Label Records

08 Record Contains Clause and Block Contains Clause, Cobol Character Set

09 Types of data, the working storage section of the data division.

10 Rules of working storage section, Editing characters

11 Examples of Working storage section

12 Coding complete COBOL programs The format of procedure division

13 READ and more on PERFORM Statements

14 Statements typically Coded in the main module of batch programs

15 Statements typically coded in fully interactive programs

16 Statements typically coded for processing batch files

17 Designing Structured Programs: moving data, printing information and displaying output interactively: Format of MOVE statements,

18 Numeric Non-Numeric or .Alphanumeric MOVE, other options of MOVE statements.

19 Producing printed output and screen displays

20 Displaying output interactively using screen input and output,

21 Discussion of an interactive solution to programming assignments

22 Computing in COBOL: The basic arithmetic verbs, options available with arithmetic verbs

23 The compute statements, Use of signed numbers in arithmetic operations,

24 Intrinsic functions

25 Decision making using the IF and EVALUATE statements

26 Selection using a simple IF statement

27 Selection using other options of the IF statements,

28 Using IF statements to determine leap years,

29 Condition names, EVALUATE statements.


Hour. No


30 Iteration: the simple PERFORM revived,

31 Iteration using other types of PERFORM,

32 Using nested PERFORM VARYING statements

33 The PERFORM WITH TEST OPTION,

34 Writing High Level COBOL Programs: Array processing and Table handling

35 An introduction to Single level OCCURS CLAUSES

36 Processing data stored in an array

37 Using an OCCURS Clauses for table handling use of the Search Statements for Table and array processing

38 More about table handling

39 The Search with VARYING option

40 The SEARCH ALL statements

41 Multiple-Level OCCURS Clause

42 File Maintenance: Sequential file processing: Systems overview of sequential file processing

43 Sequential file updating-Creating new master file using a previous master file and transaction file,

44 Validity checking in update procedures,

45 Update procedures with multiple transaction records for each master record

46 The balanced line algorithm for sequential file updating, Sequential File updating-reviewing records on disk,

47 The REWRITE statement for a disk file opened as I-O, Using an activity status field for designing records to be deleted

48 The EXTEND option for adding records to the end of a sequential file

49 File management tips, Matching files for checking purposes, Interactive updating of a sequential file.

50 Sorting and Merging: The SORT Feature an Overview

51 Processing data before AND/OR after Sorting, the MERGE statement

52 Indexed and relative file processing : Systems consideration for organizing disk files

53 Features of Magnetic Disks and Disk Drives

54 Processing Indexed disk Files

55 Additional Options for Indexed file processing ,Processing Relative Disks Files

56 Converting a key filed to a relative key

57 Advanced Topics: Improving program productivity using the COPY

58 CALL and other statements: COPY statement, CALL statement

59 Text Manipulation with the STRING and UNSTRING statements.

60 The Report Writer Module

61 The benefits of report writer module

62 The report section in the data division, Procedure Division statements


QUESTION BANK

BUSINESS DATA PROCESSING WITH COBOL-10MCA21

1. Justify the need for COBOL language for business applications.

2. Explain the four divisions of COBOL program with sections.

3. What is the purpose of picture clause? Explain any four editing and four non-editing characters

with suitable examples.

4. Give the syntax of the following verbs with examples

i) MOVE ii) ADD iii) DIVIDE iv) MULTIPLY

v) SUBTRACT

5. Write a COBOL program to compute average class marks scored by students in a subject

considering best of two test marks out of the three test marks.

6. Explain the purpose of REDEFINE and RENAME clauses with an illustration.

7. Explain the difference between nested IF and GOTO-DEPENDING ON clause with necessary

procedure division statements.

8. What are the various types of conditions? Explain any 2 of them in detail.

9. Discuss the following verbs with illustrations

i) PERFORM with UNTIL option.

ii) PERFORM with VARYING option.

10 Discuss the following verbs with syntax and examples

i) SEARCH ii) SET

11. What are Sequential files? Write and explain verbs of COBOL related to processing of these

sequential files as used in procedure division

12. Write a COBOL program to update( insert, delete, search, modify records) an index sequential

file for the following record layout. Employee-Rec EmpNo EmpName EmpDesi EmpSal


OBJECT ORIENTED PROGRAMMING WITH C++ Subject Code: 10MCA22 IA Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 Introduction 6 Hours Overview of C++, Sample C++ program, Different data types, operators, expressions, and statements, arrays and strings, pointers & user-defined types Function Components, argument passing, inline functions, function overloading, recursive functions Classes & Objects 14 Hours Class Specification, Class Objects, Scope resolution operator, Access members, Defining member functions, Data hiding, Constructors, Destructors, Parameterized constructors, Static data members, Functions; Friend functions, Passing objects as arguments, Returning objects, Arrays of objects, Dynamic objects, Pointers to objects, Copy constructors, Generic functions and classes, Applications Operator overloading using friend functions such as +, - , pre-increment, post-increment, [ ] etc., overloading <<, >>. Inheritance 12 Hours Base Class, Inheritance and protected members, Protected base class inheritance, Inheriting multiple base classes; Constructors, Destructors and Inheritance, Passing parameters to base class constructors, Granting access, Virtual base classes Virtual functions, Polymorphism 7 Hours 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 and late binding. I/O System Basics, File I/0 6 Hours C++ stream classes, Formatted I/O, I/O manipulators, fstream and the File classes, File operations Exception Handling, STL 7 Hours Exception handling fundamentals, Exception handling options STL: An overview, containers, vectors, lists, maps. Text Books: 1. Herbert Schildt: The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2003. Reference Books: 1. Stanley B.Lippmann, Josee Lajore: C++ Primer, 4th Edition, Pearson Education, 2005. 2. Paul J Deitel, Harvey M Deitel: C++ for Programmers, Pearson Education, 2009. 3. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++, Tata McGraw Hill, 1999.



LESSON PLAN

Subject Name: Object Oriented Programming with C++ Subject Code: 10MCA22


Hour No Topic to be Covered

1. INTRODUCTION

1 Overview of C++, Sample C++ Program

2 Different Data Types, Operators,

3 Expressions & Statements, Arrays and Strings

4 Function Components, Argument Passing

5 Inline function

6 Function overloading

7 Recursive functions

8 Recursive functions

2. CLASSES & OBJECTS

9 Class specification, class objects

10 Scope resolution operator, Access members

11 Defining member functions, Data Hiding

12 Constructors, Destructors, Parameterized Constructors

13 Static Data Members, Functions

14 Friend Functions, Passing objects as arguments, Returning objects

15 Array of Objects

16 Copy Constructors

17 Generic functions and classes, Applications

18 Operator Overloading using friend functions such as +,-

19 Operator Overloading using friend functions such as +,-

20 Pre-increment

21 Post increment,[ ] etc

22 Overloading <<, >>

23 Overloading <<, >>

3. INHERITANCE

24 Base Class

25 Base Class

26 Inheritance and protected members

27 Inheritance and protected members

28 Protected Base class inheritance

29 Protected Base class inheritance



30 Inheriting multiple base classes

31 Constructors

32 Destructors and Inheritance

33 Passing parameters to base class constructors

34 Granting Access

35 Granting Access

36 Virtual Base Class

37 Virtual Base Class

4. VIRTUAL FUNCTIONS, POLYMORPHISM

38 Virtual Function

39 Virtual Function

40 Calling a Virtual function through a base class reference

41 Virtual attribute is inherited

42 Virtual functions are hierarchical

43 Pure virtual function

44 Abstract classes

45 Using virtual functions

46 Early and late Binding

5. I/O SYSTEM BASICS, FILE I/O

47 C++ Stream classes

48 Formatted I/O

49 I/O Manipulators

50 I/O Manipulators

51 Fstream and file classes

52 Fstream and file classes

53 File Operations

54 File Operations

6. EXCEPTIONS HANDLING, STL

55 Exception Handling fundamentals

56 Exception Handling options

57 STL: An Overview

58 Containers

59 Containers

60 Vectors

61 Vectors

62 Lists, maps


QUESTION BANK

OBJECT ORIENTED PROGRAMMING WITH C++-10MCA22

1. What is a constructor? Explain different types of Constructors with examples.

2. What is inheritance? Explain different types of inheritance with examples

3. What are friend classes? Explain with example.

4. Write a C++ program to sort the list of students depending on their roll Numbers

5. What is operator overloading? Write a C++ program to compare two data

values representing distances in feet and inches using operator overloading

6. Is overloading of constructors and destructors possible? Justify your answer?

7. What are virtual functions? Explain the mechanism of virtual functions.

8. Write a C++ program using function templates for accepting integer

and floating values to perform stack operation.

9. Write a C++ Program to generate Employee pay slip using copy constructors

10. Write a short notes on i) Data Hiding ii) Static data members iii) Dynamic Binding v)

Friend function

11. Explain operator overloading using friend function concept with overload(<<) operator with

example.

12. What are inline functions?

13. Explain binary search tree in detail

14. Explain postfix and infix with example

15. Write a program for binary search using C++.


DATA STRUCTURES USING C Subject Code: 10MCA23 I.A Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 BASIC CONCEPTS 8 Hours Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction, Performance Analysis, Performance Measurement ARRAYS and STRUCTURES 6 Hours Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, Representation of Multidimensional Arrays STACKS AND QUEUES 6 Hours Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation of Expressions, Multiple Stacks and Queues. LINKED LISTS 6 Hours Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials, Additional List operations, Sparse Matrices, Doubly Linked Lists TREES, Graphs 12 Hours Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps. Binary Search Trees, Selection Trees, Forests, Representation of Disjoint Sets, Counting Binary Trees, The Graph Abstract Data Type. PRIORITY QUEUES 6 Hours Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps, Pairing Heaps. EFFICIENT BINARY SEARCH TREES 8 Hours Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees. Text Book: 1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition, Universities Press, 2007.(Chapters 1, 2.1 to 2.6, 3, 4, 5.1 to 5.3, 5.5 to 5.11, 6.1, 9.1 to 9.5, 10) Reference Books: 1. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition, Pearson Education, 2003. 2. Debasis Samanta: Classic Data Structures, 2nd Edition, PHI, 2009. 3. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach with C, Cengage Learning, 2005. 4. Robert Kruse & Bruce Leung: Data Structures & Program Design in C, Pearson Education, 2007.



LESSON PLAN

Subject Name: Data Structures Using ‘C’ Subject Code: 10MCA23



1.BASIC CONCEPTS

1 Pointers

2 Dynamic Memory Allocations

3 Algorithm Specification

4 Data Abstraction

5 Data Abstraction

6 Performance Analysis

7 Performance Measurement

8 Performance Measurement

2. ARRAYS AND STRUCTURES

9 Arrays

10 Dynamically Allocated Arrays

11 Structure and Unions

12 Polynomials

13 Sparse Matrices

14 Representation of Multidimensional Arrays

3.STACKS AND QUEUES

15 Stacks

16 Stacks using Dynamic Arrays

17 Queues

18 Circular Queues Using Dynamic Arrays

19 Evaluation of Expressions


21 Multiple Stacks and Queues


4.LINKED LISTS

23 Singly Linked Lists and Chains

24 Representing Chain in C

25 Linked Stacks and Queues

26 Polynomials

27 Additional List Operations, Sparse Matrices

28 Additional List Operations, Sparse Matrices

29 Doubly Linked List

30 Doubly Linked List



5 TREES, GRAPHS

31 Introduction

32 Binary Trees

33 Binary Trees

34 Binary Tree Traversals

35 Binary Tree Traversals

36 Thread Binary Trees, Heaps

37 Binary Search Trees

38 Selection Trees

39 Forests

40 Representation of Disjoint Sets

41 Counting Binary Trees

42 Counting Binary Trees

43 The Graph Abstract Data Type

44 The Graph Abstract Data Type

6. PRIORITY QUEUES

45 Single and Double-Ended Priority Queues

46 Single and Double-Ended Priority Queues

47 Leftist Trees

48 Binomial Heaps

49 Binomial Heaps

50 Fibonacci Heaps

51 Pairing Heaps

52 Pairing Heaps

7. EFFICIENT BINARY SEARCH TREES

53 Optimal Binary Search Trees



56 AVL Trees

57 AVL Trees

58 Red Black Trees

59 Red Black Trees

60 Red Black Trees

61 Splay Trees

62 Splay Trees


QUESTION BANK

DATA STRUCTURES USING C-10MCA23

1. How arrays are organized in the memory? Explain how the elements are addressed in arrays

with examples

2. Write recursive function in C to perform binary search. Trace the function for the given

input[2,5,7,12,23,28,35,36,44,50] and to search 44

3. Explain the overheads involved in recursive algorithms

4. Write an algorithm to convert a valid infix expression to postfix expression

5. For a queue implemented on linked list write algorithms to insert a node and delete a node.

6. write an algorithm to search a node in a linked list, if found delete the node from the list

7. What are the drawbacks in arrays those are eliminated by linked lists

8. With diagrams explain binary tree, binary search tree, complete binary tree

9. Write an algorithm to insert an element into a binary search tree

10. Discuss the different types of queues

11. Explain the significance of header node in a linked list

12. What is hashing function ? Discuss any three hashing functions.

13. Discuss the scope of variables .

14. Compare iteration verses recursion

15. Write an algorithm to insert an element into a binary search tree


MANAGEMENT INFORMATION SYSTEM

Subject Code: 10MCA24 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 Systems Engineering 4 Hours System concepts, system control, types of systems, handling system complexity, Classes of systems, General model of MIS, Need for system analysis, System analysis for existing system & new requirement, system development model, MIS & system analysis Information and Knowledge 4 Hours Information concepts, classification of information, methods of data and information collection, value of information, information: A quality product, General model of a human as information processor, Knowledge. Introduction of MIS 4 Hours MIS: Concept, Definition, Role of the MIS, Impact of MIS, MIS and the user, Management as a control system, MIS support to the management, Management effectiveness and MIS, Organization as system. MIS: organization effectiveness Strategic Management of Business 3 Hours Concept of corporate planning, Essentiality of strategic planning, Development of the business strategies, Type of strategies, short-range planning, tools of planning, MIS: strategic business planning Development of MIS 4 Hours Development of long range plans of the MIS, Ascertaining the class of information, Determining the information requirement, Development and implementation of the MIS, Management of information quality in the MIS, Organization for development of MIS, MIS development process model Developing Business/IT Strategies/IT Solutions 5 Hours Planning fundamentals (real world cases), Organizational planning, planning for competitive advantage,(SWOT Analysis), Business models and planning. Business/IT planning, identifying business/IT strategies, Implementation Challenges, Change management., Developing business systems, (real world case), SDLC, prototyping, System development process, implementing business system Business Process Re-Engineering 2 Hours Introduction, Business process, process model of the organization, value stream model of the organization, what delay the business process, relevance of information technology, MIS and BPR Technology of Information System 4 Hours Introduction, Data processing, Transaction processing, Application processing, information system processing, TQM of information systems, Human factors & user interface, Strategic nature of IT decision, MIS choice of information technology


Decision Making and DSS 3 Hours Decision making concepts; decision making process, decision-making by analytical modeling, Behavioral concepts in decision making, organizational decision-making, Decision structure, DSS components, Management reporting alternatives. Data resource Management 3 Hours Managing data sources, Foundation concepts of data, types of databases, traditional file processing, DBMS approach, Database structure, Database development Electronic Business systems 4 Hours Enterprise business system – Introduction, cross-functional enterprise applications, real world case, Functional business system, - Introduction, marketing systems, sales force automation, CIM, HRM, online accounting system, Customer relationship management, ERP, Supply chain management (real world cases for the above) Enterprise Business Systems 6 Hours Electronic commerce fundamentals, e-Commerce applications and Issues, (real world cases) Client Sever Architecture and E-business Technology 6 Hours Client server architecture, implementation strategies, Introduction to E-business, model of E-business, internet and World Wide Web, Intranet/Extranet, Electronic, Impact of Web on Strategic management, Web enabled business management, MIS in Web environment. Text Books: 1. Waman S Jhawadekar: Management Information System, 3rd Edition, Tata McGraw Hill. (Chapters: 1, 3, 5, 6, 7,8,10, 11, 16.1 to 16.7, 16.10 to 16.12, 18.7, 18.8, 20)

2. James A O‟Brien and George M Marakas: Management Information System, 7th Edition, Tata McGraw Hill, 2006. (Chapters: 1, 5, 7, 8, 9, 10, 11) Reference Books: 1. Ralph M Stair and George W Reynolds: Principles of Information Systems, 7th Edition, Cengage Learning, 2010. 2. Steven Alter: Information Systems - The Foundation of E-Business, 4th Edition, Pearson Education, 2001. 3. Mahadeo Jaiswal and Monika Mital: Management Information System, Oxford University Press. 4. Effy Oz: Management Information Systems, 5th Edition, Cengage Learning, 2006.



LESSON PLAN

Subject Name: Management Information Systems Subject Code: 10MCA24


Hour. No


Systems Engineering 1. System Concepts, System Control 2. Types of Systems, Handling System Complexity, Classes of system 3. General Model of MIS, Need for System Analysis 4. System Analysis for existing system & new requirement

5. System development model, MIS & system analysis

Information and Knowledge 6. Information Concepts, Classification of the Information 7. Methods of Data and Information Collection, 8. Value of the Information 9. Information: A Quality Product 10. General Model of Human as an Information Processor, Knowledge

Introduction to MIS 11. MIS: Concept, Definition, Role of MIS 12. Impact of MIS, MIS and the user 13. Management as a Control System, 14. MIS: A support to the Management, Management Effectiveness and MIS 15. Organization as a system, MIS: Organization effectiveness

Strategic Management of Business 16. The Concept of corporate planning, Essentiality of strategic planning 17. Development of Business Strategies, 18. Type of Strategies, Short-range planning, 19. Tools of Planning, MIS: Strategic Business Planning

Development of MIS 20. Development of Long Range Plans of the MIS, Ascertaining the Class of Information 21. Determining the Information Requirement, Development and Implementation of the

MIS 22. Management of information Quality in the MIS, 23. Organization for Development of the MIS 24. MIS development process model

Developing Business/IT Strategies/IT Solutions 25. Planning fundamentals(real world cases), Organizational planning, Planning for

competitive advantage 26. (SWOT Analysis), Business models and planning 27. Business/IT planning, Identifying business/IT strategies 28. Implementation Challenges, Change Management, Developing business systems 29. (real world case), SDLC, Prototyping,

30. System development process, implementing business system. Business Process Re-engineering

31. Introduction, Business Process, Process Model of the Organization,


32. Value Stream Model of the Organization, What delay the business process, 33. relevance of information technology, MIS and BPR

Technology of Information Systems

34. Introduction, Data Processing, Transaction Processing

35. Application Processing, Information System Processing

36. TQM of Information Systems, Human Factors and User Interface

37. Strategic nature of IT decision, MIS choice of information technology

Decision Making and DSS

38. Decision Making Concepts, decision making process,

39. Decision-making by analytical modeling

40. Behavioral Concepts in Decision Making, Organizational Decision Making

41. Decision structure, DSS components, Management reporting alternatives.

Data resource Management

42. Managing data sources, Foundation Concepts of data

43. types of databases, Traditional file processing

44. DBMS approach, Database structure, Database development

Electronic Business systems

45. Enterprise business system – Introduction, cross – functional enterprise applications

46. real world case, Functional business system, - Introduction, marketing systems

47. sales force automation, CIM, HRM,

48. Online accounting system, Customer relationship management,

49. ERP, Supply chain management (real world cases for the above)

Enterprise Business Systems 50. Electronic commerce fundamentals

51. Electronic commerce fundamentals

52. E-Commerce applications and Issues

53. E-Commerce applications and Issues

54. real world cases

55. real world cases

Client Server Architecture and E-Business Technology 56. Client Server Architecture,

57. Implementation Strategies

58. Introduction to E-Business, model of E-business

59. Internet and World Wide Web, Intranet/Extranet, Electronic

60. Impact of Web on Strategic Management

61. Web enabled Business management

62. MIS in Web environment


QUESTION BANK

MANAGEMENT INFORMATION SYSTEM-10MCA24

1. Define MIS. Explain the role of MIS.

2. Explain the organization as a system.

3. Discuss management as a control system.

4. What are different types of strategies? Explain with suitable examples

5. Explain various dimensions of the corporate business plan

6. List the features contributing to success & failures of MIS

7. Compare life cycle approaches in development of MIS

8. Explain the various attributes of information

9. Explain the general model of a human as an information processor

10. What are decision support systems (DSS)? Explain their main features

11. Explain the term CRM. How CRM systems benefit an organization?

12. Explain the different phases of CRM

13. What are the benefits and challenges of CRM systems?

14. What are the causes for ERP failures?

15. Compare prototype & life cycle approaches in development of MIS

16. What is SWOT analysis?

17. Explain SDLC in detail

18. Explain in detail the System Development process

19. Explain the term application processing with suitable examples

20. Distinguish between MIS and BPR.


OPERATIONS RESEARCH

Subject Code: 10MCA25 I.A. Marks: 50 Hours/Week: 4 Exam Marks: 100 Total Hours: 52 Exam Hours: 3 Introduction and Overview of the OR Modeling Approach 3 Hours The origin of OR, the nature of OR, the impact of OR, defining the problem and gathering data, Formulating a mathematical model, deriving solutions from the model, testing the model, preparing to apply the model, implementation . Introduction to Linear Programming 6 Hours Formulation of linear programming problem (LPP), examples, Graphical solution, the LP Model, Special cases of Graphical method, assumptions of Linear Programming (LP), additional example Solving LPP - the Simplex Method 12 Hours The essence of the simplex method, setting up the simplex method, algebra of the simplex method, the simplex method in tabular form, special cases in the simplex method, tie breaking in the simplex method, adopting to other model forms (Two Phase method, Big-M method), post optimality analysis. Theory of the Simplex Method 4 Hours Foundation of the simplex method, the revised simplex method, a fundamental insight Duality Theory and Sensitivity Analysis 9 Hours The essence of duality theory, economic interpretation of duality, primal dual relationship, adapting to other primal forms, the role of duality in sensitive analysis, the dual simplex method Transportation and Assignment Problems 6 Hours The transportation problem, a stream line simplex method for the transportation problem, the assignment problem, a special algorithm for the assignment problem Metaheuristics 6 Hours The nature of Metaheuristics, Tabu Search, Simulated Annealing, Generating Algorithms Game Theory 6 Hours The formulation of two persons, zero sum games, solving simple games- a prototype example, games with mixed strategies, graphical solution procedure, solving by linear programming, extensions Text Books: 1. Frederick S.Hillier & Gerald J.Lieberman: Introduction to Operations Research: Concepts and Cases, 8th Edition, Tata McGraw Hill, 2006. (Chapters 1.1, 1.2, 1.3, 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 3.2, 3.3, 3.4, 4.1, 4.2, 4.3, 4.4, 4.5, 4.6, 4.7, 5.1, 5.2, 5.3, 6.1, 6.2, 6.3,6.4, 6.5, 6.6, 6.7, 7.1, 8.1, 8.2, 8.3, 8.4, 13.1, 13.2, 13.3, 13.4, 14.1, 14.2, 14.3, 14.4, 14.5, 14.6) Reference Books: 1. Wayne L. Winston: Operations Research Applications and Algorithms, 4th Edition, Cengage Learning, 2003. 2. Hamdy A Taha: Operations Research - An Introduction, 8th Edition, Pearson Education, 2007. 3. Richard Bronson and Govindasami Naadimuthu: Theory and Problems of Operations

Research, Schaum‟s Outline Series, 2nd Edition, Tata McGraw Hill, 1997.



LESSON PLAN

Subject Name: Operations Research Subject Code: 10MCA25


Hour. Topic to be covered No

01. The origin, nature & impact of OR

02. Defining the problem & gathering data

03. Formulating the problem & deriving solutions

04. Testing, preparing & implementing the model

05. Formulating a LPP

06. LPP examples

07. Graphical solution of the LP model

08. Special cases of the graphical method

09. Special cases of the graphical method

10. Assumptions of linear programming

11. Additional examples

12. Additional examples

13. The essence of the Simplex method

14. Algebra of the Simplex method

15. Setting up the Simplex method

16. The Simplex method in tabular form

17. The Simplex method in tabular form

18. The Simplex method problems

19. Tie breaking in the Simplex method

20. Adapting to other model forms

21. The Two Phase method Definition

22. The Two Phase method problem

23. The Two Phase method problem

24. The Big-M method Definition

25. The Big-M method - problem

26. The Big-M method - problem

27. Post-optimality analysis

28. Post-optimality analysis – example


29. Foundations of the Simplex method

30. The Revised Simplex method Introduction

31. The Revised Simplex method problem

32. The Revised Simplex method problem

33. A fundamental insight

34. The essence of Duality theory

35. Economic interpretation of duality

36. Economic interpretation of duality - example

37. The primal-dual relationships

38. Adapting to other primal forms

39. Adapting to other primal forms

40. The role of duality in sensitivity analysis

41. The role of duality in sensitivity analysis - example

42. The dual simplex method

43. The dual simplex method – example

44. The transportation problem (TP)

45. The transportation problem (TP) - example

46. A streamlined simplex method for the TP

47. A streamlined simplex method for the TP – problem

48. A streamlined simplex method for the TP – problem

49. The assignment problem

50. A special algorithm for the assignment problem

51. The nature of metaheuristics

52. Tabu search

53. Tabu search - example

54. Simulated annealing

55. Simulated annealing - example

56. Genetic algorithms

57. The formulation of two person zero-sum games

58. Solving simple games – a prototype example

59. Games with mixed strategies

60. Graphical solution procedure

61. Solving by linear programming

62. Extensions


QUESTION BANK

OPERATIONS RESEARCH-10MCA25

1. a) Define OR? Explain a formulating mathematical model with an example b) An oil company had 2 units A and B which produce 3 different grades of oil. Superfine, medium and low grade oil. The company has to supply 12, 8, 24 barrels of superfine, medium and low grade oils respectively per week. It costs the company Rs. 1,000 and Rs. 800 per day to run the units A and B respectively. On a day unit A produces 6, 2 and 4 barrels and the unit B produces 2,2 and 12 barrels of superfine, medium land low grade oil per day. The manager has to decide on how many days per unit be operated in order to meet the requirement at minimum cost. Formulate the L.P.P and solve it graphically.

2. a) Define (i) unbounded solution (ii) basic feasible solution (iii) multiple solution (iv) no solution

b) Solve the following LPP using simple techniques Max Z=3x1+2x2+5x3

Subject to x1 + 2x2 +x3 <= 430 3x1 + 2x3 <= 460 x1 + 4x2 <= 420 x1, x 2, x3 >=0

3. a) Explain (i) Stack (ii) Surplus variable solution (iii) Augmented solutions (iv) Non- basic variable and basic variable

While formulating standard LPP b) Solve the following LPP using Big M method Max Z=3x1+2x2+3x3

Subject to 2x1 + x2 +x3 <= 2 3x1 + 4x2 + 2x3 >=8 x1, x 2, x3 >=0


4. a) Solve the following LPP using revised simple method

Max Z=5x1+8x2+7x3+4x4+6x5 Subject to 2x1 + 3x2 +3x3+2x4 +2x5<= 20 3x1 + 5x2 +4x3+2x4 +4x5<= 30 & xj >=0 j= 1,2,3,4,5 b) What is sensitivity analysis? And state its advantage 5. a) Explain primal –dual relationship with an example b) Using dual-simple method solve Max Z= -2x1-x3 Subject to x1 + x2 -x3 >=5 x1 -2x2 +4x3 >=8 x1, x 2, x3 >=0 6. a) Solve the following transportation problem and find the optimal solution Destination A B C D Availability Source Requirements -> 6 10 12 15 b) a firm plans to begin production of 4 new products on its 4 plants. The unit cost of producing i at plant j is as given below. Find the assignment that minimizes the total cost of production per unit. Plants 1 2 3 4 A Products

B C D

21 16 25 13 11

17 18 14 23 13

32 27 18 41 19

15 11 13 15

17 12 12 13

14 15 10 14

16 \13 11 17


7. a) Explain simulated annealing

b) Explain genetic algorithm with an example c) Explain the nature of metaheuristics with an example 8. a) Define

(i) Saddle point (ii) Zero-sum game (iii) Mixed strategy

b) Solve the following game by linear programming B1 B2 B3 A1 A2 A3 c) Solve by graphical method to determine optimal strategy for player A in the game defined by the following table Player B Player A

B1 B2 B3

A1 2 -3 -4

A2 -6 -1 1


COBOL PROGRAMMING LABORATORY

Subject Code: 10MCA26 I.A Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3 1. Write a program for the following:

a. Evaluate the following equation using COMPUTE verb. Z=(A – B) * C

b. To Find the sum of individual digits in the given „n‟ digit decimal number. 2. Write a program for the following:

a. Generating odd and even numbers between the given limits by using PERFORM statement. b. Sorting numeric numbers.

3. Write a program to search a record in the file without using SEARCH verb. 4. By using table handling concepts, write a program for

a. Sorting alphanumeric data. b. Searching a numeric number using SEARCH verb.

5. By using table handling concepts, write a program for matrix addition and matrix subtraction. 6. By using table handling concepts, write a program for matrix multiplication. 7. Write a program for the following:

a. To sort records in the file using SORT verb. b. To merge files using MERGE verb.

8. Write a program to read employee file as sequential file and calculate Gross Pay and Net Pay for employees in the organization. 9. Write a program to store student’s details with results in a file with sequential file handling techniques. 10. Using the index file organization, write a program

a. To store employee details. b. To delete a record in the index file. c. To search a record in the index file.

11. Using the index file organization, write a program to update the employee salary (increase DA of 3%). 12. Write a program to calculate Net Pay and Gross Pay by reading relative file containing fields Emp_no, Emp_name, Basic_ pay. Store the output in relative file. 13. Write a program to find simple interest and compound interest using subroutine concept. 14. Write a program to generate a sales report. Note: In the examination each student picks one question from a lot of all the 15 questions.



LESSON PLAN

Subject Name: Cobol Programming Laboratory Subject Code: 10MCA26


Hour. Topic to be covered No

1. Write a program for the following: a. Evaluate the following equation using COMPUTE verb. Z=(A – B) * C

b. To Find the sum of individual digits in the given „n‟ digit decimal number. 2. Write a program for the following:

a. Generating odd and even numbers between the given limits by using PERFORM statement. b. Sorting numeric numbers.

3. Write a program to search a record in the file without using SEARCH verb.

4. By using table handling concepts, write a program for a. Sorting alphanumeric data. b. Searching a numeric number using SEARCH verb.

5. By using table handling concepts, write a program for matrix addition and matrix subtraction.

6. By using table handling concepts, write a program for matrix multiplication.

7. Write a program for the following: a. To sort records in the file using SORT verb. b. To merge files using MERGE verb.

8. Write a program to read employee file as sequential file and calculate Gross Pay and Net Pay for employees in the organization. 9. Write a program to store student’s details with results in a file with sequential file handling techniques. 10. Using the index file organization, write a program

a. To store employee details. b. To delete a record in the index file. c. To search a record in the index file.

11. Using the index file organization, write a program to update the employee salary (increase DA of 3%).

12. Write a program to calculate Net Pay and Gross Pay by reading relative file containing fields Emp_no, Emp_name, Basic_ pay. Store the output in relative file.

13. Write a program to find simple interest and compound interest using subroutine concept.

14. Write a program to generate a sales report. Note: In the examination each student picks one question from a lot of all the 15 questions.


DATA STRUCTURES USING C LABORATORY

Subject Code: 10MCA27 I.A Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3 1. Write a C Program to construct a stack of integers and to perform the following operations on it:

a. Push b. Pop c. Display

The program should print appropriate messages for stack overflow, stack underflow, and stack empty. 2. Write a C Program to convert and print a given valid parenthesized infix arithmetic expression to postfix expression. The expression consists of single character operands and the binary operators + (plus), - (minus), * (multiply) and / (divide). 3. Write a C Program to evaluate a valid suffix/postfix expression using stack. Assume that the suffix/postfix expression is read as a single line consisting of non-negative single digit operands and binary arithmetic operators. The arithmetic operators are + (add), - (subtract), * (multiply) and / (divide). 4. Write a C program using recursive function for the following:

a. To calculate GCD and LCM of 2 integer numbers. b. To solve Towers of Hanoi problem. c. To search an element in a list using binary search

5. Write a C Program to simulate the working of a queue of integers using an array. Provide the following operations:

a. Insert b. Delete c. Display

6. Write a C Program to simulate the working of a circular queue of integers using an array. Provide the following operations:


7. Write a program to design a priority queue which is maintained as a set of queues (assume a maximum of 3 queues). The elements are inserted based upon the given priority. The deletion of an element is to be done starting from the 1st queue, if it is not empty. If it is empty, the elements from the 2nd queue will be deleted and so on. 8. Write a C Program using dynamic variables and pointers, to construct a singly linked list consisting of the following information in each node: student id (integer), student name (character string) and semester (integer). The operations to be supported are: a. The insertion operation i. At the front of a list ii. At the back of the list iii. At any position in the list


b. Deleting a node based on student id. If the specified node is not present in the list an error message should be displayed. Both the options should be demonstrated. c. Searching a node based on student id and update the information content. If the specified node is not present in the list an error message should be displayed. Both situations should be displayed. d. Displaying all the nodes in the list. (Note: Only either (a, b and d) or (a, c and d) may be asked in the examination) 9. Write a C Program using dynamic variables and pointers, to construct an ordered (ascending) singly linked list based on the rank of the student, where each node consists of the following information : student id (integer), student name (character string) and rank (integer). 10. Write a C Program using dynamic variables and pointers to construct a stack of integers using singly linked list and to perform the following operations: a. Push b. Pop c. Display The program should print appropriate messages for stack overflow and stack empty. 11. Write a C Program to support the following operations on a doubly linked list where each node consists of integers: a. Create a doubly linked list by adding each node at the front. b. Insert a new node to the left of the node whose key value is read as an input. c. Delete the node of a given data, if it is found, otherwise display appropriate message. d. Display the contents of the list. (Note: Only either (a, b and d) or (a, c and d) may be asked in the examination) 12. Write a C Program a. To construct a binary search tree of integers. b. To traverse the tree using all the methods i.e., inorder, preorder and postorder. c. To display the elements in the tree. 13. Write a C Programs for searching an element on a given list of integers using the a. Binary Search. b. Linear search 14. Write a C program to sort a list of N integers using the quick sort algorithm. 15. Write a C program to traverse the nodes in a graph using Breadth First Search. Note: In the examination each student picks one question from a lot of all the 15 questions.



LESSON PLAN

Subject Name: Data Structures Using C Laboratory Subject Code: 10MCA27


Hour. Topic to be covered No.

1. Write a C Program to construct a stack of integers and to perform the following operations on it:

a. Push b. Pop c. Display

The program should print appropriate messages for stack overflow, stack underflow, and stack empty. 2. Write a C Program to convert and print a given valid parenthesized infix arithmetic expression to postfix expression. The expression consists of single character operands and the binary operators + (plus), - (minus), * (multiply) and / (divide). 3. Write a C Program to evaluate a valid suffix/postfix expression using stack. Assume that the suffix/postfix expression is read as a single line consisting of non-negative single digit operands and binary arithmetic operators. The arithmetic operators are + (add), - (subtract), * (multiply) and / (divide). 4. Write a C program using recursive function for the following:

a. To calculate GCD and LCM of 2 integer numbers. b. To solve Towers of Hanoi problem. c. To search an element in a list using binary search

5. Write a C Program to simulate the working of a queue of integers using an array. Provide the following operations:


6. Write a C Program to simulate the working of a circular queue of integers using an array. Provide the following operations:


7. Write a program to design a priority queue which is maintained as a set of queues (assume a maximum of 3 queues). The elements are inserted based upon the given priority. The deletion of an element is to be done starting from the 1st queue, if it is not empty. If it is empty, the elements from the 2nd queue will be deleted and so on. 8. Write a C Program using dynamic variables and pointers, to construct a singly linked list consisting of the following information in each node: student id (integer), student name (character string) and semester (integer). The operations to be supported are:


a. The insertion operation i. At the front of a list ii. At the back of the list iii. At any position in the list b. Deleting a node based on student id. If the specified node is not present in the list an error message should be displayed. Both the options should be demonstrated. c. Searching a node based on student id and update the information content. If the specified node is not present in the list an error message should be displayed. Both situations should be displayed. d. Displaying all the nodes in the list. (Note: Only either (a, b and d) or (a, c and d) may be asked in the examination) 9. Write a C Program using dynamic variables and pointers, to construct an ordered (ascending) singly linked list based on the rank of the student, where each node consists of the following information : student id (integer), student name (character string) and rank (integer). 10. Write a C Program using dynamic variables and pointers to construct a stack of integers using singly linked list and to perform the following operations: a. Push b. Pop c. Display The program should print appropriate messages for stack overflow and stack empty. 11. Write a C Program to support the following operations on a doubly linked list where each node consists of integers: a. Create a doubly linked list by adding each node at the front. b. Insert a new node to the left of the node whose key value is read as an input. c. Delete the node of a given data, if it is found, otherwise display appropriate message. d. Display the contents of the list. (Note: Only either (a, b and d) or (a, c and d) may be asked in the examination) 12. Write a C Program a. To construct a binary search tree of integers. b. To traverse the tree using all the methods i.e., inorder, preorder and postorder. c. To display the elements in the tree. 13. Write a C Programs for searching an element on a given list of integers using the a. Binary Search. b. Linear search 14. Write a C program to sort a list of N integers using the quick sort algorithm. 15. Write a C program to traverse the nodes in a graph using Breadth First Search. Note: In the examination each student picks one question from a lot of all the 15 questions.


OBJECT ORIENTED PROGRAMMING WITH C++ LABORATORY

Subject Code: 10MCA28 I.A Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours : 42 Exam Hours: 3 1. Given that an EMPLOYEE class contains the following members: a. Data Members: Employee_Number, Employee_Name, Basic, DA, IT, Net_Sal b. Member Functions: to read data, to calculate Net_Sal and to print data members

Write a C++ program to read data on N employees and compute the Net_Sal of each employee (DA = 52% of Basic and Income Tax = 30% of the gross salary) 2. 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. 3. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number:

a. ADD(a, s2) – where „a‟ is an integer (real part) and s2 is a complex number b. ADD(s1, s2) – where s1 and s2 are complex numbers 4. Write a C++ program to create a class called LIST (linked list) with member functions to insert an element at the front as well as to delete an element from the front of the list. Demonstrate all the functions after creating a list object. 5. Write a C++ program to create a template function for Quicksort and demonstrate sorting of integers and doubles. 6. Write a C++ program to create a class called STACK using an array of integers. Implement the

following operations by overloading the operators „+‟ and „-„: a. 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 b. 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. 7. Write a C++ program to create a class called DATE. Accept two valid dates in the form

dd/mm/yy. Implement the following operations by overloading the operators „+‟ and „-„. After every operation display the results by overloading the operator <<. a. no_of_days = d1 – d2; where d1 and d2 are DATE objects, and no_of_days is an integer b. d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer 8. 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.


9. Write a C++ program to create a class called OCTAL which has the characteristics of an octal number. Implement the following operations by writing an appropriate constructor and an overloaded operator +. a. OCTAL h = x; where x is an integer. b. int y = h + k; where h is an OCTAL object and k is an integer Display the OCTAL result by overloading the operator << . Also display the values of h and y. 10. Write a C++ program to create a class 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. 11. Write a C++ program to create a class called DLIST (doubly Linked List) with member functions to insert a node at a specified position and delete a node from a specified position of the list. Demonstrate the operations by displaying the content of the list after every operation. 12. 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. Find the semester-wise average age for all UG and PG students separately. 13. Write a C++ program to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator <<. a. STRING s1 = “VTU” b. STRING s2 = “BELGAUM” c. STRING s3 = s1 + s2 (Use copy constructor) 14. Write a C++ program to create a class called BIN_TREE (Binary Tree) with member functions to perform in-order, preorder and post-order traversals. Create a BIN_TREE object and demonstrate the traversals. 15. Write a C++ program to create a class called EXPRESSION. Using appropriate member functions convert a given valid Infix expression into postfix form. Display the infix and postfix expressions. Note: In the examination each student picks one question from a lot of all the 15 questions.



LESSON PLAN

Subject Name: Object Oriented Programming With C++ Laboratory Subject Code: 10MCA28


Hour. Topic to be covered No.

1. Given that an EMPLOYEE class contains the following members: a. Data Members: Employee_Number, Employee_Name, Basic, DA, IT, Net_Sal b. Member Functions: to read data, to calculate Net_Sal and to print data members

Write a C++ program to read data on N employees and compute the Net_Sal of each employee (DA = 52% of Basic and Income Tax = 30% of the gross salary) 2. 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. 3. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number:

a. ADD(a, s2) – where „a‟ is an integer (real part) and s2 is a complex number b. ADD(s1, s2) – where s1 and s2 are complex numbers 4. Write a C++ program to create a class called LIST (linked list) with member functions to insert an element at the front as well as to delete an element from the front of the list. Demonstrate all the functions after creating a list object. 5. Write a C++ program to create a template function for Quicksort and demonstrate sorting of integers and doubles. 6. Write a C++ program to create a class called STACK using an array of integers. Implement the

following operations by overloading the operators „+‟ and „-„: a. 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 b. 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. 7. Write a C++ program to create a class called DATE. Accept two valid dates in the form

dd/mm/yy. Implement the following operations by overloading the operators „+‟ and „-„. After every operation display the results by overloading the operator <<. a. no_of_days = d1 – d2; where d1 and d2 are DATE objects, and no_of_days is an integer b. d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer 8. 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. 9. Write a C++ program to create a class called OCTAL which has the characteristics of an octal number. Implement the following operations by writing an appropriate constructor and an overloaded operator +. a. OCTAL h = x; where x is an integer. b. int y = h + k; where h is an OCTAL object and k is an integer Display the OCTAL result by overloading the operator << . Also display the values of h and y. 10. Write a C++ program to create a class 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. 11. Write a C++ program to create a class called DLIST (doubly Linked List) with member functions to insert a node at a specified position and delete a node from a specified position of the list. Demonstrate the operations by displaying the content of the list after every operation. 12. 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. Find the semester-wise average age for all UG and PG students separately. 13. Write a C++ program to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator <<. a. STRING s1 = “VTU” b. STRING s2 = “BELGAUM” c. STRING s3 = s1 + s2 (Use copy constructor) 14. Write a C++ program to create a class called BIN_TREE (Binary Tree) with member functions to perform in-order, preorder and post-order traversals. Create a BIN_TREE object and demonstrate the traversals. 15. Write a C++ program to create a class called EXPRESSION. Using appropriate member functions convert a given valid Infix expression into postfix form. Display the infix and postfix expressions.

i & ii semester course diary 2011-12

Documents

activity status field

tata mcgraw hill

single line consisting

exclusion mathematical induction

bcd code converter

bit adder chip

data entry scripts

report writer module