The Minimum You Need to Know about Logic to Work in It

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
October 17, 2020 | History

The Minimum You Need to Know about Logic to Work in It

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Learn the skills which are completely non-existent in today's college courses.

Logic simply isn't taught anymore, Pascal is taught in what was the logic class - if the school has any class at all devoted to logic. The result of such a curriculum is that new college grads are simply unemployable in today's market.

This book is designed to correct that problem.

What You'll Learn from the Book

  • The fundamentals of flowcharting
  • The fundamentals of pseudocode
  • The Leaping Lynn search algorithm
  • Insertion Sort concept and usage
Publish Date
Publisher
Logikal Solutions
Language
English
Pages
154

Buy this book

Edition Availability
Cover of: The Minimum You Need to Know about Logic to Work in It
The Minimum You Need to Know about Logic to Work in It
January 2007, Logikal Solutions
Paperback in English

Add another edition?

Book Details


Table of Contents

Introduction.
I.1. Why Logic? Page I-1
I.2. What is Logic? Page I-2
I.3. Prerequisites for This Book Page I-4
I.4. Approach of This Book Page I-5
I.5. Who Should Read This Book? Page I-6
I.6. Why is Flowcharting and Pseudocoding Shunned? Page I-6
I.7. Flowcharting and the Current State of IT Page I-9
I.8. Additional Reading Page I-11
Chapter 1. Basics of Flowcharting Page 1-1
1.1. Flowcharting Symbols Page 1-1
1.2. Linear Sequence Page 1-7
1.3. Top Checking Loop Page 1-9
1.4. Middle Checking Loop Page 1-11
1.5. Bottom Checking Loop Page 1-13
1.6. Multiple Decisions Page 1-14
1.7. Flowcharting Summary Page 1-16
1.8. Exercises Page 1-17
Chapter 2. Basics of Pseudocode Page 2-1
2.1. What is Pseudocode? Page 2-1
2.2. Rules of Pseudocode Page 2-1
2.3. The Why and When of Pseudocode Page 2-2
2.4. How Do You Learn to Write Pseudocode? Page 2-2
2.5. Linear Sequence Page 2-3
2.6. Top Checking Loop Page 2-3
2.7. Middle Checking Loop Page 2-4
2.8. Bottom Checking Loop Page 2-5
2.9. Multiple Decisions Page 2-5
2.10. Pseudocode Followup Page 2-7
2.11. Exercises Page 2-8
Chapter 3. Some Fundamental Data Types Page 3-1
3.1. Core Data Types Page 3-1
3.2. Data Type Sizes Page 3-3
3.3. Variables Page 3-5
3.4. Arrays Page 3-6
3.5. Records and Structures Page 3-7
3.6. Indexes Page 3-8
3.7. Record and Structure Examples Page 3-12
3.8. Summary Page 3-15
3.9. Exercises Page 3-16
Chapter 4. Searching and Sorting Page 4-1
4.1. Overview Page 4-1
4.2. The Bubble Sort Page 4-1
4.3. Class Exercise One Page 4-6
4.4. Linear Search Page 4-7
4.5. Insertion Sort Page 4-9
4.6. Class Exercise Two Page 4-12
4.7. Class Exercise Three Page 4-12
4.8. Shell Sort Page 4-13
4.9. Binary Search Page 4-14
4.10. Class Exercise Four Page 4-15
4.11. Leaping Lynn Page 4-15
4.12. Class Exercise Five Page 4-18
4.13. When All Search Routines Fail Page 4-19
4.14. The Two Part Compare Page 4-20
4.15. Comparing Dates Page 4-22
4.16. Summary Page 4-24
4.17. Exercises Page 4-25
Chapter 5. Decision Order Page 5-1
5.1. Choosing Your Decision Order Page 5-1
5.2. Creating an Extract File Page 5-2
5.3. Class Exercise One Page 5-5
5.4. Class Exercise Two Page 5-7
5.5. Class Exercise Three Page 5-8
5.6. Class Exercise Four Page 5-9
5.7. Class Exercise Five Page 5-10
5.8. Summary Page 5-11
Chapter 6. Knowing What Questions to Ask Page 6-1
6.1. How are You Going to Use This? Page 6-1
6.2. Who is the Audience? Page 6-2
6.3. What Business Areas and Systems are Impacted by This? Page 6-3
6.4. Is This Legal? Page 6-5
6.4.1. Example One Page 6-5
6.4.2. Example Two (Where Did You Get This?) Page 6-6
6.5. Who Owns This Project? Page 6-8
6.6. How W ill Success Be Measured? Page 6-9
6.7. Who Will Sign Off on This Project? Page 6-10
6.8. What are the Deliverables? Page 6-10
6.9. How Much Time Do I Have? Page 6-11
6.10. How Reliable Does This Have to Be? Page 6-11
6.11. What is the Required Availability? Page 6-13
6.12. Summary Page 6-14
Chapter 7. Linked Lists Page 7-1
7.1. Pointers Page 7-1
7.2. A Singly Linked List Page 7-2
7.3. Doubly Linked Lists Page 7-5
7.4. Which do you use? Page 7-7
7.5. Exercises Page 7-8
7.6. Class Exercise One Page 7-8
7.7. Summary Page 7-8
Chapter 8. Hash Page 8-1
8.1. What is a Hash? Page 8-1
8.2. Collisions Page 8-2
8.3. File vs. Algorithm Page 8-4
8.4. Summary Page 8-5
8.5. Exercises Page 8-6
Chapter 9. Relational Databases Page 9-1
9.1. What is a Relational Database? Page 9-1
9.2. Some Important Relational Terms Page 9-2
9.3. Data Integrity and Constraints Page 9-5
9.4. SQL and Flowcharting Page 9-9
9.5. Summary Page 9-12
9.6. Exercises Page 9-13
Chapter 10. Surviving the Fire Page 10-1
10.1. The Philosophy Page 10-1
10.2. Beware the Deadly Embrace Page 10-3
10.3. The Stock Order Problem Page 10-4
10.4. Some Career Advice Page 10-7

Edition Notes

Published in
USA

Classifications

Library of Congress
QA9 .H74 2007

The Physical Object

Format
Paperback
Number of pages
154

ID Numbers

Open Library
OL11832501M
ISBN 10
0977086623
ISBN 13
9780977086627
LCCN
2011499367
Goodreads
5371852

Links outside Open Library

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
October 17, 2020 Edited by MARC Bot import existing book
March 21, 2015 Edited by Roland Hughes Trying to fix TOC formatting
March 21, 2015 Edited by Roland Hughes Added description, TOC, links, cover
March 21, 2015 Edited by Roland Hughes Added new cover
April 30, 2008 Created by an anonymous user Imported from amazon.com record