The NCRE dedicated counseling tutorial: two C (2013 paperless examination Edition)(Chinese Edition)
Ein Angebot gefunden
Bester Preis: € 66,06 (vom 26.04.2020)Aus dem Archiv:
1
The NCRE dedicated counseling tutorial: two C (2013 paperless examination Edition)(Chinese Edition) (2013)
~EN PB NWISBN: 9787121192265 bzw. 7121192268, vermutlich in Englisch, Taschenbuch, neu.
Lieferung aus: China, Volksrepublik, Versandkosten nach: DEU.
Von Händler/Antiquariat, BookerStudy.
paperback. New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pub Date: 2013 Pages: 308 in Publisher: Publishing House of Electronics Industry the NCRE dedicated counseling tutorial: two C (2013 paperless examination Edition) organized by the College of education and other examination of the Greek race preparation. NCRE dedicated counseling Tutorial: two C (2013 paperless examination Edition) prepared by the Examination Institute of the Greek race and education organization. as the the NCRE two C language counseling and training specified tutorial. Closely linked to the the NEEA new examination outline of the book content through calendar year questions for scientific analysis. research. summarize. refined from. Comprehensive practical book covers all the knowledge points of the examination syllabus prescribed prescribed examination syllabus content to focus on refinement and deepening. Reading this book. it is equivalent to reading a detailed examination syllabus with knowledge comments. Prepare for the exam can be mastered by reading this book under the knowledge of the exam outline master exam focus and difficulty familiar with the contents of the distribution. Personnel the book suitable participate NCRE and read the majority of computer enthusiasts. Contents: Chapter 1 algorithm and data structure representation of the data structure of the definition of the data structure of the complexity of the algorithm 1 1.1.2 2 1.1.3 3 1.1.4 1 1.1.1 algorithm concept 4 1.1 1 1.1 Algorithms and Data Structures Overview. 5 linear structure with nonlinear structure 4 1.2 Linear 1.2.1 in Table 4 the linear table below summarizes the 4 1.2.2 Linear tables are stored sequentially 5 1.3 stack and queue 6 1.3.1 stack defined operation 6 1.3.2 queue definition and operation 1.4.1 8 7 1.4 linear list linear chain store 9 1.4.2 doubly linked list structure and its basic operations 10 1.5 tree and binary tree tree 11 1.5.1 Definition 11 1.5.2 binary tree the definition and properties 11 1.5.3 binary tree traversal 13 1.6 Find Technology 15 1.6.1 order to find a 15 1.6.2 dichotomy Find 15 1.7 Sequencing Technology 15 1.8 Exercises 18 Chapter 2 program design structure 21 2.1 programming Style 21 2.2 22 2.3 object-oriented programming structured programming design 23 2.3.1 23 2.3.2 class and instance of the object-oriented features 24 2.3.3 24 2.4 Exercises 25 Chapter 3 Software Engineering Fundamentals 26 3.1 Software Engineering basic 31 3.3 27 3.2 Structured Analysis method 28 3.2.1 structured analysis of the meaning of the concept 26 3.1.1 Software 26 3.1.2 software engineering 29 3.2.2 software requirements specifications structured design methodology 32 3.3.1 Software design of basic content 34 3.3.3 Overview 32 3.3.2 Structured Design 38 3.5.1 Step Design 34 3.3.4 Detailed design 35 3.4 software testing software testing 36 3.4.1 Overview 36 3.4.2 software testing techniques 37 3.5 program debugging 39 3.5.2 static debugging 39 3.5.3 40 3.6 Exercises 41 Chapter 4 43 4.1 database database design basis dynamic debugging basic concepts 43 4.1.1 Data and Information 43 4.1.2 Data processing. database and database management system 43 4.1. 46 4.2 data model of the system of the internal structure of the database system of the database system development 45 4.1.4 48 4.2.1 Data Model Overview 48 4.2.2 ER model 49 4.2.3 Relational Model 50 4.2.4 51 4.2.5 Data Manipulation relations data constraints of relational algebra 52 4.3 52 4.4 Database Design 53 4.5 Exercises 55 Chapter 5 program to design the basic concepts 57 5.1 program procedures and program design 57 5.1.1 57 5.1.3 57 5.1.2 Programming Programming Language 57 5.2 C language the basic structure of the statements. and keywords 58 5.2.1 C program 58 5.2.2 C language statement 58 5.2.3 Keywords 60 5.3 Exercises 60 Chapter 6 C language data types. operators and expressions 62 6.1 C language data types 62 6.2 constants. variables. and identifier integer variable 63 6.2.1 Constants 63 6.2.2 variables 63 6.2.3 identifier 64 6.3 integer data 64 6.3.1 representation of the integer constant 64 6.3.2 65 6.3.3 integer stored in the memory in the form of 65 6.3.4 output format representation of the real constant 66 6.4 Real Data 66 6.4.1 66 6.4.2 Real variable 66 6.4.3 output format 67 6.5 arithmetic expressions 67 mixing between the different types of data operator and assignment expression 68 6.6.2 6.5.1 arithmetic operators 68 6.6 67 6.5.2 arithmetic expression assignment expression 68 6.6.1 assignment operation 70 6.7 increment. decrement and comma expression 71 6.7.1 increment. decrement 71 6.7.2 comma expression 72 6.8 Exercises 72 Chapter 7 order structure program design 74 7.1-formatted output printf () function 74 7.1.1 Basic format 74 7.1.2 format Description 74 7.1.3 printf function output 76 7.2-formatted input scanf () function 77 7.2.1 Basic format 77 7.2.2 Format Description 77 7.2.3 through the the scanf function of input data 78 7.3 single character input and output getchar ( ) and putchar () function 79 7.3.1 single character output function 79 7.3.2 single character input function 79 7.4 Exercises 80 Chapter 8 select Structured Programming 85 8.1 Relational operators and their expression 85 8.1.1 relationship operator relationship between expression of its priorities 85 8.1.2 85 8.2 Logical operators and its expression 86 8.2.1 Logical operators and priorities logical expressions of 86 8.2.2 87 8.3 if statements and conditional operator 88 8.3.1 if statement 88 8.3.2 if else statement 91 8.3.3 if statement nested 91 8.3.4 Overview 103 9.2 for statements and constitute the conditional expression 96 8.4 switch statement 97 8.5 Exercises 98 Chapter 9 loop structure of the program design 103 9.1 cycle statement the cycle structure 103 9.3 while statement and a loop structure 106 9.4 do while statement and a loop structure nested loop statement 109 9.6 eak and continue Statements 108 9.5 112 9.7 Exercises 114 Chapter 10 character data 119 10.1 characters string constants 120 the character variables constant 119 10.2 120 10.2.1 10.2.2 input and output of characters commonly used output format 120 10.3 121 10.3.1 using scanf () statement 121 10.3.2 using printf () statement 121 10.4 a one-dimensional array reference to the definition and the one-dimensional array of elements defined dimensional array of the 121 10.4.1 array definition 121 10.4.2 122 10.4.3 one-dimensional array references 123 10.5 one-dimensional array of applications for example 123 10.6 definition of the two-dimensional array. and two dimensional array elements reference the definition of the two-dimensional array of 125 10.6.1 125 10.6.2 dimensional array reference application example of the two-dimensional array 126 10.7 128 127 10.8 string array of characters beginning of the definition of the character array 128 10.8.2 10.8.1 initialization 129 10.8.3 character array reference processing 129 10.8.4 string string input and output 129 10.9 130 10.9.1 input string gets () function the 130 10.9.2 Output string puts () function 131 10.10 character string handling functions 131 10.10.1 string comparison strcmp () function 131 10.10.2 133 10.10.4 string concatenation. test the length of the string functions strlen (array of characters) 132 10.10.3 string copy strcpy () function strcat () function 133 10.10.5 capital letters in the string convert the lowercase strlwr () function 134 10.10.6 the string lowercase letters converted to uppercase strupr () the function function 134 10.11 Exercises 135 Chapter 11 138 11.2 138 11.1 function definition function The parameters and return values ??of parameters 139 11.2.2 function return value function 139 11.2.1 140 11.2.3 the declaration of the function prototype function nested call 142 11.3 144 11.4 Recursive call 145 11.5 internal functions and external functions 149 11.6 external variables of the internal variables of the internal and external variables 150 11.6.1 151 11.6.2 152 153 11.8 Exercises 154 Chapter 12 11.7 Variables dynamic memory and static storage pointer 161 12.1 pointer concept 161 12.2 pointer variable definitions and type 162 12.2. the definition of a pointer variable the 162 12.2.2 pointer variable the op 162 12.2.3 pointer variable reference 163 12.3 pointer with the definition of a one-dimensional array 165 12.3.1 one-dimensional array pointer 165 12.3.2 The use of one-dimensional array pointer 165 12.4 two-dimensional array of pointer with two-dimensional array of 166 12.4.1 pointer defined two-dimensional array of pointers understand 166 12.4.2 168 12.4.3 referenced by address two-dimensional array of elements 169 12.4.4 through the establishment of an array of pointers to reference to a two-dimensional array of elements difference between 172 12.5 169 12.4.5 through the establishment of a row pointer reference to the use of a two-dimensional array of elements 169 12.4.6 dimensional array pointer 170 12.4.7 string pointer definition 171 12.4.8 string pointer variable character array pointer with the use of an array of pointers 173 12.5.2 173 12.5.3 pointer to a pointer variable of the function the 172 12.5.1 pointer array defined definition 175 12.5.4 use the pointer to a pointer the 177 12.5.5 pointer variable as a function parameter 177 12.6 Exercises 181 Chapter 13 compiler preprocessing compiled pretreatment dynamic memory allocation of dynamic storage allocation 190 13.2.1 Overview 189 13.2 190 13.2.2 conditional compilation 191 13.3 Exercises 193 Chapter 14 structure and union definition of the type of structure 197 14.1 13.1 189 structure variables 198 14.2.1 variable definition structure 199 14.2.2 structure variable references and initialization 199 14.2.3 array of structures defined with reference to the 201 point structure variables 14.2.4 pointer 197 14.2 201 14.2 14.2.9 linked list of deleted .5 point structure array pointer to create a linked list of linked lists 202 14.2.7 202 14.2.6 204 14.2.8 linked list insert 206 207 14.4 Exercises 210 Chapter 15-bit arithmetic 213 15.1 207 14.3 unions Operators 213 15.2 operator and bitwise operations 219 16.2 213 15.3 Exercises 216 Chapter 16 file 218 16.1 C language file concept 218 16.1.1 218 16.1.2 file with the file name file classification 218 16.1.3 read files and write files opened file pointer 219 16.3 File open and close the file of 220 16.3.1 220 16.3.2 file Close 221 16.4 commonly used file read and write operations library functions the 222 16.4.1 formatted read and write functions 222 16.4.2 read and write character function fputc and fgetc 223 16.4.3 to read and write the string functions fgets and fputs 224 16.4.4 read and write functions fread and fwrite 225 16.5 file positioning function of the data block 226 16.5.1 fseek function 226 16.5.2 227 16.5.3 the ftell function rewind function 227 16.6 Exercises 227 Chapter 17 231 17.1-on examination skills to fill in the blank on the machine simulation questions 238 17.2.1 program 231 17.2 238 17.2.2 program error correction question on machine guidance 239 17.2.3 Programming Question 17.3 on 240 Machine simulation questions 240 240 17.3.2 17.3.1 program fill in the blank program error correction question 241 17.3.3 programming problem on the machine simulation questions 242 17.4 30 243 17.4.1 243 17.4.2 program fill in the blank the program error correction question 244 17.4 .3 programming problem 245 17.5 40 246 17.5.1 program on the machine simulation questions fill in the blank 246 17.5.2 procedural error correction question program fill in the blank on the machine simulation questions five 248 17.6.1 246 17.5.3 Programming questions 247 17.6 248 17.6 .2 procedures Correction Question 249 17.6.3 programming questions 250 17.7 machine simulation questions an analysis and explanation of program design questions fill in the blank the 251 17.7.2 procedural error correction question 251 17.7.3 251 17.7.1 program 252 17.8 on the machine simulation the questions two analyze and explain the program fill in the blank 252 17.8.1 252 17.8.2 Program error correction question 253 17.8.3 Programming Question 253 17.9 254 17.9.1 program fill in the blank on the machine simulation questions analyze and explain 254 17.9.2 program change programming questions wrong title the 254 17.9.3 programming questions 254 17.10 on machine simulation questions IV analyze and explain the program fill in the blank 255 17.10.2 255 17.10.1 program error correction question 255 17.10.3 255 17.11 on the machine simulation questions five analysis explain 256 17.11.1 program to fill in the blank 256 of 17.11.2 program error correction question 257 the 17.11.3 program design title 257 Appendix A Problem Analysis and answers 258 Appendix B two C language examination papers in 2012 3 290 Appendix C 2012 September month two C language examination papers of 308 Satisfaction guaranteed,or money back.
Von Händler/Antiquariat, BookerStudy.
paperback. New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pub Date: 2013 Pages: 308 in Publisher: Publishing House of Electronics Industry the NCRE dedicated counseling tutorial: two C (2013 paperless examination Edition) organized by the College of education and other examination of the Greek race preparation. NCRE dedicated counseling Tutorial: two C (2013 paperless examination Edition) prepared by the Examination Institute of the Greek race and education organization. as the the NCRE two C language counseling and training specified tutorial. Closely linked to the the NEEA new examination outline of the book content through calendar year questions for scientific analysis. research. summarize. refined from. Comprehensive practical book covers all the knowledge points of the examination syllabus prescribed prescribed examination syllabus content to focus on refinement and deepening. Reading this book. it is equivalent to reading a detailed examination syllabus with knowledge comments. Prepare for the exam can be mastered by reading this book under the knowledge of the exam outline master exam focus and difficulty familiar with the contents of the distribution. Personnel the book suitable participate NCRE and read the majority of computer enthusiasts. Contents: Chapter 1 algorithm and data structure representation of the data structure of the definition of the data structure of the complexity of the algorithm 1 1.1.2 2 1.1.3 3 1.1.4 1 1.1.1 algorithm concept 4 1.1 1 1.1 Algorithms and Data Structures Overview. 5 linear structure with nonlinear structure 4 1.2 Linear 1.2.1 in Table 4 the linear table below summarizes the 4 1.2.2 Linear tables are stored sequentially 5 1.3 stack and queue 6 1.3.1 stack defined operation 6 1.3.2 queue definition and operation 1.4.1 8 7 1.4 linear list linear chain store 9 1.4.2 doubly linked list structure and its basic operations 10 1.5 tree and binary tree tree 11 1.5.1 Definition 11 1.5.2 binary tree the definition and properties 11 1.5.3 binary tree traversal 13 1.6 Find Technology 15 1.6.1 order to find a 15 1.6.2 dichotomy Find 15 1.7 Sequencing Technology 15 1.8 Exercises 18 Chapter 2 program design structure 21 2.1 programming Style 21 2.2 22 2.3 object-oriented programming structured programming design 23 2.3.1 23 2.3.2 class and instance of the object-oriented features 24 2.3.3 24 2.4 Exercises 25 Chapter 3 Software Engineering Fundamentals 26 3.1 Software Engineering basic 31 3.3 27 3.2 Structured Analysis method 28 3.2.1 structured analysis of the meaning of the concept 26 3.1.1 Software 26 3.1.2 software engineering 29 3.2.2 software requirements specifications structured design methodology 32 3.3.1 Software design of basic content 34 3.3.3 Overview 32 3.3.2 Structured Design 38 3.5.1 Step Design 34 3.3.4 Detailed design 35 3.4 software testing software testing 36 3.4.1 Overview 36 3.4.2 software testing techniques 37 3.5 program debugging 39 3.5.2 static debugging 39 3.5.3 40 3.6 Exercises 41 Chapter 4 43 4.1 database database design basis dynamic debugging basic concepts 43 4.1.1 Data and Information 43 4.1.2 Data processing. database and database management system 43 4.1. 46 4.2 data model of the system of the internal structure of the database system of the database system development 45 4.1.4 48 4.2.1 Data Model Overview 48 4.2.2 ER model 49 4.2.3 Relational Model 50 4.2.4 51 4.2.5 Data Manipulation relations data constraints of relational algebra 52 4.3 52 4.4 Database Design 53 4.5 Exercises 55 Chapter 5 program to design the basic concepts 57 5.1 program procedures and program design 57 5.1.1 57 5.1.3 57 5.1.2 Programming Programming Language 57 5.2 C language the basic structure of the statements. and keywords 58 5.2.1 C program 58 5.2.2 C language statement 58 5.2.3 Keywords 60 5.3 Exercises 60 Chapter 6 C language data types. operators and expressions 62 6.1 C language data types 62 6.2 constants. variables. and identifier integer variable 63 6.2.1 Constants 63 6.2.2 variables 63 6.2.3 identifier 64 6.3 integer data 64 6.3.1 representation of the integer constant 64 6.3.2 65 6.3.3 integer stored in the memory in the form of 65 6.3.4 output format representation of the real constant 66 6.4 Real Data 66 6.4.1 66 6.4.2 Real variable 66 6.4.3 output format 67 6.5 arithmetic expressions 67 mixing between the different types of data operator and assignment expression 68 6.6.2 6.5.1 arithmetic operators 68 6.6 67 6.5.2 arithmetic expression assignment expression 68 6.6.1 assignment operation 70 6.7 increment. decrement and comma expression 71 6.7.1 increment. decrement 71 6.7.2 comma expression 72 6.8 Exercises 72 Chapter 7 order structure program design 74 7.1-formatted output printf () function 74 7.1.1 Basic format 74 7.1.2 format Description 74 7.1.3 printf function output 76 7.2-formatted input scanf () function 77 7.2.1 Basic format 77 7.2.2 Format Description 77 7.2.3 through the the scanf function of input data 78 7.3 single character input and output getchar ( ) and putchar () function 79 7.3.1 single character output function 79 7.3.2 single character input function 79 7.4 Exercises 80 Chapter 8 select Structured Programming 85 8.1 Relational operators and their expression 85 8.1.1 relationship operator relationship between expression of its priorities 85 8.1.2 85 8.2 Logical operators and its expression 86 8.2.1 Logical operators and priorities logical expressions of 86 8.2.2 87 8.3 if statements and conditional operator 88 8.3.1 if statement 88 8.3.2 if else statement 91 8.3.3 if statement nested 91 8.3.4 Overview 103 9.2 for statements and constitute the conditional expression 96 8.4 switch statement 97 8.5 Exercises 98 Chapter 9 loop structure of the program design 103 9.1 cycle statement the cycle structure 103 9.3 while statement and a loop structure 106 9.4 do while statement and a loop structure nested loop statement 109 9.6 eak and continue Statements 108 9.5 112 9.7 Exercises 114 Chapter 10 character data 119 10.1 characters string constants 120 the character variables constant 119 10.2 120 10.2.1 10.2.2 input and output of characters commonly used output format 120 10.3 121 10.3.1 using scanf () statement 121 10.3.2 using printf () statement 121 10.4 a one-dimensional array reference to the definition and the one-dimensional array of elements defined dimensional array of the 121 10.4.1 array definition 121 10.4.2 122 10.4.3 one-dimensional array references 123 10.5 one-dimensional array of applications for example 123 10.6 definition of the two-dimensional array. and two dimensional array elements reference the definition of the two-dimensional array of 125 10.6.1 125 10.6.2 dimensional array reference application example of the two-dimensional array 126 10.7 128 127 10.8 string array of characters beginning of the definition of the character array 128 10.8.2 10.8.1 initialization 129 10.8.3 character array reference processing 129 10.8.4 string string input and output 129 10.9 130 10.9.1 input string gets () function the 130 10.9.2 Output string puts () function 131 10.10 character string handling functions 131 10.10.1 string comparison strcmp () function 131 10.10.2 133 10.10.4 string concatenation. test the length of the string functions strlen (array of characters) 132 10.10.3 string copy strcpy () function strcat () function 133 10.10.5 capital letters in the string convert the lowercase strlwr () function 134 10.10.6 the string lowercase letters converted to uppercase strupr () the function function 134 10.11 Exercises 135 Chapter 11 138 11.2 138 11.1 function definition function The parameters and return values ??of parameters 139 11.2.2 function return value function 139 11.2.1 140 11.2.3 the declaration of the function prototype function nested call 142 11.3 144 11.4 Recursive call 145 11.5 internal functions and external functions 149 11.6 external variables of the internal variables of the internal and external variables 150 11.6.1 151 11.6.2 152 153 11.8 Exercises 154 Chapter 12 11.7 Variables dynamic memory and static storage pointer 161 12.1 pointer concept 161 12.2 pointer variable definitions and type 162 12.2. the definition of a pointer variable the 162 12.2.2 pointer variable the op 162 12.2.3 pointer variable reference 163 12.3 pointer with the definition of a one-dimensional array 165 12.3.1 one-dimensional array pointer 165 12.3.2 The use of one-dimensional array pointer 165 12.4 two-dimensional array of pointer with two-dimensional array of 166 12.4.1 pointer defined two-dimensional array of pointers understand 166 12.4.2 168 12.4.3 referenced by address two-dimensional array of elements 169 12.4.4 through the establishment of an array of pointers to reference to a two-dimensional array of elements difference between 172 12.5 169 12.4.5 through the establishment of a row pointer reference to the use of a two-dimensional array of elements 169 12.4.6 dimensional array pointer 170 12.4.7 string pointer definition 171 12.4.8 string pointer variable character array pointer with the use of an array of pointers 173 12.5.2 173 12.5.3 pointer to a pointer variable of the function the 172 12.5.1 pointer array defined definition 175 12.5.4 use the pointer to a pointer the 177 12.5.5 pointer variable as a function parameter 177 12.6 Exercises 181 Chapter 13 compiler preprocessing compiled pretreatment dynamic memory allocation of dynamic storage allocation 190 13.2.1 Overview 189 13.2 190 13.2.2 conditional compilation 191 13.3 Exercises 193 Chapter 14 structure and union definition of the type of structure 197 14.1 13.1 189 structure variables 198 14.2.1 variable definition structure 199 14.2.2 structure variable references and initialization 199 14.2.3 array of structures defined with reference to the 201 point structure variables 14.2.4 pointer 197 14.2 201 14.2 14.2.9 linked list of deleted .5 point structure array pointer to create a linked list of linked lists 202 14.2.7 202 14.2.6 204 14.2.8 linked list insert 206 207 14.4 Exercises 210 Chapter 15-bit arithmetic 213 15.1 207 14.3 unions Operators 213 15.2 operator and bitwise operations 219 16.2 213 15.3 Exercises 216 Chapter 16 file 218 16.1 C language file concept 218 16.1.1 218 16.1.2 file with the file name file classification 218 16.1.3 read files and write files opened file pointer 219 16.3 File open and close the file of 220 16.3.1 220 16.3.2 file Close 221 16.4 commonly used file read and write operations library functions the 222 16.4.1 formatted read and write functions 222 16.4.2 read and write character function fputc and fgetc 223 16.4.3 to read and write the string functions fgets and fputs 224 16.4.4 read and write functions fread and fwrite 225 16.5 file positioning function of the data block 226 16.5.1 fseek function 226 16.5.2 227 16.5.3 the ftell function rewind function 227 16.6 Exercises 227 Chapter 17 231 17.1-on examination skills to fill in the blank on the machine simulation questions 238 17.2.1 program 231 17.2 238 17.2.2 program error correction question on machine guidance 239 17.2.3 Programming Question 17.3 on 240 Machine simulation questions 240 240 17.3.2 17.3.1 program fill in the blank program error correction question 241 17.3.3 programming problem on the machine simulation questions 242 17.4 30 243 17.4.1 243 17.4.2 program fill in the blank the program error correction question 244 17.4 .3 programming problem 245 17.5 40 246 17.5.1 program on the machine simulation questions fill in the blank 246 17.5.2 procedural error correction question program fill in the blank on the machine simulation questions five 248 17.6.1 246 17.5.3 Programming questions 247 17.6 248 17.6 .2 procedures Correction Question 249 17.6.3 programming questions 250 17.7 machine simulation questions an analysis and explanation of program design questions fill in the blank the 251 17.7.2 procedural error correction question 251 17.7.3 251 17.7.1 program 252 17.8 on the machine simulation the questions two analyze and explain the program fill in the blank 252 17.8.1 252 17.8.2 Program error correction question 253 17.8.3 Programming Question 253 17.9 254 17.9.1 program fill in the blank on the machine simulation questions analyze and explain 254 17.9.2 program change programming questions wrong title the 254 17.9.3 programming questions 254 17.10 on machine simulation questions IV analyze and explain the program fill in the blank 255 17.10.2 255 17.10.1 program error correction question 255 17.10.3 255 17.11 on the machine simulation questions five analysis explain 256 17.11.1 program to fill in the blank 256 of 17.11.2 program error correction question 257 the 17.11.3 program design title 257 Appendix A Problem Analysis and answers 258 Appendix B two C language examination papers in 2012 3 290 Appendix C 2012 September month two C language examination papers of 308 Satisfaction guaranteed,or money back.
Daten vom 26.04.2020 21:21h
ISBN (andere Schreibweisen): 7-121-19226-8, 978-7-121-19226-5
ISBN (andere Schreibweisen): 7-121-19226-8, 978-7-121-19226-5
Zuerst gefunden: 26.04.2020 21:22:01
Zuletzt gefunden: 26.04.2020 21:22:01
Kleinster Preis: € 66,06 (vom 26.04.2020 21:22:01)
Höchster Preis: € 66,06 (vom 26.04.2020 21:22:01)
Fundstellen insgesamt: 1
Zuletzt gefunden: 26.04.2020 21:22:01
Kleinster Preis: € 66,06 (vom 26.04.2020 21:22:01)
Höchster Preis: € 66,06 (vom 26.04.2020 21:22:01)
Fundstellen insgesamt: 1
Momentan keine Suchergebnisse - vielleicht bald lieferbar
Ihre Suche nach ist bei mehr als 100 angebundenen Webshops momentan nicht lieferbar. Wir finden dieses Buch aber trotzdem innerhalb weniger Wochen.
Sie Suchen nach diesem Buch:
ZHANG YONG GANG: The NCRE dedicated counseling tutorial: two C (2013 paperless examination Edition)(Chinese Edition)
ISBN: 9787121192265
Speichern Sie diese Suche kostenlos in ab, dann werden Sie automatisch benachrichtigt, sobald dieses Buch verfügbar ist. Meistens finden wir dieses Buch innerhalb weniger Wochen und verständigen Sie dann per E-Mail. Sie können dann frei entscheiden, ob Sie das Buch kaufen wollen oder nicht.
Unsere Suchtipps für Ihre Suche:
- Alle Bücher des Autors.: Suche nach "Autor: zhang" liefert mehr Ergebnisse
- Suchen nach Suchbegriffen wie Autor oder Titel des Buches sind erfolgreicher als solche nach der ISBN.: Suche nach "examination counseling dedicated zhang" liefert mehr Ergebnisse
Sie haben jetzt folgende Möglichkeiten:
- Speichern Sie diese Seite in Ihren Lesezeichen oder Favoriten ab, dann können Sie jederzeit die Suche erneut ausführen.
- Das Buch ist tatsächlich derzeit vergriffen bzw. nicht lieferbar. Es ist z.B. eine Rarität. Möglicherweise ist es aber in einiger Zeit lieferbar. Speichern Sie dazu diese Suche kostenlos ab oder lassen Sie sich kostenlos auf dieses Gerät benachrichten und Sie werden automatisch per E-Mail oder Nachricht informiert, sobald dieses Buch wieder lieferbar wird. Wir sind zuversichtlich, dass wir jedes Buch auf diese Weise innerhalb relativ kurzer Zeit finden. Probieren Sie es einfach aus!
Mich bei neuen Ergebnissen benachrichtigenSuche jetzt kostenlos SpeichernIn 50 Millionen auch bereits vergriffenen Büchern recherchieren!
Anmeldung mit Google:
ODER
Anmeldung mit Facebook:
Lade…