Programming In C (Aicte Edition)
460
INR
Book Details
Author(s)Reema Thareja,
PublisherOxford University Press
ISBN / ASIN019949228X
ISBN-139780199492282
Sales Rank97,562
CategoryPaperback
MarketplaceIndia 🇮🇳
Description
Programming in C is designed to serve as a textbook for the undergraduate students of engineering, computer applications and computer science. It provides a comprehensive coverage of the fundamental concepts of C programming.
Beginning with the basics of computers, the book provides an in-depth analysis of various constructs of C. The key topics include iterative and decision-control statements, functions, recursion, arrays, strings, pointers, structures and unions and file management. It deals separately with the fundamental concepts of linked lists the preferred data structure for dynamic allocation of memory. The book also includes a chapter on different searching and sorting algorithms and analysis of time and space complexity of algorithms.
Key Features
Completely covers the latest AICTE syllabus
Employs a very lucid style of presentation which makes the concepts easy to understand
Provides more than 240 programming examples with outputs to illustrate the concepts
Includes highly detailed pedagogy entailing examples, figures, algorithms and programming tips
Provides numerous chapter-end exercises to test the understanding of the theory
Online Resources
For Faculty:
Solutions Manual
PowerPoint Slides
For Students
Multiple Choice Questions
Supplementary Reading: Data Structures
Table of contents
1. Introduction to Programming
2. Introduction to C
3. Decision Control and Looping Statements
4. Functions
5. Recursion
6. Arrays
7. Strings
8. Algorithms
9. Pointers
10. Structure, Union and Enumerated Data Types
11. Files
12. Linked Lists.
Beginning with the basics of computers, the book provides an in-depth analysis of various constructs of C. The key topics include iterative and decision-control statements, functions, recursion, arrays, strings, pointers, structures and unions and file management. It deals separately with the fundamental concepts of linked lists the preferred data structure for dynamic allocation of memory. The book also includes a chapter on different searching and sorting algorithms and analysis of time and space complexity of algorithms.
Key Features
Completely covers the latest AICTE syllabus
Employs a very lucid style of presentation which makes the concepts easy to understand
Provides more than 240 programming examples with outputs to illustrate the concepts
Includes highly detailed pedagogy entailing examples, figures, algorithms and programming tips
Provides numerous chapter-end exercises to test the understanding of the theory
Online Resources
For Faculty:
Solutions Manual
PowerPoint Slides
For Students
Multiple Choice Questions
Supplementary Reading: Data Structures
Table of contents
1. Introduction to Programming
2. Introduction to C
3. Decision Control and Looping Statements
4. Functions
5. Recursion
6. Arrays
7. Strings
8. Algorithms
9. Pointers
10. Structure, Union and Enumerated Data Types
11. Files
12. Linked Lists.

