Political+English+Mathematics+Computer Professional Course Postgraduate Entrance Examination Syllabus: Mathematics 1, Mathematics 1, which is for students applying for science and engineering (master's degree). The examination contents include advanced mathematics, linear algebra, probability theory, mathematical statistics, and the examination contents are the most.

The basic comprehensive examination of computer specialty covers basic courses such as data organization, computer composition principle, operating system and computer network. Candidates are required to systematically master the concepts, basic principles and methods of the above-mentioned professional basic courses, and use the basic principles and methods they have learned to analyze, judge and solve related theoretical and practical problems.

(A) computer specialized courses

First, the examination objectives

The basic comprehensive examination of computer specialty covers basic courses such as data organization, computer composition principle, operating system and computer network. Candidates are required to systematically master the concepts, basic principles and methods of the above-mentioned professional basic courses, and use the basic principles and methods they have learned to analyze, judge and solve related theoretical and practical problems.

Second, the examination form and examination paper structure

First, the perfect score of the test paper and the examination time

The full mark of this volume is 150, and the examination time is 180 minutes.

Second, the way to answer questions

The answer methods are closed book and written test.

Third, the content structure of the test paper

Data structure 45 points

Principle of computer composition 45 points

Operating system 35 points

Computer network? 25 points

Fourth, the question structure of the test paper

80 points for multiple-choice questions (40 small questions, 2 points for each small question)

Comprehensive application problem 70 points

Third, the scope of inspection

data structure

Examination objectives

1. Understand the basic concepts of data structure; Master the logical structure, storage structure and differences of data, as well as the realization of various basic operations.

2. On the basis of mastering the basic data processing principles and methods, we can design and analyze the algorithm.

3. Be able to choose appropriate data structures and methods to solve problems.

First of all, linear table

(A) the definition and basic operation of linear table

(B) the realization of linear table

1. sequential storage structure

2. Chain storage structure

3. The application of linear table

Second, stacks, queues and arrays.

(A) the basic concepts of stack and queue

(2) The sequential storage structure of stack and queue

(3) Chain storage structure of stack and queue

(d) application of stack and queue

(5) compressed storage of special matrix

Third, trees and binary trees

(A) the concept of trees

(2) Binary tree

Definition and main characteristics of 1. binary tree

2. Sequential storage structure and chain storage structure of binary tree.

3. The traversal of binary tree

4. Basic concept and construction of clue binary tree

5. Binary sort tree

6. Balanced Binary Tree

(3) Trees and forests

1. Storage structure of books

2. Conversion between forest and binary tree

Step 3 walk through trees and forests

(D) the application of trees

1. equivalence class problem

2. Hoffman Tree and huffman encoding

Fourth, the figure.

(A) the concept of graphics

(2) Storage and basic operation of graphics

Adjacent matrix method.

2. Adjacency table method

(3) traversal of graphs

1. Depth first search

2. Horizontal priority search

(4) Basic application of graph and its complexity analysis.

1. Minimum (cost) spanning tree

2. The shortest path

3. Topological sorting

4. Key ways

Verb (abbreviation for verb) discovery

(A) the basic concept of search

(2) sequential search method

(3) Semi-search method

B tree

(5) Hashtable and its search.

(6) Analysis and application of search algorithm

Six, internal sorting

(A) the basic concept of sorting

(2) Insert sort

1. Insert sort directly.

2. Semi-insert sorting

(3) bubble sorting

Simple selection classification

(5) Hill sorting (shell sorting)

(6) Quick sorting

(7) heap sorting

(8) Two-way merge sort

(9) Cardinal sorting

(X) Comparison of various internal sorting algorithms

(XI) Application of internal sorting algorithm

principles of computer composition

Examination objectives

1. Understand the internal working principle, composition structure and interconnection among components of a single-processor computer system, and have a complete concept of the whole computer system.

2. Understand the concept of hierarchical structure of computer system, be familiar with the interface between hardware and software, and master the basic knowledge and implementation method of instruction set architecture.

3. Be able to use the basic principles and methods of computer composition to calculate and analyze theoretical and practical problems in computer hardware system, and simply design some basic components.

I. Overview of Computer System

(A) the development of computers

(B) the hierarchical structure of the computer system

1. Basic components of computer hardware

2. The classification of computer software

3. The working process of the computer

(3) Computer performance index

Throughput and response time; CPU clock cycle, main frequency, CPI and CPU execution time; MIPS，MFLOPS .

Second, the data representation and operation

(A) numbering system and coding

1. carry counting system and its mutual conversion

2. True value and number of machines

3.BCD code

4. Characters and strings

5. Check code

(2) Representation and operation of fixed points

1. Representation of fixed points

Representation of unsigned numbers; Representation of signed numbers.

2. Fixed point operation

Fixed-point displacement operation; Addition and subtraction of fixed points in the original code; Addition/subtraction operation of complement fixed point; Fixed-point multiplication/Divison; Concept and discrimination method of overflow.

(3) Representation and operation of floating-point numbers

1. Representation of floating-point numbers

The representation range of floating-point numbers; IEEE754 standard

2. Addition/subtraction of floating-point numbers

(4) Arithmetic logic unit

1. serial adder and parallel adder

2. The function and mechanism of ALU.

Third, the memory level.

(A) the classification of memory

(B) the hierarchical structure of memory

(3) semiconductor random access memory

Working principle of 1.SRAM memory

2. The working principle of 2.DRAM memory

(4) read-only memory

(5) Connection between main memory and CPU

(6) dual-port RAM and multi-module memory

(7) Cache

1. Local program access

2. The basic working principle of cache

3. Mapping mode between cache and main memory

4. The replacement algorithm of main memory block in cache.

5. Cache write strategy

(8) Virtual memory

1. Basic concept of virtual memory

2. Page virtual memory

3. Segmented virtual memory

4. Segment page virtual memory

5.TLB (Fast Table)

Fourth, the instruction system

(1) instruction format

Basic format of 1. instruction

2. Fixed length opcode instruction format

3. Extended opcode instruction format

(2) the addressing mode of instructions

1. The concept of effective address

2. Data addressing and instruction addressing

3. Common addressing methods

(C) the basic concepts of CISC and RISC

Five, the central processing unit (CPU)

(A) the function and basic structure of the central processing unit

(II) Instruction execution process

(3) Function and basic structure of data path

(4) Function and working principle of the controller

1. hardwired controller

2. Microprogramming controller

Microprograms, microinstructions and microinstructions; Coding mode of microinstruction; The form of micro address.

(5) instruction pipeline

Basic concepts of instruction pipeline.

2. The basic concepts of superscalar and dynamic pipeline.

Intransitive verb bus

(1) General situation of passenger cars

1. Basic concept of bus

2. Classification of buses

3. Composition and performance indicators of passenger cars

(2) Bus arbitration

1. Centralized arbitration mode

2. Distributed arbitration mode

(3) bus operation and timing

1. Synchronous timing mode

2. Asynchronous timing mode

(4) Bus standard

Seven, input and output (I/O) system

(A) the basic concept of I/O system

(2) External equipment

1. Input devices: keyboard and mouse.

2. Output devices: monitors and printers

3. External storage: hard disk storage, disk array and optical disk storage.

(3) Input/output interface (input/output controller)

The function and basic structure of 1 Input-output interface

2.I/O ports and their addressing

(4) Input and output mode

1. program query mode

2. Program interrupt mode

The basic concept of interruption; Interrupt response process; Interrupt processing; The concepts of multiple interrupts and interrupt masking.

3.DMA mode

Composition of DMA controller; DMA transfer process.

4. Channel mode

operating system

Examination objectives

1. Understand the role, status, development and characteristics of operating system in computer system.

2. Understand the basic concepts and principles of the operating system, and master the design method and implementation technology of the operating system.

3. Be able to use the principles, methods and techniques of the operating system to analyze and solve problems.

I. Overview of Operating System

(a) the concept, characteristics, functions and services provided by the operating system

(B) the development and classification of operating systems

(3) the operating environment of the operating system

Second, the process management

(a) processes and threads

1. Process concept

2. State and transformation of the process

3. Process control

4. Process organization

5. Process communication

* * * Enjoy the storage system; Message delivery system; Pipeline communication.

6. Thread concept and multithreading model

(2) Processor scheduling

Basic concept of 1. scheduling

2. Scheduling opportunities, handovers and processes

3. The basic rules of scheduling

4. Scheduling mode

5. Typical scheduling algorithm

First-come, first-served service scheduling algorithm; Priority scheduling algorithm for short jobs (short tasks, short processes, short trips); Time slice rotation scheduling algorithm; Priority scheduling algorithm; High response priority scheduling algorithm; Multi-level feedback queue scheduling algorithm.

(3) Process synchronization

Basic concepts of process synchronization.

2. The basic method of realizing critical area mutual exclusion.

Software implementation method; Hardware implementation method.

3. semaphore

4. Pipe pass

5. Classical synchronization problem

Producer-consumer problem; Reader-author problem; The dining problem of philosophers.

deadlock

The concept of 1. deadlock

2. Deadlock handling strategy

3. Deadlock prevention

4. Avoid deadlock

System security state: banker algorithm.

5. Deadlock detection and release

Third, memory management.

(a) Memory Management Foundation

1. Memory management concept

Program loading and linking; Logical address and physical address space; Memory protection.

2. Exchange and coverage

3. Continuous allocation management mode

Single continuous distribution; Partition allocation.

4. Discontinuous distribution management mode

Paging management mode; Segmented management mode; Segment page management mode.

(2) Virtual memory management

1. Basic concept of virtual memory

2. Request paging management mode

3. Page replacement algorithm

Optimal replacement algorithm (OPT); First-in first-out arrangement algorithm (FIFO); Least recently used permutation algorithm (LRU); Clock permutation algorithm (clock).

4. Page allocation strategy

Step 5 vibrate

Jitter phenomenon; Working set.

6. Request segment management mode

7. Request page management mode

Fourth, document management.

(A) the file system foundation

1. file concept

2. File structure

Sequential file; Index file; Index sequential file.

3. Directory structure

File control block and index node; Primary directory structure and secondary directory structure; Tree directory structure; Graphic directory structure.

4. Enjoy the document * * *

* * * Enjoy motivation; * * * mode of enjoyment; * * * Enjoy the semantics.

5. File protection

Access type; Access control.

(2) file system implementation

1. file system hierarchy

2. Directory implementation

3. File implementation

(3) disk organization and management

1. disk structure

2. Disk scheduling algorithm

3. Disk management

Verb (abbreviation for verb) input/output management

(a) Overview of input/output management

1. input and output devices

2.I/O management objectives

3. Input and output management function

4. Input/output application interface

5. Input and output control mode

(b) Input/output core subsystem

1. Input-output scheduling concept

2. Caches and buffers

3. Equipment distribution and recycling

Step 4 Spool (Spool)

5. Error handling

computer network

Examination objectives

1. Master the basic concepts, principles and methods of computer networks.

2. Master the architecture of computer network and typical network protocols, understand the composition and characteristics of typical network equipment, and understand the working principle of typical network equipment.

3. Be able to use the basic concepts, principles and methods of computer networks to analyze, design and apply network systems.

First, the computer network architecture

(a) Overview of computer networks

1. The concept, composition and function of computer network

2. Classification of computer networks

3. The development history of computer network and Internet

4. Standardization of computer networks and related organizations

(B) Computer network architecture and reference model

1. Hierarchical structure of computer network

2. The concepts of computer network protocols, interfaces and services.

3.ISO/OSI reference model and TCP/IP model.

Second, the physical layer

(1) communication foundation

1. Basic concepts such as channel, signal, broadband, symbol, baud, rate, etc.

2. Nyquist theorem and Shannon theory

3. Source and destination

4. Coding and modulation

5. Circuit switching, message switching and packet switching.

6. Datagram and Virtual Circuit

(2) the media

1. Twisted pair, coaxial cable, optical fiber and wireless transmission media.

2. Characteristics of Physical Layer Interface

(3) Physical layer equipment

1. Repeater

2. Center

Third, the data link layer

(A) the function of the data link layer

(2) Framework

(3) Error control

1. Error detection code

2. Error correction coding

(D) Flow control and reliable transmission mechanism

1. Flow control, reliable transmission and pulley window mechanism.

2. Single frame sliding window and stop-and-wait protocol

3. Multi-frame sliding window and backward N-frame protocol (GBN)

4. Multi-frame sliding window and selective retransmission protocol

(5) Media access control

1. Channel division media access control

Concepts and basic principles of frequency division multiplexing, time division multiplexing, wavelength division multiplexing and code division multiplexing.

2. Instant access media access control

Aloha agreement; CSMA protocol; CSMA/ CD Protocol; CSMA/CA protocol.

3. Polling Access Media Access Control: Token Passing Protocol

(6) local area network

Basic concepts and architecture of 1. LAN

2. Ethernet and IEEE 802.3

3.IEEE？ 802. 1 1

4. The basic principle of token ring network

(7) ten thousand

Basic concepts of 1. WAN

2.PPP protocol

3.HDLC protocol

4. Basic principle of 4.ATM network

(8) Data Link Layer Equipment

1. Bridge

The concept of bridge; Transparent bridge and spanning tree; Source routing bridge and source routing algorithm.

2. lan switches and its working principle.

Fourth, the network layer

(A) the function of the network layer

1. Heterogeneous network interconnection

2. Routing and forwarding

3. Congestion control

(2) Routing algorithm

1. Static and dynamic routing

2. Distance vector routing algorithm

3. Link state routing algorithm

4. Hierarchical routing

(3) IPv4

1.IPv4 packet

2.IPv4 address and NAT

3. Subdivision and subnet mask, CIDR

4.ARP protocol, DHCP protocol and ICMP protocol.

(4) IPv6

The main features of 1. IPv6

2.IPv6 address

(5) Routing protocol

1. Independent system

2. Intra-domain routing and inter-domain routing

3.RIP routing protocol

4.OSPF routing protocol

5.BGP routing protocol

(6) IP multicast

The concept of 1. multicast

2.IP multicast address

3. Multicast routing algorithm

(7) Mobile IP

1. The concept of mobile IP

2. Communication process of mobile IP

(8) Network layer equipment

Composition and function of 1. router

2. Routing table and route forwarding

Verb (abbreviation for verb) transport layer

(1) Services provided by the transport layer

65438+

2. Transport layer addressing and ports

3. Connectionless services and connection-oriented services

(2) UDP protocol

1.UDP datagram

2.UDP authentication

(3) 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) the network application mode

