Yin Cheng College blockchain go learning outline - get the outline, watch the video and contact wechat yinchengak48

Yin Cheng 2021-11-24 08:05:48 阅读数:762

yin cheng college blockchain learning

 

 

website :http://www.1cxy.net

GO Technical communication QQ Group :254416566

 

 

 

 

 

 

Stage Main content Technical points Learning goals
The first stage Go Introduction to language development 1.Go Language introduction and development environment construction 1.Go What is language
2.Go Language advantage
3.Go What language is suitable for
4.Go Language installation and setup
5. Overview of standard commands
6. first Go Language program
Curriculum design concept :
Consolidate foundation ,Go Language as the first programming language of blockchain technology , Study Go Language programming from entry to mastery , From simple grammar understanding to flexible application to solve practical problems , It helps pave the way for blockchain technology , master Linux and Windows Dual system development environment , Master common data structures and algorithms ( Time complexity calculation , Sort , Search for , Stack , queue , Binary tree ), Building object-oriented thinking , Can abstract classify problems . Master basic concurrency theory .

Core competencies to master :
1、 adopt Go Language to cultivate programming thinking and practical ability ;
2、 adopt Go Language learning cultivates process oriented and programming ideas , Lay a solid foundation for further study of employment courses .

Practical problems that can be solved :
1、 Have Go Domain basic professional programming ability ;
2、 Realization Go Language program development case .

