Image from Google Jackets

Computer Programming : For University of Mumbai.

By: Contributor(s): Material type: TextTextEdition: 0Description: 1 online resource (425 pages)ISBN:
  • 9789332506466
Genre/Form: Additional physical formats: Print version:: Computer Programming : For University of MumbaiDDC classification:
  • 23 005
Online resources:
Contents:
Cover -- Contents -- Preface -- Chapter 1: Introduction to C++ -- 1.1 Evolution of Programming Languages and Brief History of C++ -- 1.2 C++ As a Superset of C Programming Language -- 1.3 An Informal Introduction to C++ Program -- 1.4 Characteristics of Very Simple C++ Program (Level 0) -- 1.5 To Run a Program -- 1.6 C++ Fundamentals -- 1.6.1 Comments -- 1.6.2 Character Set -- 1.6.3 Identifiers and Keywords -- 1.6.4 Data Types -- 1.6.5 Constants and Variables Declarations -- 1.6.6 Operators and Expressions -- 1.6.7 Library Functions -- 1.6.8 Functions Ceil and Floor -- 1.6.9 Statements -- 1.6.10 Pre-Processor Directives -- 1.7 C++ Is a Block-Structured Language -- 1.8 Typedef Facility -- 1.9 End of Chapter Programs -- 1.9.1 Rounding a Floating Point Number -- 1.9.2 Truncating a Floating Point Number -- 1.9.3 Study of Auto Increment Operator -- 1.9.4 Study of Evaluation of Expression -- Summary -- Keywords -- Exercises -- Chapter 2: Simple Input and Output -- 2.1 Modern Style Input Output -- 2.2 Simple C Style Input Output -- 2.3 Introduction to Printf() -- 2.3.1 Function Printf() in Action -- 2.4 Introduction to Scanf() -- 2.5 More about Format Specifications -- 2.5.1 Flags -- 2.5.2 Width -- 2.5.3 Precision -- 2.5.4 Modifier -- 2.6 End of Chapter Programs -- Summary -- Keywords -- Exercises -- Chapter 3: Control Statements I -- 3.1 if Statement -- 3.2 if-else Statement -- 3.3 Nested if Statement -- 3.4 else-if Ladder -- 3.5 Switch Statement -- Summary -- Keywords -- Exercises -- Chapter 4: Control Statements II -- 4.1 for Statement -- 4.2 while Statement -- 4.3 do-while Statement -- 4.3.1 Indefinite Loop -- 4.4 Nested Control Structures -- 4.5 Break Statement -- 4.6 Continue Statement -- 4.7 Goto Statement -- 4.8 Comparison of All the Three Constructs -- 4.9 End of Chapter Programs -- 4.9.1 Control Variable -- 4.9.2 Prime Number.
4.9.3 Armstrong Number -- 4.9.4 Reversing the Digits -- Summary -- Keywords -- Exercises -- Chapter 5: Functions -- 5.1 Introduction -- 5.2 Parameter Passing -- 5.2.1 Pass by Value -- 5.2.2 Call by Reference-New Style -- 5.2.3 Call by Reference-Old Style -- 5.2.4 Arrays as Parameters -- 5.2.6 Rules of Parameter Passing -- 5.3 Local Versus Global Variables -- 5.4 Function Overloading -- 5.5 Functions with Default Arguments -- 5.6 Inline Functions -- 5.7 Storage Classes -- 5.7.1 Auto -- 5.7.2 Keyword Register -- 5.7.3 Keyword Static -- 5.7.4 Keyword External -- 5.8 Classification of Functions -- 5.8.1 Type A: Pure Mathematical Function -- 5.8.2 Type B: Pure Procedures -- 5.8.3 Type C: Functions to Return More than One Value -- 5.8.4 Type D: the Complete Function -- 5.9 Recursion -- 5.9.1 Advantages of Recursion -- 5.9.2 Disadvantages of Recursion -- 5.9.3 When to Use Recursion -- 5.9.4 When not to Use Recursion -- 5.10 Advanced Points -- 5.11 End of Chapter Programs -- 5.11.1 Recursive Factorial Function -- 5.11.2 GCD and LCM -- 5.11.3 Raised to n Using Recursion -- 5.11.4 Non-Recursive Fibonacci Numbers -- 5.11.5 Calculating Volume -- Summary -- Keywords -- Exercises -- Chapter 6: Arrays and Strings -- 6.1 Arrays: Introduction -- 6.1.1 Array Declaration -- 6.1.2 Initialisation of an Array -- 6.2 Array as Function Parameter -- 6.2.1 Sorting an Array with Bubble Sort Algorithm -- 6.3 Arrays with Multiple Dimension -- 6.3.1 Reading and Printing a Matrix -- 6.3.2 Adding Two Matrices -- 6.4 Strings -- 6.4.1 Initialisation of String Variable -- 6.5 Working with Strings -- 6.5.1 Reading a String -- 6.5.2 Writing a String -- 6.5.3 Comparing Strings -- 6.5.4 Copying One String Into Other -- 6.5.5 Length of a String -- 6.5.6 Concatenation of Strings -- 6.7 Useful Functions for Operating on Strings -- 6.8 End of Chapter Programs.
6.8.1 Capitalise First Character -- 6.8.2 Reading a String Containing Blank -- 6.8.3 Removing Return from a String -- 6.8.4 Sorting Strings -- 6.8.5 Printing Strings with Field Specifications -- 6.8.6 Copying Strings -- 6.8.7 Shifting Array Elements -- 6.8.8 Size of an Array -- 6.8.9 Printing an Array -- 6.8.10 Binary Search -- 6.8.11 Pascal Triangle -- Summary -- Keywords -- Exercises -- Debugging Exercise -- Chapter 7: Pointers -- 7.1 Introduction -- 7.1.1 Initialisation of Pointer Variable -- 7.1.2 Value Null -- 7.1.3 Pointer Comparison -- 7.2 The & (and) Operator -- 7.3 The *Operator -- 7.4 Pointers and Arrays -- 7.5 Pointer Arithmetic -- 7.6 Pointer to Void -- 7.7 Pointer to Function -- 7.8 Dynamic Memory Allocation -- 7.8.1 Free Store -- 7.9 Operators New and Delete -- 7.10 Two-Dimensional Arrays Using Pointers -- 7.10.1 Method I -- 7.10.2 Method II -- 7.11 End of Chapter Programs -- 7.11.1 Study Program -- 7.11.2 Study Program -- Summary -- Keywords -- Exercises -- Chapter 8: Advanced Input/Output -- 8.1 Introduction -- 8.2 Stream I/O Classes -- 8.3 Input/Output Using Functions and Flags Provided in IOS Class -- 8.3.1 Reading Variables -- 8.3.2 Writing Integer Variables -- 8.3.3 Writing Float -- 8.3.4 Summary of the IOS Methods and Flags Used with Cin and Cout -- 8.4 The Manipulators -- 8.4.1 Manipulators for Reading -- 8.4.2 Summary of Manipulators -- 8.5 Our Own Manipulators -- 8.6 Miscellaneous Functions -- 8.6.1 The Good the Bad and the Ugly! (Fail) -- 8.7 Console Input Output -- Summary -- Keywords -- Exercises -- Chapter 9: Structures and Unions -- 9.1 Structures -- 9.1.1 Initialisation of Structure Variable -- 9.1.2 Assignment of Structure Variables -- 9.1.3 Using Structure as Function Parameters -- 9.1.4 Structure Within Structures -- 9.1.5 Pointer to Structures -- 9.2 Union -- 9.2.1 Defining a Union -- 9.2.2 Working with Union.
9.2.3 Anonymous Union -- 9.3 Linked List -- 9.3.1 Dynamic Data Structure -- 9.3.2 Creating a Linked List -- 9.3.4 Creating a Linked List: Data in Same Order as that of its Arrival -- 9.3.5 Searching a Linked List -- 9.3.6 Inserting a Node in a Linked List -- Some Short Questions and Answers -- Summary -- Keywords -- Exercises -- Chapter 10: What They Don't Teach You at … -- 10.1 Enumerated Data Type -- 10.2 Type Reference -- 10.3 Type Void -- 10.3.1 Function Returning Type Void -- 10.3.2 Pointer of Type Void -- 10.4 Line Splicing -- 10.5 Command Line Parameters -- 10.6 Multi-File Programs -- 10.7 Simple C++ Program (Level 1) -- 10.8 Bit Manipulation -- 10.8.1 Data Encryption by Bit Manipulation -- 10.9 Differences Between C and C++ -- 10.9.1 Major Differences -- 10.9.2 Minor Differences -- Summary -- Keywords -- Exercises -- Chapter 11: Object Orientation - An Introduction -- 11.1 Programming Languages: Scenario Before Object Orientation -- 11.2 Features of Object-Oriented Language -- 11.2.1 Encapsulation -- 11.2.2 Data Hiding -- 11.2.3 Inheritance -- 11.2.4 Polymorphism -- 11.2.5 Message Passing -- 11.3 Benefits of Object-Oriented Programming -- 11.3.1 Software Reusability -- 11.3.2 Code Sharing -- 11.3.3 Rapid Prototyping -- 11.3.4 Information Hiding -- 11.4 Object-Oriented Analysis and Design -- Summary -- Keywords -- Exercises -- Chapter 12: Classes and Objects -- 12.1 Introduction -- 12.2 Data Hiding and Encapsulation -- 12.2.1 Private and Public Members -- 12.3 Member Functions -- 12.3.1 Scope Resolution Operator -- 12.4 Accessing Class Members -- 12.5 Using Pointers for Objects -- 12.6 Objects as Function Parameters -- 12.7 Inline Functions -- 12.8 Static Data Members and Methods -- 12.8.1 Static Data Member -- 12.8.2 Static Methods -- 12.9 Friend Functions -- 12.10 Friend Classes -- 12.11 Ideal Object Definition (Level 0).
12.12 End of Chapter Programs -- 12.12.1 Complex Numbers -- 12.12.2 Parameter Passing by Reference (C Style) -- Summary -- Keywords -- Exercises -- Chapter 13: Object Initialisation and Cleanup -- 13.1 Introduction -- 13.2 Constructors -- 13.3 Paramaterised Constructor -- 13.4 Pointer 'This' -- 13.5 Constructor Overloading -- 13.6 Default Constructor -- 13.7 Constructors with Default Arguments -- 13.8 Destructors -- 13.9 Copy Constructor -- 13.10 Copy Initialisation -- 13.11 Array of Objects -- 13.11.1 Array of Objects - Without Pointers -- 13.11.2 Array of Objects-with Pointer -- 13.12 End of Chapter Programs -- 13.12.1 Initialiser List -- Summary -- Keywords -- Exercises -- Chapter 14: Operator Overloading -- 14.1 Introduction -- 14.2 Unary Operator Overloading -- 14.2.1 Operator Overloading-No Value Returned -- 14.2.2 Operator Returning Value -- 14.3 Binary Operator Overloading -- 14.3.1 Overloading Operators + and * [Case 1] -- 14.3.2 Overloading of Assignment Operator [Case 1] -- 14.3.3 Overloading of *Operator [Case 2] -- 14.3.4 Binary Operator Overloading (Case 3) -- 14.4 Overloading of Auto-Increment Operators -- 14.4.1 Overloading ++ Operator -- 14.4.2 Separate Postfix and Prefix Operations -- 14.5 Conversion Function -- 14.6 End of Chapter Programs -- 14.6.1 Operator Returning Value by Reference -- 14.6.2 Expression with Unary as Well as Binary Overloaded Operators -- 14.6.3 Overloading += Operator -- 14.6.4 Overloading of += Operator -- 14.6.5 Overloading Binary Operator + Using Friend Function -- 14.6.6 Class Polar -- Summary -- Keywords -- Exercises -- Chapter 15: Strings: A Case Study -- 15.1 Our Own Strings -- 15.2 Constructors for Type String -- 15.3 Interactive Constructor for Class String -- 15.4 Operator Overloading with Class String -- Exercises -- Chapter 16: Inheritance I -- 16.1 Introduction -- 16.2 Derived and Base Class.
16.3 Public Derivation.
Summary: Computer Programming-I is specifically designed for the students of engineering in Mumbai University for their first-year course on computer programming.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Materials specified Status Barcode
E- Books E- Books Digital Library Digital Library 005 BHA-C Online access Available E0016
Total holds: 0

