BRIAN W.KERNIGHAN  | 대영사

0원  | 20100110  | 9788971630266

C언어의 창시자들이 직접 집필한 책으로 C 언어프로그래밍에 대해 간결하고 명료하게 설명해주고 있다. C 언어의 전반적인 구조, C언어의 기본적인 사항 즉, 변수, 수식, 제어흐름, 함수, C 언어에서 가장 중요한 포인터, 배열, 구조, 입출력, UNIX 시스템과의 인터페이스에 대하여 수록되어 있다.

Brian W. Kernighan  | Princeton University Press

57,810원  | 20210330  | 9780691219103

Money can buy her marriage

Brian W. Kernighan  | Princeton University Press

0원  | 20170124  | 9780691176543

Revised edition of: D is for digital. 2011.

Brian W. Kernighan  | Prentice-Hall

0원  | 99991230  | 9780139376993

Alan A. A. Donovan, Brian W. Kernighan  | Addison-Wesley Professional

55,280원  | 20151105  | 9780134190440

Go is an open-source programming language that makes it easy to build clean, reliable, and efficient software. It has been winning converts from dynamic language enthusiasts as well as users of traditional compiled languages. The former appreciate the robustness and efficiency that Go's lightweight type system brings to their code; the latter find Go's simplicity and fast tools a refreshing change.

Fourer, Robert/ Gay, David M./ Kernighan, Brian W.  | Thomson Learning

0원  | 20100628  | 9780534388096

1. PRODUCTION MODELS: MAXIMIZING PROFITS. A two-variable linear program. The two-variable linear program in AMPL. A linear programming model. The linear programming model in AMPL. Adding lower bounds to the model. Adding resource constraints to the model. AMPL interfaces. 2. DIET AND OTHER INPUT MODELS: MINIMIZING COSTS. A linear program for the diet problem. An AMPL model for the diet problem. Using the AMPL diet model. Generalizations to blending, economics, and scheduling. 3. TRANSPORTATION AND ASSIGNMENT MODELS. A linear program for the transportation problem. An AMPL model for the transportation problem. Other interpretations of the transportation model. 4. BUILDING LARGER MODELS. A multicommodity transportation model. A multiperiod production model. A model of production and transportation. 5. SIMPLE SETS AND INDEXING. Unordered sets. Sets of numbers. Set operations. Set membership operations and functions. Indexing expressions. Ordered sets. 6. COMPOUND SETS AND INDEXING. Sets of ordered pairs. Subsets and slices of ordered pairs. Sets of longer tuples. Operations on sets of tuples. Indexed collections of sets. 7. PARAMETERS AND EXPRESSIONS. Parameter declarations. Arithmetic expressions. Logical and conditional expressions. Restrictions on parameters. Computed parameters. Randomly generated parameters. Logical parameters. Symbolic parameters. 8. LINEAR PROGRAMS: VARIABLES, OBJECTIVES AND CONSTRAINTS. Variables. Linear expressions. Objectives. Constraints. 9. SPECIFYING DATA. Formatted data: the data command. Data in lists. Data in tables. Other features of data statements. Reading unformatted data: the read command. 10. DATABASE ACCESS. General principles of data correspondence. Examples of table-handling statements. Reading data from relational tables. Writing data to relational tables. Reading and writing the same table. Indexed collections of tables and columns. Standard and built-in table handlers. 11. MODELING COMMANDS. General principles of commands and options. Setting up and solving models and data. Modifying data. Modifying models. 12. DISPLAY COMMANDS. Browsing through results: the display command. Formatting options for display. Numeric options for display. Other output commands: print and printf. Related solution values. Other display features for models and instances. General facilities for manipulating output. 13. COMMAND SCRIPTS. Running scripts: include and commands. Iterating over a set: the for statement. Iterating subject to a condition: the repeat statement. Testing a condition: the if-then-else statement. Terminating a loop: break and continue. Stepping through a script. Manipulating character strings. 14. INTERACTIONS WITH SOLVERS. Presolve. Retrieving results from solvers. Exchanging information with solvers via suffixes. Alternating between models. Named problems. 15. NETWORK LINEAR PROGRAMS. Minimum-cost transshipment models. Other network models. Declaring network models by node and arc. Rules for node and arc declarations. Solving network linear programs. 16. COLUMNWISE FORMULATIONS. An input-output model. A scheduling model. Rules for columnwise formulations. 17. PIECEWISE-LINEAR PROGRAMS. Cost terms. Common two-piece and three-piece terms. Other piecewise-linear functions. Guidelines for piecewise-linear optimization. 18. NONLINEAR PROGRAMS. Sources of nonlinearity. Nonlinear variables. Nonlinear expressions. Pitfalls of nonlinear programming. 19. COMPLEMENTARITY PROBLEMS. Sources of complementarity. Forms of complementarity constraints. Working with complementarity constraints. 20. INTEGER LINEAR PROGRAMS. Integer variables. Zero-one variables and logical conditions. Practical considerations in integer programming. APPENDIX A: AMPL REFERENCE MANUAL. INDEX.

Tondo, Clovis L./ Gimpel, Scott E./ Kernighan, Bri  | Prentice-Hall

0원  | 20100315  | 9780131096530

Contains complete explanation of all exercises in Kernighan and Ritchie 2nd Ed. Ideal for use with K&R in any course on C.

Brian W. Kernighan, Ritchie, Demmos M., Ritchie, Dennis  | Prentice-Hall

60,000원  | 20160501  | 9780131103627

Written by the developers of C, this new version helps readers keep up with the finalized ANSI standard for C while showing how to take advantage of C's rich set of operators, economy of expression, improved control flow, and data structures. This 2nd edition has been completely rewritten with additional examples and problem sets to clarify the implementation of difficult language constructs. This book is meant to help the reader learn how to program in C. It is the definitive reference guide, now in a second edition. Although the first edition was written in 1978, it continues to be a worldwide best-seller. This second edition brings the classic original up to date to include the ANSI standard. From the Preface: We have tried to retain the brevity of the first edition. C is not a big language, and it is not well served by a big book. We have improved the exposition of critical features, such as pointers, that are central to C programming. We have refined the original examples, and have added new examples in several chapters. For instance, the treatment of complicated declarations is augmented by programs that convert declarations into words and vice versa. As before, all examples have been tested directly from the text, which is in machine-readable form. As we said in the first preface to the first edition, C "wears well as one's experience with it grows." With a decade more experience, we still feel that way. We hope that this book will help you to learn C and use it well.