دسترسی نامحدود
برای کاربرانی که ثبت نام کرده اند
برای ارتباط با ما می توانید از طریق شماره موبایل زیر از طریق تماس و پیامک با ما در ارتباط باشید
در صورت عدم پاسخ گویی از طریق پیامک با پشتیبان در ارتباط باشید
برای کاربرانی که ثبت نام کرده اند
درصورت عدم همخوانی توضیحات با کتاب
از ساعت 7 صبح تا 10 شب
ویرایش:
نویسندگان: T. Kishor
سری:
ناشر: Independently Published
سال نشر: 2024
تعداد صفحات: 368
زبان: English
فرمت فایل : PDF (درصورت درخواست کاربر به PDF، EPUB یا AZW3 تبدیل می شود)
حجم فایل: 6 Mb
در صورت تبدیل فایل کتاب Programming In C: A Step-by-Step Guide to Programming in C Master the Fundamentals and Unlock Your Coding Potential Today به فرمت های PDF، EPUB، AZW3، MOBI و یا DJVU می توانید به پشتیبان اطلاع دهید تا فایل مورد نظر را تبدیل نمایند.
توجه داشته باشید کتاب برنامه نویسی به زبان C: راهنمای گام به گام برنامه نویسی در C بر اصول اساسی تسلط داشته باشید و امروز پتانسیل برنامه نویسی خود را باز کنید نسخه زبان اصلی می باشد و کتاب ترجمه شده به فارسی نمی باشد. وبسایت اینترنشنال لایبرری ارائه دهنده کتاب های زبان اصلی می باشد و هیچ گونه کتاب ترجمه شده یا نوشته شده به فارسی را ارائه نمی دهد.
Unit 1 Introduction to C Programming Structure: 1.1 Introduction Objectives 1.2 Features of C and its Basic Structure 1.3 Simple C programs 1.4 Constants Integer Constants Real Constants Character Constants String Constants Backslash Character Constants 1.5 Concept of an Integer and Variable 1.6 Rules for naming Variables and assigning values to variables 1. 7 Summary 1.8 Terminal Questions 1.9 Answers to Self Assessment Questions 1.10 Answers to Terminal Questions 1.11 Exercises Unit 2 Operators and Expressions Structure: 2.1 Introduction Objectives 2.2 Arithmetic Operators 2.3 Unary Operators 2.4 Relational and Logical Operators 2.5 The Conditional Operator 2.6 Library Functions 2.7 Bitwise Operators 2.8 The Increment and Decrement Operators 2.9 The Size of Operator 2.10 Precedence of operators 2.11 Summary 2.12 Terminal Questions 2.13 Answers to Self Assessment Questions 2.14 Answers to Terminal Questions 2.15 Exercises Unit 3 Data Types and Input/Output Operators Structure: 3.1 Introduction Objectives 3.2 Floating-point Numbers Converting Integers to Floating-point and vice-versa Mixed-mode Expressions 3.3 The type cast Operator 3.4 The type char 3.5 Keywords 3.6 Character Input and Output 3.7 Formatted input and output 3.8 The gets() and puts() functions 3.9 Interactive Programming 3.10 Summary 3.11 Terminal Questions 3.12 Answers to Self Assessment Questions 3.13 Answers to Terminal Questions 3.14 Exercises Unit 4 Control Statements and Decision Making Structure: 4.1 Introduction Objectives 4.2 The goto statement 4.3 The if statement The if-else statement Nesting of if statements 4.4 The conditional expression 4.5 The switch statement 4.6 The while loop 4.7 The do ... while loop 4.8 The for loop The nesting of for loops 4.9 The break statement and continue statement 4.10 Summary 4.11 Terminal Questions 4.12 Answers to Self Assessment Questions 4.13 Answers to Terminal Questions 4.14 Exercise Unit S Functions Structure: 5.1 Introduction Objectives 5.2 Function Basics 5.3 Function Prototypes 5.4 Recursion 5. 5 Function Philosophy 5.6 Summary 5.7 Terminal Questions 5.8 Answers for Self Assessment Questions 5.9 Answers for Terminal Questions 5.10 Exercises Unit 6 Storage Classes Structure: 6.1 Introduction Objectives 6.2 Storage Classes and Visibility 6.3 Automatic or local variables 6.4 Global variables 6.5 Static variables 6.6 External variables 6.7 Summary 6.8 Terminal Questions 6.9 Answers for Self Assessment Questions 6.10 Answers for Terminal Questions 6.11 Exercises Unit 7 Arrays and Strings Structure: 7.1 Introduction Objectives 7.2 One Dimensional Arrays Passing Arrays to Functions 7.3 Multidimensional Arrays 7.4 Strings 7.5 Summary 7.6 Terminal Questions 7.7 Answers for Self Assessment Questions 7.8 Answers for Terminal Questions 7.9 Exercises Unit 8 Pointers - I Structure: 8.1 Introduction Objectives 8.2 Basics of Pointers 8.3 Pointers and One-dimensional Arrays Pointer Arithmetic Pointer Subtraction and Comparison Similarities between Pointers and One-dimensional Arrays 8.4 Summary 8.5 Terminal Questions 8.6 Answers to Self Assessment Questions 8.7 Answers to Terminal Questions 8.8 Exercises Unit 9 Pointers - II Structure: 9.1 Introduction Objectives 9.2 Null pointers 9.3 Pointers as Function Arguments 9.4 Pointers and Strings 9.5 Pointers and two-dimensional arrays Arrays of Pointers 9.6 Summary 9.7 Terminal Questions 9.8 Answers to Self Assessment Questions 9.9 Answers for Terminal Questions 9.10 Exercises Unit 10 Structures and Unions Structure: 10.1 Introduction Objectives 10.2 Basics of Structures 10.3 Structures and Functions 10.4 Arrays of Structures 10.5 Pointers to Structures 10.6 Self-referential Structures 10.7 Unions 10.8 Summary 10.9 Terminal Questions 10.10 Answers to Self Assessment Questions 10.11 Answers to Terminal Questions 10.12 Exercises Unit 11 The Preprocessor Structure: 11.1 Introduction Objectives 11.2 File Inclusion 11.3 Macro Definition and Substitution Macros with Arguments Nesting of Macros 11.4 Conditional Compilation 11.5 Summary 11.6 Terminal Questions 11.7 Answers to Self Assessment Questions 11.8 Answers to Terminal Questions 11.9 Exercises Unit 12 Dynamic Memory Allocation and Linked List Structure: 12.1 Introduction Objectives 12.2 Dynamic Memory Allocation Allocating Memory with malloc Allocating Memory with calloc Freeing Memory Reallocating Memory Blocks 12.3 Pointer Safety 12.4 The Concept of linked list Inserting a node by using Recursive Programs Sorting and Reversing a Linked List Deleting the Specified Node in a Singly Linked List 12.5 Summary 12.6 Terminal Questions 12.7 Answers to Self Assessment Questions 12.8 Answers for Terminal Questions 12.9 Exercises Unit 13 File Management Structure: 1 3.1 Introduction Objectives 13.2 Defining and Opening a file 13.3 Closing Files 13.4 Input/Output Operations on Files Predefined Streams 13.5 Error Handling during I/0 Operations 13.6 Random Access to Files 13.7 Command Line Arguments 13.8 Summary 13.9 Terminal Questions 13.10 Answers to Self Assessment Questions 13.11 Answers to Terminal Questions 13.12 Exercises Unit 14 Advanced Data Representation Structure: 14.1 Introduction Objectives 14.2 Exploring Data Representation 14.3 Abstract Data Types 14.4 Stack as an Abstract Data Type Array Implementation of a Stack Implementation of a Stack Using Linked Representation Applications of Stacks 14.5 Queue as an Abstract Data Type Array Implementation of a Queue Implementation of a Queue Using Linked List Representation Circular Queues Applications of Queues 14.6 Summary 14.7 Terminal Questions 14.8 Answers to Self Assessment Questions 14.9 Answers to Terminal Questions 14.10 Exercises