Cover -- Contents -- Preface -- Chapter 1: Introduction to C++ -- 1.1 Evolution of Programming Languages and Brief History of C++ -- 1.2 C++ As a Superset of C Programming Language -- 1.3 An Informal Introduction to C++ Program -- 1.4 Characteristics of Very Simple C++ Program (Level 0) -- 1.5 To Run a Program -- 1.6 C++ Fundamentals -- 1.6.1 Comments -- 1.6.2 Character Set -- 1.6.3 Identifiers and Keywords -- 1.6.4 Data Types -- 1.6.5 Constants and Variables Declarations -- 1.6.6 Operators and Expressions -- 1.6.7 Library Functions -- 1.6.8 Functions Ceil and Floor -- 1.6.9 Statements -- 1.6.10 Pre-Processor Directives -- 1.7 C++ Is a Block-Structured Language -- 1.8 Typedef Facility -- 1.9 End of Chapter Programs -- 1.9.1 Rounding a Floating Point Number -- 1.9.2 Truncating a Floating Point Number -- 1.9.3 Study of Auto Increment Operator -- 1.9.4 Study of Evaluation of Expression -- Summary -- Keywords -- Exercises -- Chapter 2: Simple Input and Output -- 2.1 Modern Style Input Output -- 2.2 Simple C Style Input Output -- 2.3 Introduction to Printf() -- 2.3.1 Function Printf() in Action -- 2.4 Introduction to Scanf() -- 2.5 More about Format Specifications -- 2.5.1 Flags -- 2.5.2 Width -- 2.5.3 Precision -- 2.5.4 Modifier -- 2.6 End of Chapter Programs -- Summary -- Keywords -- Exercises -- Chapter 3: Control Statements I -- 3.1 if Statement -- 3.2 if-else Statement -- 3.3 Nested if Statement -- 3.4 else-if Ladder -- 3.5 Switch Statement -- Summary -- Keywords -- Exercises -- Chapter 4: Control Statements II -- 4.1 for Statement -- 4.2 while Statement -- 4.3 do-while Statement -- 4.3.1 Indefinite Loop -- 4.4 Nested Control Structures -- 4.5 Break Statement -- 4.6 Continue Statement -- 4.7 Goto Statement -- 4.8 Comparison of All the Three Constructs -- 4.9 End of Chapter Programs -- 4.9.1 Control Variable -- 4.9.2 Prime Number.

