Computer Science: An OverviewComputer Science: An Overview truly lives up to its title, providing a timely introduction to the entire computer science discipline. Broad coverage, combined with clear explanations, has made it the leading textbook for the breadth-first course. This book provides a balanced, realistic picture that communicates the dynamics of computer science by presenting topics in a historical perspective in which past developments, the current state of the art, and directions of research are discussed. The coverage of topics such as programming languages, operating systems, algorithms, software engineering, networking, database design, artificial intelligence, and machine architecture result in a complete overview of the field of computer science. |
From inside the book
Results 1-3 of 29
... stack of books on a table ) . Thus the last entry placed in a stack will always be the first entry removed - an observation that leads to stacks being known as last - in , first - out ( LIFO ) structures . The head of a stack is called ...
... stack , checking to see if the stack is empty , and checking to see if the stack is full - all of which would require definitions of additional procedures . In short , our definition of the data type StackType has not included all the ...
... stack . In what form is a stack still involved in your recursive solution ? 15. Sometimes a single linked list is given two dif- ferent orders by attaching two pointers to each entry rather than one . Fill in the table below so that by ...