First put about a 20-year examination syllabus. If we say that early on saw this article or a strong power player, I can tell you follow a syllabus of a school on the list, if the fast graduate exam or poor foundation, it forces a little. What can score a good score, what the high cost of what we learned, these cost-effective part, I marked in red, hyperlinks related to knowledge and learning. May every person can get up early for an early project manager.
The overall analysis, 408 exam, multiple choice questions 40 (a 2 points), the big question 7 (an average of 10 points), to test four, ds, co, os, network share fraction of 45,453,525. If you simply look at test scores, networks and operating systems of the least worthy of review, but otherwise, the reason is because these two low proportion too difficult, but it is most likely to score, and Dijkstra, Puli Mu algorithm is familiar, programming data structures you will be looked dumbfounded, no idea is not the idea, is not will not. But the big question of the operating system is relatively easy, a decade exam type often nothing more than file management, process management, memory management . The focus is always the focus, each year, two out of three in the election test. Examine network is almost not escape the network layer, the hierarchical network architecture has a variety of network layer, we can see the network layer top priority, network layer could not escape the big question, what does not go over this review? 20-30 minutes firmly hand, the corresponding choice concept almost back to back 30 is also steady. At this point there is certainly emboldened the 80+ exam is enough, now 408 exam is a long period of division of the state, more and more efficient test 408 difficulty should not be great changes, but would mean that as long as 80+ focus on mathematics in English better, do not be afraid contents confused so many courses.
It did not say a data structure and composition principle, for a reason. Because bloggers heart itself is a little escape, partial logical data structure, the composition of the principle of partial calculations. But then again the point is always the focus, the focus of the test does not test what it? Undergraduate phase difference is nothing more than some people head each pass of the algorithm can emerge out of the process of implementation and even simple algorithms are people who do not back down. Binary tree traversal, topology map, sorting and searching master the basic on it, and occasionally test a Huffman, will not will not, because it is no easy points bid was too low. Shell sort examination also, but its grasp quickly exhaust these more common and more worthwhile. Composition Principle forget finished. . . . . . . . . . .
A linear table
Define (a) and the basic operation of the linear form
(Part two) in the linear form
1. sequential storage
2. store chain
3. Application of the linear form
Second, stacks, queues, and the array
The basic concept of (a) of the stacks and queues
Sequential storage structure (II) of the stacks and queues
(C) memory stacks and queues chain structure
Application (iv) of the stacks and queues
Compressed storage (5) The special matrix
Third, the tree and binary tree
Basic Concepts (a) of the tree
(B) binary tree
Its main features defined 1. Binary Tree
2. The binary tree structure and stored in the order Storage Structure
3. binary tree traversal
4. The basic concepts and constructs threaded binary
(C) trees, forest
1. Tree structure storage
2. Forest and binary conversion
3. traverse the tree and forest
(D) the application of binary tree and
1. binary sort tree
2. balanced binary tree
3. Huffman (Huffman) encoding the Huffman tree, and
Fourth, Figure
The basic concept of (a) of FIG.
Storage (B) and the basic operation of FIG.
1. adjacency matrix
2. adjacency table method
3. the adjacent multi-table, orthogonal list
Traversing (c) of FIG.
1. depth-first search
2. BFS
Basic applications (D) of FIG.
1. Minimum (Consideration) spanning
2. Shortest Path
3. topological sorting
4. Critical Path
Fifth, find
Basic Concepts (a) Find
(B) the sequential search method
(Iii) block search method
(D) binary search
Basic Concepts (e) B and its basic operation tree, B + tree
(F) hash (Hash) table
(Vii) the string pattern matching
(H) analysis and application of the algorithm to find
Sixth, sorting
Basic Concepts (a) sort of
(Ii) insertion sort
1. Direct insertion sort
2. binary insertion sort
(Iii) Bubble Sort (bubble sort)
(D) select Sort
(E) Hill sorting (shell sort)
(Vi) quicksort
(Vii) heapsort
(Viii) two-way merge sort (merge sort)
(Ix) radix sort
(J) external sorting
(Xi) comparing the various internal sorting algorithm
Application (xii) sorting algorithm
First, the computer system overview
(A) computer development
(B) the computer system hierarchy
1. The basic components of the computer system
2. The basic components of computer hardware
3. The relationship between computer software and hardware
4. The computer work process
(C) computer performance
Throughput, response time; the CPU clock cycle, frequency, CPI, CPU execution time; MIPS, MFLOPS, GFLOPS, TFLOPS, PFLOPS.
Second, the representation of the data and calculation
(A) the number of encoding system
1. Its binary notation conversion
2. The true value and the number of machines
3.BCD code
4. The character string
5. Check code
(Ii) the fixed-point representation and calculation
1. The fixed-point representation
Unsigned representation; representing a signed integer.
2. The fixed-point arithmetic
Calculation of fixed-point displacement; primitive fixed-point addition and subtraction; plus complement fixed points / subtraction operation; fixed-point multiply / divide operations; overflow concepts and determination methods.
(C) floating-point representation and calculation
1. floating-point representation
IEEE 754 standard
2. The floating-point addition / subtraction operation
(Iv) The ALU
1. The parallel-serial adder and adder
2. The ALU function and structure
Third, the memory hierarchy
Category (a) memory
Hierarchical structure (II) memory
(C) a semiconductor random access memory
1.SRAM memory
2.DRAM memory
3. Read-Only Memory
4.Flash memory
(Iv) a main memory connected to the CPU
(E) dual-port RAM memory modules and the plurality
(Vi) a cache memory (Cache)
The basic operating principle of 1.Cache
Mapping mode between the main memory and 2.Cache
Replacement algorithm in main memory block 3.Cache
4.Cache write strategy
(Vii) virtual memory
Basic concepts of virtual memory
2. paged virtual memory
3. Segment virtual memory
4. The virtual memory page segments
5.TLB (fast table)
Fourth, the instruction
(A) Instruction Format
1. The basic format of the instructions
2. The fixed-length instruction format opcode
3. extended opcode instruction format
(B) addressing mode instructions
1. The concept of the effective address
2. instruction addressing and data addressing
3. Common addressing
(C) the basic concepts of CISC and RISC
Fifth, the central processing unit (CPU)
(A) CPU function and basic structure
(Ii) an instruction execution process
The basic function and structure (iii) data path
Function and operating principle (d) of the controller
1, hard-wired controller
2, the micro program controller
Microprogram microinstruction command and micro; microinstruction encoding; form a micro address.
(E) an instruction pipeline
1, the basic concept of the instruction pipeline
2, the basic realization of the instruction pipeline
3, the basic concepts and dynamic superscalar pipeline
Six bus
(A) Overview Bus
1, the basic concept bus
2, bus classification
3, composition and performance of bus
(B) the arbitration bus
1, centralized arbitration
2, distributed arbitration
(C) bus operation and the timing
1, the synchronization timing mode
2, the asynchronous timing modes
(D) bus standard
Seven, input-output (I / O) system
(A) the basic concept of I / O system
(B) an external device
1, input devices: keyboard, mouse
2, an output device: a display, printer
3, the external memory: a hard disk memory, a disk array, optical disk memory
(C) I / O interfaces (I / O Controller)
1, I / O interface function and basic structure
2, I / O ports and addressing
(D) I / O mode
1, the program query
2, interrupt program
The basic concept of an interrupt; interrupt response procedure; interrupt processing; multiple interrupt and mask concept.
3, DMA mode
Composition DMA controller, DMA transfer process.
First, the operating system overview
The concept (a) of the operating system, features, functions and services provided
Development and classification (b) of the operating system
(C) operating system runtime environment
1. kernel mode and user mode
2. interrupts, exceptions
3. System Calls
(D) Operating System Architecture
Second, process management
(A) processes and threads
1. The concept of process
2. The status of the conversion process
3. Process Control
4. Process Organization
5. Process Communication
Shared storage system; messaging system; communication pipe.
6. Thread the concept of multi-threading model
(Ii) processor scheduling
Basic concepts scheduling
Scheduling an opportunity to switch to the process
3. basic criteria scheduling
4. scheduling
The typical scheduling algorithm
FCFS scheduling algorithm; short job (short process, short process) priority scheduling algorithm; round-robin scheduling algorithm; priority scheduling algorithm; higher than the response priority scheduling algorithm; multilevel feedback queue scheduling algorithm.
(C) synchronization and mutual exclusion
Basic concepts of Process Synchronization
2. The basic method to achieve critical section mutex
Software implementation; hardware implementation.
3. Semaphore
4. the tube
The classic synchronization problem
Producer - consumer issues; readers - write the problem; dining philosophers problem.
(D) deadlock
1. The concept of deadlock
2. Deadlock Strategy
3. deadlock prevention
4. deadlock avoidance
System security status, bankers algorithm.
The deadlock detection and release
Third, memory management
(A) memory management infrastructure
1. Memory Management Concepts
Program load and link; logical addresses and physical address space; memory protection.
2. exchange and coverage
3. Continuous distribution management
4. Non-contiguous allocation management
Paging supervisor mode; segment management; segment page management method.
(B) the virtual memory management
1. The basic concept of virtual memory
2. Demand paging management
3. The page replacement algorithm
Optimal replacement algorithm (OPT); FIFO replacement algorithm (the FIFO); least recently used replacement algorithm (the LRU); replacement algorithm clock (CLOCK).
4. page allocation strategy
5. Working Set
6. Jitter
Fourth, document management
(A) file system basis
1. The concept paper
2. The logical structure of files
Sequential file; the index file; indexed sequential file.
3. Directory Structure
And inode file control block; two single-level directory structure and the directory structure; directory tree structure; pattern directory structure.
4. File Sharing
5. File Protection
The type of access; access control.
(B) file system implementation
1. file system hierarchy
2. Directory achieve
3. File achieve
(C) Disk Organization and Management
1. Structure of disk
2. Disk scheduling algorithm
3. Disk Management
Fifth, the input-output (I / O) management
(A) I / O management Overview
1.I / O control
2. I / O software hierarchy
(B) I / O subsystem core
1.I / O scheduling concept
2. caches and buffers
3. Device allocation and recovery
4. spooling (SPOOLing)
A computer network architecture
(A) an overview of computer network
Concepts of computer networks, composition and function
2. Classification of computer networks
3. Standardization of computer networks and related organizations
(B) Computer Network Architecture Reference Model and
1. Computer network hierarchy
2. computer network protocols, interfaces, and service concept
3.ISO / OSI reference model and TCP / IP model
Second, the physical layer
(A) Communication Foundation
1. Basic Concepts channel signals, wideband, symbols, baud rate, the source and the sink, etc.
2. Nyquist theorem and Shannon
3. The coding and modulation
4. The circuit switching, packet switching and packet switching
The virtual circuit data packets and
(Ii) transmission media
1. twisted pair, coax, fiber and wireless transmission media
2. The physical layer interface properties
(C) the physical layer device
1. Repeater
2. Hub
Third, the data link layer
Function (a) a data link layer
(B) framing
(C) error control
1. error detection coding
2. The error correction coding
(D) flow control and a reliable transport mechanism
1. Flow control, reliable transmission pulley window mechanism
2. Stop - wait protocol
3. Back N frame protocol (a GBN)
4. Select the retransmission protocol (SR)
(E) MAC
1. The channel is divided
Frequency division multiplexing, time division multiplexing, wavelength division multiplexing, code division multiplexing principles and basic concepts.
2. Then visit
ALOHA protocol; CSMA protocol; CSMA / CD protocol; CSMA / CA protocol.
3. polling access
Token passing protocols
(Vi) local area network
1. Basic concepts and architecture of the local area network
2. Ethernet and IEEE 802.3
3.IEEE 802.11
4. The basic principle of the token ring network
(Vii) WAN
Basic concepts of WAN
2.PPP agreement
3.HDLC agreement
(H) a data link layer device
1. The concept and basic principles of bridge
2. LAN switches and how it works.
Fourth, the network layer
Function (a) the network layer
1. heterogeneous network interconnection
2. Routing and Forwarding
3. Congestion Control
(B) routing algorithm
1. static routing and dynamic routing
2. Distance - vector routing algorithm
3. The link-state routing algorithm
4. hierarchical routing
(C) IPv4
1.IPv4 grouping
2.IPv4 address and NAT
3. subnetting and subnet mask, CIDR
4.ARP protocol, DHCP protocol and ICMP protocol
(Iv) IPv6
The main features of 1.IPv6
2.IPv6 address
(E) routing protocol
1. AS
2. Inter-domain routing and Domain Routing
3.RIP routing protocol
4.OSPF routing protocol
5.BGP routing protocol
(Vi) IP Multicast
Concepts Multicast
2.IP multicast address
(Vii) Mobile IP
1. Mobile IP concept
2. Mobile IP communication procedure
(H) network layer devices
1. The composition and function of the router
2. routing tables and route forwarding
Fifth, the transport layer
Service (a) transport layer provides
1. The function of the transport layer
2. the transport layer address and port
3. connectionless services and connection-oriented service
(B) UDP protocol
1.UDP Datagram
2.UDP check
(C) TCP protocol
1.TCP segment
2.TCP Connection Management
3.TCP reliable transmission
4.TCP flow control and congestion control
Sixth, the application layer
(A) network application model
1. The client / server model
2.P2P model
(B) the DNS system
1. The level domain name space
2. Domain Name Server
3. Domain Name Process
(C) FTP
It works 1.FTP agreement
2. The control connection is connected to the data
(Iv) e-mail
1. The e-mail system composition structure
2. E-mail MIME format
3.SMTP agreement with the POP3 protocol
(E) WWW
The concept and composition of the structure 1.WWW
2.HTTP agreement