4.9.3 Armstrong Number -- 4.9.4 Reversing the Digits -- Summary -- Keywords -- Exercises -- Chapter 5: Functions -- 5.1 Introduction -- 5.2 Parameter Passing -- 5.2.1 Pass by Value -- 5.2.2 Call by Reference-New Style -- 5.2.3 Call by Reference-Old Style -- 5.2.4 Arrays as Parameters -- 5.2.6 Rules of Parameter Passing -- 5.3 Local Versus Global Variables -- 5.4 Function Overloading -- 5.5 Functions with Default Arguments -- 5.6 Inline Functions -- 5.7 Storage Classes -- 5.7.1 Auto -- 5.7.2 Keyword Register -- 5.7.3 Keyword Static -- 5.7.4 Keyword External -- 5.8 Classification of Functions -- 5.8.1 Type A: Pure Mathematical Function -- 5.8.2 Type B: Pure Procedures -- 5.8.3 Type C: Functions to Return More than One Value -- 5.8.4 Type D: the Complete Function -- 5.9 Recursion -- 5.9.1 Advantages of Recursion -- 5.9.2 Disadvantages of Recursion -- 5.9.3 When to Use Recursion -- 5.9.4 When not to Use Recursion -- 5.10 Advanced Points -- 5.11 End of Chapter Programs -- 5.11.1 Recursive Factorial Function -- 5.11.2 GCD and LCM -- 5.11.3 Raised to n Using Recursion -- 5.11.4 Non-Recursive Fibonacci Numbers -- 5.11.5 Calculating Volume -- Summary -- Keywords -- Exercises -- Chapter 6: Arrays and Strings -- 6.1 Arrays: Introduction -- 6.1.1 Array Declaration -- 6.1.2 Initialisation of an Array -- 6.2 Array as Function Parameter -- 6.2.1 Sorting an Array with Bubble Sort Algorithm -- 6.3 Arrays with Multiple Dimension -- 6.3.1 Reading and Printing a Matrix -- 6.3.2 Adding Two Matrices -- 6.4 Strings -- 6.4.1 Initialisation of String Variable -- 6.5 Working with Strings -- 6.5.1 Reading a String -- 6.5.2 Writing a String -- 6.5.3 Comparing Strings -- 6.5.4 Copying One String Into Other -- 6.5.5 Length of a String -- 6.5.6 Concatenation of Strings -- 6.7 Useful Functions for Operating on Strings -- 6.8 End of Chapter Programs.

