ii sem_ course information_ 2012
TRANSCRIPT
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
1
PES Institute of Technology Department of MCA
GENERAL GUIDELINES
1. The course information is to be brought to the classroom daily. 2. Students should be in time for the first class and subsequent classes thereafter. 3. Students should keep the classroom and Laboratories clean and tidy. 4. Students are informed to clarify their doubts in the respective subjects with the faculty
by taking prior appointments. 5. Students are advised to show due respect to all faculty regardless of the department and
maintain affable personality. 6. Students are to maintain absolute discipline and decorum, so as to promote the fair name
of their college in all its activities. 7. Students having less the 85% attendance in any subject (both Theory and Practical) will
not be allowed to take up the university examination. 8. Students who fail to get minimum of 25 marks in Internal assessment of any subject will
fall in NSSR category and / or not eligible to take up that particular subject. 9. Parents are to follow the progress of their wards by being in touch with the college
authorities at regular intervals. 10. Writing on desks and walls is strictly prohibited, failing which the students will be fined a
minimum of Rs. 500. If the identity of the individual is not established the entire class will be fined ranging from Rs.100 to Rs.500
11. Attendance of the students will be displayed on the department notice board as well as available in the Web site at the end of the 5th, 10th, and 16th week of the semester along with list of students having shortage in attendance.
12. Students should bring the observation book as well as the laboratory record book completed in all respect to the laboratory.
13. Take the print outs of the source listing and output of the code after execution and delete your files.
14. Students are not supposed to alter the configuration / any software on the system. 15. Final examination is of 3 hours duration. 16. Students are supposed to fill details in the LOG BOOK at the time of entering and leaving the
lab. 17. Students should wear IDENTITY CARD all the time. Students without the same will not be
allowed to enter either the class room or the lab. 18. Those students who have less than 85% attendance should sign the undertaking given by their
class teachers from time to time. 19. Students are not allowed to bring the mobile phones and Ragging is strictly prohibited in the
campus.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
2
II SEMESTER – PROGRAMME STRUCTURE
Time Table
Class Teacher II A – Mr. Srikanth V II B – Mr. Tamal Dey
Sl. No. Sub Code SUBJECT
MARKS Total Page # IA UE
1 10MCA21 Business Data Processing with COBOL 50 100 150 3-11
2 10MCA22 Object Oriented Programming with C++ 50 100 150 12-18
3 10MCA23 Data Structures Using C 50 100 150 19-25
4 10MCA24 Management Information Systems 50 100 150 26-33
5 10MCA25 Operations Research 50 100 150 34-51
6 10MCA26 COBOL Programming Laboratory 50 50 100 52
7 10MCA27 Data Structures using C Laboratory 50 50 100 53-54
8 10MCA28 Object Oriented Programming with C++Laboratory
50 50 100 55-56
Total 400 650 1050
Day/Time 8:15-9:15
9:15-10:15
10.15-10.45
10:45-11:45
11.45-12.45
12.45-1.30
1.30-2.30
02.30-03.30
Monday
Te
a Br
eak
Lu
nch
Brea
k
Tuesday
Wednesday
Thursday
Friday
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
3
BUSINESS DATA PROCESSING WITH COBOL
Subject Code: 10 MCA21 Hours / Week: 04 Faculty: Mr. Tamal Dey Total Hours: 52 COBOL is one of the most widespread commercial applications languages in use today. The course is aimed at developers to get the basic knowledge of COBOL program development. This course covers all aspects of Programming with COBOL. The course teaches the design, writing and testing of COBOL programs. Having studied this subject, the students should be able:
Develop Structured COBOL Programs Understand and Use COBOL Verbs Develop COBOL programs using the available verbs Develop and Test COBOL print programs Develop and Test COBOL programs accessing different types of files
Class #
Chapter # Topic to be covered % of portions to be covered
Chapter wise
Cumulative
1
Chapter 1 : The Basics Page 2-100
An introduction to structured design in COBOL :
23.1
23.1
2 The nature of COBOL, A history of COBOL and their ANS versions
3 The Identification and Environment divisions: Basic Structure of a COBOL program
4 Coding requirements of the ID, the sections of the Environment Div
5 Assigning files to devices in the Environment Division 6 The Data Division: Forming data-names 7 The file sections of the data division, types of data 8 The working-storage section of the data division 9 Coding complete COBOL programs: the format of the
procedure division, 10 Statements typically coded in the main module of batch
programs. 11 Statements coded in fully interactive programs. 12 Statements typically coded for processing batch files 13
Chapter 2 II: Designing structured programs Page: 130-322
Moving data, printing info and displaying output interactively: The instruction formats of the MOVE statements.
32.7
55.8
14 Numeric MOVE, non-numeric or alphanumeric MOVE, other options of the MOVE statements.
15 Producing printed output and screen displays, 16 displaying output interactively using screen i/p & o/p
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
4
17 Discussion of an interactive solution to programming assignments
18 Computing in COBOL: The basic arithmetic verbs 19 Options available with arithmetic verbs, the compute
statements. 20 Use of signed numbers in arithmetic operations, 21 intrinsic functions 22 Decision making using the IF and EVALUATE
statements: selection using a simple IF statements. 23 Selection using other options of the IF statements. 24 Using IF statements to determine leap years 25 Condition names, EVALUATE statements. 26 Iteration: the simple PERFORM revived 27 Iteration using other types of PERFORM 28 Using nested PERFORM VARYING statements. 29 The perform with test option. 30
Chapter 3: Writing High Level COBOL programs Page:360-437
Array processing and table handling
15.4
71.2
31 An introduction to single level Occurs clauses 32 Processing data stored in an array 33 Using an occurs clauses for table handling use of the
search statements for table and array processing 34 Contd.. 35 The search varying option, 36 The search all statements. 37 Multiple-level occurs clause 38
Chapter 4: File Maintenance Page 520- 597
Sequential file processing: systems overview of sequential file processing
23.1
94.3
39 Sequential file updating-creating new master file using a previous master file & transaction file
40 Validity checking in update procedures, Update procedures with multiple transaction records for each master record
41 The balanced line algorithm for sequential file updating. Sequential file updating- reviewing records on disk
42 The rewrite statement for a disk file opened as I-O, using an activity status field for designing records to be deleted
43 The EXTEND option for adding records to the end of a sequential file, File management tips,
44 Matching files for checking purposes, Interactive updating of a sequential file
45 Sorting and Merging: the sort feature on overview,
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
5
46 Processing data before AND/OR after sorting, the merge statements.
47 Indexed and relative file processing: systems consideration for organizing disk files, features of magnetic disks and disk drives
48 Processing indexed disk files, additional options for indexed file processing
49 Processing relative disks files, Converting a key filed to a relative key
50
Chapter 5 : Advanced Topics Page:650-703
Improving program productivity using a COPY, CALL and other statements: COPY statements , CALL tatements,
5.7
100
51 Text Manipulation with the STRING and UNSTRING statements
52 Report writer module: The benefits of report writer module, the report section in the data & procedure division statement.
LITERATURE: Book Type Book
code Title and Author Publication Specification
Edition Publication Year
Text Book T1
Structured COBOL Programming , Nancy Stern & Robert A Stern Chapters: 1 to 4, 6 to 9, 12 to17
11th
John Wiley & Sons
2006
Reference Books R1
COBOL Programming Including MS-COBOL and COBOL-85 M.K.Roy & D Ghosh Dastidar
2nd
Tata-McGraw Hill
2001
Reference Books R2
Structured COBOL Programming Gary B Shelly. Thomas J Cashman. Roy O Foreman
2nd Thomson Course Technology
1999
Reference Books R3
David M.Collopy: Introduction to COBOL, A guide to Modular Structure Programming
Pearson Education 2000
Test Syllabus Test 1: Chapter 1, 2 Test 2: Chapter 2, 3 Test 3: Chapter 4, 5
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
6
QUESTION BANK Chapter 1: THE BASICS OVERVIEW: The reasons for COBOL programming success and its future are discussed in this section. Later the basic coding and format rules, the structure and elements of COBOL are introduced.
1. What does COBOL stands for? Why COBOL is Popular Language? With Suitable Syntax and Example, Explain COBOL divisions.
2 COBOL is High Level or Low level Programming Language? Justify? 3 Mention advantage and Disadvantage of COBOL Programming Language? 4 Describe the special features of COBOL ,that made it more suitable for business applications 5 Has the COBOL a weak structure? Justify your statement with two instances. 6 Discuss the coding sheet format for a COBOL program. 7 Explain different divisions of COBOL indicating the mandatory and optional entries. 8 Explain the various divisions of COBOL program including their sections in order. Also indicate
their positions in order. Also indicate their positions on COBOL coding sheet. 9 Give the character set of COBOL. 10 Explain the following with example.
COBOL words , Data names & Identifiers , Literals 11 Describe various types of literals used in COBOL with examples. 12 What is a data name? List the rules followed to device data names. 13 What are the advantages of figurative constants? List different figurative constants used in
COBOL. 14 Explain Continuation of lines with Different notations
1. What is the major purpose of the file section in Data Division? 2. What is a level number? Explain with examples? 3. Name the two sections that can be written in the Data Division? 4. Explain the difference between group and elementary data item? 5. What is the purpose of the picture clause? Explain two different types of picture clauses? 6. What is the of working storage section in data division? 7. What picture clause to use to represent numeric, alphabet and alphanumeric data type? 8. What are the different ways you can assign values to data names? 9. What is the purpose of FD Entry? 10. What is the difference between paragraph name and data names? 11. What is meaning of the clause label records are omitted / standard? 12. What are the different types of picture clause available in COBOL? Explain with example.
1) blank 2) dollar 3) floating picture clause 13. Illustrate with example, clarify when $, +, - characters can be used as i) insertion characters ii)
floating characters. 14. What is the purpose of value clause in the file section? Explain the purpose through an example. 15. What is the function of SPECIAL-NAMES paragraph? 16. What is the purpose of MEMORY SIZE clause? 17. What is a mnemonic name?
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
7
18. What is the purpose of FILE-CONTROL PARAGRAPH? 19. What is an optional file and how can it be specified. 20. What are the different categories of data?
1. Write a general form of following arithmetic verbs and illustrate with example.
1) ADD II) SUBTRACT III) MULTIPLY IV) DIVIDE V)COMPUTE 2. What is the purpose of looping statement? 3. Explain the different form of if statement? with an example ? 4. Write the syntax of “go to” and “go to depending on” statements? with an example ? 5. List the different format of MOVE verb. What are the rules associated with MOVE
statement? Explain with examples 6. Write a COBOL program to calculate simple interest without using COMPUTE verb. 7. Write the general form of the GOTO statement with depending phrase. Explain with an example. 8. The salary increase is calculated as follows.
For Salary upto 10000 Rs. = 20% increase For Salary between 10,001 and 30000 = 10 % increase For Salary > 30000 = 5% increase. Write a COBOL program which accepts employee-number, employee-name, employee –address from key board and calculates the increase in salary.
9. Discuss the meaning and use of a READ statement, when ATTEND clause is activated. what is its effect
10. Explain different control statement in COBOL.
Chapter 2: DIFFERENT TYPES OF CLAUSES & OTHER VERBS OVERVIEW: The optional data description clauses are explained. The additional features of ADD, MOVE ,SUBTRACT are discussed.
1. Explain 1) Justify clause 2)Renames clause 3) Redefines clause 4) Synchronized clause
2. Explain the different types of USAGE clauses , Discuss its influence on storage of data. 3. Describe the use of following options with examples.
1) MOVE CORR. 2)ROUNDED 3)ONSIZE ERROR
4. Discuss how size errors and rounded options are handled in cobol programs. 5. What do u understand by Qualification of data names. 6. Explain SIGN clause. 7. Explain CORRESPONDING option w.r.to ADD, SUBTRACT
Chapter 2: COMPUTATION AND DECISION MAKING OVERVIEW: Describes the elementary form of the condition verb IF and sequence control verbs such as GOTO and STOP and GOTO with DEPENDING phrase, ALTER and perform statements. Also explains different types of conditions supported by COBOL.
1. Explain the difference between varying and varying after option with an example 2. Explain condition names condition with examples and list its advantages and disadvantages. 3. Describe the format and use of relation condition used in conjunction with IF statement.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
8
4. Explain SCREEN section 5. Explain Intrinsic functions 6. List the various types of perform statements. Explain any three of them with syntax and
examples.
7. Explain the IF statement with example. 8. Explain negated simple conditions with examples 9. Explain the following.
1)COMPOUND CONDITION 2) SIGN CONDITION
10. Write a COBOL program to find roots of quadratic equation 11. Write a program to find the difference between two given dates. 12. A sports committee is conducting an interview for 100 candidates. The requirements for
selection are as follows Points in running must be >+ 60 Points in High Jump must be >= 65 Points in short –put must be >=70 above these average points must be greater than 70.
Write COBOL statements to prepare a list of selected candidates?
13. Write a COBOL program to find largest of and second largest of 3 numbers? 14. Write a COBOL program to compute average class marks scored by students in a
subject considering best of two test marks out of three test marks.
15. Write a COBOL, program to reverse a given number? 16. Write a COBOL program to find a give number is even or odd? 17. Write a COBOL program to find sum of n digits using perform statements? 18. Write a COBOL program to find a input date of the form
dd/mm/yyyy is valid or not ?
19. What is a decision table. What is its importance in program development? 20. Write a COBOL program to reverse a given number by using perform statement. 21. Write a COBOL program a find the sum of the OOD numbers from 1 to 100 22. Explain ALTER statement with examples.
Chapter 3: WRITING HIGH LEVEL COBOL PRG-ARRAY PROCESSING AND TABLE HANDLING OVERVIEW: COBOL features to handle a group of data consisting of similar items. Also explains one, two and multi dimensional table structure using PERFORM.
1. Explain the syntax of SERACH, SET verb with an example? 2. Explain the method of assigning value to table elements with an example? 3. What is the purpose of usage in index clause? 4. Is index and index data items can directly refereed in SET, SERACH and
PERFORM statement ? Justify with an example?
5. What are the difference among a subscript, an index and an index data items ?
6. Write a Cobol program to find two dimensional addition using occur clauses? 7. Explain OCCURS clause with DEPENDING ON option. 8. Write a COBOL program to perform matrix multiplication.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
9
9. What is table element? Illustrate how two and three dimensional tables can be constructed using OCCURS clause.
10. Describe with structure and example the sequential search statement. 11. Explain the use of table handling in business data processing 12. Write COBOL program to search a given key element in a table. Display the
appropriate message.
13. Write a COBOL Program to find the sum and average of N elements in an array. Also display the total number of entries having their average greater than 75.
14. Write a COBOL program to find the number of even and ODD numbers in an array of size N. And also find the sum of all even numbers and odd numbers. Display the same.
Chapter 4 : FILE MAINTENANCE OVERVIEW: The COBOL features for handling sequential files are discussed.
1. What is the purpose of the file-control paragraph of the COBOL program? 2. Define file? Mention the different type of file organization? 3. Explain the following
Master file -Program file -Transaction file-Data file,
4. Mention advantage of sequential file? 5. Explain the different modes of file operation?
Explain the following with respect to sequential file: open, input , output , extend
6. What is the purpose of advancing clause in write statement in COBOL? Explain with an example?
7. Write a COBOL program to create a sequential file and extract the information of different subjects marks find the total average and the grade in terms of first class second , third class and pass class .?
8. Write a COBOL program to create a student -file which has the following record description
Column numbers
contents
1-6 Register number 7-25 Student name 26-28 Language marks 29-31 English marks 32-34 Physics marks 35-37 Mathematics marks 38-40 Computer sciences
marks
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
10
9. Write a program to create a student report ( for above program) format from existing created file STUDENT REPORT ---------------------------------------------------------------------- REG-NO NAME TOTAL RESULT ---------------------------------------------------------------------- ---------------------------------------------------------------------- And also find result using the given table Average marks Class 0-34 any one subject Fail 35-49 Pass Class 50-59 Second Class 60-74 First Class 75 and above Distinction
Create a sequential file of employees with employee name, basic pay and employee number. Update the basic pay by 10% of basic pay if the basic pay is between 5001 and 1000. cobol program to accomplish the same.
Chapter 4: DIRECT ACCESS FILES OVERVIEW: The COBOL features for handling the relative and indexed sequential files are discussed in this chapter. And also explains the selection and use of these organizations
1. Explain the usage of INVLID KEY phrase on a relative file & indexed file. 2. What is an indexed file. How it is specified in a program. 3. How many ways can the records of a indexed file be accessed. 4. How useful is relative organization compared to indexed organization 5. How can we update a relative and an indexed file. 6. What is the purpose of ALTERNATE RECORD KEY clause
7.
Write a modular COBOL program to create an indexed organised file called master file with customer code, name, and address having customer code as record key. The program must enable the user to add new customer code as record key. The program must enable the user to add new customer records ,change the contents of a particular record, to delete any records and display the contents of selected records.
8. Explain procedure division statements for relative file
9. Explain the syntax of REWRITE and DELETE verb by writing a COBOL interactive program to update an indexed file?
10. Write a COBOL program to access a Customer record randomly by prime key ( ACC-NO ) or Alternative Key ( Name )
11. What are the advantages of using an index file? 12. Write and explain the syntax of rewrite statements w.r.t. index file ?
13. Write a COBOL, program to create a indexed file with the following fields account number (9), Name (10) age (3) Salary (with decimal 2 digits)
14. Discuss the structure and uses of various clauses to be defined in FILE CONTROL paragraph for an indexed sequential file.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
11
15. Discuss a hashing routine to insert and retrieve records from a hash file. 16. Explain the progressive overflow technique used to resolve collision of relative key address. 17. Explain the procedure used to add records in indexed sequential file organization 18. Write a COBOL program to create an indexed sequential file of records containing employee
number, employee name, employee salary and percentage of bonus. Compute bonus of each employee. Give provision for additional bonus to the selected employees. Make your program interactive.
Chapter 4: COBOL SUBROUTINE PROGRAMMING OVERVIEW: The inter-program communication facility of COBOL provides one with the capability of transferring control as well as data from one program to another within the same run-unit. 1. How can a COBOL subroutine be distinguished from a regular COBOL program. 2. How is a subroutine called by the main program 3. Explain the difference between goto, perform and call statement? 4. With a suitable example. Discuss COBOL subroutine , also explain how parameters
are passed between calling and called program.
5. Explain the difference between actual and formal parameter? 6. Explain the different type of parameter passing? 7. Give syntax of cancel statement and use of it. 8. Write a short notes on 1) screen section 11) Linkage section. 9. Write a COBOL program to create and process files using subroutine 10. Write a COBOL subroutine that receives a table of integers from the calling program
and returns the count of elements with zero values. State the assumptions you make while writing the subroutine.
Chapter 5: ADVANCED TOPICS - REPORT GENERATION OVERVIEW: COBOL provides facilities to produce attractive reports through the use of report writer features. This chapter deals with the report writer features of COBOL
1. Explain the general format of a report? 2. What are the different parts of a Report 3. Mention the difference between logical page and physical page? 4. Describe the general format of a REPORT DESCRIPTION ENTRY OF REPORT SECTION. 5. List out the various tasks to be performed by a report writer. Explain in brief, the
statements used to control the report writer
6. Explain the procedure division statements purpose in report generation .Initiate statements, generate statements, terminate statements, use before reporting statements, suppress statements?
7. Explain how a control break is related to the printing of the report groups. 8. Why is the column number clause in the description of an elementary item in a report
group?
9. What is FINAL in the context of Report Writer? 10. What is the purpose of LINE, COLUMN and SUM clause? 11. What is Static, Dynamic linking?
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
12
OBJECT ORIENTED PROGRAMMING WITH C++
Subject Code: 10MCA22 Hours / Week: 04 Faculty: Sec: A: Mrs. Neelam Bawane & Sec B: Dr. D.Uma Total Hours: 52
Overview:
C++ has undergone international standardization, which has not only added new features to the
language, such as exception handling, runtime type identification, namespaces, a built-in Boolean data
type and a new cast notation, but has also extensively modified and extended existing features, such as
Templates, the class mechanism in support of both object - oriented and object based programming,
nested types and overload function resolution.
Class # Chapter # Topics To be Covered % of portions covered Chapter
wise Cumulative
1 Chapter 1: Introduction
T1:
Page #: 255-262, 13-14, 35-52, 137-142,
153, 275
Overview of C++, Sample C++ program
12
12
2 Different data types, operators, expressions, and statements
3 Arrays and strings, pointers & user-defined types
4 Function components, argument passing 5 Inline functions, function overloading 6 Recursive functions 7 Chapter 2:
Classes & Objects
T1: Page #: 289-324
Class specification, Class objects
27
39
8 Scope resolution operator, Access members 9 Defining member functions, Data hiding, 10 Constructors, Destructors 11 Parameterized constructors 12 Static data members, Functions 13 Friend functions 14 Passing objects as arguments 15 Returning objects, Arrays of objects, 16 Dynamic objects, Pointers to objects 17 Copy constructors, generic functions and
classes, Applications 18 Operator overloading using friend functions
such as +, -, 19 pre-increment, post-increment, [] etc. 20 Overloading <<, >>
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
13
21 Chapter 3: Inheritance
T1:
Page #: 417-437
Base class
23
62
22 Inheritance and protected members 23 Inheritance and protected members 24 Protected base class inheritance 25 Protected base class inheritance 26 Inheriting multiple base classes; 27 Constructors, Destructors and Inheritance, 28 Passing parameters to base class constructors 29 Passing parameters to base class constructors 30 Granting access 31 Virtual base classes 32 Virtual base classes 33 Chapter 4:
Virtual Functions,
Polymorphism T1:
Page #: 443-458
Virtual function
13
75
34 Calling a virtual function through a base class reference
35 Virtual attribute is inherited 36 Virtual functions are hierarchical 37 Pure virtual functions, Abstract classes 38 Using virtual functions 39 Early and late binding 40 Chapter 5:
I/O System Basics, File I/O
T1: Page #: 509-563
C++ stream classes
12
87
41 Formatted I/O 42 I/O manipulators 43 fstream and the File classes 44 File operations 45 File operations 46 Chapter 6:
Exception Handling, STL
T1: Page #: 629-695
Exception handling fundamentals
13
100 47 Exception handling options 48 STL: An overview 49 Containers 50 Vectors 51 Lists 52 Maps
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
14
Literature:
Book
Type
Book
Code
Title & Author Publication Info
Edition Publisher Year
Text
Book
T1 C++ The Complete Reference
Herbert Schildt
4th TMH 2003
Reference
book
R1 C++ Primer ,
Stanley, B. Lippman and Josee Lajore
4th Addison
Wesley
2005
Reference
book
R2 C++ for Programmers,
Paul J Deitel, Harvey M Deitel
Pearson
Education
2009
Reference
book
R3 Mastering C++,
K R Venugopal, Rajkumar and T. Ravi Shankar
TMH 1999
Test Syllabus
Test 1: Chapters 1, 2 Test 2: Chapters 2, 3, 4 Test 3: Chapters 4, 5, 6
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
15
QUESTION BANK
Chapter 1: The Basic Language
Objective: This chapter gives an introduction to the Object Oriented Programming. At the end of this
chapter student will be able to understand the basic features of Object Oriented Programming, like Data
Encapsulation, Inheritance, Polymorphism and Exception handling, also the student will get familiar
with the basic data types and some of the built in data types provided by C++ language.
Student will be able to write simple programs of his own with C++ syntax with accepting values and
using them in the program as per the need and displaying wherever needed to the output device.
Student will also learn to convert one data type into another.
1. What is object oriented programming? Explain the features of OOP.
2. Differentiate object oriented design and procedure based design.
3. Explain purpose of including preprocessor directive in C++ program?
4. Explain the following data types with examples. Pointer types, string types, reference types, the
bool type, enumeration types, array types, complex number types.
5. Explain const qualifier and volatile qualifier and typedef names.
6. Differentiate the features of C and C++.
7. Explain new and delete expressions with examples.
8. Explain different types of type conversions in C++.
9. List the operators and keywords in C++.
10. Write the complete Operator and expression evaluation precedence.
11. Write a note on Scope resolution operator “::”.
12. Differentiate how strings are handled in C and C++.
13. How function declaration is different in C++ compared with C?
14. Explain the following with syntax:
a. typedef names
b. volatile qualifier
c. Reference types
d. comma operator
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
16
Chapter 2: Procedural-Based Language
Objective: In this chapter students will focus some of the advanced topics like linkage directives,
handling command line options, pointers to functions. At the end of the chapter student will get familiar
with the scope and life time of the objects and functions. Students will also be able to implement few
important concepts in OOP like Polymorphism and more importantly generic programming i.e. function
templates which will be a basic foundation for understanding object based software design in future.
1. Explain different parameter passing ways to functions in C++ with examples.
2. When will you make a function inline? Why?
3. Demonstrate pointers to functions with an example.
4. Write a note on linkage directives.
5. How command line options are handled using main( )? Explain in detail.
6. Explain global objects and local objects with an example.
7. Write a note on dynamically allocated objects.
8. Explain function overloading and three steps of overload resolution.
9. Explain overloading a function template.
10. Demonstrate a generic sort.
11. Explain different types of passing parameters to functions.
12. What is the main advantage of passing arguments by reference?
13. What are the advantages of using functions? Explain function prototyping and parameter passing
mechanisms.
14. Write a note on inline functions with illustrations.
15. Explain the meaning of scope and lifetime of an object.
Chapter 3: Classes and Objects
Objective: This is the chapter where student will get the real essence of Object oriented
Programming concepts. At the end of this chapter student will get familiarize with most of the
features of the OOP more importantly some new concepts which c++ provides also will be included
like inline functions, array of objects, nested classes and passing objects to functions. Student will be
able to implement operator overloading concept for some of the special operators.
1. What is a class? How does it accomplish data hiding?
2. How is a member function of a class defined?
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
17
3. Differentiate unions and classes.
4. Distinguish between private vs. public member functions.
5. Define function overloading. Discuss overload resolution.
6. Explain friend classes and friend functions.
7. Define friend function in C++. Write a C++ program with use of object as function arguments.
8. When do we declare a member of a class static?
9. What are the merits and demerits of using friend functions?
10. What is a constructor? Explain different types of constructors.
11. Describe the importance of destructors.
12. How do we invoke a constructor function?
13. Write a program to demonstrate
a. array of objects
b. pointers to objects
c. this pointer
d. pointers to class members
e. pointers to derived types
f. Copy constructor
14. What is operator overloading? Why is it necessary to overload an operator?
15. What is an operator function? Describe the syntax of an operator function.
16. Define type conversion. Write a C++ program to illustrate this concept.
17. Write a program to demonstrate operator overloading using friend functions
a. To overload ++ and –- operators
b. To overload special operators [], ->, and comma (,) operator.
c. Output operator << and input operator >>.
Chapter 4 to 7: Inheritance, Virtual functions and iostream library
Objective: This chapter takes a student deep into the features of the Object oriented programming and
also some of the advanced concepts associate with the implementations of streams in C++ compiler.
Student will be able to understand with a clear picture about how the data is handled by the compiler;
also how the streams are handled is also explained
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
18
At the end of the chapter file-handling using C++ is another concept which shows how easy and
efficiently files could be handled in C++.
1. What is inheritance? Explain with an example.
2. What are the different forms of inheritance? Give an example for each.
3. Write a program for multiple inheritances.
4. What is a virtual base class? When do we make a class virtual?
5. What is an abstract class?
6. Write a program demonstrate
a. The calling a virtual function trough a base class reference
b. Pure virtual functions
7. Explain early and late binding.
8. How is polymorphism achieved at (a) compile time, and (b) run time?
9. When do we make a virtual function “pure”? What are the implications of making a function a
pure virtual function?
10. What is a stream? Describe the features of I/O system supported by C++.
11. Explain the architecture of standard header stream files of C++ compiler.
12. What are input and output streams? What are the steps involved in using a file in a C++
program?
13. What is a file mode? Describe the various file mode options available.
14. Explain the difference between overloading and overriding.
15. With an example, explain the iostream in C++. Give the stream class hierarchy.
16. Write short notes on:
a. This pointer
b. Generic algorithm
c. Abstract classes.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
19
DATA STRUCTURE USING C
Subject code: 10MCA23 Hours / Week: 04 Faculty : Mrs. A. Lekha Total Hrs : 52
Overview At a very abstract level, computer science can be defined as the study of data, its representation and its transformation by a digital computer. In this course, students will be studying many different kinds of data objects. Each data object has a way of representation and a class of operations that may be efficiently performed on the represented data. The ability to devise alternative data representation and the ability to analyze the algorithm which operate on this data will be taught in this course.
Class Chapter Topics to be Covered % of portion covered
Chapter wise
Cumulative
1
Chapter 1 : Basic Concepts
T1: Page #: 001-050
Working with Pointers
15.34 15.34
2 Dynamic Memory allocation with examples 3 Dynamic Memory allocation with examples 4 Introduction to Algorithms, Algorithm
Specification, Properties of an Algorithm 5 Problem solving, Recursive algorithms, 6 Performance Analysis of Algorithms 7 Performance analysis and Measurement 8 Introduction to Data Structures, Abstract Data
Types 9
Chapter 2 : Arrays and Structures
T1: Page #: 051-086
Array as an abstract data type, Single dimensional array representation, 2D array representation
11.53 26.92 10 3D array representation, multidimensional array representation
11 Array address computation 12 sparse matrices, Polynomials 13
Chapter 3: Stacks and
Queues T1: Page #: 107-
144
Stacks as abstract data type, Stack representation using arrays, Recursion
11.53 38.46 14 Recursion 15 Expression Evaluation 16 Infix to suffix 17 Queue as an Abstract data type 18 Linear queue, circular queue 19 Multiple stacks and queues 20 Chapter 4 :
Linked Lists T1: Page #:
Sequential Allocation vs Dynamic Allocation, Linear Singly Linked List 11.53 50 21 Linear Singly Linked List
22 Polynomial representation, Sparse Matrices
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
20
23 145 -190 Equivalence Classes 24 Circular Linked List 25 Doubly Linked List 26
Chapter 5 Trees and
Graphs T1: Page #:
191 -211, 216-264, 265-279
Representation of Trees
23.07 73.07
27 Binary Trees - ADT 28 Binary tree Traversals – Inorder, Preorder 29 Postorder Traversal, Iterative traversal 30 Threaded Binary Trees 31 Traversal, Inserting Nodes 32 Heaps – Priority Queues 33 Max Heap – Operations 34 Binary Search Trees - Operations 35 Binary Search Trees - Operations 36 Selection Trees 37 Forests 38 Representations of Disjoints Sets 39 Counting Binary Tees 40 Counting Binary Tees 41 Graph - ADT 42
Chapter 6 Priority Queues
T1: Page #: 422 - 458
Single and Double ended queues
11.53 84.61
43 Leftist Trees – Height Biased Trees 44 Weight Biased Tress 45 Binomial Heaps - Definition 46 Binomial Heaps - Operations 47 Fibonacci Heaps 48 Parsing Heaps 49 Chapter 7
Efficient Binary
Search Trees T1: Page #:
481-531
Optimal Binary Search Trees
15.38 100 50 AVL Trees 51 Red Black trees 52 Splay Trees
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
21
Literature:
Book Type
Book Code
Title and Author Publication Information Edition Publisher Year
Text Book T1
Data structures using C and C++ By Yedidyah Langsam Moshe J. Augenstein and Aaron M. Tenanbaum
2nd Pearson Education Asia 2002
Reference Book R1
Data Structures and Algorithm Analysis in C By Mark Allen Weiss
2nd Pearson Education Asia 1997
Reference Book R2
Data Structures - A Pseudo code Approach with C By Richard F Giberg and Behrouz A Forouzan
3rd Thomson Course Technology 2005
Test Syllabus: Test 1 : Chapter 1, 2, 3 Test 2 : Chapter 4, 5 Test 3 : Chapter 6, 7
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
22
Question Bank
Chapter 1: INTRODUCTION TO DATA STRUCTURES Objective: At the end of this chapter you will be able to define Data Structure and its classification. You will also come to know about Dynamic Memory Allocation 1 Mention the functions used for finding out the memory size of a data element and to
dynamically allocate required memory. 2 Define Data Structures. Chapter 2: ARRAYS AND STRUCTURES Objective: At the end of this chapter you will be able to define: what is an Abstract Data Type. You will also come to know about unions, structures and Arrays 1 What is an ADT? Explain this concept with the help of ADT RATIONAL. 2 Which are the different storage classes? Explain the scope of each with example. 3 Explain union data type. How does it differ from a structure data type? 4 What is Dynamic Memory Allocation? What are the functions that support Dynamic allocation in
C. Give an example of each. 5 Which are the different storage classes of variables? Explain the scope of each with examples. 6 What are register variables? Where are they used? 7 What do you mean by dynamic memory allocation? Mention the different functions used for
this. 8 Explain call - by - value and call - by - reference methods. Give an example for each. 9 Write a short note on enumerations. 10 Explain how to pass arrays as parameters to functions. Chapter 3: STACKS AND QUEUES Objective: At the end of this chapter you will be able to learn about a data structure called stack, its implementations and applications, recursion, its use(Fibonacci series, factorial, Tower of Hanoi etc) , its efficiency over iterative function, Queues and its applications 1 What is a stack? Mention the operations that are performed to push all elements on to a stack
and remove an element from a stack. Give the C code for the implementation of these operations. 2 Explain clearly the method to convert an infix expression to postfix form. Write a C function that
does this. 3 Define stack. List the primitive operations on stack and also write C implementation of these
operations. 4 Write an algorithm for evaluating a postfix expression. Trace the algorithm on the following
string indicating the contents of stack. 623 + - -382 /+ *2$3+ 5 If an input character string is of the form x C y, where x is a string consisting of letters 'A' and
'B', write an algorithm to determine whether y is the reverse of x using stacks. (i.e. if x = 'ABABBA', then y must be equal to 'ABBABA'). At each point you may read only the next character of the string.
6 Given the following expressions give their postfix and prefix forms. 1. (A + B) * (D - C) 2. X$Y * Z - M + N + P /Q /(R +S).
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
23
7 Write the prefix and postfix form of the following infix expressions: 1. ((A+B*C-(D-E))$(F+G) 2. (A+B)*(C+D-E)*F 3. (A+B)*(C+D)$(A+B) 4. A+B*C-D/E*H 5. (A+BACAD)*(E+F/D) 6. ((A/B**C))+(D*E))-(A*C)) 7. (A$B*C-D+E/F/(G+H)
8 Define Stack as a data structure and discuss its application 9 Write a C Program to perform the following operation on stack i) Push ii) Pop iii) Display 10 What are the restrictions in the tower of Hanoi game problem? Write a C recursive program to
solve the towers of Hanoi problem. Give the trace for 3 disks. 11 Write a recursive C program for binary search. 12 Comment on the efficiency of recursive routines. 13 Express the following C function without using recursion. Write the appropriate main to call the
function and print the values. int func (int n) { if (n == 0) return (0); return (n+func (n - 1); }
14 Compare the recursive program with iterative program with an example. 15 Write a recursive C function to find the nth Fibonacci numbers. Trace the program for n = 6. 16 Write a recursive program to find GCD of two numbers. 17 Write a recursive C routine that accepts a non negative decimal integer as a parameter and writes
out its binary representation. 18 Write a recursive C function to find minimum of 'n' numbers in a given list. 19 Write a recursive C function for the multiplication of natural numbers. 20 Write a C program to perform the following operations on an ordinary queue.
i) Insert ii) Remove iii) Display 21 Discuss Queue as an ADT. 22 Distinguish between Ordinary queues and Circular queues. 23 A circular queue has a size of 5 and has 3 elements 10,40 and 20 where F=2 and R=4. After
inserting 50 and 60, hat is the value of F and R. Trying to insert 30 at this stage what will happen? Delete 2 elements from the queue and insert 100. Show the sequence of steps with necessary diagrams with the value of F and R.
24 What is the advantage of circular queue over linear queue? Write C routine for inserting and deleting an element from the circular queue.
Chapter 4: LINKED LISTS Objective: At the end of this chapter you will be able to learn about a new data structure called Queue. You will also learn about the various implementations of Single Linked list and Double linked list and various operations that can be performed on these data structures.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
24
1 What is a linked list? Write a C function to insert a node at the beginning and deleting the last node from the linked list.
2 What is the doubly linked list and what are the advantages of doubly linked list? Write an algorithm that deletes all nodes with the value x from the doubly linked list.
3 What are non homogeneous lists? How are they represented? 4 Explain how linked lists can be used to implement stacks and queues? Give implementations for
the same. 5 Write a C routine to delete all the nodes whose information field contains the value x, from a
singly linked list. 6 What is a circular list? What are the advantages of circularly linked list over a linear list? Write a
C routine that concatenates two circular lists 7 Explain how an ordinary queue can be represented using a linked list. Give algorithms for
insertions and deletion on such a representation. 8 Write the routine that accepts a pointer P to a node and an item x as parameter. It first ensures that
P is not null and then inserts x into a node following the node pointed to by P. 9 State any two advantages and any two disadvantages of linked lists over arrays. 10 Explain merging of two lists which have been represented in i) Array and ii) Linked List. 11 Give a C program to interchange the mth and nth elements of a Doubly Linked List. 12 Write a C routine to find the sum of all the elements in the singly linked list 13 Write a C function to insert and delete a node from the front end in case of doubly linked list 14 What are the advantages and disadvantages of doubly linked list? Also give its applications Chapter 5: GRAPHS AND TREES Objective: At the end of this chapter you will be able to learn about new data structures called Trees and Graphs. Then you will also learn about various types of trees. Different traversal techniques and then the various applications of the tree as a data structures. You will also learn about graphs and their applications, different traversal techniques, DFS and BFS. 1 Explain the different methods of binary tree representation. 2 What is a binary tree? With a suitable example explain the three tree traversal methods 3 Mention different types of binary trees and explain any two of them clearly. 4 Short Notes: Implicit array representation of a binary tree 5 Short Notes: Threaded binary trees 6 Define Graphs. Explain the different representations of graphs. 7 Explain how graphs can be represented in C. 8 Given the following traversals: Inorder: E I C F J B G D K H L A Preorder: A B C E I F J D G H K
L Draw the tree. 9 What are the two different traversal methods for graphs? Explain with an example. 10 Write an algorithm for deleting a node in a binary search tree for all the three cases 11 Explain binary tree searching method. How can an item be inserted into a binary if it does not
exist on it already? 12 Define the following:
1. Strictly binary tree 2. Almost complete binary tree 3. Ordered Binary tree 4. Right threaded binary tree
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
25
13 Write the output of the following tree after traversing by i) Inorder ii) Preorder traversing methods
Chapter 6: PRIORITY QUEUES Objective: At the end of this chapter you will be able to learn about a data structure called priority queue, the various applications of the priority queue. 1 What is a priority queue? Mention different types of priority queue and explain them briefly. 2 Define input restricted deque and output-restricted deque with suitable diagrams. 3 Discuss the implementation of priority queues. 4 What is Binomial Heap? 5 What is meant by cost amortization? 6 What is a Fibonacci Heap? 7 What is a Pairing Heap? Chapter 7: EFFICIENT BINARY SEARCH TREES Objective: At the end of this chapter you will be able to learn about the efficient binary search trees 1 What is meant by optimal BST? 2 What is an AVL Tree? 3 What is a Red Black Tree? 4 What are the operations performed on a Red Black Tree? 5 What are Splay Trees?
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
26
MANAGEMENT INFORMATION SYSTEMS
Subject code: 10MCA24 Hours / Week: 04 Faculty : V.SRIKANTH Total Hrs : 52 Overview: MIS provides managers with information and support for effective decision making, and provides feedback on daily operations. Output, or reports, is usually generated through accumulation of transaction processing data. Each MIS is an integrated collection of subsystems, which are typically organized along functional lines within an organization. The different departments in the organization for which the MIS can act as a key resource are Financial MIS, Manufacturing MIS, Marketing MIS, Human Resource MIS, Accounting MIS, etc.
Class
#
Chapter #
Topics to be covered
% of portions to be covered Chapter
wise Cumulative
1
Chapter 1: Systems
Engineering T1:Page 176-214
System concepts, system control, types of systems, handling system complexity
7 7 2 Classes of systems, General Model of MIS, Need for System analysis
3 System analysis for existing system and new requirements, system development model
4 MIS & System Analysis
5
Chapter 2: Information and
Knowledge T1:Page 149-168
Information concepts and classification of information
7 14 6 Methods of data and information collection,
value of information
7 Information-a quality product, General model of a human as information processor
8 Knowledge and difference between information and knowledge
9 Chapter 3:
Introduction of MIS T1:Page 3 -
22
MIS Concept, Definition, Role of MIS
7 21 10 Impact of MIS and the user, Management as a
control system, support to the Management
11 Management effectiveness and MIS, Organization as a system
12 MIS: Organization effectiveness
13 Chapter 4: Strategic
Management Of Business T1:Page
54-76
The concept of Corporate Planning
7 28
Essentiality of Strategic Planning
14 Development of the Business Strategies Types of Strategies
15 Short-range Planning Tools of Planning
MIS: Strategic Business Planning
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
27
16 17
Chapter 5: Development of
MIS T1:Page 278 - 300
Development of Long range Plans of MIS
11 39
18 Ascertaining the Class of Information 19 Determining the Information requirement 20 Development and Implementation of MIS 21 Management of Information Quality in MIS
22 Organization for the Development of MIS, MIS Development process model
23
Chapter 6 Developing Business/IT
Strategies/IT solutions T2:Page
363 - 413
Planning Fundamentals (Real world Cases)
11 50
24 Organizational Planning, Planning for competitive advantage, (SWOT Analysis)
25 Business models and Planning, Business/IT Planning, identifying business/IT strategies
26 Implementation challenges, Change Management, Developing Business systems (real world cases)
27 SDLC, prototyping, System development process
28 Implementing business system 29 Chapter 7:
Business Process Re-Engineering
T1:Page 323 - 339
Introduction, Business Process
5 55 30 Process model of the Organization, Value Stream model of the organization, What delays the business process
31 Relevance of information technology, MIS and BPR
32 Chapter 8:
Technology of Information
System T1:Page 519 – 548
Introduction
11 66
33 Data Processing, Transaction Processing
34 Application Processing, Information System Processing
35 TQM of Information Systems
36 Human Factors and User Interface, Strategic nature of IT decisions
37 MIS choice of information technology 38
Chapter 9: Decision Making & DSS T1: Page
129-144, T2 : Page 316-323
Decision Making concepts,
7
73
39 Decision making process, decision making by analytical modeling , Behavioral Concepts in Decision Making
40 Organizational Decision Making
41 Decision structure, DSS components, Management reporting alternatives
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
28
42
Chapter 10: Data Resource
Management T2 : Page 138-163
Managing Data sources, Foundation concepts of data, types of databases, Traditional File Processing
4 77
DBMS approach, Database Structure, Database development
43
Chapter 11: Electronic
Business systems T2 : Page 211-270
Enterprise Business systems- Introduction, cross functional enterprise applications, real world cases
6 83 44 Functional Business systems – introduction,
marketing systems, sales force automation 45 CIM, HRM, online accounting system
46
Customer Relationship Management ERP, Supply Chain Management (real world cases of the above)
47
Chapter 12: Enterprise
Business systems T2 : Page 278-306
Electronic Commerce Fundamentals
6 89 e-commerce applications and issues(real world cases)
48 Chapter 13:
Client Server Architecture and
E-Business Technology
T1:Page 596 – 608, 644 - 683
Client Server Technology and Implementation strategies
11 100
49 Introduction to E-business
50 Models of E-business, Internet and World wide web
51 Intranet/Extranet, Electronic Payment System, Impact of Web on Strategic Management
52 Web enabled business management MIS in Web Environment
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
29
Literature : Book Type
Book Code
Title & Author Publication Information. Edition Publisher Year
Text Book T1 Management Information Systems W.S.Jawadekar 3rd Edition Tata MCGraw
Hill
Text Book T2 Management Information Systems James A O’Brien and George M
Marakas 7th Edition Tata MCGraw
Hill 2006
Reference Book R1
Principles of Information Systems Ralph M Stair and George W
Reynolds 7th Edition Cengage
Learning 2010
Reference Book R2
Information Systems- The foundation of E-Business Steven Alter
4th Edition Pearson Education 2001
Reference Book R3
Management Information System Mahadeo Jaiswal and Monika Mittal
Oxford University
Press
Reference Book R4 Management Information System
Effy Oz 5th Edition Cengage Learning 2006
Test1: Chapters 1- 4 Test2: Chapters 5- 8 Test3: Chapters 9- 13
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
30
QUESTION BANK
1. Define System. Explain the the basic concepts of systems. 2. Explain different types of systems with examples 3. Give a general model Of MIS and explain the need of System Analysis.
1. What is Information? Explain different kinds of information. 2. Explain different methods of information collection. 3. Bring out differences between knowledge and information 4. Explain General model of human as a information processor.
1. What are the Approaches to Management? 2. What are the Functions of the Manager? 3. Write a note on MIS: A Support to Management.
1. What is the concept of Corporate Planning? 2. Explain the reasons making strategic planning as an essential management process. 3. What is Short-range Planning? 4. Which are the Tools of Planning? 5. Write a note on MIS: Business Planning. 6. Explain different types of strategies used in strategic management.
CHAPTER 1: Systems Engineering Overview: This chapter discusses about the basics of Systems, concepts and General model of MIS and System analysis
CHAPTER 2: Information and Knowledge Overview: This chapter talks about the role and importance of management, its various approaches and the various functions of the manager.
CHAPTER 3: Introduction to Management Information System Overview: This chapter discusses about the basics of Management Information System
CHAPTER 4: Strategic Management Of Business Overview: This chapter discusses about one of the most important functions of a manager i.e planning which is the first function of a manager.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
31
CHAPTER 5: Development of MIS Overview: This chapter discusses about the long range plans of the MIS.
1. Why do we need information? 2. How do we develop and Implement MIS 3. Write a note on MIS : The factors of Success and Failure 4. Why do we need information? 5. How do we develop and Implement MIS? 6. Write a note on MIS : The factors of Success and Failure
CHAPTER 6: Developing Business/IT Strategies/IT solutions Overview: This chapter discusses about the Planning, Business models, SWOT Analysis, Implementation challenges, Change Management etc
1. What is planning? Explain basic fundamentals of Planning. 2. What is SWOT Analysis? How it is done? 3. How many business models are there? How planning is done in those models? 4. Explain System Development Life Cycle. 5. What is prototyping? Explain System Development prototyping. CHAPTER 7: Business Process Re-Engineering Overview: This chapter discusses about re-engineering i.e re-designing of the information system so as to achieve dramatic improvements of performance, cost, time, quality and service. 1. What is the Process model of the Organization 2. What is the Value Stream model of the Organization? 3. How will you relate MIS and BPR? 4. Give the business process model of an organization and explain its importance in MIS CHAPTER 8: Technology of Information Systems Overview: This chapter discusses about how the new technologies are required for an information system. 1. What is Data Processing, Transaction Processing? 2. What is Application Processing, Information System Processing? 3. Explain the TQM approach to the information system development.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
32
1. Which are the Decision Methods, Tools and Procedures? 2. Write a note on Behavioural Concepts in Decision Making and Organisational Decision Making. 3. Explain Herbert Simon model for decision making with block diagram. 4. Explain with the help of a flow chart, the phases in decision making process. What are DSS
components What is Decision Support System: Concept and Philosophy? 5. What is Artificial Intelligent System and Knowledge based Expert System? 6. What is the difference between Deterministic and probabilistic system? 7. What is DSS and explain the types of DSS 8. Briefly explain the knowledge based expert systems.
Chapter 10: Data Resource Management Overview: This chapter discusses upon as how to manage data sources and here the foundation concepts of data along with types of databases is discussed upon. Also differentiation of dbms vs traditional file processing along with database structure and database development is also being discussed upon here. 1. Discuss about the various types of databases? 2. Discuss upon traditional file processing? 3. Differentiate traditional vs dbms approach? 4. Explain in short about database structure? 5. Describe upon database development?
CHAPTER 11: Electronic Business Systems Overview: This chapter discusses about the various the dimensions of the business activity and how a management system is required to carry out these activities smoothly 1. Explain the components of enterprise business systems. 2. Distinguish between EMS and ERP. 3. Explain about CRM (Customer Relation Management System) 4. Discuss in detail upon ERP? 5. Explain in detail about supply chain management? CHAPTER 12:Enterprise Business systems Overview:-This chapter discusses upon the fundamentals of ecommerce along with the various
applications and issues of e-commerce is also being stressed upon. 1. Discuss upon ecommerce fundamentals? 2. List out in detail the various ecommerce applications and issues?
CHAPTER 9:Decision Making & DSS Overview: This chapter discusses about how decisions making affects the process of conducting business in a given environment.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
33
CHAPTER 13: Client-Server architecture & E-business technology Overview: This chapter discusses about the requirement of a flexible, dynamic, simple to use, technology friendly information systems that meet the business needs. 1. With help of block diagram explain the client-server Technology 2. What are the implementation strategies of Client Server technology? 3. Explain different models of E-business. 4. Explain about Web enabled Business management. 5. What is the impact of Web on Strategic Management? 6. Discuss about web enabled business management? 7. Discuss upon MIS in web environment?
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
34
OPERATIONS RESEARCH
Subject code: 10MCA25 Hrs/ Week: 4 Faculty : Dr .R.CHANDRASEKHAR(Dr.RCS) Total Hrs: 52
Overview: In the present days the availability of resources is not adequate and due to high demand on cost reduction there is always a need for improvement in productivity index. In other words, optimization in the product and/or process development is necessary. This warrants for new techniques / methodology for resource allocation. One such effort is through research on operations and subject of interest is operations research. Operations research, which is concerned with the efficient allocation of scarce resources, is both an art and a science. The art lies in the ability to reflect the concepts efficient and scarce in a well-defined mathematical model of a given situation; the science consists in the derivation of computational methods for solving such models. The subject is divided into parts: mathematical programming and probabilistic methods includes on stochastic dynamic programming, Graph theory, Decision theory, Markov chains and queuing. Deterministic methods in linear, Nonlinear, Integer and Dynamic Programming along with a chapter on network analysis. Since the optimal allocation of money, manpower, energy or a host of other scarce factors is of importance to decision makers in many traditional disciplines.
Class #
Chapter #
Topics to be covered
% of portion to be covered Chapter
wise Cumulative
1 Chapter -1
Introduction & Overview of
the OR Modeling Approach Page No.
1-23
The Origin of Operations Research
5.8 5.8
The Nature of Operations Research The Impact of Operations Research
2 Defining the Problem and Gathering
Data Formulation a Mathematical Model
3 Deriving Solutions from the Model Testing the Model Implementation
4 Chapter -2
Introduction to Linear
Programming Page No.
25-50
The Linear Programming Problem (LPP)- Introduction and formulation
11.5 17.3
5 Methods of solving LPP - Graphical method
6 Methods of solving LPP - Graphical method
7 Special cases of Graphical method 8 Assumptions of Linear Programming 9 Additional examples
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
35
10
Chapter -3 Solving LPP-the
Simplex Method
Page No. 103-149
The Essence of the Simplex Method
23.1 40.4
11 Setting Up the Simplex Method 12 The Algebra of the Simplex Method 13 The Simplex Method in Tabular Form 14 Tie Breaking in the Simplex Method 15 Adapting to Other Model Forms 16 Two-Phase Method 17 Two-Phase Method-Problems 18 Big-M method 19 Big-M method-Problems 20 Post optimality Analysis 21 Post optimality Analysis- Examples 22
Chapter -4 Theory of the
Simplex Method
Page No. 173-200
Foundations of the Simplex Method
7.7 48.1
23 The Revised simplex Method
24 The Revised simplex Method-Examples
25
A Fundamental Insight
26
Chapter -5 Duality Theory
and Sensitivity Analysis
Page No. 209-258
The Essence of Duality Theory
17.4
65.5
27 Economic Interpretation of Duality 28 Primal-Dual Relationships 29 Adapting to Other Primal Forms
30 The Role of Duality Theory in Sensitivity Analysis
31 The Essence of Sensitivity Analysis 32 Applying Sensitively Analysis 33 The Dual Simplex Method 34 The Dual Simplex Method 35
Chapter -6 Transportation
and Assignment Problems Page No. 320-362
The Transportation Problems
11.5 77.0
36 The Transportation Problems
37 A Streamlined Simplex Method for the Transportation Problem
38 The Assignment Problem 39 The Assignment Problem
40 A Special Algorithm for the Assignment Problem
41 Chapter -7 Game Theory
Page No. 659-673
The Formulation of Two-Person, Zero-sum Games
11.5 88.5 42 Solving Simple Games-A Prototype Example
43 Games with Mixed Strategies
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
36
44 Graphical Solution Procedure 45 Solving By Linear Programming 46 Extensions 47 Chapter -8
Metaheuristics Page No. 617-650
The nature of Metaheuristics
11.5 100
48 Tabu Search 49 Tabu Search-Examples 50 Simulated Annealing 51 Genetic Algorithms 52 Genetic Algorithms-Examples
Literature
Book Type
Book Code Title & Author
Publication Information.
Edition Publisher Year
Text Book T1 Introduction to `Operations
Research’ Frederick S. Hiller and Gerald J.Liberman
8th Tata MCGraw Hill 2005
Reference Book R1
Operations Research Applications and Algorithms, Wayne L Winston
4th Thomson Course Technology 2003
Reference Book R2
Operations Research : An Introduction, Hamdy A Taha
8th Prentice Hall India 2007
Test Syllabus Test1: Chapters 1- 3 Test2: Chapters 3- 6 Test3: Chapters 6- 9
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
37
QUESTION BANK
1. Explain the role of computers in OR. 2. Briefly explain various Operations Research? 3. What are the limitations of Operations research? 4. What are the steps involved in operations research? Explain in brief. 5. Define operation research. Explain the characteristics of Operation Research. 6. Define OR. Explain the steps of OR study. 7. Explain the role of computers in OR.
Introduction to Linear Programming
8. A small plant makes two types of automobile parts. Part A and Part B. It buys castings that are machined, bored and polished. You are given the following data:
Capacity Part A Part B Machining Capacity 25/hr. 40/hr.
Boring Capacity 28/hr. 35/hr. Polishing Capacity 25/hr. 25/hr.
Casting for Part A cost Rs.20/- each and for Part B they cost Rs.30/-each. Finished products sell at Rs.50/- and Rs.60/-respectively. The three machine have running costs of Rs.200/-, Rs.140/- and Rs.175/-per hours. Assuming that any combination of part A and part B can be sold, formulate as an LPP and solve graphically )14,12( 21 xx
9. The Prime Insurance Company is introducing 2 new product lines: Special risk insurance and Mortgages. The expected profit is $5/unit on special risk and $2/unit on mortgages. Management wishes to establish sales quota as for the new product lines to maximize total expected profit. The work requirements are
Department Work hours/ unit Work hours available Special risk Mortgage
Underwriting 3 2 2400 Administration 0 1 800 Claims 2 0 1200 Formulate the problem into linear programming problem.
10. Two food products A & B have different quantities of ingredients P & Q which are to be provided in certain quantity. The products also contain another ingredient R, which is harmful if present in excessive quantities. The following table give necessary data.
Ingredient Quantities present A B
Quantities Reserved
Remarks
P 18 06 45 Minimum Q 2 8 32 Minimum R 4 4 40 Maximum
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
38
Cost/Unit In Rs
20 40
11. Consider the following constraints 10;102 2121 xxxx and 02 x . Represent the constraints graphically and clearly show the feasible region. Draw two Iso-Z lines if 21 xxZ . Show the direction of improvement of Z if Z is to be minimized. Find the minimum value of Z. what can be the maximum value of Z?
12. An oil company has 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 and 24 barrels of superfine, medium and low grade oils respectively per week. It costs the company Rs. 1000 and Rs. 800 per day to run the unit 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 and low grade oil per day. The manager has to decide on how many days per week should each unit be operated in order to meet the requirement at minimum cost. Formulate the LPP and solve it graphically.
13. A firm plans to purchase at least 200 quintals of scrap containing high quality metal X and low quality metal Y. It decides that the scrap to be purchased must contain at least 100 quintals of X metal and not more than 35 quintals of Y metal. The firm can purchase the scrap from two suppliers A and B in unlimited quantities. The percentage of X and Y metals in terms of weight in the scraps supplied by A and B is given below:
Metals Supplier A Supplier B X 25% 75% Y 10% 20%
The price of A’s scrap is Rs.200 per quintal and that of B’s is Rs. 400 per quintal. Formulate this problem as LP model and solve it by graphical method to determine the quantities that the firm should buy from the two suppliers so as to minimize total purchase cost.
14. Explain the graphical method of finding solution to a linear programming problem. What are its limitations?
15. Formulate the following linear programming problem . A used car dealer wishes to stock up his lot to maximize his profit. He can select cars A, B and C which are valued wholesale at Rs.50000, Rs. 70000 and Rs 80000 respectively. These can be sold at Rs.60000 Rs.8500 and Rs, 105000 respectively. For each car type, the probabilities of sale are:
16. A Company manufactures radios and calculators.
The radios contribute Rs. 10 /- and the calculators Rs.15/- to profit. Each radio requires 4 diodes and 4 resistors, while each calculator requires 10 diodes and 2 resistors. The radios take 12 minutes and the calculators take 9.6 minutes of time on the company’s electronic testing machine while the project manager estimates that 160 hours of test time are available, there are 8000 diodes and 3000 resistors inventory. Formulate this LPP and hence solve graphically.
17. A farmer has to plant trees of 2 kinds, A & B in a land 4400m2 in area. Tree A requires at least 25 m2
Type of car A B C Prob.of sale in 90 days
0.7 0.8 0.6
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
39
and tree B at least 40 m2 land. The annual water requirement of A is 30 units and B is 40 units per tree, while at most 3300 units of water are available. It is also estimated that the ratio of number of B trees to A trees should not be less than 6/10 and not more than 17/8. The return per tree from A is expected to be 1.5 times as much as B trees. Formulate as an LPP and solve graphically. (x1=60, x2=80)
18. A Company manufactures washing machines and driers. The manufacturing departments and their monthly capacities are as follows:
Department Monthly Washers
Capacities Driers
Motor& Transmission
16000 7000
Stamping 10000 10000 Assembly line for washers
9000 -
Assembly line for driers .
900 1000
If the contribution to profit is Rs.900 per washer & Rs.1000 per drier determine the optimum product mix and profit.
19. a. State the assumptions made in LPP and explain in brief any one of them.
b. A soft drink bottling plant has two machines A and B. Though machines A and B are designed for bottling 8–ounce and 16–ounce respectively. Each machine can be used on both types with some loss of efficiency. The following data is available: Each machine can be run 8- hour per day, 5 days per week. Profit on each 8–ounce bottle is Rs.0.50 and that on 16–ounce bottle is Rs. 0.8. Weekly production of the drink cannot exceed 3,00,000 ounces and the market can absorb 25,000 8–ounce bottles and 7,000 16–ounce bottles per week. The production planner of the bottling plant wishes to plan the production for maximization of profit. Formulate the problem as LPP. c. Solution space identified by a set of constraints is shown in fig. If one more constraint X1+X2 ≥ 3 is to be included, then is there any change in the solution space? If so, show the new feasible zone. With respect to the new feasible zone, state the redundant constraint or constraints if there any .
Machine 8–ounce bottles 16 – ounce bottles A 100 / minute 40 / minute B 60 / minute 75 / minute
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
40
Solving LPP-the Simplex Method
20. a. Explain the terms: i) Basic Solution ii) Basic feasible solution iii) Optional Solution iv) Degeneracy.
b. Solve using simplex method Maximize Z = 3X1+5X2 Subject to constraints X1 ≤ 4, 2X2 ≤ 12, 3X1+2X2 ≤ 18, X1, X2 ≥ 0.
21. Solve the following LPP: Minimize 321 23 xxxZ Subject to constraints 733 321 xxx , 042 21 xx , 10834 321 xxx , 0,, 321 xxx .
22. Solve by simplex method the following LPP: Minimize 21 527 xx ,42 21 xx
632 21 xx where x1, x2 are unrestricted in sign.
23. Solve the following LPP: Minimize 4321 432 xxxxZ Subject to constraints 1532 321 xxx 2052 321 xxx 102 4321 xxxx 0, 4,321 xxxx
24. Maximize 321 432 xxxZ Subject to constraints 1321 xxx
22 321 xxx 423 321 xxx
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
41
0, 21 xx , x3 unrestricted.
25. Solve the following LP problem by graphical method. Maximize 21 35 xxZ Subject to constraints ,1523 21 xx 1025 21 xx 021 xx
26. Solve the following LPP by Big M method. Maximize 321 32 xxxZ , Subject to constraints 532 321 xxx
2052 321 xxx 82 321 xxx 0,, 321 xxx
27. Solve the following LPP using simplex method.
Maximize z 321 523 xxx Subject to constraints: 1 2 32 430x x x 1 33 2 10x x 1 2 3, , 0x x x
28. Solve by Simplex method the following LPP Minimize 21 527 xx Subject to constraints: 42 21 xx 632 21 xx where x1, x2 are unrestricted in sign.
29. With reference to the solution of LPP by simplex method / table. When one can conclude as the problem has i) Unbounded solution and ii) no feasible solution.
30. A company has manufacture circular tops of cans. Two sizes, one of diameter 10cm and other of diameter 20cm are required. They are to be cut from metal sheets of dimensions 20cm by 50 cm. The requirement of smaller size is 20000 and of larger size 15000. How to cut the tops from metal sheets so that the number of sheets used is minimized? Formulate it as a linear programming problem (LPP) and solve.
31. Define ‘Basic feasible solution’. Find all basic solutions for the following problem and
group them into basic feasible solution. Minimize 321 7xxxZ Subject to constraints 102 321 xxx and 0321 xxx
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
42
Write the steps followed to solve the simplex problem.
32. Explain the following. a. Explain degeneracy and unbounded solution with respect to LPP. b. Define (i) Feasible solution (ii) Optimal Solution (iii) Basic Feasible solution. c. Explain (i) Artificial Variable (ii) Duality (iii) Alternate Optimal Solution. d. State the characteristics of the Linear Programming Problem. e. How do you identify that an LPP has non-unique optimal solutions when solving by simplex method?
33. Solve the following LPP using simplex algorithm. 1 2 3. 2 2 5Max z x x x Subject to constraints 1 2 32 430x x x 4603 321 xxx 4204 321 xxx , 0,, 321 xxx .
34. Solve the following LPP using big M Method MaxZ 321 323 xxx Subject to constraints 22 321 xxx 8243 321 xxx 0321 xxx
35. Solve the following LPP using two phase simplex method
Minimize 22 32
15 xxZ
Subject to constraints 33 321 xxx 2321 xxx 0321 xxx
36. Explain in brief the term ‘Artitificial variable’ used in Big-M-Method.
37. Solve the following LPP using big M Method
MinimizeZ 21 32
15 xx
Subject to constraints 33 321 xxx 2321 xxx and 0321 xxx
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
43
38. Solve the following LPP by Big M method. Max Z= 321 32 xxx Subject to constraints
0,,82
2052532
321
321
321
321
xxxxxx
xxxxxx
Duality Theory and Sensitivity Analysis
39. Write the dual of
1 2 3. 3 4 3Max z y y y Subject to constraint s 1 2 33 4 2y y y 1 2 33 2 1y y y 1 2 3, , 0y y y
40. Find the dual of :
Maximize z =3 x1 + x2
Subject to constraints x1 ≤ 4 2x2 ≤ 12 3x1 + 2 x2 ≤ 18, x1, x2≥ 0.
41. Solve by Dual Simplex method Minimize z= 4321 423 xxxx Subject to constraint 10542 321 xxx 2273 4321 xxxx 15625 4321 xxxx 0,,, 4321 xxxx
42. Solve the following LPP by Dual simplex method.
Minimize z = 3X1 + 2X2. Subject to constraints 3X1+X2 ≥ 3 4X1 + 3X2 ≥ 6 X1+X2 ≤ 3. X1, X2 ≥ 0
43. Write the dual to the following problem and hence solve by dual simplex method.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
44
Maximize z= 321 3xxx Subject to constraints 10321 xxx 22 31 xx 6322 321 xxx 0,, 321 xxx
44. Solve the following problem either by Big method or by dual simplex method.
Minimize 321 422 xxxz Subject to constraints 2532 221 xxx 373 321 xxx 564 321 xxx
45. Find the solution of the following LPP by solving the dual problem
Maximize 21 32 xxz Subject to constraints 44 21 xx 3065 21 xx 305 21 xx
1521 xx , 101 x , 72 x , )0,( 22 xx 46. Solve by Dual simplex method
Minimize 4321 423 xxxxz Subject to constraints 10542 4321 xxxx 2273 4321 xxxx 24625 4321 xxxx 0, 4,321 xxxx Solve the dual of the above by dual simplex method.
47. Apply Dual simplex method to maximize Z = - 4y1-12y2-18y3 Subject to constraints y1+3y3 ≥ 3 2y2+2y3≥ 5, y1, y2, y3 ≥ 0.
48. Solve by revised simplex method Maximize Z= 6X1-2X2+3X3 Subject to constraints
3X1-X2+2X3+2X3 ≤ 2 X1+4X3 ≤ 4 X1, X2, X3 ≥ 0.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
45
Transportation and Assignment Problems
49.A Company has factories at A,B, and C, while supply ware houses are at D,E,F andG. Monthly factory capacities are 160, 150 and 190 units respectively. Monthly warehouse requirements are 80, 90, 110 and 160 units respectively. Unit shipping costs are given in the table (in Rs). Determine the optimum distribution for this company to minimize shipping costs.
TO D E F G A 42 48 38 37 B 40 49 52 51 C 39 38 40 43
50. There are four territories I,II,III and IV and there are four salesman A,B,C and D. Annual sales in territories I, II, III and IV are Rs.60,000-00 (6 in units of Rs.10,000),Rs. 50,000-00 (5 in units of Rs.10,000-00), Rs.40,000-00 ( 04 in units of Rs.10,000-00) and Rs.30,000-00 (03 in units of Rs.10,000-00) respectively. The sales proportions of A,B,C and D are 7,5,5 and 4 respectively. The effectiveness matrix ix given below.
Sales proportions
6 5 4 3 (sales in Rs.10,000-00)
I II III IV 7 A 42 35 28 21 5 B 30 25 20 15 5 C 30 25 20 15 4 D 24 20 16 12
Determine how the territories should be assigned to salesmen so that the sale is maximized 51. The child fair company has 3 plants producing child push chairs that are to be shipped to 4 distribution centres. Plants 1, 2 & 3 produce 12, 17, 11 shipments /month. Each distribution centre needs to receive 10 shipments / month. The distances (miles) from each plant to the respective distribution centre is as follows: Distribution Centre
Plant
1 2 3 4 1 800 1300 400 700 2 1100 1400 600 1000 3 600 1200 800 900
The freight cost for each shipment is $100 plus 5 cents/unit. Obtain optimal solution.
52. Solve the following assignment problem. The data given in the table refer to production in certain units. Operator
Machine A B C D
1 10 5 7 8
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
46
2 11 4 9 10 3 8 4 9 7 4 7 5 6 4 5 8 9 7 5
53. A company has three factories at Amethi, Baghpat and Gwalior and four distribution centers at Allahabad, Mumbai, Kolkata and Delhi. With identical cost of production at the three factories the only variable cost involved is transportation cost. The production at three factories is 5,000 tonnes respectively. The transportation costs per tonne from different factories to different centers are given below. Suggest the optimum transportation schedule and find the minimum cost of transportation.
54. Solve the following assignment problem. A B C D E
P 3 8 2 10 4 Q 8 7 5 6 9 R 7 8 4 9 6 S 8 6 3 5 7
55. Find the optimal assignment for the following problem:
I II III IV V 1 11 17 8 16 20 2 9 7 12 6 15 3 13 16 15 12 16 4 21 24 17 28 25 5 14 10 12 11 15
56. Find the optimal solution for the assignment problem with the following cost matrix.
I II III IV V A 11 17 8 16 20 B 9 7 12 6 15 C 13 16 15 12 16 D 21 24 17 28 26 E 14 10 12 11 15
On a given day district head quarters has the information that one ambulance is stationed at each of the
Factory Distribution centers Allahabad Mumbai Kolkata Delhi Amethi 3 2 7 6 Baghpat 7 5 2 3 Gwalior 2 5 4 5
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
47
five locations A, B, C, D and E. A dispatch order is to be issued for the ambulance van to reach 6 locations, Viz, I,II,III,IV,V and VI one each. The distance (Kms) between present locations of ambulance vans and destinations are given in the table below. State the transportation problem in general terms and explain the conditions to solve the problem. 57. Goods are to be supplied from warehouses W1, W2, W3 to six customers C1, C2, C3, C4, C5, and C6. The availability at the warehouses are 100,120 and 150 units respectively. While the demands of customers are 50, 40, 50, 90, 60 & 80 units respectively. The unit costs of transportation are given in the following table.
Ware House
Customer C1 C2 C3 C4 C5 C6
W1 15 25 18 35 40 23
W2 22 36 40 60 50 38
W3 26 38 45 52 45 48
(a) Develop an optimum transportation schedule and given transportation cost. List possible to have more than one optimal schedule? If so at least one more optimum schedule. 58. A private firm employs typists on hourly piece rate basis for their daily work. 5 typists are working in that firm and their charges and speeds are different. On the basis of some earlier understanding only one job is to be given to one typist and the typist is paid for full hours even when he / she works for a fraction of an hour. Find least cost assignment. Typist Rate /
hour Number of pages /hour
Job
Number of pages
A 5 12 P 199 B 6 14 Q 175 C 3 8 R 145 D 4 10 S 295 E 4 11 T 178
59. Solve the following assignment problem. The data given in the table refer to production in certain units. Operator
Machine A B C D
1 10
5 7 8
2 11
4 9 10
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
48
3 8 4 9 7 4 7 5 6 4 5 8 9 7 5
60. Suggest the optimum transportation schedule and find the minimum cost of transportation. 61. Find the optimal assignment for the following problem :
I II III IV V 1 11 17 8 16 20 2 9 7 12 6 15 3 13 16 15 12 16 4 21 24 17 28 25 5 14 10 12 11 15
62. Solve the following transportation problem. The demand at destination 1 must be shipped only form source 4. D1 D2 D3 Availability
S1 5 1 0 20 S2 3 2 4 10 S3 7 5 2 15 S4 9 6 0 15
Requirement 5 10 15 The entries in the table give the cost of transportation one unit from source S1 to destination. Differentiate between a transportation problem and an assignment problem. 63. A machine operator processes five types of items on his machine each week and must choose a sequence for them. The setup cost per change depends on the item presently on the machine and the setup to be made according to the following table:
To items A B C D E From A ∞ 4 7 3 4 B 4 ∞ 6 3 4 Item C 7 6 ∞ 7 5 D 3 3 7 ∞ 7 E 4 4 5 7 ∞ If he process each type of item once and only one each week, how should he sequence the items on his machine in order to minimize the total setup cost?
Game Theory
64. The following matrix represents the pay off of P1. Find the optimal strategy of both and the value of the game
1 2 3 4 1 3 2 4 0 2 3 4 2 4 3 4 2 4 0 4 0 4 0 8
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
49
65. Explain the following: a) Pure Strategy b) Mixed Strategy c) Saddle point
66. Solve the following 2 x 3 game
B
A I II III I 1 3 11 II 8 5 2
67. Solve the following 2 x 4 game
B
A
I II III
IV
I 2 2 3 -1 II 4 3 2 6
68. a. In a game of matching coins, player ‘A’ wins Rs 8, if both coins show heads and Rs. 1 if both are tails. Player B wins Rs 3 when coins do not match. Given the choice of being player A or Player B, which would you choose and what would be your strategy? b. Solve the following game:
69. Solve the game whose pay off matrix is given below.
B
A I II III III I 2 2 3 -1 II 4 3 2 6
70. Reduce the following game by dominance to 2 x 4 & hence solve graphically
8 15 -1 -2 19 15 17 16 0 20 15 5
B
A
I II III
IV
1 20
15
12
35
2 25
14 8 1
0 3 4
0 2 19 5
4 5 4 11 0
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
50
71. Use minimax criterion to find the best strategy for each player. Does this game have a saddle point?
72. Solve the game
1 2 3 4 5 I -2 0 0 4 3 II 4 2 1 5 5 III -4 0 0 2 6 IV 5 2 -5 -3 -6
73. Explain (i) pure strategy ii) Two person zero-sum game iii) Mixed strategy 74. Explain the principles of Dominance 75. What are the basic assumptions made while solving problems in the game theory? 76. Explain clearly Min-max and Max-Min principle. 77. Explain the criterion of dominance of strategy in a game. 78. Solve the following transportation problem. The demand at destination 1 must be shipped only from source 4. D1 D2 D3 Availability
S1 5 1 0 20 S2 3 2 4 10 S3 7 5 2 15 S4 9 6 0 15
Requirement 5 10 15
79. Explain the principle of dominance in Game Theory and solve the below game.
80. Find minimal spanning tree for the graph
Player II
Player I
1 2 3 4 1 3 -3 -2 -4 2 -4 2 -1 1 3 1 -1 2 0
8 10 9 14 10 11 8 12 13 12 14 13
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
51
With constraints i) Link AD can be included only if DE is included ii) At most one of 3 links AD, CD & AB can be included.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
52
COBOL PROGRAMMING LABORATORY
Subject code: 10MCA26 Hours/Week: 03 Faculty: Prema Latha H M
1. Write a program for the following a. Valuate 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 14 questions.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
53
DATA STURUCTURES USING C LABORATORY
Subject code: 10MCA27 Hours/Week: 03 Faculty: Mrs. A. Lekha 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 arithmet ic expression to postfix expression. The expression consists of single character operands and the binary operators + (puls), - (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:
a) insert b) delete
c) display 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 fm the 1st queue, if it is not empty.
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
54
8 Write a 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 : at the front of the list, at the back of the list and at any position of 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. Search a node based on student id and update the information content. If the specified node is not present an error message should be displayed.
d. Display all the nodes in the list. 9 Write a 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 program using dynamic variables and pointers, to construct a singly linked list to perform the operations of a stack of integers :
a. Push b. pop c. display
The program should print appropriate messages for stack overflow and stack empty. 11 Write a 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 a 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 d. message e. Display the content of the list
12 Write a C program to: a. To construct a binary search tree of integers, b. To traverse the tree using all the methods i.e. in order, 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
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
55
OOP with C++ Laboratory
Subject code: 10MCA28 Hours/Week: 03 Faculty: Sec: A: Mrs. Neelam Bawane & Sec B: Dr. D.Uma 1. Given that an EMPLOYEE class contains the following members:
Data Members: Employee_number, Employee_name, Basic, DA, IT, Net_Sal 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 both s1 and s2 are complex numbers.
4. 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).
5. 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 results by overloading the operators <<. Also display the values of h and y. 6. 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.
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
Course outline Semester: II Session: Feb 2012 – June 2012
_____________________________________________________________________________________ Perseverance Excellence Service
56
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. 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 a 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.
9. 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. 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 these member functions, implement a queue of integers and double. Demonstrate the operations by displaying the content of the queue after every operation.
11. 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.
12. 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 and delete a node from a specified position of the list. Demonstrate the operations by displaying the contents of the list after every operation.
13. Write a C++ program to create a template function for Quick sort and demonstrate sorting of
integers and doubles.
14. Write a C++ program to create a class called BIN_TREE (Binary tree) with member functions to perform in-order, pre-order and post-order traversal. 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.