II Sem - Course Information - 2012

Course outline
Semester: II
Session: Feb 2012 June 2012
PES Institute of Technology

Department of MCA
GENERAL GUIDELINES
1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
11.
12. 13. 14. 15. 16. 17. 18. 19.
The course information is to be brought to the classroom daily. Students should be in time for the first class and subsequent classes thereafter. Students should keep the classroom and Laboratories clean and tidy. Students are informed to clarify their doubts in the respective subjects with the faculty by taking prior appointments. Students are advised to show due respect to all faculty regardless of the department and maintain affable personality. Students are to maintain absolute discipline and decorum, so as to promote the fair name of their college in all its activities. Students having less the 85% attendance in any subject (both Theory and Practical) will not be allowed to take up the university examination. 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. Parents are to follow the progress of their wards by being in touch with the college authorities at regular intervals. 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 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. Students should bring the observation book as well as the laboratory record book completed in all respect to the laboratory. Take the print outs of the source listing and output of the code after execution and delete your files. Students are not supposed to alter the configuration / any software on the system. Final examination is of 3 hours duration. Students are supposed to fill details in the LOG BOOK at the time of entering and leaving the lab. 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. Those students who have less than 85% attendance should sign the undertaking given by their class teachers from time to time. Students are not allowed to bring the mobile phones and Ragging is strictly prohibited in the campus.
1 _____________________________________________________________________________________ Perseverance Excellence Service
Course outline
Semester: II
II SEMESTER PROGRAMME STRUCTURE Sub Code 10MCA21 10MCA22 10MCA23 10MCA24 10MCA25 10MCA26 10MCA27 10MCA28 MARKS SUBJECT Business Data Processing with COBOL Object Oriented Programming with C++ Data Structures Using C Management Information Systems Operations Research COBOL Programming Laboratory Data Structures using C Laboratory Object Oriented Programming with C++Laboratory Total IA 50 50 50 50 50 50 50 50 400 UE 100 100 100 100 100 50 50 50 650 Total 150 150 150 150 150 100 100 100 1050 Page # 3-11 12-18 19-25 26-33 34-51 52 53-54 55-56
Sl. No. 1 2 3 4 5 6 7 8
Time Table
Day/Time Monday
8:159:15
9:1510:15
10.1510.45
10:4511:45
11.4512.45
12.451.30
1.302.30
02.3003.30
Wednesday Thursday Friday Class Teacher II A Mr. Srikanth V II B Mr. Tamal Dey
Lunch Break
Tuesday
Tea Break
Course outline
Semester: II
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 % of portions to be Class Chapter # Topic to be covered covered # Chapter Cumulative wise 1 An introduction to structured design in COBOL : 2 The nature of COBOL, A history of COBOL and their ANS versions 3 The Identification and Environment divisions: Basic 23.1 23.1 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 Chapter 1 : 7 The file sections of the data division, types of data The Basics 8 The working-storage section of the data division Page 2-100 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 Moving data, printing info and displaying output interactively: The instruction formats of the MOVE Chapter 2 II: statements. Designing 14 Numeric MOVE, non-numeric or alphanumeric MOVE, structured other options of the MOVE statements. programs 15 Producing printed output and screen displays, Page: 130-322 32.7 55.8 16 displaying output interactively using screen i/p & o/p
Course outline
Semester: II
17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
Chapter 3: Writing High Level COBOL programs Page:360-437
41 42
Chapter 4: File Maintenance Page 520- 597
43 44 45
Discussion of an interactive solution to programming assignments Computing in COBOL: The basic arithmetic verbs Options available with arithmetic verbs, the compute statements. Use of signed numbers in arithmetic operations, intrinsic functions Decision making using the IF and EVALUATE statements: selection using a simple IF statements. Selection using other options of the IF statements. Using IF statements to determine leap years Condition names, EVALUATE statements. Iteration: the simple PERFORM revived Iteration using other types of PERFORM Using nested PERFORM VARYING statements. The perform with test option. Array processing and table handling An introduction to single level Occurs clauses Processing data stored in an array Using an occurs clauses for table handling use of the search statements for table and array processing Contd.. The search varying option, The search all statements. Multiple-level occurs clause Sequential file processing: systems overview of sequential file processing Sequential file updating-creating new master file using a previous master file & transaction file Validity checking in update procedures, Update procedures with multiple transaction records for each master record The balanced line algorithm for sequential file updating. Sequential file updating- reviewing records on disk The rewrite statement for a disk file opened as I-O, using an activity status field for designing records to be deleted The EXTEND option for adding records to the end of a sequential file, File management tips, Matching files for checking purposes, Interactive updating of a sequential file Sorting and Merging: the sort feature on overview,
15.4
71.2
23.1
94.3
Course outline
Semester: II
46 47
48 49 50 Chapter 5 : Advanced Topics Page:650-703
51 52
Processing data before AND/OR after sorting, the merge statements. Indexed and relative file processing: systems consideration for organizing disk files, features of magnetic disks and disk drives Processing indexed disk files, additional options for indexed file processing Processing relative disks files, Converting a key filed to a relative key Improving program productivity using a COPY, CALL and other statements: COPY statements , CALL tatements, Text Manipulation with the STRING and UNSTRING statements Report writer module: The benefits of report writer module, the report section in the data & procedure division statement.
5.7
100
LITERATURE: Book Type Book code Text Book Reference Books Reference Books Reference Books Test Syllabus Test 1: Chapter 1, 2 Test 2: Chapter 2, 3 Test 3: Chapter 4, 5 T1 R1
Title and Author Structured COBOL Programming , Nancy Stern & Robert A Stern Chapters: 1 to 4, 6 to 9, 12 to17 COBOL Programming Including MS-COBOL and COBOL-85 M.K.Roy & D Ghosh Dastidar Structured COBOL Programming Gary B Shelly. Thomas J Cashman. Roy O Foreman David M.Collopy: Introduction to COBOL, A guide to Modular Structure Programming
Publication Specification Edition Publication Year 11th 2nd 2nd John Wiley & Sons Tata-McGraw Hill Thomson Course Technology Pearson Education 2006
2001 1999
R2
R3
2000
Course outline
Semester: II
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. 2 3 4 5 6 7 8 9 10 11 12 13 14 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. What does COBOL stands for? Why COBOL is Popular Language? With Suitable Syntax and Example, Explain COBOL divisions. COBOL is High Level or Low level Programming Language? Justify? Mention advantage and Disadvantage of COBOL Programming Language? Describe the special features of COBOL ,that made it more suitable for business applications Has the COBOL a weak structure? Justify your statement with two instances. Discuss the coding sheet format for a COBOL program. Explain different divisions of COBOL indicating the mandatory and optional entries. 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. Give the character set of COBOL. Explain the following with example. COBOL words , Data names & Identifiers , Literals Describe various types of literals used in COBOL with examples. What is a data name? List the rules followed to device data names. What are the advantages of figurative constants? List different figurative constants used in COBOL. Explain Continuation of lines with Different notations What is the major purpose of the file section in Data Division? What is a level number? Explain with examples? Name the two sections that can be written in the Data Division? Explain the difference between group and elementary data item? What is the purpose of the picture clause? Explain two different types of picture clauses? What is the of working storage section in data division? What picture clause to use to represent numeric, alphabet and alphanumeric data type? What are the different ways you can assign values to data names? What is the purpose of FD Entry? What is the difference between paragraph name and data names? What is meaning of the clause label records are omitted / standard? What are the different types of picture clause available in COBOL? Explain with example. 1) blank 2) dollar 3) floating picture clause Illustrate with example, clarify when $, +, - characters can be used as i) insertion characters ii) floating characters. What is the purpose of value clause in the file section? Explain the purpose through an example. What is the function of SPECIAL-NAMES paragraph? What is the purpose of MEMORY SIZE clause? What is a mnemonic name?
Course outline
Semester: II
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. 2. 3. Explain the difference between varying and varying after option with an example Explain condition names condition with examples and list its advantages and disadvantages. Describe the format and use of relation condition used in conjunction with IF statement.
Course outline
Semester: II
4. 5. 6. 7. 8. 9. 10. 11. 12.
13. 14. 15. 16. 17. 18. 19. 20. 21. 22.
Explain SCREEN section Explain Intrinsic functions List the various types of perform statements. Explain any three of them with syntax and examples. Explain the IF statement with example. Explain negated simple conditions with examples Explain the following. 1)COMPOUND CONDITION 2) SIGN CONDITION Write a COBOL program to find roots of quadratic equation Write a program to find the difference between two given dates. 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? Write a COBOL program to find largest of and second largest of 3 numbers? 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. Write a COBOL, program to reverse a given number? Write a COBOL program to find a give number is even or odd? Write a COBOL program to find sum of n digits using perform statements? Write a COBOL program to find a input date of the form dd/mm/yyyy is valid or not ? What is a decision table. What is its importance in program development? Write a COBOL program to reverse a given number by using perform statement. Write a COBOL program a find the sum of the OOD numbers from 1 to 100 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. 2. 3. 4. 5. 6. 7. 8. Explain the syntax of SERACH, SET verb with an example? Explain the method of assigning value to table elements with an example? What is the purpose of usage in index clause? Is index and index data items can directly refereed in SET, SERACH and PERFORM statement ? Justify with an example? What are the difference among a subscript, an index and an index data items ? Write a Cobol program to find two dimensional addition using occur clauses? Explain OCCURS clause with DEPENDING ON option. Write a COBOL program to perform matrix multiplication.
Course outline
Semester: II
9. 10. 11. 12. 13. 14.
What is table element? Illustrate how two and three dimensional tables can be constructed using OCCURS clause. Describe with structure and example the sequential search statement. Explain the use of table handling in business data processing Write COBOL program to search a given key element in a table. Display the appropriate message. 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. 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. 2. 3. 4. 5. 6. 7. What is the purpose of the file-control paragraph of the COBOL program? Define file? Mention the different type of file organization? Explain the following Master file -Program file -Transaction file-Data file, Mention advantage of sequential file? Explain the different modes of file operation? Explain the following with respect to sequential file: open, input , output , extend What is the purpose of advancing clause in write statement in COBOL? Explain with an example? 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 .? Write a COBOL program to create a student -file which has the following record description Column contents numbers 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
8.
Course outline
Semester: II
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. 2. 3. 4. 5. 6. Explain the usage of INVLID KEY phrase on a relative file & indexed file. What is an indexed file. How it is specified in a program. How many ways can the records of a indexed file be accessed. How useful is relative organization compared to indexed organization How can we update a relative and an indexed file. What is the purpose of ALTERNATE RECORD KEY clause 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. Explain procedure division statements for relative file Explain the syntax of REWRITE and DELETE verb by writing a COBOL interactive program to update an indexed file? Write a COBOL program to access a Customer record randomly by prime key ( ACC-NO ) or Alternative Key ( Name ) What are the advantages of using an index file? Write and explain the syntax of rewrite statements w.r.t. index file ? 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) Discuss the structure and uses of various clauses to be defined in FILE CONTROL paragraph for an indexed sequential file.
7.
8. 9. 10. 11. 12. 13. 14.
Course outline
Semester: II
15. 16. 17. 18.
Discuss a hashing routine to insert and retrieve records from a hash file. Explain the progressive overflow technique used to resolve collision of relative key address. Explain the procedure used to add records in indexed sequential file organization 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
OBJECT ORIENTED PROGRAMMING WITH C++ Subject Code: 10MCA22 Faculty: Sec: A: Mrs. Neelam Bawane & Sec B: Dr. D.Uma 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. Hours / Week: 04 Total Hours: 52
Class #
Chapter #
Topics To be Covered
% of portions covered Chapter Cumulative wise
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Overview of C++, Sample C++ program Different data types, operators, expressions, and statements T1: Arrays and strings, pointers & user-defined Page #: 255-262, 13-14, types 35-52, 137-142, Function components, argument passing Inline functions, function overloading 153, 275 Recursive functions Chapter 2: Class specification, Class objects Classes & Scope resolution operator, Access members Objects Defining member functions, Data hiding, T1: Constructors, Destructors Page #: Parameterized constructors 289-324 Static data members, Functions Friend functions Passing objects as arguments Returning objects, Arrays of objects, Dynamic objects, Pointers to objects Copy constructors, generic functions and classes, Applications Operator overloading using friend functions such as +, -, pre-increment, post-increment, [] etc. Overloading <<, >>
Chapter 1: Introduction
12
12
27
39
Course outline
Semester: II
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
Base class Inheritance and protected members Inheritance and protected members T1: Protected base class inheritance Page #: Protected base class inheritance 417-437 Inheriting multiple base classes; Constructors, Destructors and Inheritance, Passing parameters to base class constructors Passing parameters to base class constructors Granting access Virtual base classes Virtual base classes Chapter 4: Virtual function Calling a virtual function through a base class Virtual reference Functions, Polymorphism Virtual attribute is inherited Virtual functions are hierarchical T1: Pure virtual functions, Abstract classes Page #: Using virtual functions 443-458 Early and late binding Chapter 5: C++ stream classes I/O System Formatted I/O Basics, File I/O I/O manipulators T1: fstream and the File classes Page #: 509-563 File operations File operations Chapter 6: Exception handling fundamentals Exception Exception handling options Handling, STL STL: An overview T1: Containers Page #: Vectors 629-695 Lists Maps
Chapter 3: Inheritance
23
62
13
75
12
87
13
100
Course outline
Semester: II
Literature: Book Type Text Book Reference book Reference book Reference book Test Syllabus Test 1: Chapters 1, 2 Test 2: Chapters 2, 3, 4 Test 3: Chapters 4, 5, 6 R3 R2 R1 Book Code T1 C++ The Complete Reference Herbert Schildt C++ Primer , Stanley, B. Lippman and Josee Lajore C++ for Programmers, Paul J Deitel, Harvey M Deitel Mastering C++, K R Venugopal, Rajkumar and T. Ravi Shankar 4th Addison Wesley Pearson Education TMH 1999 2009 2005 Title & Author 4th Publication Info Edition Publisher TMH Year 2003
Course outline
Semester: II
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
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
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
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
DATA STRUCTURE USING C Subject code: 10MCA23 Faculty : Mrs. A. Lekha Hours / Week: 04 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 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 Chapter 2 : Arrays and Structures T1: Page #: 051086 Chapter Topics to be Covered Working with Pointers Dynamic Memory allocation with examples Dynamic Memory allocation with examples Introduction to Algorithms, Algorithm Specification, Properties of an Algorithm Problem solving, Recursive algorithms, Performance Analysis of Algorithms Performance analysis and Measurement Introduction to Data Structures, Abstract Data Types Array as an abstract data type, Single dimensional array representation, 2D array representation 3D array representation, multidimensional array representation Array address computation sparse matrices, Polynomials Stacks as abstract data type, Stack representation using arrays, Recursion Recursion Expression Evaluation Infix to suffix Queue as an Abstract data type Linear queue, circular queue Multiple stacks and queues Sequential Allocation vs Dynamic Allocation, Linear Singly Linked List Polynomial representation, Sparse Matrices % of portion covered Chapter Cumulative wise
Chapter 1 : Basic Concepts T1: Page #: 001-050
15.34
15.34
11.53
26.92
Chapter 3: Stacks and Queues T1: Page #: 107144 Chapter 4 : Linked Lists T1: Page #:
11.53
38.46
11.53
50
Course outline
Semester: II
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
Equivalence Classes Circular Linked List Doubly Linked List Representation of Trees Binary Trees - ADT Binary tree Traversals Inorder, Preorder Postorder Traversal, Iterative traversal Threaded Binary Trees Chapter 5 Traversal, Inserting Nodes Trees and Heaps Priority Queues Max Heap Operations Graphs T1: Page #: Binary Search Trees - Operations 191 -211, 216- Binary Search Trees - Operations 264, 265-279 Selection Trees Forests Representations of Disjoints Sets Counting Binary Tees Counting Binary Tees Graph - ADT Single and Double ended queues Chapter 6 Leftist Trees Height Biased Trees Priority Weight Biased Tress Queues Binomial Heaps - Definition T1: Page #: Binomial Heaps - Operations 422 - 458 Fibonacci Heaps Parsing Heaps Chapter 7 Optimal Binary Search Trees Efficient AVL Trees Binary Search Trees Red Black trees T1: Page #: Splay Trees 481-531
145 -190
23.07
73.07
11.53
84.61
15.38
100
Course outline
Semester: II
Literature: Book Type Text Book Book Code T1 Title and Author Data structures using C and C++ By Yedidyah Langsam Moshe J. Augenstein and Aaron M. Tenanbaum Data Structures and Algorithm Analysis in C By Mark Allen Weiss Data Structures - A Pseudo code Approach with C By Richard F Giberg and Behrouz A Forouzan Publication Information Edition Publisher 2nd Pearson Education Asia Pearson Education Asia Thomson Course Technology
Year 2002
Reference Book Reference Book
R1
2nd 3rd
1997
R2
2005
Test Syllabus: Test 1 : Chapter 1, 2, 3 Test 2 : Chapter 4, 5 Test 3 : Chapter 6, 7
Course outline
Semester: II
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 Mention the functions used for finding out the memory size of a data element and to 1 dynamically allocate required memory. Define Data Structures. 2 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 What is an ADT? Explain this concept with the help of ADT RATIONAL. 1 2 Which are the different storage classes? Explain the scope of each with example. Explain union data type. How does it differ from a structure data type? 3 What is Dynamic Memory Allocation? What are the functions that support Dynamic allocation in 4 C. Give an example of each. Which are the different storage classes of variables? Explain the scope of each with examples. 5 What are register variables? Where are they used? 6 What do you mean by dynamic memory allocation? Mention the different functions used for 7 this. Explain call - by - value and call - by - reference methods. Give an example for each. 8 Write a short note on enumerations. 9 Explain how to pass arrays as parameters to functions. 10 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 What is a stack? Mention the operations that are performed to push all elements on to a stack 1 and remove an element from a stack. Give the C code for the implementation of these operations. Explain clearly the method to convert an infix expression to postfix form. Write a C function that 2 does this. Define stack. List the primitive operations on stack and also write C implementation of these 3 operations. Write an algorithm for evaluating a postfix expression. Trace the algorithm on the following 4 string indicating the contents of stack. 623 + - -382 /+ *2$3+ If an input character string is of the form x C y, where x is a string consisting of letters 'A' and 5 '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. Given the following expressions give their postfix and prefix forms. 6 1. (A + B) * (D - C) 2. X$Y * Z - M + N + P /Q /(R +S).
Course outline
Semester: II
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 Write a C Program to perform the following operation on stack i) Push ii) Pop iii) Display 9 What are the restrictions in the tower of Hanoi game problem? Write a C recursive program to 10 solve the towers of Hanoi problem. Give the trace for 3 disks. Write a recursive C program for binary search. 11 Comment on the efficiency of recursive routines. 12 Express the following C function without using recursion. Write the appropriate main to call the 13 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. Write a recursive C function to find the nth Fibonacci numbers. Trace the program for n = 6. 15 Write a recursive program to find GCD of two numbers. 16 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
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. What are non homogeneous lists? How are they represented? 3 Explain how linked lists can be used to implement stacks and queues? Give implementations for 4 the same. Write a C routine to delete all the nodes whose information field contains the value x, from a 5 singly linked list. What is a circular list? What are the advantages of circularly linked list over a linear list? Write a 6 C routine that concatenates two circular lists Explain how an ordinary queue can be represented using a linked list. Give algorithms for 7 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. State any two advantages and any two disadvantages of linked lists over arrays. 9 Explain merging of two lists which have been represented in i) Array and ii) Linked List. 10 Give a C program to interchange the mth and nth elements of a Doubly Linked List. 11 Write a C routine to find the sum of all the elements in the singly linked list 12 Write a C function to insert and delete a node from the front end in case of doubly linked list 13 What are the advantages and disadvantages of doubly linked list? Also give its applications 14 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. Explain the different methods of binary tree representation. 1 What is a binary tree? With a suitable example explain the three tree traversal methods 2 Mention different types of binary trees and explain any two of them clearly. 3 Short Notes: Implicit array representation of a binary tree 4 Short Notes: Threaded binary trees 5 Define Graphs. Explain the different representations of graphs. 6 Explain how graphs can be represented in C. 7 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 8 L Draw the tree. What are the two different traversal methods for graphs? Explain with an example. 9 Write an algorithm for deleting a node in a binary search tree for all the three cases 10 Explain binary tree searching method. How can an item be inserted into a binary if it does not 11 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 1
Course outline
Semester: II
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? 13
Course outline
Semester: II
MANAGEMENT INFORMATION SYSTEMS Subject code: 10MCA24 Faculty : V.SRIKANTH
Hours / Week: 04 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. % of portions to be covered Class Chapter # Topics to be covered Chapter Cumulative # wise 1 System concepts, system control, types of systems, handling system complexity Chapter 1: 2 Systems Classes of systems, General Model of MIS, 7 7 Engineering Need for System analysis T1:Page 176-214 System analysis for existing system and new 3 requirements, system development model 4 MIS & System Analysis Information concepts and classification of 5 information Methods of data and information collection, Chapter 2: 6 Information and value of information 7 14 Knowledge Information-a quality product, General model 7 T1:Page 149-168 of a human as information processor Knowledge and difference between 8 information and knowledge 9 MIS Concept, Definition, Role of MIS Impact of MIS and the user, Management as a Chapter 3: 10 control system, support to the Management Introduction of 7 21 MIS T1:Page 3 - Management effectiveness and MIS, 11 22 Organization as a system 12 MIS: Organization effectiveness The concept of Corporate Planning 13 Essentiality of Strategic Planning Chapter 4: Development of the Business Strategies Strategic 14 Management Of Types of Strategies 7 28 15 Short-range Planning Business T1:Page Tools of Planning 54-76 MIS: Strategic Business Planning
Course outline
Semester: II
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
Development of Long range Plans of MIS Ascertaining the Class of Information Chapter 5: Determining the Information requirement Development of MIS T1:Page 278 - Development and Implementation of MIS 300 Management of Information Quality in MIS Organization for the Development of MIS, MIS Development process model Planning Fundamentals (Real world Cases) Organizational Planning, Planning for competitive advantage, (SWOT Analysis) Chapter 6 Business models and Planning, Business/IT Developing Planning, identifying business/IT strategies Business/IT Implementation challenges, Change Strategies/IT Management, Developing Business systems solutions T2:Page (real world cases) 363 - 413 SDLC, prototyping, System development process Implementing business system Introduction, Business Process Chapter 7: Process model of the Organization, Value Business Process Stream model of the organization, What Re-Engineering delays the business process T1:Page 323 - 339 Relevance of information technology, MIS and BPR Introduction Data Processing, Transaction Processing Chapter 8: Application Processing, Information System Technology of Processing Information System T1:Page TQM of Information Systems 519 548 Human Factors and User Interface, Strategic nature of IT decisions MIS choice of information technology Decision Making concepts, Decision making process, decision making by Chapter 9: analytical modeling , Behavioral Concepts in Decision Making Decision Making & DSS T1: Page Organizational Decision Making 129-144, T2 : Page Decision structure, DSS components, 316-323 Management reporting alternatives
11
39
11
50
55
11
66
73
Course outline
Semester: II
42
Chapter 10: Data Resource Management T2 : Page 138-163
43 44 45 46 Chapter 11: Electronic Business systems T2 : Page 211-270
Managing Data sources, Foundation concepts of data, types of databases, Traditional File Processing DBMS approach, Database Structure, Database development Enterprise Business systems- Introduction, cross functional enterprise applications, real world cases Functional Business systems introduction, marketing systems, sales force automation CIM, HRM, online accounting system Customer Relationship Management ERP, Supply Chain Management (real world cases of the above) Electronic Commerce Fundamentals
77
83
47
48 49 50 51 52
e-commerce applications and issues(real world cases) Client Server Technology and Implementation strategies Chapter 13: Introduction to E-business Client Server Architecture and Models of E-business, Internet and World wide web E-Business Technology Intranet/Extranet, Electronic Payment System, T1:Page 596 608, Impact of Web on Strategic Management 644 - 683 Web enabled business management MIS in Web Environment
Chapter 12: Enterprise Business systems T2 : Page 278-306
89
11
100
Course outline
Semester: II
Literature : Book Book Type Code Text Book Text Book Reference Book Reference Book Reference Book Reference Book T1 T2
Title & Author Management Information Systems W.S.Jawadekar Management Information Systems James A OBrien and George M Marakas Principles of Information Systems Ralph M Stair and George W Reynolds Information Systems- The foundation of E-Business Steven Alter Management Information System Mahadeo Jaiswal and Monika Mittal Management Information System Effy Oz
Publication Information. Edition Publisher Year 3rd Edition 7th Edition 7th Edition 4th Edition Tata MCGraw Hill Tata MCGraw Hill Cengage Learning Pearson Education Oxford University Press Cengage Learning 2006
R1
2010
R2
2001
R3 R4
5th Edition
2006
Test1: Chapters 1- 4 Test2: Chapters 5- 8 Test3: Chapters 9- 13
Course outline
Semester: II
QUESTION BANK
CHAPTER 1: Systems Engineering Overview: This chapter discusses about the basics of Systems, concepts and General model of MIS and System analysis
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.
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. 1. 2. 3. 4. What is Information? Explain different kinds of information. Explain different methods of information collection. Bring out differences between knowledge and information Explain General model of human as a information processor. CHAPTER 3: Introduction to Management Information System Overview: This chapter discusses about the basics of Management Information System
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. 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. 1. 2. 3. 4. 5. 6. What is the concept of Corporate Planning? Explain the reasons making strategic planning as an essential management process. What is Short-range Planning? Which are the Tools of Planning? Write a note on MIS: Business Planning. Explain different types of strategies used in strategic management.
Course outline
Semester: II
CHAPTER 5: Development of MIS Overview: This chapter discusses about the long range plans of the MIS. 1. 2. 3. 4. 5. 6. Why do we need information? How do we develop and Implement MIS Write a note on MIS : The factors of Success and Failure Why do we need information? How do we develop and Implement MIS? 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. 2. 3. 4. 5. What is planning? Explain basic fundamentals of Planning. What is SWOT Analysis? How it is done? How many business models are there? How planning is done in those models? Explain System Development Life Cycle. 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. 2. 3. 4. What is the Process model of the Organization What is the Value Stream model of the Organization? How will you relate MIS and BPR? 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
CHAPTER 9:Decision Making & DSS Overview: This chapter discusses about how decisions making affects the process of conducting business in a given environment.
1. 2. 3. 4. 5. 6. 7. 8.
Which are the Decision Methods, Tools and Procedures? Write a note on Behavioural Concepts in Decision Making and Organisational Decision Making. Explain Herbert Simon model for decision making with block diagram. 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? What is Artificial Intelligent System and Knowledge based Expert System? What is the difference between Deterministic and probabilistic system? What is DSS and explain the types of DSS 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. 2. 3. 4. 5. Explain the components of enterprise business systems. Distinguish between EMS and ERP. Explain about CRM (Customer Relation Management System) Discuss in detail upon ERP? 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?
Course outline
Semester: II
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. 2. 3. 4. 5. 6. 7. With help of block diagram explain the client-server Technology What are the implementation strategies of Client Server technology? Explain different models of E-business. Explain about Web enabled Business management. What is the impact of Web on Strategic Management? Discuss about web enabled business management? Discuss upon MIS in web environment?
Course outline
Semester: II
OPERATIONS RESEARCH Subject code: 10MCA25 Faculty : Dr .R.CHANDRASEKHAR(Dr.RCS) Hrs/ Week: 4 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. % of portion to be covered Chapter Cumulative wise
Class # 1
Chapter # Chapter -1 Introduction & Overview of the OR Modeling Approach Page No. 1-23
Topics to be covered The Origin of Operations Research The Nature of Operations Research The Impact of Operations Research Defining the Problem and Gathering Data Formulation a Mathematical Model Deriving Solutions from the Model Testing the Model Implementation The Linear Programming Problem (LPP)- Introduction and formulation Methods of solving LPP - Graphical method Methods of solving LPP - Graphical method Special cases of Graphical method Assumptions of Linear Programming Additional examples
5.8
5.8
2 3 4 5 6 7 8 9
Chapter -2 Introduction to Linear Programming Page No. 25-50
11.5
17.3
Course outline
Semester: II
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
The Essence of the Simplex Method Setting Up the Simplex Method The Algebra of the Simplex Method The Simplex Method in Tabular Form Chapter -3 Solving LPP-the Tie Breaking in the Simplex Method Adapting to Other Model Forms Simplex Method Two-Phase Method Page No. Two-Phase Method-Problems 103-149 Big-M method Big-M method-Problems Post optimality Analysis Post optimality Analysis- Examples Foundations of the Simplex Method The Revised simplex Method Chapter -4 The Revised simplex MethodTheory of the Examples Simplex A Fundamental Insight Method Page No. 173-200 The Essence of Duality Theory Economic Interpretation of Duality Primal-Dual Relationships Adapting to Other Primal Forms The Role of Duality Theory in Sensitivity Analysis The Essence of Sensitivity Analysis Applying Sensitively Analysis The Dual Simplex Method The Dual Simplex Method The Transportation Problems The Transportation Problems A Streamlined Simplex Method for the Transportation Problem The Assignment Problem The Assignment Problem A Special Algorithm for the Assignment Problem The Formulation of Two-Person, Zero-sum Games Solving Simple Games-A Prototype Example Games with Mixed Strategies
23.1
40.4
7.7
48.1
Chapter -5 Duality Theory and Sensitivity Analysis Page No. 209-258
17.4
65.5
Chapter -6 Transportation and Assignment Problems Page No. 320-362 Chapter -7 Game Theory Page No. 659-673
11.5
77.0
11.5
88.5
Course outline
Semester: II
44 45 46 47 48 49 50 51 52
Chapter -8 Metaheuristics Page No. 617-650
Graphical Solution Procedure Solving By Linear Programming Extensions The nature of Metaheuristics Tabu Search Tabu Search-Examples Simulated Annealing Genetic Algorithms Genetic Algorithms-Examples
11.5
100
Literature Book Type Text Book Book Code T1 Publication Information. Title & Author Introduction to `Operations Research Frederick S. Hiller and Gerald J.Liberman Operations Research Applications and Algorithms, Wayne L Winston Operations Research : An Introduction, Hamdy A Taha Edition 8th Publisher Tata MCGraw Hill Yea r 2005
Reference Book Reference Book
R1
4th
Thomson Course Technology
2003
R2
8th
Prentice Hall India
2007
Test Syllabus Test1: Chapters 1- 3 Test2: Chapters 3- 6 Test3: Chapters 6- 9
Course outline
Semester: II
1. 2. 3. 4. 5. 6. 7.
QUESTION BANK Explain the role of computers in OR. Briefly explain various Operations Research? What are the limitations of Operations research? What are the steps involved in operations research? Explain in brief. Define operation research. Explain the characteristics of Operation Research. Define OR. Explain the steps of OR study. 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 Boring Capacity 25/hr. 28/hr. 40/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 ( x1 12, x 2 14) 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 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. Department Ingredient P Q R Quantities present A B 18 06 2 8 4 4 Quantities Reserved 45 32 40 Remarks Minimum Minimum Maximum
Course outline
Semester: II
Cost/Unit In 20 40 Rs 11. Consider the following constraints x1 2 x 2 10; x1 x 2 10 and x2 0 . Represent the constraints graphically and clearly show the feasible region. Draw two Iso-Z lines if Z x1 x 2 . 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 As scrap is Rs.200 per quintal and that of Bs 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: Type of car A B Prob.of sale 0.7 0.8 in 90 days C 0.6
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 companys 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
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 Motor& Transmission Stamping Assembly line for washers Assembly line for driers . Monthly Washers 16000 10000 9000 900 Capacities Driers 7000 10000 1000
Course outline
Semester: II
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 8ounce and 16ounce respectively. Each machine can be used on both types with some loss of efficiency. The following data is available: Machine 8ounce bottles 16 ounce bottles A 100 / minute 40 / minute B 60 / minute 75 / minute Each machine can be run 8- hour per day, 5 days per week. Profit on each 8ounce bottle is Rs.0.50 and that on 16ounce bottle is Rs. 0.8. Weekly production of the drink cannot exceed 3,00,000 ounces and the market can absorb 25,000 8ounce bottles and 7,000 16ounce 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 .
Course outline
Semester: II
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 Z x1 3 x 2 2 x3 Subject to constraints 3 x1 x 2 3 x3 7 , 2 x1 4 x 2 0 , 4 x1 3x 2 8 x3 10 , x1 , x 2 , x 3 0 . 22. Solve by simplex method the following LPP: Minimize 7 2 x1 5x2 x1 2 x2 4, 2 x1 3x2 6 where x1, x2 are unrestricted in sign. 23. Solve the following LPP: Minimize Z x1 2 x 2 3 x3 4 x 4 Subject to constraints x1 2 x 2 3 x3 15 2 x1 x 2 5 x 3 20 x1 2 x 2 x 3 x 4 10 x1 , x 2 x 3, x 4 0 24. Maximize Z 2 x1 3x 2 4 x 3 Subject to constraints x1 x 2 x 3 1 x1 x 2 2 x3 2 3x1 2 x 2 x3 4
Course outline
Semester: II
x1 , x 2 0 , x3 unrestricted.
25. Solve the following LP problem by graphical method. Maximize Z 5 x1 3x 2 Subject to constraints 3 x1 2 x 2 15, 5 x1 2 x 2 10 x1 x 2 0 26. Solve the following LPP by Big M method. Maximize Z x1 2 x 2 3x 3 , Subject to constraints x1 2 x 2 3x3 5 2 x1 x 2 5 x 3 20 x1 2 x 2 x 3 8 x1 , x 2 , x 3 0
27. Solve the following LPP using simplex method. Maximize z 3 x1 2 x 2 5 x 3 Subject to constraints: x1 2 x2 x3 430 3x1 2 x3 10 x1 , x2 , x3 0 28. Solve by Simplex method the following LPP Minimize 7 2 x1 5 x 2 Subject to constraints: x1 2 x 2 4 2 x1 3x 2 6 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 Z x1 x 2 7 x 3 Subject to constraints x1 x 2 2 x3 10 and x1 x 2 x 3 0
Course outline
Semester: II
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. Max.z 2 x1 2 x2 5 x3 Subject to constraints x1 2 x2 x3 430 3x1 x2 x3 460 x1 4 x2 x3 420 , x1, x2 , x3 0 . 34. Solve the following LPP using big M Method MaxZ 3 x1 2 x 2 3 x3 Subject to constraints 2 x1 x 2 x3 2
3 x1 4 x 2 2 x 3 8
x1 x 2 x 3 0 35. Solve the following LPP using two phase simplex method 15 Minimize Z x 2 3 x 2 2 Subject to constraints 3 x1 x 2 x 3 3 x1 x 2 x 3 2 x1 x 2 x 3 0 36. Explain in brief the term Artitificial variable used in Big-M-Method. 37. Solve the following LPP using big M Method 15 MinimizeZ x1 3 x 2 2 Subject to constraints 3 x1 x 2 x 3 3
x1 x 2 x 3 2 and
x1 x 2 x 3 0
Course outline
Semester: II
38. Solve the following LPP by Big M method. Max Z= x1 2 x2 3x3 Subject to constraints
x1 2 x 2 3x 3 5 2 x1 x 2 5 x3 20 x1 2 x 2 x3 8 x1 , x 2 , x3 0
Duality Theory and Sensitivity Analysis 39. Write the dual of Subject to constraint Max. z 3 y1 4 y2 3 y3 s 3 y1 4 y2 y3 2 y1 3 y2 2 y3 1 y1 , y2 , y3 0
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= 3 x1 2 x2 x3 4 x 4 Subject to constraint 2 x1 4 x2 5 x3 10

3 x1 x 2 7 x3 2 x 4 2
5 x1 2 x 2 x3 6 x 4 15
x1 , x2 , x3 , x4 0
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
Maximize z= x1 x 2 3 x 3 Subject to constraints x1 x2 x3 10

2 x1 x 3 2
2 x1 2 x 2 3 x3 6 x1 , x 2 , x 3 0 44. Solve the following problem either by Big method or by dual simplex method. Minimize z 2 x1 2 x 2 4 x3 Subject to constraints 2 x1 3x 2 5 x 2 2 3x1 x 2 7 x 3 3 x1 4 x 2 6 x 3 5 45. Find the solution of the following LPP by solving the dual problem Maximize z 2 x1 3x 2 Subject to constraints 4 x1 x 2 4 5 x1 6 x 2 30 x1 5 x 2 30 x1 x 2 15 , x1 10 , x 2 7 , ( x 2 , x 2 0) 46. Solve by Dual simplex method Minimize z 3 x1 2 x 2 x3 4 x 4 Subject to constraints 2 x1 4 x 2 5 x3 x 4 10 3x1 x 2 7 x 3 2 x 4 2 5 x1 2 x 2 x 3 6 x 4 24 x1 , x 2 x 3, x 4 0 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
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,00000) respectively. The sales proportions of A,B,C and D are 7,5,5 and 4 respectively. The effectiveness matrix ix given below. 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 Sales proportions 6 5 4 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 1 2 3 4 1 800 1300 400 700 Plant 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. Machine Operator A B C D 1 10 5 7 8
Course outline
Semester: II
2 3 4 5
11 8 7 8
4 4 5 9
9 9 6 7
10 7 4 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. Factory Distribution centers Allahabad Mumbai Kolkata Delhi Amethi 3 2 7 6 Baghpat 7 5 2 3 Gwalior 2 5 4 5 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 9 7 12 6 15 B 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
Course outline
Semester: II
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.
Customer C1 C2 C3 C4 C5 C6 Ware W1 15 25 18 35 House W2 22 36 40 60 W3 26 38 45 52 40 23 50 38 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 / Number of Number hour pages /hour Job of pages A B C D E 5 6 3 4 4 12 14 8 10 11 P Q R S T 199 175 145 295 178
59. Solve the following assignment problem. The data given in the table refer to production in certain units. Machine Operato r A B C D 1 1 5 7 8 0 2 1 4 9 1 1 0
Course outline
Semester: II
3 4 5
8 7 8
4 5 9
9 6 7
7 4 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 48 4 0 4 0 8
_____________________________________________________________________________________ Perseverance Excellence Service
Course outline
Semester: II
65. Explain the following: a) Pure Strategy
b) Mixed Strategy
c) Saddle point
66. Solve the following 2 x 3 game B I II III A I 1 3 11 II 8 5 2 67. Solve the following 2 x 4 game B I II II I I V A 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: B I II 1 A 2 3 4 2 0 2 5 4 0 5 2 4 1 4 1 5 8 1 9 1 1
II I 1 2
I V 3 5 1 0 5 0
69. Solve the game whose pay off matrix is given below. B I II III III A 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
Course outline
Semester: II
71. Use minimax criterion to find the best strategy for each player. Does this game have a saddle point? Player II 1 2 1 3 -3 Player I 2 -4 2 3 1 -1 72. Solve the game 1 2 3 I -2 0 0 II 4 2 1 III -4 0 0 IV 5 2 -5 3 -2 -1 2 4 -4 1 0
4 4 5 2 -3
5 3 5 6 -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. 8 10 13 10 11 12 9 8 14 14 12 13
80. Find minimal spanning tree for the graph
Course outline
Semester: II
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
COBOL PROGRAMMING LABORATORY
Subject code: 10MCA26 Faculty: Prema Latha H M
Hours/Week: 03
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 students 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
DATA STURUCTURES USING C LABORATORY Subject code: 10MCA27 Faculty: Mrs. A. Lekha 1 Hours/Week: 03
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. 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) 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). 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. 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 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 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
9 10
11
12
13 14 15
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. 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). 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. 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 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. Write a C Programs for searching an element on a given list of integers using the a. Binary Search b. Linear Search Write a C program to sort a list of N integers using the quick sort algorithm Write a C program to traverse the nodes in a graph using Breadth First Search
Course outline
Semester: II
OOP with C++ Laboratory Subject code: 10MCA28 Faculty: Sec: A: Mrs. Neelam Bawane & Sec B: Dr. D.Uma Hours/Week: 03
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
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.

II Sem - Course Information - 2012

Загружено:

Сведения о документе

Исходное описание:

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

II Sem - Course Information - 2012

Загружено:

Авторское право:

Доступные форматы

Course outline

Session: Feb 2012 June 2012

PES Institute of Technology

12. 13. 14. 15. 16. 17. 18. 19.

1 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

2 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

3 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

Chapter 3: Writing High Level COBOL programs Page:360-437

Chapter 4: File Maintenance Page 520- 597

4 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

48 49 50 Chapter 5 : Advanced Topics Page:650-703

5 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

Session: Feb 2012 June 2012

Session: Feb 2012 June 2012

4. 5. 6. 7. 8. 9. 10. 11. 12.

Session: Feb 2012 June 2012

9. 10. 11. 12. 13. 14.

9 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

8. 9. 10. 11. 12. 13. 14.

Session: Feb 2012 June 2012

15. 16. 17. 18.

11 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

% of portions covered Chapter Cumulative wise

12 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

13 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

14 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

15 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

Session: Feb 2012 June 2012

Session: Feb 2012 June 2012

18 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

Chapter 1 : Basic Concepts T1: Page #: 001-050

19 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

20 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

Reference Book Reference Book

Test Syllabus: Test 1 : Chapter 1, 2, 3 Test 2 : Chapter 4, 5 Test 3 : Chapter 6, 7

21 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

22 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

23 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

24 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

25 _____________________________________________________________________________________ Perseverance Excellence Service

Session: Feb 2012 June 2012

MANAGEMENT INFORMATION SYSTEMS Subject code: 10MCA24 Faculty : V.SRIKANTH

Hours / Week: 04 Total Hrs : 52

Session: Feb 2012 June 2012