- 相关
- 目录
- 笔记
- 书签
更多相关文档
-
Calculus of Variations
星级： 25 页
-
Calculus of Variations
星级： 25 页
-
On the calculus of variations in the Euler Lagrange equation
星级： 6 页
-
Physics 430 Lecture 14 Calculus of Variations
星级： 13 页
-
Dynamic MRR Function Optimization Using Calculus of Variations
星级： 13 页
-
Calculus of Variations
星级： 240 页
更多猜你喜欢
-
Calculus of Variations
-
Calculus of Variations and PDE
-
Calculus of Variations Gelfand
-
Jost Li-Jost - Calculus of Variations (CUP 1998) 0521642035
-
Jurgen Jost, Xianqing Li-Jost Calculus of Variations (Cambridge Studies in Advanced Mathematics 64) 1999
-
Calculus.of.Variations.and.Optimal.Control.Theory.A.Concise.Introduction,.Liberzon,.PUP,.2012
- Table of Contents
- CHAPTER 1 | INTRODUCTION
- Why Read This Book?
- A Brief History of Computer Programming:
- CHAPTER 2 | GETTING STARTED
- What is an interpreter?
- CHAPTER 3 | BASIC TERMS
- Tokens
- int[] arrayNumbers = {1, (int) 3.0, 9000};
- for (int i = 0, j = 1; ; i++, j++)
- int a = 1 + 2 - 4 + 7; //a = 6
- int b = 7 + 4 - 2 + 1; //b = 10
- CHAPTER 4 | BASIC OF JAVA PROGRAM
- Structure of Java Program
- The main() Method
- CHAPTER 5 | VARIABLES, DATA TYPES
- Variables
- boolean
- 1 bit
- char
- 2 byte
- 1 byte
- short
- 2 byte
- int
- 4 byte
- long
- 8 byte
- float
- 4 byte
- double
- 8 byte
- Understanding Floating Points
- Keywords
- Return Keyword
- Are Errors Bad?
- Compile Time and Run Time Errors
- CHAPTER 6 | FUNCTIONS AND OPERATORS
- What Are Functions?
- Logic and Operators
- CHAPTER 7 | CONTROLING EXECUTION, LOOPS & ARRAYS
- True and false:
- if-else statement:
- or
- Switch case Statement:
- Loop
- CHAPTER 8 | OBJECT ORIENTED PROGRAMMING
- Constructors:
- Creating an Object:
- Accessing Instance Variables and Methods:
- Light lt = new Light();
- lt.on();
- CHAPTER 9 | EXCEPTION HANDLING
- Error Handling With Exception
- Catching an exception:
- Catching any exception:
- CHAPTER 10 | Algorithms & the Big O Notation
- Thinking in Algorithms
- Step 1: Start
- Step 2: Declare variables num1, num2 and sum.
- Step 3: Read values num1 and num2.
- Step 4: Add num1 and num2 and assign the result to sum.
- Step 5: Display sum
- Step 6: Stop
- Step 1: Start
- Step 2: Declare variables a, b and c.
- Step 3: Read variables a, b and c.
- Step 4: If a>b
- Step 5: Stop
- Step 1: Start
- Step 2: Declare variables a, b, c, D, x1, x2, rp and ip;
- Step 3: Calculate discriminant
- Step 4: If D≥0
- r2←(-b-√D)/2a
- Else
- Step 5: Stop
- Step 1: Start
- Step 2: Declare variables n,factorial and i.
- Step 3: Initialize variables
- Step 4: Read value of n
- Step 5: Repeat the steps until i=n
- Step 6: Display factorial
- Step 7: Stop
- Step 1: Start
- Step 2: Declare variables n,i,flag.
- Step 3: Initialize variables
- Step 4: Read n from user.
- Step 5: Repeat the steps until i<(n/2)
- Step 6: If flag=0
- Step 7: Stop
- Step 1: Start
- Step 2: Declare variables first_term,second_term and temp.
- Step 3: Initialize variables first_term←0 second_term←1
- Step 4: Display first_term and second_term
- Step 5: Repeat the steps until second_term≤1000
- Step 6: Stop
- What kinds of problems are solved by algorithms?
- Big-O Complexity Chart:
- Array Sorting Algorithms complexity:
- CHAPTER 11 | DATA STRUCTURE
- Step 2 − Pick next element
- Step 3 − Compare with all elements in the sorted sub-list
- Step 4 − Shift all the elements in the sorted sub-list that is greater than the value to be sorted
- Step 5 − Insert the value
- Step 6 − Repeat until list is sorted
- Step 1 − Set MIN to location 0
- Step 2 − Search the minimum element in the list
- Step 3 − Swap with value at location MIN
- Step 4 − Increment MIN to point to next element
- Step 5 − Repeat until list is sorted
- CHAPTER 4 | NETWORKING
- What is network programming?
- Socket Programming:
暂无笔记
暂无书签