6.8.1 Capitalise First Character -- 6.8.2 Reading a String Containing Blank -- 6.8.3 Removing Return from a String -- 6.8.4 Sorting Strings -- 6.8.5 Printing Strings with Field Specifications -- 6.8.6 Copying Strings -- 6.8.7 Shifting Array Elements -- 6.8.8 Size of an Array -- 6.8.9 Printing an Array -- 6.8.10 Binary Search -- 6.8.11 Pascal Triangle -- Summary -- Keywords -- Exercises -- Debugging Exercise -- Chapter 7: Pointers -- 7.1 Introduction -- 7.1.1 Initialisation of Pointer Variable -- 7.1.2 Value Null -- 7.1.3 Pointer Comparison -- 7.2 The & (and) Operator -- 7.3 The *Operator -- 7.4 Pointers and Arrays -- 7.5 Pointer Arithmetic -- 7.6 Pointer to Void -- 7.7 Pointer to Function -- 7.8 Dynamic Memory Allocation -- 7.8.1 Free Store -- 7.9 Operators New and Delete -- 7.10 Two-Dimensional Arrays Using Pointers -- 7.10.1 Method I -- 7.10.2 Method II -- 7.11 End of Chapter Programs -- 7.11.1 Study Program -- 7.11.2 Study Program -- Summary -- Keywords -- Exercises -- Chapter 8: Advanced Input/Output -- 8.1 Introduction -- 8.2 Stream I/O Classes -- 8.3 Input/Output Using Functions and Flags Provided in IOS Class -- 8.3.1 Reading Variables -- 8.3.2 Writing Integer Variables -- 8.3.3 Writing Float -- 8.3.4 Summary of the IOS Methods and Flags Used with Cin and Cout -- 8.4 The Manipulators -- 8.4.1 Manipulators for Reading -- 8.4.2 Summary of Manipulators -- 8.5 Our Own Manipulators -- 8.6 Miscellaneous Functions -- 8.6.1 The Good the Bad and the Ugly! (Fail) -- 8.7 Console Input Output -- Summary -- Keywords -- Exercises -- Chapter 9: Structures and Unions -- 9.1 Structures -- 9.1.1 Initialisation of Structure Variable -- 9.1.2 Assignment of Structure Variables -- 9.1.3 Using Structure as Function Parameters -- 9.1.4 Structure Within Structures -- 9.1.5 Pointer to Structures -- 9.2 Union -- 9.2.1 Defining a Union -- 9.2.2 Working with Union.

