Muutke küpsiste eelistusi

Basic Computation and Programming with C [Pehme köide]

,
  • Formaat: Paperback / softback, 662 pages, kõrgus x laius x paksus: 238x177x27 mm, kaal: 840 g
  • Ilmumisaeg: 16-Jan-2017
  • Kirjastus: Cambridge University Press
  • ISBN-10: 1316601854
  • ISBN-13: 9781316601853
Teised raamatud teemal:
Basic Computation and Programming with CSuurem pilt
  • Formaat: Paperback / softback, 662 pages, kõrgus x laius x paksus: 238x177x27 mm, kaal: 840 g
  • Ilmumisaeg: 16-Jan-2017
  • Kirjastus: Cambridge University Press
  • ISBN-10: 1316601854
  • ISBN-13: 9781316601853
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781316601853.html
Märksõnad:
Providing in-depth coverage, this book covers the fundamentals of computation and programming in C language. Essential concepts including operators and expressions, input and output statements, loop statements, arrays, pointers, functions, strings and preprocessors are described in a lucid manner. A unique approach - 'Learn by quiz' - features questions based on confidence-based learning methodology. It helps the reader to identify the right answer with adequate explanation and reasoning as to why the other options are incorrect. Computer programs and review questions are interspersed throughout the text. The book is appropriate for undergraduate students of engineering, computer science and information technology. It can be used for self-study and assists in the understanding of theoretical concepts and their applications.

Muu info

