Almost there! Just a few clicks from the resource you need.
You can either checkout with the notes in your basket now, or find more notes. The choice is yours!
My Basket
Ancient China short booklet
A short booklet including information about ancient China, its history, its emperors and dynasties, The four great inventions of China, The traditional Chinese clothes, Chinese arts, Most famous historical sites in China, pictures,....and many more.
£12.50 Preview RemoveExam question plan - Journey's End
This is a detailed plan on how you can answer the question " Explore the significance of friendship in Journey's End". This is a GCSE English literature question that may come up, so if you are looking for a plan example for this type of question, you may use this as you please! This is aimed at GCSE students in year 10 or 11 looking for some exam practice. Journey's End is a topic you may be doing in your school so if it is needed, feel free to use this exam question plan.
£6.25 Preview RemoveLeadership - Embodying Values Consistently
A comprehensive essay about how consistent embodying values affects a good and effective leader. Discussed four areas where embodying values consistently greatly influences the type of leadership one becomes.
£2.50 Preview Removelearn French for beginners
Best compiled notes for learning French. It is very comprehensive for first time learners and those who have little knowledge in the usage of the language.
£2.00 Preview RemoveLivre ASD
If you want to study the algorithm and data structure and c language then you are in the right place
£6.24 Preview RemoveThree different essays for applying to Stanford University (4 pages)
Three different essays for applying to Stanford University (4 pages) Main themes: 1) Exploration of the depths 2) The art of data visualization 3)Leadership in medical science
£6.25 Preview RemoveLearn C programming
Learn C language from hear. Any one can learn from 1 year to 4 year 1 Introduction 1 1.1 Programming and Programming Languages . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 The C Programming Language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 A First Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Variants of HelloWorld . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.5 A Numerical Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.6 Another Version of the Conversion Table Example . . . . . . . . . . . . . . . . . . . 6 1.7 Organisation of the Text . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Types, Operators, and Expressions 8 2.1 Identifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2 Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Constants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4 Symbolic Constants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.5 printf Conversion Specifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.6 Declarations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.7 Arithmetic Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.8 Relational and Logical Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.9 Bitwise Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.10 Assignment Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.11 Type Conversions and Casts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3 Branching and Iteration 17 3.1 If-Else . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 ?: Conditional Expression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.3 Switch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.4 While Loops . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.5 Do-While Loops . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.6 For Loops . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.7 Break and Continue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 3.8 Goto . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4 Functions 25 4.1 Function Prototypes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 4.2 Function Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 4.3 Benefits of Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 4.4 Designing For Errors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 4.5 Interface Design. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 4.6 The Standard Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 5 Scope and Extent 33 5.1 Local Scope and Automatic Extent . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 5.2 External Scope and Static Extent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 5.3 The static Storage Class Specifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 5.4 Scope Resolution and Name Hiding . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 5.5 Summary of Scope and Extent Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 5.6 Header Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 5.7 Modular Programming: Multiple File Programs . . . . . . . . . . . . . . . . . . . . . 39 6 Software Design 41 6.1 Requirements and Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 6.2 Program Flow and Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 6.3 Top-down and Bottom-up Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 6.4 Pseudocode Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 6.5 Case Study: A Tic-Tac-Toe Game . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 6.5.1 Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 6.5.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 6.5.3 Program Flow and Data Structures . . . . . . . . . . . . . . . . . . . . . . . . 45 6.5.4 Bottom-Up Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 6.5.5 Top-Down Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 6.5.6 Benefits of Modular Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 7 Pointers 49 7.1 What is a Pointer? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 7.2 Pointer Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 7.3 Pass By Reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 7.4 Pointers and Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 7.5 Pointer Arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 7.6 Return Values and Pointers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 7.7 Pointers to Pointers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 7.8 Function Pointers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 8 Arrays and Strings 59 8.1 Array Initialisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 8.2 Character Arrays and Strings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 8.3 Strings and the Standard Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 8.4 Arrays of Pointers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 8.5 Multi-dimensional Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 9 Dynamic Memory 68 9.1 DifferentMemory Areas in C . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 9.2 Standard Memory Allocation Functions . . . . . . . . . . . . . . . . . . . . . . . . . 69 9.3 Dynamic Memory Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 9.4 Example: Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 9.5 Example: An Expandable Array . . . . . . . . . . . . . . . . . . . . . . . . . More topics are ther
£18.75 Preview RemoveFundamental Principles of the Metaphysic of Ethics
This is a summary of one of the texts written by Immanuel Kant in the year 1785. In this text, the author wishes to expound what are the principles under the metaphysic of ethics and how these principle works.
£2.88 Preview RemoveChemical Engineering Thermodynamics
These are the notes of thermodynamics for students studying chemical engineering covering the books as mentioned: 1. Engineering and Chemical Thermodynamics by Milo. D. Koretsky(2nd Edition) 2. Introduction to Chemical Engineering Thermodynamic by Yunus. A . Cengel(8th Edition) 3. Chemical Engineering Thermodynamics by J . M . Smith(7th Edition)
£3.13 Preview RemoveEasy Embedded Systems
This notes of embedded systems are very helpful to me for understanding what an embedded is and what it does ? Also its features, applications , development life cycle , etc . I think this is the one you want to learn to make a good grade in your studies. - Simple Lucid Language -Easy to understand -IMPORTANT points are covered
£1.50 Preview RemoveMoskt know words for GRE Beginning with the Letter ‘C’
I’ve never endorsed studying words alphabetically. Not only is this method boring and predictable, but many words tend to blend into together. I focused on the letter"C" words you should know and understand but they aren't in alphabetical order.
£0.50 Preview Remove