Bachelor of Technology (Computer Science and Engineering) Credit Based Scheme of Studies/Examination(Modified) Semester Ill (w2.f Session 2019-2020) [Examination Schedule (Warks) [Duration lof Exam 5 Minor | Praca | Total |") 'S. |CourseNo. |Subject LTP |Hourss |creaits | Malo No. Week Test | Test 1 |ES-227A [Principles ofProgramming Languages [300 3 | 3 | 75 | 2 | 0 |100/ 3 2 |PC-CS- [Data Structure and Algoritims 300] 3 | 3 | |] 0 |i; 3 2014 2 /ES-207A [Digital Electronics 300] 3 | 3 | |B] 0 |i; 3 ' [PO-CS- _|Object Oriented Programming woo; 3 | 3 | | Be) 0 fio; Ss 203, 5 (BS-205A (Mathematics soo] 3 | 3 || Be] 0 jo; 3 16 |HI-9024 [Business Infeligence and 300] 3 | 3 | |e) 0 |io; 3 [Entrepreneurship 7 |PC-0S- [Data Structure and Algorithms Lab aoa] 4 | 2 | 0 | wm) 6 [too]; 3 ‘2058L '® /ES-209AL [Digital Electronics Lab aoa} 4 | 2 | 0 | | wo |i; 3 12 |PC-CS-|Object Oriented Programming Lab oa} 4 | 2 | 0) a) w lio; 3 ‘207AL** Total 3) | a5) aT | 180 | 900 10 |[SIM-207A* [Seminar on Summer intemship 200 | 2 0; so) 0 | sD “Note: SIM-201A" is a mandatory creditess course in which the students will be evaluated for the Summer Internship (training) undergone after 2» semester and students will be required to get passing marks to qualify.ES.227A Principles of Programming Languages Lecture Tutorial Practical Credit Major Test | Minor Test Total Time 3 o o 30 15 ey 100 3Hour Purpose | To iniroduce the principlos and paradigms of programming languages for design and implement tho software intensive systems. Course Outcomes (CO) cot To introduce the basic concopis of programming language, the general probloms and methods related to syntax and semantics. coz To introduce the structured data objecs, subprograms and programmer defined data types, co3 To outline the sequence control and data control. cos To introduce the concepts of storage management using programming languages. Unit+: Introduction, Syntax and Semantics Introduction: A brief history, Characteristics of a good programming language, Programming language translators- compiler and intorprotors, Elomentary data types - data objects, variablo and constants, data types. Specification and implementation of clementary data types, Declarations, type checking and type conversions, Assignment and initialization, Numeric data types, ‘enumerations, Booleans and characters. ‘Syntax and Semantics: Introduction, general problem of describing syntax, Formal method of describing Syntax, attribute (grammar dynamic semantic. Unit-tl: Structured data objects, Subprograms and Programmer Defined Data Types Structured data objects: Structured data objects and data types, specification and implementation of structured data typos, Declaration and type checking of data structure, vector and arrays, records Character strings, vatiable sizo data structures, Union, pointer and programmer defined data objects, ses, files. ‘Subprograms and Programmer Defined Data Types: Evolution of data type concept abstraction, encapsulation and information hiding, Subprograms, type definitions, abstract datatypes, overloaded subprograms, genetic subprograms.Unit-Il: Sequence Control and Data Control Sequence Control: Implicit and explicit sequence control, sequence control within expressions, sequence control within statement, Subprogram sequence control: simple call return, recursive subprograms, Exception and exception handlers, co routines, sequence control. Concurrency — subprogram level concurtency, synchronization through semaphores, monitors and message passing Data Control: Names and referencing environment, slic and dynamic scope, block structure, Local data and local referencing environment, Shared data: dynamic and stafic scope, Parameter and parameter transmission schemes. Unit-V: Storage Management and Programming Languages Storage Management: Major runtime elements requiting storage, programmer and system controlled storage management and phases, Static storage management, Stack based storage management, Heap storage management, variable and fixed size cloments, Programming Languages: Introduction to procedural, non-procedural, structured, logical, functional and object oriented programming language, Comparison of C and C+ programming languages, Suggested Books: . Terronco W. Pratt, Marvin V. Zelkowitz, Programrring Languages Design and Implementation, Pearson. ‘Alon Tuckor and Robert Noonan, Programming Languages-Princioles and Paradigms, Tata McGraw-Hill 2009. Elis Horowitz, Fundamentals of Programming Languages, Galgotia Publications, 2010. C. Ghezzi, Programming Languages Concepts, Wiley Publications, 2010, Note: The Examiner will be given the question paper template and will have to set the question paper according to the template provided along with the syllabus.PC-CS201A Data Structure and Algorithms Lecture Tutorial | Practical | Credit Major Test | Minor Test | Total Time 3 0 0 3.0 5 25 100 3 Hour Purpose To introduce the principles and paradigms of Data Structures for design and implement the software systems logically and physically ‘Course Outcomes (CO) cot To introduce the basic concepts of Data structure , basic dala types ,searching and sorting based on array data types. coz To introduce the structured data types like Stacks and Queue and is basic operations's implementation co3 To introduce dynamic implementation of inked lst cos To introduce the concepts of Tree and graph and implementation of traversal algorithms. Unit Introduction to Data Structures, Data Types, Buill in and User Defined Data Structures, Applications of Data Structure, gorithm Analysis, Worst, Best and Average Case Analysis, Notations of Space and Time Complexity, Basics of Recursion. Arrays, One Dimensional Arrays, Two Dimensional Arrays and Mult-Dimensional Arrays, Sparse Matrices, Searching from array using Linear and Binary Searching Algorithm, Sorting of array using Selection, Insertion, Bubble, Radix Aigorithm Unit-2 Stacks: Definition, Implementation of Stacks and Its Operations, Evaluation of infix, prefix and Postfix Expression, Inter- Conversion of Infix, Prefix and Post-Fix Expression, Implementation of Merge Sort and Quick Sort Algorithm, Queues: Definition, Sequential Implementation of Linear Queues and Its Operations, Circular Queue and Its Implementation, Priority Queues and Its Implementation, Applications of queues, Unit-3Unit-3 Linked Lists: Need of Dynamic Data Structures, Single Link List and Its Dynamic Implementation, Traversing, Insertion, Deletion ‘Operations on Single Link Lists. Comparison between Static and Dynamic, Implementation of Linked List. Circular Link Lists and Doubly Link List, Dynamic Implementation of Primitive Operations on Doubly Linked Lists and Circular Link List. Dynamic Implementation of Stacks and Queues. Unit-4 ‘Trees: Definition, Basic Terminology, Binary Tree, Extemal and intemal Nodes, Static and Dynamic Implementation of a Binary ‘Tree, Primitive Operations on Binary Trees, Binary Tree Traversals: PreOrder, In-Order and Post-Order Traversals. Representation of Infx, Post-Fix and Prefix Expressions using Trees, Introduction to Binary Search Trees: B+ trees, AVL Trees, Threaded Binary trees, Balanced Mult-way search trees, Implementation of Heap Sort Algorithm. Graphs: Basic Terminology, Defition of Undirected and Directed Graphs, Memory Representation of Graphs, Minimum-Spanning ‘Trees, Warshal Algorithm, Graph Traversals Algorithms: Breadth First and Depth First. ‘Suggested Books: . Theory and Problems of Data Structures by Jt. Symour Lipschelz, Schaum's oulline, TMH. . Data Structures and Algorithms by PAI, TMH. . Fundamentals of Data structures by Elis Horowitz and Saitaj Sahni, Pub, 1983, AW. . Data Structures and Algorithms by A. Aho, JE. Hopcroft and 7.D. Uiman, Original edition, Addison-Wesley, 1999, Low Priced Edition Data Structures and Program Design in C by Robert Kruse, PHI, ‘Shukla, Data Structures using C++, Wiley India Introduction to Computers Science -An Algorithms Approach, Jean Paul Tremblay, Richard B. Bunt, 2002, TMH, Data Structure and the Standard Tempiate library ~ Wiam J, Collins, 2003, T.MLH.ES.207A Digital Electronics Lecture | Tutorial | Practical | Credit Major Test | Minor Test | Total Time 3 0 0 3.0 75 25 100 3 Hour Purpose | To leam the basic methods forthe design of digital cicuils and provide the fundamental concepts used in the design ofcigital systems. Course Outcomes (CO) cot To introduce basic poslulates of Boolean algebra and shows the corelation between Boolean expressions coz To introduce the methods for simplifying Boolean expressions cos “To outine the formal procedures forthe analysis and design of combinational drcuils and sequential crculls cos To introduce the concept of memories and programmable logic devices. UNIT | MINIMIZATION TECHNIQUES AND LOGIC GATES Binary Digits, Logic Levels, and Digital Waveforms, Logic Syslems-Positive and negative, Logic Operations,Logical Operators, Logic Gates-AND, OR, NOT, NAND, NOR, Exclusive-OR and Exclusive-NOR, Active high and Active low concepts, Universal Gates and realization of other gates using universal gates, Gate Performance Characteristics and Parameters Boolean Algebra: Rules and laws of Boolean algebra, Demorgan’s Theorems, Boolean Expressions and Truth Tables, Standard SOP and POS forms; Minterm and Maxterms, Canaonical representation of Boolean expressions, Dualty Theorem, Simplification of Boolean Expressions, Minimization Techniques for Boolean Expressions using Kamiaugh Map and Quine McCluskey Tabulat method introduction of TTL and CMOS Logic and their characteristics, Tristate gates. UNIT II COMBINATIONAL CIRCUITS Introduction to combinational Circuits, Adders-Halt Adder and Ful-Adder, Subtractors- Half and Full Subtractor; Parallel adder and Subiractor; Look-Ahead Carry Adders. BCD adder, BCD subtractor, Party Checker/Generator, Mutiplexer, Demuitiplexer, Encoder, Priority Encoder, Decoder BCD to Seven segment Display DecoderDrver, LCD Display, and Comparators. UNIT Ill SEQUENTIAL CIRCUITS Introduction to Sequential Circuits, Flip-Flops: Types of Flip Flops -RS, T, D, JK; Edge triggering, Level Triggering: Flip Flop conversions; Master-Salve JK.UNIT Ill SEQUENTIAL CIRCUITS Introduction to Sequential Circuits, Flip-Flops: Types of Flip Flops -RS, T, D, JK; Edge triggering, Level Triggering: Flip Flop conversions; Master-Salve JK. Introduction to shift registers, Basic Shift Register Operations, types of shift registers, Bidirectional Shift Registers, Shift Register Counters. Introduction to counters, Types of Counters-Asynchronous and synchronous counters, Up/Down Synchronous Counters, Modulo-n Counter , State table, excitation table concepis, Design of asynchronous and synchronous counters, Ring Counter, Applications of counters. UNIT IV CONVERTER and MEMORY DEVICES Digital to Analog Converter, Weighed Register: R-2R Ladder Network: Analog to Digital Conversion, Suocessive Approximation Type, Dual Slope Type. Classification of memories - ROM: ROM organization, PROM, EPROM, EEPROM, EAPROM, RAM: - RAM organization - Write operation, Read operation, Memory cycle, Timing wave forms, memory expansion, Static RAM Cell, MOSFET RAM cell structure, Dynamic RAM cal structure, Programmable Logic Devices - Programmable Logic Array (PLA), Programmable Array Logic (PAL), Implementation of PLA, PAL using ROM. ‘Suggested Books: . Donald P. Leach and Albert Paul Malvino, Digital Principles and Applications, 8th Edition, TMH, 2003 M. . Morris Mano, Digital Design, 3rd Edition, Prentice Hall of India Pvt. Ltd., 2003 / Pearson Education (Singapore) Pvt. Ltd, New Delhi, 2003, . AL, Digital Switching Systems, , TMH . AK. Maini, Digital Electronics, Wiley India . John F. Wakerly, Digital Design, Fourth Edition, Pearson/PHI, 2006 . John. M Yarbrough, Digital Logic Applications and Design, Thomson Learning, 2002. S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 3rd Ecition., Vikas Publishing House Pvt. Ltd, New Delhi,PC-CS203A Object Oriented Programming Lecture Tutorial Practical | Credit Major Test | Minor Test | Total | Time 3 0 0 30 5 25 100 ‘3 Hour Purpose To introduce the principles and paradigms of Object Oriented Programming Language for design and implement the Object Oriented System. Course Outcomes (CO) cot ‘To introduce the basic concepls of object oriented programming language and the its representation coz ‘To allocate dynamic memory, access private members of class and the behavior of inheritance and its implementation cos ‘To introduce polymorphism, interface design and overioading of operator. cos To handle backup system using fle, general purpose template and handling of raised exception during programming. Introduction to C++, C++ Standard Library, Illustrative Simple C++ Programs. Header Files, Namespaces, Application of object ofionted programming, Object Oriented Concepts, Introduction to Objects and Object Oriented Programming, Encapsulation, Polymorphism, Overloading, Inheritance, Abstract Classes, Accessifior (public! protected! private), Class Scope and Accessing Class Members, Controlling ‘Access Function, Constant, Class Member, Structure and Class Friend Function and Friend Classes, This Pointer, Dynamic Memory Allocation and Deallocation (Now and Delete), Static Class ‘Members, Constructors, parameter Constructors and Copy Constructors, Deconstrucors, Introduction of inheritance, Types of Inhertance, Overtiding Base Class Members in a Derived Class, Publi, Protected and Private Inheritance, Effect of Constructors and Deconstructors of Base Class in Derived Classes.Unit-3 Polymorphism, Pointer to Derived class, Virtual Functions, Pure Virtual Function, Abstract Base Classes, Static and Dynamic Binding, Virtual Deconstructors. Fundamentals of Operator Overloading, Rules for Operators Overloading, Implementation of Operator Overloading Like <<>> Unary Operators, Binary Operators, Unit-4 ‘Text Streams and binary stream, Sequential and Random Access File, Stream Input/ Output Classes, Stream Manipulators, Basics of C+-+ Exception Handling, Try, Throw, Catch, multiple catch, Re-throwing an Exception, Exception specifications. Templates: Function Templates, Ovetloading Template Functions, Class Template, Class Templates end Non- Type Template arguments. ‘Suggested Books: . The complete reference C ++ by Herbert shieldt Tata McGraw Hil . Object Oriented Programming in Turbo C++ by Robert Lafore, 1994, The WAITE Group Press. . Shukla, Object Oriented Programming in c++, Wiley India . ++ How to Program by HM Deitel and P J Deitel, 1998, Prentice Hall . Programming with C++ By D Ravichandran, 2003, TMH. Note: The Examiner will be given the question paper template and will have to set the question Paper according to the template provided along with the syllabus.BS-205A Mathematics-II Lecture | Tutorial | Practical | Credit | Theory | Sessional | Total Time 3 0 0 3.0 75 25 100 ‘3 Hour Purpose | To familiarize the prospective engineers with techniques in sequence and series, multivariable calculus, and cidinary differential equations. ‘Course Outcomes (CO) cot To develop the foo! of sequence, series and Fourier series for leaming advanced Engineering Mathematics, co2 To introduce effective mathematical tots for the solutions of differential equations that model physical processes. co3 To acquaint the student with mathematical tools needed in evaluating muliple integrals and their usage, Coa To familiarize the student with calculus of vector functions that is essential in most branches of engineering. UNIT Sequence and Series: Convergence of sequence and series, tests for convergence (Comparison test, D’Alembert’s Ratio test Logarithmic test, Cauchy root test, Raabe's tes Fourier series: introduction, Fourier-Euler Formula, Dirchlet’s conditions, Change of intervals, Fourier series for even and odd functions, Half range sine and cosine series. UNIT-IL First order ordinary differential equations: Exact, linear and Bemoull’s equations, Euler's equations, Equations not of first degree ‘equations solvable for p, equations solvable for y, equations solvable for x and Clairauts type Differential equations of higher orders: ‘Second order linear differential equations with constant coefficients, method of variation of parameters, Cauchy and Legendre's linear differential equations. UNIT-ILUNIT-I Multivariable Calculus (Integration): Muttiple Integration: Double integrals (Cartesian), change of order of integration in double integrals, Change of variables (Cartesian to polar) Applications: areas and volumes; Triple integrals (Cartesian), orthogonal curvilinear coordinates, Simple applications involving cubes, sphere and rectangular parallelepipeds, UNITAV Vector Calculus: Introduction, Scalar and Vector point functions, Gradient, divergence and Curl and their properties, Directional derivative, Line integrals, surtace integrals, volume integrals, Theorems of Green, Gauss and Stokes (Without proof) Suggested Books: G.B. Thomas and RL. Finney, Calculus and Analytic geometry, Sth Editon, Pearson, Reprint, 2002. Veerarajan T., Engineering Mathematics for fist year, Tata McGraw-Hill, New Delhi, 2008. Ramana B.V,, Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th Reprint, 2010. NP. Bali and Manish Goyal, text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010, B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000, W.E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems, Sth Edition, Wiley India, 2008. S.L Ross, Differential Equations, 3rd Ed., Wiley India, 1984. E.A Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India, 1995, E.L Ince, Ordinary Differential Equations, Dover Publications, 1958. GF Simmons and SG. Krantz, Differential Equations, Tata MeGraw Hil, 207 Note: The Examiner will be given the question paper template and will have to set the question paper according to the template provided along with the syllabus.HM-902A Business Intelligence and Entrepreneurship Lecture Tutorial | Practical Credit Major Test__| Minor Test | Total | Time 3 0 0 3.0 75 25 100 3 Purpose | To make the students conversant with the basics concepts in management thereby leading to nurturing their managerial skis. ‘Course Outcomes (CO) cot Students will be able understand who the entrepreneurs are and what competences needed to become an Entrepreneur. coz ‘Students will be able understand insighis into the management, opportunity search, identificalion of a Product, market feasibility studies; project finalization ote. required for small business enterprises, co3 ‘Students can be able to write @ report and do oral presentation on the topies such as product identification, business idea, oxport marketing ot. co4 ‘Studonts willbe able to know the different financial and other assistance available forthe small industrial unis. Unit Entrepreneurship : Concept and Definitions; Entrepreneurship and Economic Development; Classification and Types of Entrepreneurs; Entrepreneurial Competencies; Factor Affecting Entrepreneurial Growth - Economic, Non-Economic Factors; EDP Programmes; Entreprencurial Training; Traits/Quaitos of an Entrepreneurs; Manager Vs. Entrepreneur, Entrepreneurial challenges. Unit tt ‘Opportunity / Identification and Product Selection: Entrepreneurial Opportunity Search and Identification; Criteria to Select a Product; Conducting Feasibilty Studies; Sources of business ideas, Marketing Plan : Conducting of Marketing Research, Industry Analysis, Competitor analysis, market segmentation and positioning, building a marketing plan, marketing mix, launching a now product; export marketing, Methods of Project Appraisal, Project Report Preparation; Specimen of Project Report; Project Planning ‘and Scheduling using Networking Techniques of PERT / CPM. Unit 0Unit ‘Small Enterprises and Enterprise Launching Formalities : Definition of Small Scale; Rationale; Objective; Scope; SSI; Registration; NOC from Pollution Board; Machinery and Equipment Selection , Role of SSI in Economic Development of india; major problem faced by SSIMSMEs - Definition and Significance in Indian Economy; MSME Schemes, Challenges and Dificultes in availing MSME Schemes. Unit-V Role of Support Institutions and Management of Small Business : DIC; SIDO; SIDBI, Small Industies Development Corporation (SIDC); SISI; NSIC; NISBUD; State Financial Corporation SIC; Venture Capital: Concepl, venture capita financing schemes offered by various financial institutions in India, Special Issues for Entrepreneurs: Legal issues ~ Forming business entity, roquirements for formation of a Privato/Public Limited Company, Enireproncurshio and intellectual Property Rights: IPR and their importance. (Patent, Copy Right, Trademarks) , Caso Studies-At least one in whole course, Note: * Caso studies of Entrepreneurs ~ successful, failed, tumaround ventures should be discussed inthe class. + Exercises / activities should be conducted on ‘generating business ideas’ and identifying problems and opportunities, + Interactive sessions with Entroprenours, authontios of financial institutions, Govemment oficials should be organized Suggested Readings: ‘© ‘Entrepreneurship development small business enterprises’, Pearson, Poorima M Charantimath, 2013. © Roy Rajiv, Entrepreneurship", Oxford University Press, 2041 ‘= “Innovation and Entrepreneurship’ Harper business- Drucker-F, Peter, 2006, . Tata Mc-graw Hill Publishing Co td new Delhi- Robert D. Hisrich, Mathew J. Menimata, Michael P Shepherd, Bh Edition, 2012 Entorpronourship Dovolopment- S.Chand and Co, Delhi- S.S.Khanka 1999 . ‘Small-Scale Industri and Enitopronourship. Himalaya Publishing House, Doli Vasant Dosai 2003.PC-CS205AL Data Structure and Algorithms Lab Lecture Tutorial [Practical | Credit MinorTest | Practical | Total Time 0 a 4 20 40 60 100 3 Purpose To introduce the principles and paradigms of Data Structures for design and implement the software systems logically end physically. Course Outcomes (CO) cot To introduce the basic concepts of Data structure, basic dala types, searching and sorting based on array data typos. coz TTointroduce the structured data types ike Stacks and Queue and is basic operation's implementation co3 TToiniroduce dynamic implementation of inked Est. cos Tointroduce the concopts of Tres and graph and implomontation of traversal algorithms. 1 Wiite a program for Binary search methods. 2 Wie a program for insertion sor, selection sort and bubble sort 3. We a program to implement Stack and its oporaton. 4 Write a program for quick sort. 5. Wie a program for merge sort 6 Wie a program fo implement Queue and its operation. 7. Write a program to implement Circular Quoue and its operation. 8 Write a program to implement singly linked list for the following operations: Croate, Display, searching, traversing and deletion 9. Wie @ program to implement doubly linked list forthe following operations: Create, Display, inserting, counting, searching, traversing and deletion 10 White @ program to implement circular linked list for the following operations: Create, Display, inserting, counting, searching, 11 traversing and deletion \Wiite @ program to implement insertion, deletion and traversing in B treeES-200AL Digital Electronics Lab Lecture | Tutorial | Practical | Credit Minor Test | Practical | Total Time 0 0 4 20 40 60 100 3 Purpose | To learn the basic methods forthe design of digital crcuits and systems. ‘Course Outcomes (CO) cot ‘To Familarization with Digital Trainer Kit and associated equipment coz “To Study and design of TTL gates cO3 “To lear the formal procedures forthe analysis and design of combinalional cris co4 “To leam the formal procedures for the analysis and design of sequential circuits LIST OF EXPERIMENTS: 4. Familarzetion with Digital Trainer Kit and associated equipment 2 Study of TTL gates AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR 3 Design and realize a given function using K-Maps and verify is performance. 4 ‘To verify the operation of Multiplexer and De-multiplexer. 5. To verify the operation of Comparator. 6. Toverify the truth table of S-R, JK, T, D Flip-flops. 7. To verify the operation of Bi-directional shift register. 8. Todesign and verify the operation of 3-bit asynchronous counter. 9 To design and verity the operation of asynchronous Upidown counter using J-K FS, 10. Todesign and verify the operation of asynchronous Decade counter. 11. Study of TTL logic tami characteristics. 12 Study of Encoder and Decoder. 43. Study of BCD to 7 segment Decoder. NOTE: ‘Astudent has to perform at least ten experiments. Seven experiments should be performed from the above ist. Romaininn thre avnarimante mau ethar ha narlnrmad fen the ahnva lie ar dacinned 8 eat hu the cancamed_Object Oriented Programming Lab Lecture Tutorial | Practical | Credit WinorTest | Practical | Total | Time 0 0 4 20 40 60 100 | 3Hour Purpose ‘To introduce the principles and paradigms of Object Oriented Programming Language for design and implement the Object Oriented System. ‘Course Outcomes (CO) cot ‘To introduce the basic concepts of object oriented programming language and the is representation, co2 ‘To allocate dynamic memory, access private members of class and the behavior of inheritance and its implementation. cos To introduce polymorphism, interface design and overloading of operator. Coa ‘To handle backup system using fle, general purpose template and handling of raised exception during programming, Qi. Raising a number n toa power pis the same as muliplying n by itself p tes, Write a function called power (that takes a double value forn and an int value for p, and returns the result as double value. Use a default argument of 2 for p, so thatf this argument is omitted, the number wil be squared. Write a main () function that gets values from the user to test this function, Q2.Apoint on the two dimensional piane can be represented by two numbers: an X coordinate and a Y coordinate. For example, (4,5) Tepresents a point 4 units tothe right ofthe origin along the X axis and 5 units up the Y axis. The sum of two points can be defined as a new point whose X coordinate is the sum ofthe X coordinates of the points and whose Y coordinate is the sum oftheir Y coordinates. \Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of ther. Then set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1: 3.4 Enter coordinates for P2: 57 Coordinates of Pt + P2 are: 8, 11 3. Create the equivalent of a four function calculator. The program should request the user to enter @ number, an operator, and another number. It should then carry out the specifed arithmetical operation: adding, subtracting, multiplying, or dividing the twoQS. Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator, and another number. It should then cary out the specified artmetical operation: adding, subtracting, muttplying, or dividing the two ‘numbers. (I should use a switch statement to select the operation). Finaly it should display the result. When it finishes the calculation, the program should ask f the user wants to do another calculation. The response can be 'Y’ or '‘N. Some sample interaction with the ‘rogram might look like ths. Enter first number, operator, and second number: 10/ 3 ‘Answer = 3.333333 Do another (VIN)? Y Enter frst number, operator, second number 12 + 100 Answer = 112 Do another (¥! N) ?N ‘Q4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to slore these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Inialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look lke this: ‘+ Enler your area code, exchange, and number: 415 555 1212 ‘© My number is (212) 767-8900 © Your number is (418) $55-1212 ‘G5. Create two classes DM and DB which store the value of distances. OM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values forthe class objects and add one object of DM with another object of DB. Use a friend function to cay out the addition operation. The object that stores the results maybe @ DM object or DB objects, depending on the units in which the resuits are required. The display should be inthe format of feet and inches or metres and cenitmetres depending ‘nthe object on display. {Q6. Create a class rational which represents a numerical value by two double values- NUMERATOR and DENOMINATOR. Include the following public member Functions: * constructor with no arguments (default) + constructor with two arguments.pst oF Mest 5 Fry nd shoth p15 people MSE END SKSUDENBHENSN ONE EBSA. | Hedeem now © Tour TUMer 1s (419) 999-12 12 5. Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM abject or DB objects, depending on ‘the units in which the results are required, The display should be in the format of feet and inches or metres and cenitmetres depending on the object on display. Q6. Create a class rational which represents a numerical value by two double values- NUMERATOR and DENOMINATOR. Include the following public member Functions: * constructor with no arguments (default). + constructor with two arguments. * void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator. + Overload + operator to add two rational number. + Overload >> operator fo enable input through cin + Overload << operator to enable output through cout. Write a main (to test all the functions in the class. 7. Consider the following class definition class father { protected : int age; public; father (int x) {age =x} virtual void iam (){cout < <°1AM THE FATHER, my age is: "<< agec< end} PC-CS207AL, ke Derive the two classes son and daughter from the above class and for each, define iam ( ) to write our similar but appropriate messages. You should also define suitable constructors for these classes. Now, write a main ( ) that creates objects of the three classes and then cals iam () for them. Deciare pointer to father. Suocessively, assign addresses of objects of the two derived classes to this pointer and in each case, call iam ( through the pointer to demonstrate polymorphism in action. QB. Write @ program that creates a binary fle by reading the data forthe students from the terminal. The data of each student consist of rll no,, name (string of 30 of lesser no, of characters) and marks, G8. A hospital wants to create a database regarding its indoor patients. The information to store include a) Name of the patient ) Date of admission ©) Disease ) Date of discharge Create a structure to slore the date (year, month and date as its members). Create a base class to store the above information, The ember function should include functions to enter information and display a list of all the patients in the database, Creale a derived class to store the age ofthe patients. List the information about all the to store the age ofthe patients, List the information about all the pediatric patients (less than twelve years in age) 10, Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Add an instance variable, named department, of type string. Supply a method to to String that prints the manager's name, department and salary. Make a class Executive inherits om Manager. Supply a method to String that prints the string “Executive” followed by the information stored in the Manager superclass object. Supply a test program that tests these classes and methods, Qt. Imagine a tobooth with a class called toll Booth. The two data tems are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected, A constructor initaizes both these to 0, A member function called payingCar (increments the car total and adds 0.50 to the cash total. Another function, called nopayCar ( ), increments the car total but adds Nothing to the cash total, Finally, a member function called displays the two totals, Include a program to test tis class. This program should allow the user to push one Key to count a paying car, and another to count a nonpaying cat. Pushing the ESC kay should causeee jae wept, UI ye Duly, GUMply a MeuTo Wy ew wating Wat Penns We MaiiayeT > Haine, UEpAIUHEAK aM Setaly. mane a was> Executive inherts from Manager. Supply a method to String that prints the string “Executive” followed by the information stored in the Manager superclass object. Supply atest program that tests these classes and methods. 1 Imagine a tolbooth with a class called toll Booth. The two data items are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected. A constructor initializes both these to 0, A member function called payingCar (() increments the car total and ads 0.50 to the cash total. Another function, called nopayCar (), increments the car total but adds nothing to the cash total. Finally, a member function called displays the two toals. Include a program to test this class. This program should allow the user to push one key to count a paying car, and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit (12. Write a function called reversit () that reverses a string (an array of char). Use a for loop that swaps the fist and last characters, then the second and next to last characters and so on. The string should be passed to reversit () as an argument. Write a program to exercise reversit ( ). The program should get a string from the user, call reversit (), and print out the result. Use an input method that allows embedded blanks. Test the program with Napoleon's famous phrase, “Able was | ere | saw Elba)’. {Q13, Create some objects ofthe string class, and put them in a Deque-some at the head of the Deque and some atthe tail Display the contents of the Deque using the forEach () function and a user writen display function. Then search the Deque for a particular string, Using the first That ( ) function and display any strings that match. Finally remove all the items from the Deque using the getLeft() ‘function and display each item. Notice the order in which the items are displayed: Using get eft (), those inserted on the left (head) of the Deque are removed in “ast in first out” order while those put on the right side are removed in “fs in fist out’ order. The opposite ‘would be true if getRight () were used. Q14, Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facity. The current account provides cheque book facility but no interest. Current account holders should also maintain @ minimum balance and ifthe balance falls below ths level, a service charge is imposed. Create a class account that stores customer name, account number and type of account. From this derive the classes cour_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tas 2) Aecep depos om acstomer and update balance ») Display the balance.aun anne wayray GaAs NER NOIRE HIE UG HI MIN WIE NES OFS ME UO YEALCH f, WRG HHOSHEU UN wR EH HCE UF the Deque are removed in "last n fist out’ order while those put onthe right side are removed in “fist in frst out” order. The opposite would be true if getRight () were used Q14, Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain @ minimum balance and ifthe balance falls below this level, a service charge is imposed. Create a class account that stores customer name, account number and type of account. From this derive the lasses cour_acct and sav_acct to make them more specific o their requirements, Include necessary member functions in order to achieve the ‘ollowing tasks: 2) Accept deposit fom a customer and update the balance. ») Display the balance, c) Compute and deposit interest «) Permit withdrawal and update the balance. €) Check forthe minimum balance, impose penalty, necessary and update the balance. 4) Do not use any constructors. Use member functions to initialize the ciass members. 15, Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a member function ‘get data ) to initialize baseclass data members and another member function display_area( ) to compute and display the area of figures. Make display_atea ( ) as a virual function and redefine this function in the derived classes to suit their requirements. Using these three ciasses, design a program that will accept dimensions ofa triangle ofa rectangle interactively and display the area, Remember the two values given as input willbe treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle = x* y ‘Area of triangle = "4" x*y NOTE: _Astudent has to perform at least ten experiments. Seven experiments should be performed from the above list. Remaining three experiments may either be performed from the above list or designed & set by the concemed institution as per the scope ofthe sylabus,