9.2.3 Anonymous Union -- 9.3 Linked List -- 9.3.1 Dynamic Data Structure -- 9.3.2 Creating a Linked List -- 9.3.4 Creating a Linked List: Data in Same Order as that of its Arrival -- 9.3.5 Searching a Linked List -- 9.3.6 Inserting a Node in a Linked List -- Some Short Questions and Answers -- Summary -- Keywords -- Exercises -- Chapter 10: What They Don't Teach You at … -- 10.1 Enumerated Data Type -- 10.2 Type Reference -- 10.3 Type Void -- 10.3.1 Function Returning Type Void -- 10.3.2 Pointer of Type Void -- 10.4 Line Splicing -- 10.5 Command Line Parameters -- 10.6 Multi-File Programs -- 10.7 Simple C++ Program (Level 1) -- 10.8 Bit Manipulation -- 10.8.1 Data Encryption by Bit Manipulation -- 10.9 Differences Between C and C++ -- 10.9.1 Major Differences -- 10.9.2 Minor Differences -- Summary -- Keywords -- Exercises -- Chapter 11: Object Orientation - An Introduction -- 11.1 Programming Languages: Scenario Before Object Orientation -- 11.2 Features of Object-Oriented Language -- 11.2.1 Encapsulation -- 11.2.2 Data Hiding -- 11.2.3 Inheritance -- 11.2.4 Polymorphism -- 11.2.5 Message Passing -- 11.3 Benefits of Object-Oriented Programming -- 11.3.1 Software Reusability -- 11.3.2 Code Sharing -- 11.3.3 Rapid Prototyping -- 11.3.4 Information Hiding -- 11.4 Object-Oriented Analysis and Design -- Summary -- Keywords -- Exercises -- Chapter 12: Classes and Objects -- 12.1 Introduction -- 12.2 Data Hiding and Encapsulation -- 12.2.1 Private and Public Members -- 12.3 Member Functions -- 12.3.1 Scope Resolution Operator -- 12.4 Accessing Class Members -- 12.5 Using Pointers for Objects -- 12.6 Objects as Function Parameters -- 12.7 Inline Functions -- 12.8 Static Data Members and Methods -- 12.8.1 Static Data Member -- 12.8.2 Static Methods -- 12.9 Friend Functions -- 12.10 Friend Classes -- 12.11 Ideal Object Definition (Level 0).