The book offers detailed coverage of basic computation and C programming concepts, supported by numerous computer programs.
List of Figures
xiii
List of Tables
xv
Preface xvii
Acknowledgments xix
Part A Fundamentals of Computer
1 Computer-History, Classification and Basic Anatomy
1(13)
1.1 Generations of Computer
1(3)
1.2 Classification of Computers
4(4)
1.3 Basic Anatomy of a Computer
8(1)
1.4 Von Neumann Architecture
9(1)
1.5 Memory Classification and Hierarchy
10(1)
1.6 Input and Output Devices
10(4)
2 Introduction to Number System and Logic Gates
14(17)
2.1 Introduction
14(1)
2.2 Base of a Number System
14(1)
2.3 Reason behind Using Binary Number System
15(1)
2.4 Conversion among Different Bases
16(3)
2.5 Similarities between Number Systems of Different Bases
19(1)
2.6 Addition of Two Numbers
19(2)
2.7 Signed Binary Numbers
21(3)
2.8 ASCII (American Standard Code for Information Interchange)
24(1)
2.9 Logic Gates and Boolean Algebra
25(1)
2.10 Gates (Logic Gates)
25(1)
2.11 Basic Gates
26(2)
2.12 Universal Gates
28(3)
3 Introduction to System Software and Operating Systems
31(9)
3.1 Introduction to Assembler
31(1)
3.2 Introduction to Compiler
32(2)
3.3 Introduction to Operating System
34(6)
4 Algorithms and Flow Chart
40(9)
4.1 Flow Chart
40(9)
Part B Programming in `C'
5 Introduction to C
49(9)
5.1 Generations of Programming Languages
50(1)
5.2 History of C Language
51(1)
5.3 Why is C so Popular?
52(1)
5.4 Position of C in the Generations of Languages
53(5)
6 Constants, Variables and Data Types
58(16)
6.1 C Character Set
58(1)
6.2 Constants
58(3)
6.3 Keywords and Identifiers
61(1)
6.4 Variables and Data Types
61(3)
6.5 Storage Type Qualifier
64(10)
7 Operators and Expressions
74(24)
7.1 Operators in C
74(8)
7.2 Expressions
82(3)
7.3 Precedence and Associativity
85(13)
8 Input and Output Statement
98(34)
8.1 Formatted I/O Functions
98(10)
8.2 Unformatted I/O Functions
108(1)
8.3 General Structure of a C Program
109(1)
8.4 First C Program
110(1)
8.5 Executing a C Program
111(2)
8.6 Executing from UNIX Environment
113(1)
8.7 Developing a Program
113(2)
8.8 Programming Examples
115(17)
9 Branching Statement
132(39)
9.1 If Statement
132(11)
9.2 Conditional Operator
143(1)
9.3 Switch Statement
144(4)
9.4 Goto Statement
148(1)
9.5 Programing Examples
148(23)
10 Loop Statements
171(53)
10.1 While Statement
172(5)
10.2 Nested Loop
177(1)
10.3 Test Your Progress
178(1)
10.4 For Statement
179(6)
10.5 Test Your Progress
185(1)
10.6 Do-while Statement
186(1)
10.7 Break Statement
187(2)
10.8 Use of Goto
189(1)
10.9 Continue Statement
190(1)
10.10 Test Your Progress
191(1)
10.11 Programming Examples
191(33)
11 Array
224(44)
11.1 What is an Array?
224(1)
11.2 Declaration of an Array
224(1)
11.3 Initializing Arrays
225(3)
11.4 Accessing Elements of an Array
228(4)
11.5 Sorting
232(8)
11.6 Searching
240(2)
11.7 Two Dimensional Array
242(3)
11.8 Multidimensional Array
245(2)
11.9 Programming Examples
247(21)
12 String Handling
268(52)
12.1 String
268(5)
12.2 Overcoming the Limitation with the Help of Scanset
273(5)
12.3 sscanf() and sprintf() Function
278(2)
12.4 Character Handling Functions
280(9)
12.5 String Handling Functions
289(5)
12.6 Two-Dimensional Array of Characters
294(2)
12.7 Programming Examples
296(24)
13 Function
320(47)
13.1 Why Function
320(3)
13.2 Calling a Function
323(1)
13.3 Types of Function Arguments
324(2)
13.4 Array as Function Argument
326(2)
13.5 Function Prototype
328(3)
13.6 Passing Multidimensional Array as Function Argument
331(1)
13.7 Storage Class
332(5)
13.8 Multi-file Programs
337(2)
13.9 Recursion
339(4)
13.10 Advantage and Disadvantage of Recursion
343(1)
13.11 Implementation of Some Standard Library Functions
343(2)
13.12 Programming Examples
345(22)
14 Pointer
367(49)
14.1 Pointer
367(4)
14.2 Array and Pointer
371(1)
14.3 Pointer Arithmetic
372(3)
14.4 Array vs Pointer
375(1)
14.5 Pointer and Function
376(4)
14.6 Pointer and String
380(1)
14.7 Function Returning Pointer
381(2)
14.8 Pointers and Multidimensional Arrays
383(1)
14.9 Array of Pointers
384(6)
14.10 Dynamic Memory Allocation
390(3)
14.11 Function Pointer
393(1)
14.12 Returning a Two Dimensional Array from Function
394(2)
14.13 Dangling Pointer
396(1)
14.14 Implementation of Some Standard Library Functions
397(2)
14.15 Advantages of Pointer
399(1)
14.16 Interpreting Complicated Pointer Declarations
400(1)
14.17 Programming Examples
401(15)
15 Structure
416(45)
15.1 Structure
416(2)
15.2 Structure Initialization
418(4)
15.3 Arrays of Structures
422(3)
15.4 Nested Structures
425(2)
15.5 Structures and Functions
427(1)
15.6 Function Returning Structure
428(3)
15.7 Structures and Pointers
431(3)
15.8 Bit Fields
434(8)
15.9 Programming Examples
442(19)
16 File
461(46)
16.1 What is a File?
461(1)
16.2 Processing a File
462(2)
16.3 Input-Output Operations on Files
464(9)
16.4 More File Functions
473(4)
16.5 Command Line Arguments
477(2)
16.6 Programming Examples
479(28)
17 Bitwise Operators
507(21)
17.1 Bitwise & Operator
508(3)
17.2 Bitwise | Operator
511(1)
17.3 Bitwise ˆ Operator
512(2)
17.4 ~ Operator
514(1)
17.5 Left Shift Operator
515(2)
17.6 Right Shift Operator
517(1)
17.7 Programming Examples
518(10)
18 Preprocessors
528(18)
18.1 #define Directive
528(1)
18.2 Macros with Arguments
529(2)
18.3 Nesting of Macro
531(1)
18.4 Multiline Macro
531(1)
18.5 Macro vs. Function
532(1)
18.6 #undef Directive
532(1)
18.7 #include Directive
532(1)
18.8 Conditional Compilation Directive
533(3)
18.9 Additional Directives
536(1)
18.10 Predefined Macros
537(1)
18.11 Programming Examples
538(8)
19 Linked List
546(35)
19.1 Linked List
547(1)
19.2 Advantages of Linked List
547(1)
19.3 Types of Linked List
547(1)
19.4 Implementation of Singly Linked List
548(2)
19.5 Operations on Singly Linked List
550(3)
19.6 Inserting a New Element in a Linked List
553(15)
19.7 Applications of Singly Linked List
568(4)
19.8 Disadvantages of Linked List
572(1)
19.9 Programming Examples
572(9)
Part C Technical Questions for Interview
Model Question Set-1
581(5)
Answer to Model Question Set-1
584(2)
Model Question Set-2
586(5)
Answer to Model Question Set-2
589(2)
Model Question Set-3
591(5)
Answer to Model Question Set-3
594(2)
Model Question Set-4
596(6)
Answer to Model Question Set-4
599(3)
Model Question Set-5
602(5)
Answer to Model Question Set-5
605(2)
Appendix
I Common Questions and Answers
607(23)
II ASCII Characters
630(5)
III Some Useful Library Functions
635
Subrata Saha is presently working as Head of the Department of Computer Applications at Techno India Hooghly, West Bengal. He has more than seventeen years of teaching experience in the subjects of C, C++, Java and data structures. He obtained his MTech degree in Software Engineering from West Bengal University of Technology. His areas of interest include object oriented languages, image processing and cryptography. Subhodip Mukherjee is currently Head of the Department of Computer Applications, Techno India College of Technology, West Bengal, and has more than seventeen years of teaching experience. He has completed his MTech in Software Engineering from National Institute of Technical Teachers' Training and Research, Kolkata. His areas of interest include object oriented languages, software engineering, computer architecture and database management systems.