Fundamentals of Programming

✍ Scribed by Mir Shehzad Ahmad

• Publisher: Toronto Academic Press
• Year: 2024
• Tongue: English
• Leaves: 242
• Edition: 1
• Category: Library

✦ Synopsis

This text is a comprehensive guide to computer programming, covering the basic principles, concepts, and techniques of programming. The book provides a detailed overview of programming languages, algorithms, data structures, and software development methodologies. With clear explanations and practical examples, this book is an excellent starting point for anyone interested in learning programming fundamentals. It is an essential resource for students and professionals who want to develop their programming skills and enhance their understanding of computer science.

✦ Table of Contents

Cover
Title Page
Copyright
About The Author
Contents
List of Figures
List of Tables
List of Abbreviations
Preface
Chapter 1: Introduction To Programming
Unit Introduction
1.1. Processing Of Information
1.2. Managing The Computer
1.3. The Essence Of Programming
1.4. History Of Programming
1.5. Types Of Programming Languages
1.6. Stages In Software Development
1.7. Software Development Is More Than Just Coding
1.8. Summary
Review Questions
Multiple Choice Questions
References
Chapter 2: Evaluation Of Major Programming Languages
Unit Introduction
2.1. Zuse’s PlankalkÜl
2.2. Pseudocodes
2.3. IBM 704 And Fortran
2.4. Functional Programming: LISP
2.5. Computerizing Business Records
2.6. The Early Stages Of Timesharing
2.7. Two Initial Dynamic Languages: SNOBOL And APL
2.8. Object-oriented Programming (OOP): Smalltalk
2.9. Merging Imperative And Object-oriented Characteristics
2.10. An Imperative-centered Object-oriented Language: Java
2.11. Markup-programming Hybrid Languages
2.12. Scripting Languages
2.13. Summary
Review Questions
Multiple Choice Questions
References
Chapter 3: Data Types
Unit Introduction
3.1. Primitive Data Types
3.2. Character String Types
3.3. Summary
Review Questions
Multiple Choice Questions
References
Chapter 4: Algorithms And Data Structures In Programming
Unit Introduction
4.1. Issues Solved By Algorithms
4.2. Data Structures
4.3. Algorithms Like A Technology
4.4. Algorithms And Other Technologies
4.5. Analyzing Data Structures And Algorithms
4.6. Summary
Review Questions
Multiple Choice Questions
References
Chapter 5: Functions
Unit Introduction
5.1. Categories Of Functions
5.2. Program Layout
5.3. Hierarchy Or Structure Chart
5.4. Parameters And Arguments
5.5. Call By Value Vs. Call By Reference
5.6. Return Statement
5.7. Void Data Type
5.8. Scope
5.9. Programming Style
5.10. Standard Libraries
5.11. Summary
Review Questions
Multiple Choice Questions
References
Chapter 6: Arrays
Unit Introduction
6.1. Array
6.2. Index Notation
6.3. Displaying Array Members
6.4. Arrays And Functions
6.5. Math Statistics With Arrays
6.6. Searching Arrays
6.7. Sorting Arrays
6.8. Parallel Arrays
6.9. Multidimensional Arrays
6.10. Dynamic Arrays
6.11. Summary
Review Questions
Multiple Choice Questions
References
Chapter 7: Control Structures
Unit Introduction
7.1. Selection Control Structures
7.2. If Then Else
7.3. Nested If Then Else
7.4. Relational Operators
7.5. Assignment Vs. Equality
7.6. Iteration Control Structures
7.7. Branching Statements
7.8. Summary
Review Questions
Multiple Choice Questions
References
Chapter 8: Fundamentals Of Object-oriented Programming
Unit Introduction
8.1. An Object-oriented World
8.2. Importance Of OOp
8.3. The Characteristics Of An OOP
8.4. Encapsulation
8.5. Inheritance
8.6. Polymorphism
8.7. Exception Handling
8.8. Final Remarks Of OOP
8.9. Summary
Review Questions
Multiple Choice Questions
References
Index
Back Cover