Market value :
Have the ability to learn programming thinking , However, it can not meet any enterprise employment standards .
2. The base type 1. Naming rules for variables
2. Declaration of variables
3. Initialization of a variable
4. The assignment of a variable
5. Anonymous variables
6. Basic data type
7. Literal constants
8. Constant definition
9.iota enumeration
10. Type conversion
11. Type the alias
12.fmt Formatted output of the package
3. Operator 1. Arithmetic operator
2. Relational operator
3. Logical operators
4. An operator
5. Assignment operator
6. Other operators
7. Operator priority
4. Process control 1. Selection structure
2. Loop statement
3. Jump statements
5. function 1. Define format
2. Custom function
3. Recursive function
4. Function type
5. Anonymous functions and closures
6. Delay call defer
7. Get command line parameters
8. Scope ( local variable , Global variables
6. engineering management 1. work area
2. package
3. Test cases
4.GOPATH Set up
5. Compile run program
6.Go get,test,install wait Use
7.go Language pack management (godep/glide/govender)  
7. The compound type 1. The pointer
2. Array
3.Slice
4.map
5. Structure
8. object-oriented programming 1. Encapsulation and inheritance
2. Interface implementation
3.Interface{} data type
4. Types of assertions
5. Polymorphism
6. Reflection
9. Pointer and method 1. Object lifecycle and anonymous functions
2. Pointer array
3. The pointer to the pointer
4. Pointer and function copy mechanism
5. Method with pointer receiver
10. exception handling 1.error Interface
2.panic error
3.recover
11. Document processing 1. string manipulation
2. String conversion
3. Regular expressions
4.Json Handle
5. File operations
6. Case study : Copy files , Document cutting and merging
12.go Standard library development 1. Create a custom package
2. Import package
3.Go Introduction to command line tools
4.Strings package
5.Bytes package
6. Container package
7.IO package
8.OS package
9.Image package
10. Math processing package
11.runtime package
12. Log package
13. System call package
14. Reflex package
15.unicode Coding package
16.unsafe package
17. Debugging package
13 Comprehensive document processing 1. Handle JSON file
2. Handle XML file
3. Working with plain text files
4. Processing binaries
5. establish ZIP The archive
6. Create compressible tar package
7. Untie ZIP The archive
8. Untie tar The archive
14. Developing actual combat 1. Black and white chess project actual combat
2. Big data file processing practice
The second stage Linux And Go Language advanced programming 1.Linux command 1.Linux The directory structure under
2. Work schedule application command
3.Ubuntu Software installation and uninstallation under
Curriculum design concept
1.Linux It's an enterprise server , Must be
2. High concurrency multi process multi thread development server back-end development will

Core competencies to master :
Have Linux platform Golang Basic knowledge and common skills of server development , And have basic development ability .

Practical problems that can be solved :
1、 Have Golang Back end development capabilities
2、 Have Linux System programming ability
3、 Can solve common problems Linux System programming problems
4、 Understand the concurrency mechanism of system programming

Market value :
After proficient learning and mastering , It can meet the initial and intermediate needs of enterprise development .
2.LinuxShell 1.Linux The directory structure under
2. Work schedule application command
3.Ubuntu Software installation and uninstallation under
4.base shell
5.base shell Script routine programming
6.base shell Script practice
3.Linux Development and debugging tools 1.Go Language Linux Next IDE Development tool installation and configuration
2. File descriptor , Virtual address space
3.Linux System IO function
4. The concept of blocking and non blocking
4. System I/O operation 1.OS package
2. File attribute correlation function
3. Link related concepts and functions
4. Concepts and functions related to directory operation
5. Multi process development 1. Process related concepts
2. Process operation related functions
3. Orphan process
4. Zombie process
5. Process recycling
6 Multi process synchronization and communication 1. Process shared memory communication
2. Process anonymous pipeline communication
3. Process named pipeline communication
4. Process semaphore communication
5. Process read / write file communication
6. Process mutex traffic
7. Process network communication
7. Coprocessor and communication 1. The mutex
2. Deadlocks and solutions
3. Read-write lock
4. Condition variables,
5. Conditional variables realize the production consumer model
6. Thread synchronization
7.Sync package
8.goroutine Coroutine and scheduler  1.Goroutine The concept of synergy
2.Goroutine Scheduler mechanism
3. High concurrency programming of coroutines
9.channel Pipeline and CSP Synchronization mechanism  1.CSP Communication sequence synchronization mechanism
2.channel Piping and characteristics
3. cache channel And non cache channel
4. Concurrent loops
5.select
10. High concurrency principle analysis 1Mutex The implementation of the 、 Extended functionality and functionality .
2RWMutex The implementation of the 、 Extended functionality and functionality .
3Waitgroup The implementation of the 、 pit
4Cond The use of and pits
5Once Implementation and implementation of , The singleton Eager/Lazy Realization
6Pool The pit of , net.Conn Pool
7Map The implementation of the 、 Application scenarios
8Context Some of the problems
11 High concurrency expansion 1 Reentrant lock
2 Semaphore
3SingleFlight And Application
4ErrGroup
5 spinlocks
6 File lock
7 Concurrent Map A variety of implementations of
12 Atomic manipulation analysis 1 The realization of atomic operation
2 The data type of the operation
3 Provided function
4 Universal Value type
5. Extended atomic operation Library
13.channel actual combat 1. Common mistakes channel Use scenarios
2. Three usage scenarios
3.Or-done Three implementations of patterns
4. Fan in
5. Fan out
6.Tee
7.Pipeline
8. Streaming
14.golang Memory model analysis 1. Pile up , Stack , Static zone , Code section
2.init function
3.goroutine
4.channel
5.Mutex/RWMutex
6.Waitgroup
7.Once
8.atomic
15 Thread safe data structure design and practice 1. File thread safety practice
2. Concurrent big data search practice
The third stage Go Language network and server development 1. Network protocol and network programming 1.OSI Seven layer model structure
2.TCP/IP 4 Layer model structure
3.B/S、C/S Comparison of advantages and disadvantages
4. Common network protocol formats
5. Socket ; Network byte order
6.IP Address translation function
7. To write TCP Of C/S Network program
8.UDP Communication mechanism and model
9. Local socket
10. Three handshakes establish the connection process
11. Four wave disconnection process
12. Sliding window concept
13. Error handling function encapsulation
14.TCP State transition
15.2MSL Concept
16. Port multiplexing method
17. Half closed
18.socket Network programming
Curriculum design concept :
High concurrency server development , master Linux operating system groutines coroutines / process / Thread management and networking socket Programming , Skilled in writing C/S Client server communicator , understand Go The scheduler mechanism of collaborative process has the common high concurrency server development features , Game server development capability .


Core competencies to master :
1. Have basic knowledge and common skills of common background server development , And have basic development ability ;
2. master gouroutine、channel etc. go Language concurrency mechanism and high concurrency server solution ;
3. master Linux Platform system programming ;
4. Master network programming protocol , Realize point-to-point communication between networks .

Practical problems that can be solved :
Can achieve including server background 、 Development of server database .

Market value :
After proficient learning and mastering , It can meet the initial and intermediate needs of enterprise development .
2.Golang Network programming practice 1.socket Client programming
2.socket Server programming
3. Case study : Concurrent clock server
4. Case study : Concurrent echo server
5. actual combat : High concurrency network chat room
6. actual combat : Distributed sorting
7. actual combat : File transfer
8. actual combat : Folder transfer
3.RPC Remote call mechanism 1.RPC Use protocol buffers
2.RPC Environment building
3.golang Realization RPC The remote invocation
4.RPC-Server To write
5.RPC-Client To write
4.GRPC Remote call mechanism 1gRPC brief introduction
2gRPC Write a guide
3gRPC Compilation guide
4gRPC The remote invocation
5gRPC asynchronous communication
6gRPC Streaming communication
5. High concurrency service time round 1. Time wheel principle
2. Time wheel Golang Realization
3. Test and use of time wheel
6. High concurrency server framework design  1. Server framework basic class IServer Realization
2. Design and implementation of server framework message interface
3. Design and implementation of server framework packet interface
4. Design and implementation of server framework network connection interface
5. Design and implementation of server framework network connection manager interface
6. Design and implementation of server framework network request interface
7. Server framework network request routing settings
7.AOI Communication broadcasting mechanism  1.AOI Algorithm implementation
2. be based on AOI Area broadcast of the algorithm
3. Global broadcast
4.AOI Location information management
8. High concurrency server framework design Golang High concurrency big data search server development
9. be based on Golang Lightweight TCP Implementation of concurrent server framework 1 Basic routing module
2 Global configuration
3 Message encapsulation
4 Multi route mode
5 Read write separation model
6 Message queuing and multitasking
7 Link management
8 Connection property settings

 
10.TCP Concurrent game server practice 1AOI Point of interest algorithm
2 Data transfer protocol protocol buffer
3Proto3 Protocol definition
4 Build project and user online
5 World chat
6 Online location information synchronization
7 Move position and AOI radio broadcast
8 Players offline
9 Simulation client AI modular
Phase IV front end development 1.html5 And css3 html Overview and basic structure
html Introduction to labels and layout
css Loading mode
css Selectors
css Getting started with properties
css Basic layout demonstration
Relative address and absolute address
Lists and forms
Box model
css Display properties
css Element overflow
form
location
css The weight
Curriculum design concept :
html5/css/javascript Is the cornerstone of the entire Internet page , It is very important to learn them well and lay a good foundation .
web Service is web The cornerstone of service .
Core competencies to master :
1、 According to the UI Design , Development web The front page of the website ;
2、PC Development of page effects on mobile terminal and mobile terminal ;
3、 Front end page performance optimization .
4. master web Service development

Practical problems that can be solved :
1、 Developing common Web Front end pages and mobile terminals of the website H5 page ;
2、 Data communication with the background ;
3、 Master the front-end framework used in the current market popular front-end and back-end separation development mode .
4. master web Service development and docking front end
Market value :
Front end as web Half of the website development , Necessary skills for full stack Engineers
web Service is a necessary skill for development .
2.JavaScript Variable
Data type and basic syntax specification
function
Conditional statements
Get element method and operation element
Event properties and anonymous functions
Comprehensive example
Array and operation method
Loop statement
String and operation method
Method of debugging program
Timer
Variable scope
Closed function
3.jQuery jquery Selectors
jquery Style operation
binding click event
jquery Animation
jquery Special effects
jquery call chaining
jquery Attribute operation
jquery loop
jquery event
Form validation
Event bubbling and event delegation
Dom operation
javascript object
json and ajax request
4. The front frame 1、vue.js Introduction and basic concepts
2、Vue.js Template syntax
3、Class And Style binding 、 Conditions apply colours to a drawing 、 The list of rendering 、 Event handling 、 Form input binding 、 filter 、 Instance life cycle 、 Data interaction
4、vue Components 、vue Single file component 、vue Component development automation tools 、 Generate vue Single page application project
5.nodejs  1. ES6 Introduce
2. ES6 Variable definitions
3. ES6 Deconstruct assignment
4. ES6 Function extension
5. ES6class grammar
6. Nodejs The development history
7. Nodejs asynchronous IO Mechanism
8. Nodejs Function is introduced
9. npm Package download
10. Global variables
11.path modular
12.fs modular
13.fs modular reader flow
6.web Service development 1web Operation mode
2Go Build a simple web service
3 Go How to make web Work
4 Go Of http Bao explained in detail
5. Forms
5.1 Process the input of the form
5.2 Verify the input of the form
5.3 Prevent cross site scripting
5.4 Prevent multiple submission of forms
5.5 Handle file upload
5.6 Summary
6.session And data storage
6.1 session and cookie
6.2 Go How to use session
6.3 session Storage
6.4 The prevention of session hijacked
6.5 Summary
The fifth stage is the development of database and back-end framework 1. Relational database -mysql 0.sql Statement practice
1.mysql Table constraints
2.mysql Chinese garbled code in
3.mysql The function library connects to the database
4.mysql API Access database
5. Use the base class API Realization mysql Client tools
6. Preprocessing class API visit mysql database
7. Use api modify mysql Transaction features
8.sql Statement injection practice
Curriculum design concept :
html5/css/javascript Is the cornerstone of the entire Internet page , It is very important to learn them well and lay a good foundation .
Beego It's the mainstream of big Internet companies web Server framework , because Go Congenital support for high concurrency , So a lot of big Internet companies are web Service Framework Go The transformation of language , It can easily achieve hundreds of millions of levels of high concurrency , More saving enterprise operating costs .

Core competencies to master :
1、 According to the product prototype , Development web The front-end interface of the website ;
2、 According to the business process diagram , Development web The background business of the website ;
3、 According to the web framework design , Develop the corresponding database ;
4、 Operation and design of cache server ;
5、 Implementation of asynchronous tasks .

Practical problems that can be solved :
1、 High concurrency and full function web Website development ;
2、 Provide data response speed and use cache flexibly ;
3、 The corresponding database tables are designed according to the practical problems .

Market value :
web Full stack engineer , Develop front-end and back-end business independently .
2.no-sql Cached database -redis 1.key-value Storage mode characteristics
2.redis Environment installation and redigo Drive installation
3.redis in key The relevant operation
4.redis in string The relevant operation
5.redis in list The relevant operation
6.redis in hash The relevant operation
7.redis in set and sort-set The relevant operation
3.NoSQL-MongoDB Database practice 1.NoSQL brief introduction
2.MongoDB brief introduction
3.MongoDB Concept of analytical
4.MongoDB Connect
5.MongoDB Create database 6.
6.MongoDB Delete database
7.MongoDB Create set
8.MongoDB Delete the collection
9.MongoDB Inserted into the document
10.MongoDB Update the document
11.MongoDB Delete the document
12.MongoDB Query the document
13.MongoDB Conditional operators
14.MongoDB $type The operator
15.MongoDB Li.Mit And Skip Method
16.MongoDB Sort
17.MongoDB Indexes
18.MongoDB polymerization
19.MongoDB Copy ( Replica set )
20.MongoDB Fragmentation
21.MongoDB Backup and recovery
22.MongoDB monitor
23.MongoDB Relationship
24.MongoDB Database references
25.MongoDB ObjectId
26.MongoDB .Map Reduce
27.MongoDB Full text search
4.git  1. Code version control tool git Common instructions for
2.git Team development and formation
3.git Creation and management of code warehouse
5. distributed file system fastDFS 1. Distributed concept
2.tracker、storage、client Related configuration
3.fastDFS in go Of api encapsulation
6.Nginx Deploy with response agent 1.Nginx Environmental installation
2.Nginx Environment configuration
3.Nginx Response agent
4.Nginx Build load balancing
7.beego frame 1.beego Build a framework environment
2.controller Design :
   Parameter configuration 、
   Routing settings 、
   session control 、
   Multi format data output 、
   Request data processing
3.model Design :
   ORM Use 、
   CRUD operation 、
   Advanced query 、
   Native SQL Inquire about
4.view Design :
   Template grammar guide 、
   Template handling
8.beego Framework practice Real estate rental project
8.Gin frame 1.Gin The framework outlined
2.AsciiJSON
3.HTML Rendering
4.HTTP2 server push
5.JSONP
6.Multipart/Urlencoded binding
7.Multipart/Urlencoded Forms
8.PureJSON
9.Query and post form
10.SecureJSON
11.XML/JSON/YAML/ProtoBuf Rendering
12. Upload files
13. A single file
14. Multiple files
15. Do not use the default middleware
16. from reader Reading data
17. Restart or stop gracefully
18. Use BasicAuth middleware
19. Use HTTP Method
8.Gin Framework practice Blog project practice
The sixth stage is container programming 1. virtualization VS Containerization 1. Virtualization Basics
2. Common virtualization types and technology implementation
3. Container Basics
4. virtualization VS Containerization
Curriculum design concept
1.docker Virtualization is a common way of enterprise deployment
2.k8s Is management docker Essential tools

Core competencies to master :
1、 Master virtualization technology ;
2、 Skilled use of containers and container scheduling tools .

Practical problems that can be solved :
1、 Able to use KVM Virtualization ;
2、 Be able to use Docker Containers ;
3、 Be able to use Kubernates Container choreographer .


Market value after learning this stage :
After mastering and learning , To satisfy Linux Advanced requirements for cloud computing architecture Engineers .
2.Docker 1.Docker Quick start
2.Docker Image management
3.Docker Container management
4.Docker Data management
5.Docker Network management
6.Docker Cluster management
3.Kubernetes(k8s) actual combat 1.Kubernetes Design architecture
2.Kubernetes Clustering and deployment
The seventh stage is microservices and distributed services 1. Microservice distributed programming theory 1. High availability design
2. Load balancing
3. colony
Curriculum design concept :
At this stage, the course is important to solve the common virtualization deployment and distributed mainstream skills related to microservices in enterprises ,Go Language as Docker Development language , What's more, it's popular for distributed ecology .

Core competencies to master :
1. It has the mainstream big data distributed technology in the market ;
2. Have go Language high concurrency background development ability ;
3. Have docker Virtualization container technology ;
4. Have the ability to design distributed micro service architecture .


Practical problems that can be solved :
1. Solve the problem of enterprise container virtualization technology ;
2. Solve the optimization scheme of enterprise resource utilization and availability ;
3. Solve the tradition PaaS Enterprises , use Micro Service( Microservices ) To implement their application .

Market value :
After proficient learning and mastering , It can meet the initial and intermediate requirements of enterprise development 、 Even advanced requirements .
2. Microservice features 1. Introduction to microservices and microservice framework
2. Single service features
3. Characteristics of microservice architecture
4. Disadvantages of microservices architecture
3.protobuf Communication protocol 1.protobuf brief introduction
2. Format comparison of data interaction
3.protobuf The advantages of
4.protobuf Installation
4. Service discovery 1. What is service discovery
2.Consul Environment and installation
3.Consul agent
4.Consul Server
5.Consul Client
6. Registration service
7. Query service
8.Consul framework
5.go-mirco Microservice framework  1.Micro Introduction and installation compilation
2. Create microservices
3. start-up consul Supervision
4. Micro service srv End operation
5. Microservices handler Programming
6. Micro service and gRPC
6. Higher order distributed theory 1. Processes and threads
2. Concurrent
3. lock
4. parallel
5. colony
6. State characteristics
7. System retransmission and idempotency
8. Hardware exception
9.CAP theory
10.CAP Theoretical clarification
12.2PC
13.3PC
14. The heartbeat detection
15. High availability design
16. Fault tolerance
17. Load balancing
18. overall situation ID Generate
19. Hash modulus
20. Consistent Hashing
21. Routing table
22 Data splitting
7.RESTful 1.REST Concept
2.RESTful The implementation of the
3.RESTful Interface design
8 ETCD And distributed high concurrency 0ETCD Introduce
1.ETCD Implementing service discovery
2.ETCD Realize distributed configuration
3.ETCD Implement distributed locks ,Mutex, RWmutex actual combat
4.ETCD Implement distributed fence
5.ETCD Implement distributed leader The election
6.ETCD Implementing distributed queues
7.ETCD Implementation of distributed priority queue
8.ETCD Implement distributed STM
9. Other distributed concurrent libraries
8. Message middleware 1.RabbitMQ
2.go-nats
3.NSQ
4. Six modes of message oriented middleware
One to one transmission
One to many transmission
Many to many transmission
Task queue mode
Publish subscribe mode
Routing mode
Switch mode
9. Distributed components zookper
1.zookper brief introduction
2.Zookeeper summary
3.Zookeeper Basics
4.Zookeeper workflow
5.Zookeeper leader The election
6.Zookeeper install
7.Zookeeper CLI
8.Zookeeper API
9.Zookeeper Applications
10. Distributed log component kafka And Kibana 1.Apache Kafka summary
2.Apache Kafka Basics
3.Apache Kafka Cluster architecture
4.Apache Kafka Workflow
5.Apache Kafka Installation steps
6.Apache Kafka Basic operation
7.Apache Kafka Simple producer example
8.Apache Kafka Consumer group example
9.kibana Distributed visualization  
11 Search engine Elasticsearch And Solr 1.Elasticsearch fill
2Elasticsearch Migration between versions
3Elasticsearch API Appointment
4Elasticsearch file API
5Elasticsearch Search for API
6Elasticsearch polymerization
7Elasticsearch Indexes API
8Elasticsearch colony API
9Elasticsearch Inquire about DSL
10Elasticsearch mapping
11Elasticsearch analysis
12Elasticsearch modular
13.solr Yan Shen
12 Distributed integrated combat mapReduce Programming actual combat
raft(kvraft) Programming actual combat
Fault-tolerant Key/Value Service practice
Sharded Key/Value Service practice  
13.golang Search engine framework yinchengSearch Realization golang Search engine framework yinchengSearch Realization
14. Microservice project design 1. Micro service splitting principle
2. Micro service project process and interface design
3.Docker-compose Single cluster
15. Microservice project practice - Billion level marketing practice Project brief introduction : Based on Tencent cloud advertising platform . Locate according to keywords QQ Group , export QQ data , Carry out mass email or import Tencent marketing system for pop-up advertising . Tens of thousands of users visit at the same time during the peak period , Build a distributed structure to meet customer needs . And customize the system for customers .
Project description : The project adopts distributed structure design .
1.web Interface , be based on ETCD The spare tire mode and cluster election mode are realized to establish load balancing ( A server hangs up , Select a server as the management server )
2. about 17 Billion data indexing and algorithm optimization , Realization 0.01 second 1MB Memory retrieval 17 100 million data .
3. be based on golang Search engine riot, And word segmentation , Fast keyword search
4. be based on redis And go-fastDFS Build a cache system
5. Design general database interface — export MongoDB ,mysql,redis
6. Design general message oriented middleware interface —rabbitMQ.NSQ,kafka,
7. Design encryption and rights management recharge system .
8. be based on ETCD Service discovery and maintenance system .
9. Implementation interface , Load balancing algorithm switch .
10. Distributed data acquisition system , Breadth traversal extracts all the information on a website QQ.
11. Access distributed logs .
The eighth stage is cryptography development 1. Common cryptographic algorithms 1. Symmetric encryption system
2. Asymmetric encryption system
3. digital signature
4. Data confidentiality
5. Identification
6. Data integrity
7. National secret development
Curriculum design concept :
Master information security development ;

Core competencies to master :
1. Knowledge of common cryptography principles and security protocols ;
2. Have the ability of information security programming and development ;
3. Provide theoretical support for information security system development and blockchain development ;
4. Familiar with common security protocols and encryption algorithms ;
5. Familiar with information security optimization protocols and industry standards .

Practical problems that can be solved :
1. It can solve the problem of information security, encrypted data transmission and authentication process , Have the development ability in the field of information security , It can solve the financial development of centralized system ;
2. A solid theoretical foundation , Quickly integrate into the development needs of blockchain related enterprises in various industries .

Market value :
The short board of the security talent market is huge .
2. Common cryptographic protocols  1. Cryptography security protocol
2. Digital certificate Certification (CA) center
3. Public key infrastructure PKI System
3. Cryptography and social engineering Practical password dictionary and cracking ssh, And mysql database
4. Information security improvement practice 1 Microservice anti tampering security implementation
2 Microservice anti listening security implementation
3 Microservice authentication security implementation
Phase IX actual combat of back-end comprehensive project 1. Distributed log system Project brief introduction
Design and develop project architecture according to business requirements , Realize the business log collection of multiple product lines , And realize the visual display and retrieval of business log .
Mastering skills
1、 Server program architecture design ;
2、Go Language development server agent;
3、etcd;
4、kafka;
5、ElasticSearch;
6、Klbaba;

 
Curriculum design concept :
Real projects from the enterprise

Core competencies to master :
1. Have common project development modes
2. Have software development thought and software engineering theory
3. Provide theoretical support for large-scale data development ;
4. Familiar with common load balancing algorithms of the project ;
5. Familiar with distributed backend optimization protocols and industry standards .

Practical problems that can be solved :
1. Able to solve the data flow process , Have the ability to develop distributed back-end fields ,;
2. A solid theoretical foundation , Quickly integrate the development requirements related to distributed micro services in various industries .

Market value :
go The short board of the back-end market is huge .
2. Back end micro service cluster for automatic driving image recognition Distributed back-end system for automatic driving image recognition
Running environment + golang + docker + grpc + protobuf + beego + MySQL+tensorflow+redis+go-fastDFS
Project brief introduction : Solve the online automatic identification task of thousands of cars in the company ,go The efficiency is much greater than python, be based on golang Distributed improves existing business performance .
Project description : The system is used as a module system of automatic driving , Provide image recognition computing tasks . be based on 100 platform GPU The server , Realize real-time service identification .
And it can quickly mark data in the background , Improve model recognition rate .
1. be based on redis And gofastDFS Implement cache system + Picture saving system
2. be based on tensorflow GPU Go Realize image recognition call
3. be based on ETCD Realize service discovery and election
4. be based on GRPC And http Two interfaces are provided
5. Provides download updates for models —TCP,FTP
6. Background human annotation and training update model
7. Message oriented middleware solves the problem of load balancing
8. Based on cryptography to prevent hacker attacks
9.  Access distributed log system
3. Big data distributed precision marketing and intelligent recommendation system Project brief introduction : be based on QQ Number , cell-phone number , E-mail tagging system , Tag based intelligent recommendation , Export accurate data , Business Marketing . And customize the system for customers .
Running environment : golang + docker + grpc + protobuf + beego + redis + fastDFS + rabbitMQ+riot+ETCD+mongoDB+NSQ+goFastDFS

Project description : The project is based on distributed design
1. be based on mongoDB Database implementation label system , be based on Mongodb colony
2. web Interface to import data , be based on ECTD Load balancing with message oriented middleware , Election model .
3. web Data acquisition is based on distributed design ,redis Queue implementation , The number of search layers can be customized , Depth traversal , Breadth traversal .
4. Import data interface , Support txt,xls,doc,pdf,mdb, Common data formats
5. Export data interface , Support json,txt,xls,doc,pdf,mdb, Common data formats
6. External SMS system , Mail system .
7. Design general database interface — export MongoDB ,mysql,redis
8. Design general message oriented middleware interface —rabbitMQ.NSQ,kafka,
9. be based on redis And go-fastDFS Build a cache system
10. Tag system , Statistical word frequency and word segmentation processing , Create tags .
11. Access distributed log system
12. Authority management and recharge system . encryption GRPC call , Call to ensure that the signature is correct before calling , Support Alipay WeChat payment .
Stage 10 interview Counseling Professional interview training go Intensive training for special interview
Computer network interview special interview intensive training
Database special interview intensive training
Data structure algorithm special interview intensive training
Distributed design interview special interview intensive training
Operating system interview special interview intensive training
Curriculum design concept :
Real interview questions and project interviews from enterprises .

Core competencies to master :
1. Interview with the world's top 500
2. Have software development thought and software engineering theory
3. Provide theoretical support for large-scale data development ;
4. Familiar with software engineering and industry standards .

Practical problems that can be solved :
1. Pass the enterprise interview ;
2. A solid theoretical foundation , Quickly integrate into enterprise development needs .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages .
Project experience and interview expression training 1. Language expression training
2. Project experience expression training
3. Project actual combat ability training
Resume counseling 1 Recruitment hot express 、
2 Career planning 、
3 Share workplace experience 、
4 Resume production
Stage Main content Technical points Learning goals
Design patterns Object oriented design pattern 1. Good code is good ?―― Simple factory model
2. Shopping promotion ―― The strategy pattern
3. shooting UFO―― Principle of single responsibility
4. Postgraduate entrance examination and job hunting are the same ―― to open up - Closed principle
5. Can repair computers, can't repair radios ?―― Dependence Inversion Principle
6. What to wear is so important ?―― Decoration mode
7. Make wedding clothes for others ―― The proxy pattern
8. Lei Feng is still in the world ―― Factory method model
9. Resume copy ―― Archetypal model
10. It's useless to copy the wrong test questions ―― Template method pattern
11. It's hard to do without acquaintances ?―― Dimitar's law
12. Bull market stocks will lose money ?―― Appearance mode
13. Every good dish has a different aftertaste ―― Builder pattern
14. The boss came back , I don't know ―― Observer mode
15. You have to change DB Do you ?―― Abstract factory pattern
16. When to take off endless overtime ―― The state pattern
17. stay NBA I need an interpreter ―― Adapter pattern
18. If you go back to the past ―― Memo mode
19. branch office = A department ―― Portfolio model
20. Want to go ? Sure ! Buy tickets first ―― Iterator pattern
21. Some classes also need family planning ―― The singleton pattern
22. When will mobile software be unified ―― Bridging mode
23. The thought of roast mutton kebab ―― Command mode
24. The boss must approve the salary increase ?―― Responsibility chain pattern
25. The world needs peace ―― Intermediary model
26. Don't be silly with too many projects ―― The flyweight pattern
27. In fact, you don't understand the boss's heart ―― Interpreter mode
28. Men and women ―― Visitor mode
Curriculum design concept :
Design patterns (Design pattern) Represents best practice , Usually used by experienced object-oriented software developers . Design patterns are the solution to the general problems that software developers face in the process of software development . These solutions are the result of a long period of trial and error by many software developers .

Core competencies to master :
1. Have the idea of object-oriented programming and Architecture
2. Have go Language high concurrency background architecture capability ;
3. Have go Language distributed background architecture capability ;
4. Have the ability to design distributed micro service architecture .


Practical problems that can be solved :
1. Understand the best solution to the problems faced in software development ;
2. Solve the optimization scheme of enterprise resource utilization and availability ;
3. Understand software engineering ideas , Quickly understand software engineering architecture design .
4. According to the actual needs of the enterprise , Built architecture

Market value :
After proficient learning and mastering , Meet the needs of enterprise architects .
Go Concurrent design patterns 1 generator
2 As a service
3 Multiplex recombination
4select Monitoring channels
5. End mark
6. Chrysanthemum chain
7. Random number generator
8. Timer
9. Resident memory concurrency
10. Non resident memory concurrency
11. Timeout concurrency
High concurrency distributed design pattern 1、 Single library single application mode
This is the simplest model , That is, one data, one application server , Generally, it will be more convenient to use in the early stage of product release , One day 30 Wan to 50 ten thousand PV There is generally no problem with the following .

2、 Content distribution model
After using static file caching in the host , You can also use CDN The static files are distributed to the node nearest to the user in order to achieve the purpose of rapid response , Generally at the million level PV When needed

3、 Query split mode
It mainly refers to the read-write separation of the database , It can reduce the response delay , At tens of millions of levels PV Will use .

4、 Microservice model
Microservice is to split a single application into multiple services , Each service is deployed in its own host , Finally, a ESB To manage and schedule these services , The advantage is that they perform their duties without confusion and consistency paralysis , The disadvantages are obvious , That is, integration testing and collaborative release are much more difficult .

5、 Sub database and sub table mode
When there are hundreds of millions of data in a table, it is necessary to consider sub tables , Such as order data, etc , Split into multiple tables according to user attributes or time , Even split into multiple repositories .

6、 Multi level cache mode
You can cache data to redis、memcache Or in a distributed file system , Usually in 500 ten thousand PV You need to use .

7、 Flex mode
When the application is prone to peaks and troughs, using elastic scaling mode can effectively reduce the cost of hardware resources , Especially when using the public cloud, the cost reduction accumulation will be a relatively large value .

8、 Multi room mode
If the machine room is self built, the machine room can be installed in the South and north to effectively reduce the delay , And prevent the possibility of simultaneous downtime . If the public cloud is used, multiple nodes can be deployed . On the other hand , use CDN It is also a practical application of multi machine room .
Microservice design pattern 1 Aggregator microservice design pattern
2 Proxy microservice design pattern
3 Chain microservice design pattern
4 Branch microservice design pattern
5 Data sharing microservice design pattern
6 Asynchronous messaging microservice design pattern
Microservice unit design pattern The diplomat model (Ambassador)
Anticorrosive coating (Anti-corruption layer)
Back end service front end (Backends for Frontends)
Bulkhead mode (Bulkhead)
Gateway aggregation (Gateway Aggregation)
Gateway uninstall (Gateway Offloading)
The gateway routing (Gateway Routing)
Sidecar mode (Sidecar)
Strangler mode (Strangler)

 

Stage Main content Technical points Learning goals
The first stage data structure  1 Program performance analysis 1.1 What is program performance
1.2 Spatial complexity
1.1.1 Composition of spatial complexity
1.1.2 give an example
1.3 Time complexity
1.3.1 Composition of time complexity
1.3.2 Operation count
1.3.3 best 、 Worst and average operation counts
1.3.4 They count
Curriculum design concept :
  Through a lot of algorithms and data structure problems , Show the difference between yourself and other companies . Especially some particularly difficult ones , Once out of the examination room , It's going to be lively , The Internet is also busy .
  Through the questions on tall , To identify smart and hardworking children , What are the out of class boys .
   You know ,BAT Companies such as , Salary for fresh undergraduates , All on monthly salary 1 All the above , About a year 13 All the above .
   salary 、 personnel 、 The interview is difficult , Nature is related .
  Algorithm , I think it's a very forced word . Books and online public opinion , All make this word tall .
   I don't think so , Why , I like to put forward some new ideas .
   Algorithm , Just the way to solve the problem , What's so great about .
   a farmer 、 Architecture 、 Medical care , Which industry has no solution to the problem , only IT The program design makes the algorithm Algorithm come out .
  The business of large companies is more complex , The technology used is difficult , The requirement for a person's ability and quality is very high . big data 、 Cloud computing 、 High performance is also required , The requirements for basic skills such as data structure and algorithm are relatively high . Basic knowledge of data structure and algorithm , You can see a person's growth potential .
   The business of large companies is more complex , The technology used is difficult , The requirement for a person's ability and quality is very high . big data 、 Cloud computing 、 High performance is also required , The requirements for basic skills such as data structure and algorithm are relatively high . Basic knowledge of data structure and algorithm , You can see a person's growth potential .
   Small and medium-sized companies are more concerned about short-term interests , Recruit someone who can work immediately , A worker who helps the company make money . What can make money immediately , Of course, it's a project , Instead of doing research , Algorithms or something , It doesn't work . Small and medium-sized companies , Do more business systems 、 Website , speed of progress 、 performance 、 Business is the main , Algorithmic requirements are low .
  For example , The algorithm is like the internal skill in martial arts , Good study , Only in the future can we become prawns , Dominating the Wulin . however , No matter how good your internal skill is , No moves , Can't play . And do projects , Engage in application development , It's like the moves in martial arts , Learn a move , You can find a soft persimmon to squeeze , Experience the pleasure of learning martial arts .


Core competencies to master :
1. Have the data structure and algorithm of the world's top 500
2. Have software development thought and software engineering theory
3. Provide theoretical support for large-scale data development ;
4. Familiar with software engineering and industry standards .

Practical problems that can be solved :
1. Pass the enterprise interview ;
2. A solid theoretical foundation , Quickly integrate into enterprise development needs .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages . Understand the role of data structure development in practice .
 2 Asymptotic notation 2.1 introduction
2.2 Asymptotic notation
2.2.1 Big Ο Notation
2.2.2 Asymptotic notation Ω and Θ
2.3 Asymptotic Mathematics ( Optional )
2.2.1 Big O Notation
2.2.2 Ω Notation
2.2.3 Θ Notation
2.2.4 Small ο Notation
2.2.5 characteristic
2.4 Examples of complexity analysis
2.5 Actual complexity
 3 Performance measurement 3.1 introduction
3.2 Select the size of the instance
3.3 Design test data
3.4 Experimental design
3.5 Cache
3.5.1 Simple computer model
3.5.2 Impact of cache misses on runtime
3.5.3 Matrix multiplication
4 The linear table —— Array description 4.1 Data objects and data structures
4.2 Linear table data structure
4.2.1 Abstract data types linearList
4.2.2 abstract class linearList
4.3 Array description
4.3.1 describe
4.3.2 Variable length one-dimensional array
4.3.3 class arrayList
4.3.4 iterator
4.3.5 arrayList An iterator of
4.4 Multiple tables implemented in an array
4.5 Performance measurement
4.6 Generalized table concept
4.7 Generalized table actual combat
5 The linear table —— Chain description 5.1 One way linked list
5.1.1 describe
5.1.2 structure chainNode
5.1.3 class chain
5.1.4 Abstract data types linearList Expansion
5.1.5 class extendedChain
5.1.6 Performance measurement
5.2 Circular linked list and head node
5.3 Double linked list
5.4 Bidirectional circular linked list
5.5 application
5.5.1 Sort the boxes
5.5.2 Radix sorting
5.5.3 convex hull
5.5.4 Union checking set
6 Arrays and matrices 6.1 Array
6.1.1 Abstract data types
6.1.2 Index of array
6.1.3 Row master mapping and column master mapping
6.1.4 Use an array of arrays to describe
6.1.5 Row main description and column main description
6.1.6 Irregular two-dimensional array
6.2 matrix
6.2.1 Definition and operation
6.2.2 class matrix
6.3 Special matrix
6.3.1 Definition and Application
6.3.2 Diagonal matrix
6.3.3 Tridiagonal matrix
6.3.4 Trigonometric matrix
6.3.5 Symmetric matrix
6.4 sparse matrix
6.4.1 Basic concepts
6.4.2 Describe... With a single linear table
6.4.3 Describe... With multiple linear tables
6.4.4 Performance measurement
7. Hash table and set 7.1 hash function
7.2 Hash collision
7.3 Hash table array implementation
7.4 Hash table linked list implementation
7.5 Set concept
7.6 intersection , Combine , Difference set
7.7 Array set
7.8 Linked list set
7.9 Hash set
8 Stack 8.1 Definition and Application
8.2 Abstract data types
8.3 Array description
8.3.1 Implement... As a derived class
8.3.2 class arrayStack
8.3.3 Performance measurement
8.4 Linked list description
8.4.1 class derivedLinkedStack
8.4.2 class linkedStack
8.4.3 Performance measurement
8.5 application
8.5.1 Parentheses matching
8.5.2 Hanoi
8.5.3 Train car rearrangement
8.5.4 Switch box wiring
8.5.5 Offline equivalence problem
8.5.6 Maze mouse
8.6 Mathematical expression string parsing calculation
8.7 Hexadecimal conversion
8.8 Maze routing algorithm
9 queue 9.1 Definition and Application
9.2 Abstract data types
9.3 Array description
9.3.1 describe
9.3.2 class arrayQueue
9.4 Linked list description
9.5 application
9.5.1 Train car rearrangement
9.5.2 Circuit wiring
9.5.3 Element recognition
9.5.4 Factory simulation
10. Skip tables and hashes 10.1 Dictionaries
10.2 Abstract data types
10.3 Linear table description
10.4 A jump table indicates ( Optional )
10.4.1 Ideal situation
10.4.2 Insert and delete
10.4.3 Level allocation
10.4.4 structure skipNode
10.4.5 class skipList
10.4.6 skipList The complexity of the method
10.5 Hash table description
10.5.1 Ideal hash
10.5.2 Hash functions and hash tables
10.5.3 Linear probe
10.5.4 Chained hash
10.6 An application —— Text compression
10.6.1 LZW Compress
10.6.2 LZW Implementation of compression
10.6.3 LZW decompression
10.6.4 LZW Implementation of decompression
10.6.5 Performance evaluation
11 Binary tree 11.1 Trees
11.2 Binary tree
11.3 Properties of binary trees
11.4 Description of binary tree
11.4.1 Array description
11.4.2 Linked list description
11.5 Common operations of binary tree
11.6 Binary tree traversal
11.7 Abstract data types BinaryTree
11.8 class linkedBinaryTree
11.9 application
11.9.1 Set the signal amplifier
11.9.2 Union checking set
12 Priority queue 12.1 Definition and Application
12.2 Abstract data types
12.3 The linear table
12.4 Pile up
12.4.1 Definition
12.4.2 Insertion of large root pile
12.4.3 Deletion of large root heap
12.4.4 Initialization of large root heap
12.4.5 class maxHeap
12.4.6 Heaps and STL
12.5 Zuo gaoshu
12.5.1 Maximum and minimum left height trees with height first and width first
12.5.2 Maximum HBLT Insertion
12.5.3 Maximum HBLT The deletion of
12.5.4 The two largest trees HBLT The merger of
12.5.5 initialization
12.5.6 class maxHblt
12.6 application
12.6.1 Heap sort
12.6.2 Machine scheduling
12.6.3 Huffman code
13 The competition tree 13.1 Winner tree and Applications
13.2 Abstract data types WinnerTree
13.3 Implementation of winner tree
13.3.1 Express
13.3.2 Initialization of winner tree
13.3.3 Reorganize the game
13.3.4 class completeWinnerTree
13.4 Loser tree
13.5 application
13.5.1 The first fit method is used to solve the box loading problem
13.5.2 Solving the box loading problem by adjacent adaptation method
14 Search tree 14.1 Definition
14.1.1 Binary search tree
14.1.2 Index binary search tree
14.2 Abstract data types
14.3 Operation and implementation of binary search tree
14.3.1 class binarySearchTree
14.3.2 Search for
14.3.3 Insert
14.3.4 Delete
14.3.5 Height of binary search tree
14.4 Binary search tree with the same keyword elements
14.5 Index binary search tree
14.6 application
14.6.1 Histogram
14.6.2 Optimal matching method for box loading problem
14.6.3 Cross distribution
15. Balanced search tree 15.1 AVL Trees
15.1.1 Definition
15.1.2 AVL The height of the tree
15.1.3 AVL Description of the tree
15.1.4 AVL The search of the search tree
15.1.5 AVL Insertion of search tree
15.1.6 AVL Deletion of search tree
15.2 red - Black tree
15.2.1 Basic concepts
15.2.2 red - Description of black tree
15.2.3 red - Black tree search
15.2.4 red - Insertion of black tree
15.2.5 red - Deletion of black tree
15.2.6 Consideration of implementation details and complexity analysis
15.3 Split the tree
15.3.1 Introduce
15.3.2 Split tree operation
15.3.3 Conversion complexity
15.4 B- Trees
15.4.1 Index sequential access method
15.4.2 m Cross search tree
15.4.3 m rank B- Trees
15.4.4 B- The height of the tree
15.4.5 B- Tree search
15.4.6 B- Insertion of trees
15.4.7 B- Delete tree
15.4.8 The node structure
16. chart 16.1 Basic concepts
16.2 Applications and more concepts
16.3 characteristic
16.4 Abstract data types graph
16.5 Description of the graph
16.5.1 Adjacency matrix
16.5.2 Adjacency list
16.5.3 Adjacency array
16.6 Description of weighted graph
16.7 Class implementation
16.7.1 Different classes
16.7.2 Adjacency matrix class
16.7.3 expand chain class
16.7.4 List class
16.8 Graph traversal
16.8.1 Breadth first search
16.8.2 Implementation of breadth first search
16.8.3 Method graph::bfs Complexity analysis of
16.8.4 Depth-first search
16.8.5 Implementation of depth first search
16.8.6 Method graph::dfs Complexity analysis of
16.9 application
16.9.1 Find a path and conclude the scalar algorithm
16.9.2 Connected graph and its composition
16.9.3 Make trees , Prim algorithm , Kruskal algorithm
16.9.4 Shortest path A* Algorithm
16.9.5 A topological sort
16.9.10  Network flow
16.9.10.1 Streaming networks
16.9.10.2 Ford\Fulkerson Method
16.9.10.3 Maximum two point match
16.9.10.4 Push relabel algorithm
16.9.10.5 Front relabeling algorithm
17 Sort and search 17.1 Sort
17.1.1 Select sorting and performance analysis optimization
17.1.2 Bubble sorting and performance analysis optimization
17.1.3 Hill sorting and performance analysis optimization
17.1.4 Insert sorting and performance analysis optimization
17.1.5 Binary search insertion sorting and performance analysis optimization
17.1.6 Merge sort and performance analysis optimization
17.1.7 Quick sort and performance analysis optimization
17.1.8 Parity sorting and performance analysis optimization
17.1.9 Cardinality sorting and performance analysis optimization
17.1.10 Barrel sorting and performance analysis optimization
17.1.11 Merge sort and performance analysis optimization
17.1.12 Cocktail sorting and performance analysis optimization
17.1.13 Goblin sorting and performance analysis optimization
17.1.14 Heap sorting and performance analysis optimization
17.1.15 Tournament ranking and performance analysis optimization
17.1.16 Comb sorting and performance analysis optimization
17.2 lookup
17.2 Unordered search
17.2.1 Search in order
17.2.1.1 Two points search
17.2.1.2 Median search
17.2.1.3 Fibonacci looks for
17.2.1.4 Three point search
17.2.1.5 Binary search approximate search
18 List sorting 18.1 List insertion sort
18.2 Linked list selection sorting
18.3 List bubble sort
18.4 Linked list quick sort
18.5 Linked list merge sort
19. External sorting 19.1 Multiple merge sort
19.2 Permutation selection sort
19.3 Index lookup
19.4 Secondary index retrieval 17 Million documents
20. bitmap With the bloom filter 20.1 Fast review of bit operations
20.2 bitmap actual combat
20.3 Bloom filter implementation
21. String retrieval 21.1 General string retrieval
21.1KMP Algorithm
21.2BM Algorithm
21.3Karp—Rabin Algorithm
21.4 String to achieve high-precision addition
21.5 String to achieve high-precision subtraction
21.6 String to achieve high-precision multiplication
21.7 String to achieve high-precision Division
22 Memory recovery algorithm 22.1 summary
22.2 Available space tables and allocation methods
22.3 Boundary marking
22.3.1 Structure of available spatial tables
22.3.2 Allocation algorithm
22.3.3 Recovery algorithm
22.4 Buddy system
22.4.1 Structure of available spatial tables
22.4.2 Allocation algorithm
22.4.3 Recovery algorithm
22.5 Useless unit collection
22.6 Storage compression
Introduction to the second stage algorithm 1. The first day Mathematical basis 1.1 Function growth and complexity classification
1.1.1 Progressive symbol
1.1.2 Calculation of order
1.1.3 Complexity classification
1.2 probability theory
1.2.1 Events and probabilities
1.2.2 Expectation and variance
1.3 Algebra
1.3.1 matrix
1.3.2 determinant
1.3.3 Solve a system of linear equations
1.3.4 polynomial
1.1.5 The plural
1.1.6 Group
1.4 Combinatorics
1.4.1 Arrange and combine
1.4.2 Pigeon nest principle
1.4.3 Principle of tolerance and exclusion
1.4.4 Special counting sequence
1.4.5 Pólya Counting theorem
1.5 Game theory
1.5.1 Game tree
1.5.2 SG function
1.5.3 Nim Games and Nim
1.6 number theory
1.6.1 to be divisible by
1.6.2 Indefinite equation
1.6.3 Congruence equation and Euler theorem
1.6.4 Primordial root 、 Discrete logarithm and binomial congruence equation
1.6.5 Even points
Curriculum design concept :
  Through a lot of algorithms and data structure problems , Show the difference between yourself and other companies . Especially some particularly difficult ones , Once out of the examination room , It's going to be lively , The Internet is also busy .
  Through the questions on tall , To identify smart and hardworking children , What are the out of class boys .
   You know ,BAT Companies such as , Salary for fresh undergraduates , All on monthly salary 1 All the above , About a year 13 All the above .
   salary 、 personnel 、 The interview is difficult , Nature is related .
  Algorithm , I think it's a very forced word . Books and online public opinion , All make this word tall .
   I don't think so , Why , I like to put forward some new ideas .
   Algorithm , Just the way to solve the problem , What's so great about .
   a farmer 、 Architecture 、 Medical care , Which industry has no solution to the problem , only IT The program design makes the algorithm Algorithm come out .
  The business of large companies is more complex , The technology used is difficult , The requirement for a person's ability and quality is very high . big data 、 Cloud computing 、 High performance is also required , The requirements for basic skills such as data structure and algorithm are relatively high . Basic knowledge of data structure and algorithm , You can see a person's growth potential .
   The business of large companies is more complex , The technology used is difficult , The requirement for a person's ability and quality is very high . big data 、 Cloud computing 、 High performance is also required , The requirements for basic skills such as data structure and algorithm are relatively high . Basic knowledge of data structure and algorithm , You can see a person's growth potential .
   Small and medium-sized companies are more concerned about short-term interests , Recruit someone who can work immediately , A worker who helps the company make money . What can make money immediately , Of course, it's a project , Instead of doing research , Algorithms or something , It doesn't work . Small and medium-sized companies , Do more business systems 、 Website , speed of progress 、 performance 、 Business is the main , Algorithmic requirements are low .
  For example , The algorithm is like the internal skill in martial arts , Good study , Only in the future can we become prawns , Dominating the Wulin . however , No matter how good your internal skill is , No moves , Can't play . And do projects , Engage in application development , It's like the moves in martial arts , Learn a move , You can find a soft persimmon to squeeze , Experience the pleasure of learning martial arts .


Core competencies to master :
1. Have the data structure and algorithm of the world's top 500
2. Have software development thought and software engineering theory
3. Provide theoretical support for large-scale data development ;
4. Familiar with software engineering and industry standards .

Practical problems that can be solved :
1. Pass the enterprise interview ;
2. A solid theoretical foundation , Quickly integrate into enterprise development needs .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages . Understand the role of algorithms in practical development .
2 Elementary number theory and combinatorial mathematics 2.1 to be divisible by
2.2 Prime numbers and composite numbers
2.3 Prime sieve method
2.4 Prime factor decomposition
2.5 The greatest common divisor and the least common multiple
2.6 Modular arithmetic
2.7 congruence
2.8 Euclid algorithm
2.9 extended euclidean algorithm
2.10 Multiplicative inverse in the sense of module
2.11 Theorems related to prime numbers
2.12 Linear congruence equation
2.13 Chinese remainder theorem
2.14 Basic counting principle
2.15 array
2.16 Combine
2.17 Yang hui triangle
2.18 Special arrangement
2.19  stirling Count
2.20 Catalan Count
2.21 Principle of tolerance and exclusion
2.22 Pigeon nest principle
3 Violent solution 3.1 Simple enumeration
3.2 Enumerate permutations
3.2.1 Generate 1~n Permutation
3.2.2 Generate permutations of repeatable sets
3.2.3 Answer tree
3.2.4 Next spread
3.3 Subset generation
3.3.1 Incremental construction
3.3.2 Bit vector method
3.3.3 Binary method
3.4 backtracking
3.4.1 Eight queens question
3.4.2 Examples of other applications
3.5 Path finding problem
3.6 Iteratively deepen the search
4. The basis of number theory 4.1 Basic number theory concepts
4.2 greatest common divisor
4.3 Modular arithmetic
4.4 Solving the modular linear equation
4.5 Chinese remainder theorem
4.6 The power of the element
4.7 RSA Public key encryption system
4.8 The test of prime numbers
4.9 Factorization of integers
5. Probabilistic and stochastic algorithms 5.1 Employment issues
5.2 Indicator random variable
5.3 Random algorithm
5.4 Probability analysis and further use of indicator random variables
5.4.1 Birthday paradox
5.4.2 Ball and box
5.4.3 Characteristic sequence
5.4.4 Online employment issues
6. Greedy algorithm 6.1 Optimization problems
6.2 Greedy algorithm thought
6.3 application
6.3.1 Container loading
6.3.2 0/1 knapsack problem
6.3.3 A topological sort
6.3.4 Bipartite coverage
6.3.5 Single source shortest path
6.3.6 Minimum cost spanning tree
6.3.7 Huffman code
6.3.8 Matroids and greedy algorithms
6.3.9 Using matroid to solve task scheduling problem
7 Divide and conquer algorithm 7.1 Algorithmic thought
7.2 application
7.2.1 Incomplete chessboard
7.2.2 Merge sort
7.2.3 Quick sort
7.2.4 choice
7.2.5 The nearest point to
7.3 Solving recursive equations
7.4 Lower limit of complexity
7.4.1 The lower bound of the minimax problem
7.4.2 Lower bound of sorting algorithm
7.4.3 Maximum subarray problem
7.4.4 Matrix multiplication is Strassen Algorithm
7.4.5 Use the substitution method to solve the recursive formula
7.4.5 The recursive tree method is used to solve the recursive
7.4.6 Use the main method to solve the recursive
7.4.7 Prove the main theorem
7.4.8 Yes b The power of proves the main theorem
7.4.9  Round down and round up
8. Dynamic programming algorithm 8.1 Algorithmic thought
8.2 application
8.2.1 0/1 knapsack problem
8.2.2 Matrix multiplication chain
8.2.3 The shortest path between all vertex pairs
8.2.4 Single source shortest path with negative value
8.2.5 The uncrossed subset of a net group
8.2.6 Steel cutting
8.2.7 Longest common subsequence
8.2.8 The best binary search tree
8.2.9 Maximum continuous subsequence and
8.2.10 The longest non descending subsequence (LIS)
8.2.11 Longest text substring
8.2.12 DAG The longest way
8.2.13 knapsack problem
9. backtracking 9.1 Algorithmic thought
9.2 application
9.2.1 Container loading
9.2.2 0/1 knapsack problem
9.2.3 Maximal complete subgraph
9.2.4 Travel agent problem
9.2.5 Circuit board arrangement
10. Branch boundary algorithm 10.1 Algorithmic thought
10.2 application
10.2.1 Container loading
10.2.2 0/1 knapsack problem
10.2.3 Maximal complete subgraph
10.2.4 Travel agent problem
10.2.5 Circuit board arrangement
11. Apportionment analysis 11.1 Aggregate analysis
11.2 Accounting method
11.3 Potential energy method
11.4 Dynamic table
11.4.1 Table expansion
11.4.2 Table expansion and contraction
12. Linear programming 12.1 Standard and relaxed
12.2 The problem is expressed as linear programming
12.3 Simplex algorithm
12.4 Duality
12.5 The initial basic feasible solution
13. Polynomials and fast Fourier transform 13.1 The representation of polynomials
13.2 DFT And FFT
13.3 Efficient FFT Realization
14. Computational geometry 14.1 polygon
14.1.1 Calculate geometric error correction
14.1.2 Calculate geometric point class
14.1.3 Calculate geometric segment class
14.1.4 Polygon class
14.1.5 The center of gravity of the polygon
14.1.6 The number of lattice points in a polygon
14.1.7 Convex polygon class
14.1.8 The diameter of a convex polygon
14.1.9 Half plane cutting polygon
14.1.10 Half plane intersection
14.1.11 Intersection of convex polygons
14.1.12 The core of a polygon
14.1.13 Intersection of convex polygon and line set
14.2 round
14.2.1 Intersection of circle and line
14.2.2 Area of intersection of circle and polygon
14.2.3 Minimum circle cover
14.2.4 Circle intersects with circle
14.2.5 Discretization of circles
14.2.6 The area of a circle is not
14.3 Three dimensional computational geometry
14.3.1 3D point class
14.3.2 3D line class
14.3.3 3D plane class
14.3.4 Three dimensional vector rotation
14.3.5 The shortest distance between two points on the surface of a box
14.3.6 Tetrahedral volume
14.3.7 The smallest ball covers
14.3.8 Three dimensional convex hull
14.4 other
14.4.1 The four centers of a triangle
14.4.2 The nearest point is right
14.4.3 Plane minimum Manhattan distance spanning tree
14.4.4 Maximum empty convex hull
14.4.5 Plane division
15.NP Completeness 15.1 polynomial time
15.2 Polynomial time verification
15.3 NP Completeness and reducibility
15.4 NP Proof of completeness
15.5 NP Problem completely
15.5.1 The League problem
15.5.2 Vertex covering problem
15.5.3 Hamiltonian loop problem
15.5.4 Travel agent problem
15.5.5 Subsets and questions
16. The approximate algorithm 16.1 Vertex covering problem
16.2 Travel agent problem
16.2.1 Traveling salesman problem satisfying trigonometric inequality
16.2.2 General traveling salesman problem
16.3 Set covering problem
16.4 Randomization and linear programming
16.5 Subsets and questions
17. Advanced topics   17.1 Select the knowledge points to talk about
17.1.1 automata
17.1.2 Classical problems and methods of trees
17.1.3 Persistent data structures
17.1.4 Boolean operation of polygons
17.2 Problem solving
17.2.1 data structure
17.2.2 Network flow
17.2.3 mathematics
17.2.4 The geometric
17.2.5 Imperfect algorithm
17.2.6 Miscellaneous topics
17.3 Mountain climbing
17.4 Simulated annealing
17.5 Genetic algorithm (ga)
The fourth stage is machine learning 1 Regression algorithm 1 Regression algorithm
1.1 Least square method (Ordinary Least Square)
1.2 Logical regression (Logistic Regression)
1.3 Stepwise regression (Stepwise Regression)
1.4 Multiple adaptive regression splines (Multivariate Adaptive Regression Splines)
1.5 Local scatter smoothing estimation (Locally Estimated Scatterplot Smoothing)

 
Curriculum design concept :
Machine learning is an interdisciplinary subject , Probability theory 、 statistical 、 Approximation theory 、 Convex analysis 、 Algorithm complexity theory and other disciplines . To study how computers simulate or implement human learning behavior , To acquire new knowledge or skills , Reorganize the existing knowledge structure to improve its performance .
It's the core of AI , It's the fundamental way to make computers intelligent .


Core competencies to master :
1 Solve the application problem of machine learning
2. Provide theoretical support for intelligent development of large-scale data ;


Practical problems that can be solved :
1. Understand neural network algorithms , Master the basis of machine learning theory ;
2. A solid theoretical foundation , Quickly integrate into the needs of enterprises to develop artificial intelligence .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages , Have the ability of machine learning and development .
2 Instance based algorithm 2 Instance based algorithm
2.1  k-Nearest Neighbor(KNN)
2.2 Learning vector quantization (Learning Vector Quantization, LVQ)
2.3 Self organizing mapping algorithm (Self-Organizing Map , SOM)
3 Regularization method 3 Regularization method
3.1Ridge Regression
3.2Least Absolute Shrinkage and Selection Operator(LASSO)
3.3 Elastic network (Elastic Net)
4 Decision tree learning 4 Decision tree learning
4.1 Classification and regression trees (Classification And Regression Tree, CART)
4.2 D3 (Iterative Dichotomiser 3)
4.3  C4.5
4.4  Chi-squared Automatic Interaction Detection(CHAID)
4.5 Decision Stump
4.6 Random forests (Random Forest)
4.7 Multiple adaptive regression splines (MARS)
4.8 Gradient thruster (Gradient Boosting Machine, GBM)
5 Bayesian method 5 Bayesian method
5.1 Naive bayes algorithm
5.2 Average single dependence estimate (Averaged One-Dependence Estimators, AODE)
5.3 Bayesian Belief Network(BBN)
6 Kernel based algorithms 6 Kernel based algorithms
6.1 Support vector machine (Support Vector Machine, SVM)
6.2 Radial basis function (Radial Basis Function ,RBF)
6.3 Linear discriminant analysis (Linear Discriminate Analysis ,LDA)
7 clustering algorithm 7 clustering algorithm
7.1 k-Means Algorithm
7.2 Expectation maximization algorithm (Expectation Maximization, EM)
8 Association rule learning 8 Association rule learning
8.1Apriori Algorithm
8.2 Eclat Algorithm
9 Artificial neural network 9 Artificial neural network
9.1 Perceptron neural network (Perceptron Neural Network)
9.2 Reverse transfer (Back Propagation)
9.3 Hopfield The Internet
9.4 Learning vector quantization (Learning Vector Quantization, LVQ)
Machine learning algorithm practice Marriage website intelligent recommendation , Real estate forecast
The fifth stage is deep learning Deep learning and neural networks 0 Deep learning
0.1 Restricted Boltzmann machine (Restricted Boltzmann Machine, RBN)
0.2 Deep Belief Networks(DBN)
0.3 Convolution network (Convolutional Network)
0.4 Stack type automatic encoder (Stacked Auto-encoders)

 
Curriculum design concept :
Deep learning (DL, Deep Learning) It's machine learning (ML, Machine Learning) A new research direction in the field , It was introduced into machine learning to bring it closer to the original goal —— Artificial intelligence (AI, Artificial Intelligence).
Deep learning is the internal law and representation level of learning sample data , The information acquired in the process of learning, for example, words , The interpretation of data such as images and sounds helps a lot . Its ultimate goal is to enable the machine to have analytical learning ability like human beings , Be able to recognize words 、 Image and sound data . Deep learning is a complex machine learning algorithm , The results achieved in speech and image recognition , Much more than the previous technology .
Deep learning in search technology , data mining , machine learning , Machine translation , natural language processing , Multimedia learning , voice , Recommendation and personalization technology , And other related fields have made a lot of achievements . Deep learning enables machines to imitate human activities such as listening, speaking and thinking , Many complex pattern recognition problems have been solved , It has made great progress in AI related technology .

Core competencies to master :
1 Solve the application problem of deep learning
2. Provide theoretical support for intelligent development of large-scale data ;


Practical problems that can be solved :
1. Understand neural network algorithms , Master the basis of deep learning theory ;
2. A solid theoretical foundation , Quickly integrate into the needs of enterprises to develop artificial intelligence .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages , Have the ability of in-depth learning and development .
Deep learning dimension reduction algorithm 1 Dimension reduction algorithm
1.1 Principal component analysis (Principle Component Analysis, PCA)
1.2 Partial least squares regression (Partial Least Square Regression,PLS)
1.3 Sammon mapping
1.4 Multidimensional scale (Multi-Dimensional Scaling, MDS)
1.5 Projection tracing (Projection Pursuit)
Deep learning integration algorithm
2 The integration algorithm
2.1 Boosting
2.2 Bootstrapped Aggregation(Bagging)
2.3 AdaBoost
2.4 Stack generalization (Stacked Generalization, Blending)
tensorflow-go tensorflow Deep learning framework
Deep learning practice Handwriting recognition , Image recognition , Automatic driving image recognition
The sixth stage is intelligent recommendation Intelligent recommendation algorithm Content based recommendation algorithm
Collaborative filtering recommendation algorithm
Based on knowledge recommendation
Based on utility recommendation
Rule based recommendation
Curriculum design concept :
Intelligent recommendation generates user portraits according to different user preferences , Provide... For each user “ One thousand thousand ” Personalized recommendation content , Help the media 、 E-commerce and other industries can effectively improve the click through rate 、 Conversion rate and user stickiness , Greatly increase the operating efficiency of customers

Core competencies to master :
1 Solve the core problem of intelligent recommendation
2. Provide theoretical support for the development of large-scale data intelligent recommendation ;


Practical problems that can be solved :
1. Understand Intelligent Recommendation Algorithm , Master the basis of recommendation theory ;
2. A solid theoretical foundation , Quickly integrate into the needs of enterprise development intelligent recommendation .

Market value :
Pass the technical interview and technical assessment , Have strong bargaining power on wages , Have the ability to develop intelligent recommendation system .
Intelligent recommendation practice E-commerce recommendation algorithm and the implementation of today's headline recommendation algorithm

 

Stage Main content Technical points Learning goals
Public chain development The first stage Go Public chain development  1.Golang Blockchain public chain development - Blockchain architecture implementation
2.Golang Blockchain public chain development - Proof of workload
3.Golang Blockchain public chain development - Persistence
4.Golang Blockchain public chain development -UTXO Transaction structure
5.Golang Blockchain public chain development - Transaction and address
6.Golang Blockchain public chain development - Trading with the Merkel tree
7.Golang Blockchain public chain development - Trading and networking
Curriculum design concept :
Understand the basic principles of blockchain system , be based on Go Language can customize blockchain system for enterprises .
Master the mainstream blockchain (Bitcoin,Ethereum) Related mechanism and principle , Understand all kinds of mainstream consensus algorithms (PoW,PoS,DPoS), Master the blockchain system Go development language , Be able to write smart contracts based on Ethereum , Can write and publish tokens ;

Core competencies to master :
1. Knowledge of common cryptography principles and security protocols ;
2. Have the ability of information security programming and development ;
3. Provide theoretical support for information security system development and blockchain development ;
4. Master the mainstream blockchain (Bitcoin,Ethereum) Related mechanism and principle ;
5. Understand all kinds of mainstream consensus algorithms (PoW,PoS,DPoS);
6. Master the blockchain system Go development language ;
7. Familiar with common security protocols and encryption algorithms ;
8. Familiar with bitcoin optimization protocol and industry standards .

Practical problems that can be solved :
1. It can solve the problem of information security, encrypted data transmission and authentication process , Have the development ability in the field of information security , It can solve the financial development of centralized system ;
2. A solid theoretical foundation , Quickly integrate into the development needs of blockchain public chain of enterprises in various industries .

Market value :
The blockchain talent market has a huge weakness .
The second stage is bitcoin source code analysis 1. Bitcoin design concept :
  - Bitcoin connotation
  - The value of bitcoin
  - Digital signature and multi signature
  - Unique transaction design mode and its advantages
  - block : How to solve the chronology of attacks and transactions
  - Bifurcation
  - Bitcoin's double flower attack
  -51% attack
  - Mining and ore pool
  - Bitcoin difficulty
  - Bitcoin expansion
2. Bitcoin source code analysis :
  - framework
  - Address generation 、 Encoding and decoding ( Elliptic curve and Base58 code )
  - Transaction structure 、 establish 、 spread 、 Integrate (CTransaction)
  - Trading pool (CTxMemPool)
  - Script (P2PKH、P2PK、P2SH)
  - Block building 、 To verify 、 Assembly and selection (CBlock、CBlockHeader)
  - Difficulty calculation and adjustment (Difficulty)
  -POW Consensus algorithm (Consensus)
  - Bifurcation detection
  -Merkle Tree
  -SPV And Bloom Filter
  -JSON-RPC Interface
  - dig (Minner)
  - Network node discovery 、 Connect 、 Broadcast and exception handling
The third stage is the customization and modification of bitcoin source code Custom counterfeit coins C++ With customized state secret bitcoin
Phase III Ethereum source code 1. download 、 compile 、 start-up Go-etherenum
2. Go-etherenum Client code and Node analysis
3. The etheric fang RPC Communication examples and principle code analysis
4. Ethereum Service and Ethereum P2P Protocol sending broadcast source code analysis
5. The etheric fang P2P Processing and processing of protocol receiving broadcast Fetcher Source code analysis
6. Ethereum core BlockChain Source code analysis
7. Ethereum through EVM Perform transaction process analysis
8. The etheric fang Bloom Filter implementation principle and application scenario analysis
The fourth stage EOS Source code analysis 1EOS brief introduction 、 Source download 、 compile 、 debugging ;
2EOS Plug in source code structure .
3EOS data ,
4DPos Consensus algorithm
5 data structure
6 Account and authority system , Unique to graphene series , Different from other blockchain platforms ;
7Token And resource systems .
8 Block production and block synchronization
9 Smart contract development .
10 parallel
11 Cross link .
12 Deployment and maintenance .
13 government
The fifth stage is the customization and modification of Ethereum source code Modify the consensus algorithm of Ethereum to dpos
The sixth stage is the source code analysis of super ledger 1. fabric account number and fabric-ca Use
2. fabric Organizations in , node , user
3. fabric Channel in
4. fabric Consensus mechanism in
5. fabric The books in the book
6. fabric The process of trading
The seventh stage is the customization and modification of super ledger Change the super ledger into a state secret
The eighth stage IPFS System source code analysis IPFS The underlying technology
Distributed hash table (DHT)
Chord agreement
Kademlia agreement
S/Kademlia agreement
BitTorrent agreement
Distributed version control (Git)
Self validating file system ((SFS)
IPFS Multiformats
IPFS IPLD
IPFS Storage layer
IPFS Bitswap
IPFS The network layer
IPFS colony
The ninth stage is customization IPFS System Modify Nebula file system to state secret
Stage 10 ripple Source code analysis 1.Ripple brief introduction
2. Blockchain infrastructure and format
3. Transaction type and format
4. Network erection and configuration
5. Transfer transaction
6. Pending transaction
7. Multi party signature transactions
8.Escrow transaction
9.Payment Channel transaction
10. How the transaction is sent
11. The path principle of transaction
12. Introduction and application of gateway
13. The underlying technology of gateway
14. Consensus process
The eleventh stage is decentralized exchange customization bitshares Customized decentralized exchange design
The twelfth stage is based on the compilation principle VM virtual machine VM Virtual machine implementation
Phase 13 wallet development Wallet mnemonics restore private key
Private key fragment
Multisignature
Bitcoin transfer
Transfer from Ethereum
Ethereum contract token transfer

 

Stage Main content Technical points Learning goals
Public intelligence contract development 1Solidity Language 1. Basic grammar : integer 、 Boolean 、 floating-point 、internal、external、storage、memory etc.
2. Advanced Grammar : Array 、 enumeration 、 structure 、 mapping 、 Tuples etc.
Can be based on Ethereum and EOS Write smart contracts , Can write and publish tokens , With blockchain Dapp Development capability .

Core competencies to master :
1. Be able to master the use of Vue Technology stack for project development ;
2. Be able to master the use of source code management tools ;
3. Be able to master the front and rear end separation development mode ;
4. Be able to master the use of mainstream framework to develop portal websites 、 Management system 、 Move Web Such as the client ;
5. Be able to master Web Project deployment and release mode ;
6. Be able to write smart contracts based on Ethereum ;
7. Can write and publish tokens ;
8. Master common DApp Development framework ;
9. Have the ability to develop district centered distributed storage model .

Practical problems that can be solved :
A solid theoretical foundation , Quickly integrate into the development needs of blockchain related enterprises in various industries .

Market value :
The blockchain talent market has a huge weakness .
2 Introduction to Ethereum 1. Contract programming : contract 、 Inherit 、 Global function 、 Address 、 Transfer accounts 、 event 、 Modifiers, etc

2. Ethereum introduction and environment construction
   a. Mist wallet
   b. MetaMask wallet
   c. Remix compiler
3. Ethereum framework 1. The blockchain builds and implements multiple nodes to realize data interaction
    a. Private chain building
    b. Alliance chain construction

2. Truffle Frame learning
   a. Deployed in different environments (develop Environmental Science 、Ganache、 The chain of private 、ropsten Network, etc )
   b. Unit test writing
   c. Built in project introduction

3. Web3.0.js Study
4. Ethereum project practice Case study 1: Ethereum project practice - Voting system
Case study 2: Ethereum project practice - Issue simple tokens
Case study 3: Ethereum project practice - Wallet making
Case study 4: District centered game based on Ethereum - Ethernet cat development practice
5.EOS Intelligent contract 1.EOS Smart contract environment deployment
2.HPP
3.CPP
4.WAST
5.ABI
6. Currency contracts
7.Tie-Tac-Toe
8.EOS Contract practice
9.EOS Contract upgrade
10.EOS Contract commissioning
6.EOS Project practice Case study EOS Realize token issuance , Transfer accounts .
Alliance chain smart contract actual combat HyperLedger Fabric Environment configuration 1 Deploy HyperLedger Fabric
2.First-NetWork Environment testing and network startup
3 fabric account number and fabric-ca Use
4. fabric Organizations in , node , user
5. fabric Channel in
6. fabric Consensus mechanism in
7. fabric The books in the book
8. fabric The process of trading
9.cryptogen Module command and configuration
10.configxgen Module command and configuration
11.orderer Module command and configuration
12.peer Module commands and peer channel
13 . Certificate and channel management
Curriculum design concept :
hyperledger yes IBM The company supports ,linux Blockchain commercial development platform incubated by the foundation .hyperledger Fabric It's all for Go The realization of language ,hyperledger It can be widely used in private chain and alliance chain , Many large domestic companies have joined hyperledger union .

Core competencies to master :
1. Working experience in blockchain and related industries ;
2. Have class Hyperledger, Development capability of Ethereum and other public blockchain projects ;
3. Have smart contracts and their use scenarios ;
4. Have the ability to master Bitcoin,Ethereum,HyperLedger Fabric Relevant mechanisms and principles of blockchain ;
5. be familiar with ;Hyperledger Fabric Technology The various components of (Peers、Orderer、MSP、CA ...);
6. Able to use Go Language to write smart contract chain code ;
7. be familiar with hyperledger febric Deployment of .


Practical problems that can be solved :
1. Design of blockchain underlying products 、 R & D work ;
2. Design of blockchain application layer products 、 R & D work ;
3. Study the underlying protocol and implementation of bottom blockchain , Participate in optimization and reconstruction .

Market value :
After proficient learning and mastering , It can meet the initial and intermediate requirements of enterprise development 、 Even advanced requirements .
HyperLedger Fabric Intelligent contract chaincode

1.ChainCode Introduce
2.Golang Of ChainCode The code structure
3.ChainCode Transaction endorsement mechanism
4.orderer Sort nodes
5. Deploy peer0.orggo node
6. Deploy peer0.orgcpp node
7. Chain code packaging
8. Start block and channel files
9.Zookeeper Deployment and configuration
10.Kafka Concept and setting
11.orderer Node set
12. Build a multi cluster environment
13.dairy Organization deployment
14.process Organization deployment
15.sell Organization deployment
16. Traceability business chainCode To write
17. Introduction to Alibaba cloud platform blockchain service
18. Cloud platform blockchain service construction
19. Chain code management
20. Chain code writing
21. Personal authentication chain code
22. Project blockchain service system construction
23. Transaction information on the chain
HyperLedger Fabric actual combat Commodity traceability platform based on alliance chain  

 

版权声明:本文为[Yin Cheng]所创,转载请带上原文链接,感谢。 https://netfreeman.com/2021/11/20211108224341519p.html