12.12 End of Chapter Programs -- 12.12.1 Complex Numbers -- 12.12.2 Parameter Passing by Reference (C Style) -- Summary -- Keywords -- Exercises -- Chapter 13: Object Initialisation and Cleanup -- 13.1 Introduction -- 13.2 Constructors -- 13.3 Paramaterised Constructor -- 13.4 Pointer 'This' -- 13.5 Constructor Overloading -- 13.6 Default Constructor -- 13.7 Constructors with Default Arguments -- 13.8 Destructors -- 13.9 Copy Constructor -- 13.10 Copy Initialisation -- 13.11 Array of Objects -- 13.11.1 Array of Objects - Without Pointers -- 13.11.2 Array of Objects-with Pointer -- 13.12 End of Chapter Programs -- 13.12.1 Initialiser List -- Summary -- Keywords -- Exercises -- Chapter 14: Operator Overloading -- 14.1 Introduction -- 14.2 Unary Operator Overloading -- 14.2.1 Operator Overloading-No Value Returned -- 14.2.2 Operator Returning Value -- 14.3 Binary Operator Overloading -- 14.3.1 Overloading Operators + and * [Case 1] -- 14.3.2 Overloading of Assignment Operator [Case 1] -- 14.3.3 Overloading of *Operator [Case 2] -- 14.3.4 Binary Operator Overloading (Case 3) -- 14.4 Overloading of Auto-Increment Operators -- 14.4.1 Overloading ++ Operator -- 14.4.2 Separate Postfix and Prefix Operations -- 14.5 Conversion Function -- 14.6 End of Chapter Programs -- 14.6.1 Operator Returning Value by Reference -- 14.6.2 Expression with Unary as Well as Binary Overloaded Operators -- 14.6.3 Overloading += Operator -- 14.6.4 Overloading of += Operator -- 14.6.5 Overloading Binary Operator + Using Friend Function -- 14.6.6 Class Polar -- Summary -- Keywords -- Exercises -- Chapter 15: Strings: A Case Study -- 15.1 Our Own Strings -- 15.2 Constructors for Type String -- 15.3 Interactive Constructor for Class String -- 15.4 Operator Overloading with Class String -- Exercises -- Chapter 16: Inheritance I -- 16.1 Introduction -- 16.2 Derived and Base Class.

16.3 Public Derivation.

Computer Programming-I is specifically designed for the students of engineering in Mumbai University for their first-year course on computer programming.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2018. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

Share
Powered by Koha ILS
Page Design & Customization: Library Web Team CE Thalassery