1. client/server model

2.P2P model

(2) Domain name system

1. Hierarchical domain name space

2. Domain name server

3. Domain name resolution process

(3) FTP

The working principle of 1 file transfer protocol

2. Control connection and data connection

(4) Email

1. Composition of e-mail system

2. Email format and MIME

3.SMTP protocol and POP3 protocol

(5) WWW

The concept and structure of 1 World Wide Web

2.HTTP protocol

Extended data:

Unified examination of public * * courses for postgraduate entrance examination.

edit

Starting from 20 10, the national postgraduate entrance examination English papers are divided into English (1) and English (2).

English (1) is the original unified examination English. English (II) is a selective unified examination subject mainly for universities and research institutes to recruit professional master students.

According to the different requirements of engineering, economics and management disciplines and majors for graduate students' mathematical knowledge and ability, there are three kinds of mathematics papers for graduate entrance examination, among which mathematics ⅰ and ⅱ are engineering and mathematics ⅲ is economics and management. The types of test papers that must be used for enrollment majors are as follows:

First, you must use math I as your enrollment major.

1. Mechanics, mechanical engineering, optical engineering, instrument science and technology, metallurgical engineering, power engineering and engineering thermophysics, electrical engineering, electronic science and technology, information and communication engineering, control science and engineering, computer science and technology, civil engineering, surveying and mapping science and technology, transportation engineering, ship and ocean engineering, aerospace science and technology, ordnance science and technology, nuclear science and technology.

2. A first-class discipline in management science and engineering, with an engineering degree.

Second, you must use the enrollment major of Mathematics II.

String science and engineering, light industry technology and engineering, agricultural engineering, forestry engineering, instrument science and engineering, etc., are all two disciplines and majors.

Three, you must choose a math or math two enrollment major (decided by the admissions unit).

Among the engineering disciplines, the two disciplines with higher requirements for mathematics choose mathematics as their major and mathematics as their minor.

Fourth, we must use the enrollment major of Mathematics III.

1. The first-level discipline of economics.

2. Management of business administration, agriculture and forestry economic management level discipline.

3. First-class discipline of management science and engineering, with a degree in management.

References:

Baidu encyclopedia-postgraduate entrance examination