Analysis of computer postgraduate subjects and pre-examination-Outline Analysis

The basic examination for computer science covers basic courses for subjects such as data institutions, computer composition principles, operating systems, and computer networks. Candidates are required to systematically master the concepts, basic principles, and methods of the above-mentioned basic courses, and be able to analyze, judge, and solve relevant theoretical and practical problems using the basic principles and methods they have learned.

II Examination Form and Examination Paper Structure

I. full score and examination time

The full score of this exam is 150 and the exam time is 180 minutes.

Ii. Answer Methods

Closed exams and written exams

Iii. Exam Content Structure

Data Structure: 45 minutes

Computer composition principle 45 minutes

Operating System: 35 points

Computer Network: 25 points

Iv. exam question Type Structure

Single-choice question 80 points (40 sub-questions, 2 points per sub-question)

Comprehensive Application Questions 70 points

III Scope of examination

Data Structure

「 Test objectives 」

1. Understand the basic concepts of data structures, master the logical structure, storage structure and differences of data, and implement various basic operations.

2. The algorithm can be designed and analyzed based on the basic data processing principles and methods.

3. select an appropriate data structure and method for problem solving.

I. Linear table

(1) linear table definition and basic operations

(2) Implementation of linear tables

1. Sequential Storage Structure

2. chained Storage Structure

3. Linear table Application

Ii. Stack, queue, and array

(1) Basic concepts of stack and queue

(2) sequential storage structure of stacks and queues

(3) chained storage structure of stacks and queues

(4) stack and queue applications

(5) compression and storage of Special Matrices

3. Tree and binary tree

(1) concepts of trees

(2) binary tree

1. Binary Tree definition and main features

2. Ordered Storage Structure and chain storage structure of Binary Trees

3. binary tree traversal

4. Basic concepts and structures of a clue Binary Tree

5. Binary sorting tree

6. balanced binary tree

(3) trees and forests

1. Storage Structure of books

2. transition between forests and Binary Trees

3. Tree and forest Traversal

(4) Application of trees

1. equivalence problems

2. Huffman tree and

Iii. Diagram

(1) concepts of Graphs

(2) graph storage and basic operations

1. Method of the adjacent matrix

2. Join Table Method

(3) graph Traversal

1. Deep Priority Search

2. extended search

(4) Basic Application and Complexity Analysis of Graphs

1. Minimum (cost) spanning tree

2. Shortest Path

3. topological sorting

4. Key Path

4. Search

(1) Basic Search concepts

(2) sequential search

(3) Half-Lookup

(4) B-tree

(5) hash table and its search

(6) Analysis and Application of search algorithms

5. Internal sorting

(1) Basic concepts of sorting

(2) Insert sorting

1. Insert sorting directly

2. Semi-insert sorting

(3) Bubble Sorting (bubble sort)

(4) Simple selection and sorting

(5) Shell sort)

(6) quick sorting

(7) Heap sorting

(8) Merge sort)

(9) Base sorting

(10) Comparison of various internal sorting algorithms

(11) Application of Internal sorting algorithms

Computer composition principle

「 Test objectives 」

1. Understand the internal working principle, structure, and connection mode of each component in a single processor computer system, and have a complete concept of a computer system.

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

3. The basic principles and methods of computer components can be used to calculate and analyze theoretical and practical problems in computer hardware systems, and some basic components can be simply designed.

I. Overview of computer systems

(1) computer development history

(2) Computer System Hierarchy

1. Basic Components of computer hardware

2. Classification of Computer Software

3. Computer Work Process

(3) computer performance indicators

Throughput, response time; CPU clock cycle, clock speed, CPI, CPU execution time; MIPS, mflops.

Ii. Data Representation and Operation

(1) Number System and coding

1. Carry counting system and its mutual conversion

2. True Value and number of machines

3. BCD code

4. Character and string

5. Verification Code

(2) expression and operation of Fixed Points

1. Number of points

The expression of the unsigned number; the expression of the signed number.

2. Count Calculation

Number-point displacement calculation; original code number-point addition/subtraction calculation; Complement code number-point addition/subtraction calculation; number-point multiplication/Division calculation; overflow concept and discriminant method.

(3) floating point expression and Operation

1. floating point representation

Floating point representation range; ieee754 Standard

2. Addition/subtraction of Floating Point Numbers

(4) arithmetic logical unit ALU

1. Serial and Parallel Processors

2. Functions and Mechanisms of the arithmetic logical unit ALU

Iii. Storage hierarchy

(1) Storage Classification

(2) Hierarchical Structure of memory

(3) random semiconductor access memory

1. Working Principle of SRAM memory

2. Working Principle of DRAM Memory

(4) read-only memory

(5) connection between primary memory and CPU

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

(7) Cache)

1. Local program access

2. basic working principle of Cache

3. ing between cache and primary storage

4. cache master memory block replacement algorithm

5. cache write policy

(8) Virtual Memory

1. Basic concepts of virtual memory

2. webpage-based Virtual Memory

3. segment-type virtual memory

4. segment-page virtual memory

5. TLB (fast table)

Iv. Command System

(1) Instruction format

1. Basic Instruction format

2. fixed-length operation code Command Format

3. Extended operation code Instruction format

(2) addressing of commands

1. Concept of valid addresses

2. Data addressing and command addressing

3. Common addressing methods

(3) Basic concepts of CISC and RISC

5. central processor (CPU)

(1) functions and basic structure of CPU

(2) instruction execution process

(3) functions and basic structure of data paths

(4) functions and working principles of the Controller

1. hard wiring Controller

2. microprogram Controller

Micro-programs, micro-commands and micro-commands; micro-instruction encoding; micro-address format.

(5) Command Line

1. Basic concepts of the command line

2. Basic concepts of excessive capacity and dynamic Pipeline

Vi. Bus

(1) Overview of Bus

1. Basic concepts of Bus

2. Bus Classification

3. Bus composition and performance indicators

(2) bus arbitration

1. Centralized Arbitration

2. distributed arbitration Method

(3) bus operations and timing

1. synchronous timing Mode

2. asynchronous timing

(4) Bus Standards

VII. Input/output (I/O) System

(1) Basic concepts of I/O Systems

(2) external devices

1. Input Device: keyboard and mouse

2. output devices: displays and printers

3. External Storage: hard disk storage, disk array, and Disc Storage

(3) I/O interface (I/O controller)

1. Functions and basic structure of I/O interfaces

2. I/O port and Its addressing

(4) I/O mode

1. Program Query Method

2. Program interruption

Basic concepts of Interrupt; interrupt response; interrupt handling; multiple interruptions and interrupt shielding.

3. DMA mode

The composition of the DMA controller; the DMA transfer process.

4. Channel Mode

Operating System

「 Test objectives 」

1. Understand the role, position, Development and Characteristics of the operating system in the computer system.

2. Understand the basic concepts and principles of the operating system and master the operating system design methods and implementation technologies.

3. Be able to analyze and solve problems using the operating system principles, methods and technologies learned.

I. Operating System Overview

(1) concepts, features, functions, and services provided by the operating system

(2) Development and classification of Operating Systems

(3) Operating System Environment

2. Process Management

(1) processes and threads

1. Process Concept

2. Process status and transition

3. Process Control

4. Process Organization

5. Process Communication

Shared storage system, message passing system, and pipeline communication.

6. Thread concept and multithreading Model

(2) Processor Scheduling

1. Basic concepts of scheduling

2. Scheduling time, switching and Process

3. basic scheduling principles

4. scheduling mode

5. Typical Scheduling Algorithms

Service scheduling algorithm first; Priority Scheduling Algorithm for short jobs (short jobs, short processes, and short threads); time slice rotation scheduling algorithm; Priority Scheduling Algorithm for high response ratio; multi-level feedback queue scheduling algorithm.

(3) Process Synchronization

1. Basic concepts of Process Synchronization

2. Basic methods to achieve mutex in the critical section

Software Implementation Method and hardware implementation method.

3. semaphores

4. Management

5. Typical synchronization problems

Producer-consumer issues, reader-writer issues, and philosophers eat questions.

(4) deadlock

1. Concept of deadlock

2. deadlock Handling Policy

3. Deadlock Prevention

4. Deadlock Avoidance

System Security Status: bankers algorithm.

5. Deadlock Detection and Removal

Iii. Memory Management

(1) memory management basics

1. Memory Management Concept

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

2. Exchange and coverage

3. Continuous Allocation Management

Single continuous allocation; partition allocation.

4. Non-continuous allocation management

Paging management; segmented Page Management.

(2) Virtual Memory Management

1. Basic concepts of virtual memory

2. Manage request pages

3. Page Replacement Algorithm

The best replacement algorithm (OPT), first-in-first-out (FIFO), least recently used replacement algorithm (LRU), and clock replacement algorithm (clock ).

4. Page Allocation Policy

5. Jitter

Jitter phenomenon; working set.

6. Manage request segments

7. webpage management for request segments

Iv. File Management

(1) File System Basics

1. File Concept

2. File structure

Ordered files, index files, and index ordered files.

3. directory structure

File control blocks and index nodes; single-level directory structure and two-level directory structure; tree directory structure; Graphical directory structure.

4. File Sharing

Sharing motivation; sharing method; Sharing 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

V. Input/output (I/O) Management

(1) I/O management overview

1. I/O device

2. I/O management objectives

3. I/O Management

4. I/O application interface

5. I/O Control Mode

(2) I/O core Subsystem

1. I/O scheduling Concept

2. High-speed cache and buffer zone

3. device allocation and recovery

4. spooling)

5. Error Handling

Computer Network

「 Test objectives 」

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

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

3. ability to analyze, design, and apply network systems using basic concepts, principles, and methods of computer networks

I. Computer Network Architecture

(1) Overview of computer networks

1. Concepts, components, and functions of computer networks

2. Classification of computer networks

3. Development History of computer networks and the Internet

4. Standardization of computer networks and related organizations

(2) computer network architecture and Reference Model

1. Computer Network Hierarchy

2. Concepts of computer network protocols, interfaces, and services

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

Ii. Physical Layer

(1) communication Basics

1. Basic concepts such as channel, signal, broadband, code element, Porter, and rate

2. nequest theorem and Shannon theorem

3. Source and Sink

4. coding and Modulation

5. Circuit Switching, packet switching, and group Switching

6. datagram and virtual circuit

(2) transmission media

1. Twisted Pair wires, coaxial cables, optical fiber and wireless transmission media

2. Features of physical layer Interfaces

(3) Physical Layer Devices

1. Repeater

2. Hub

Iii. Data Link Layer

(1) Functions of the data link layer

(2) group Frames

(3) Error Control

1. Error Code

2. Error Correction Code

(4) Traffic Control and reliable transmission mechanism

1. Traffic Control, reliable transmission, and pulley Window Mechanism

2. Single Frame Sliding Window and stop-wait protocol

3. Multi-frame Sliding Window and back n-frame protocol (GBN)

4. Multi-frame Sliding Window and selection retransmission protocol (SR)

(5) Media Access Control

1. Channel division Media Access Control

Concepts and basic principles of multiplexing, multiplexing, division multiplexing, and code multiplexing.

2. Access Media Access Control immediately

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

3. Round-Robin Access Media Access Control: token Transfer Protocol

(6) LAN

1. Basic Concepts and architecture of LAN

2. Ethernet and IEEE 802.3

3. IEEE 802.11

4. Basic principles of the Ring Network

(7) Wan

1. Basic concepts of Wan

2. PPP protocol

3. HDLC Protocol

4. Basic principles of ATM Networks

(8) data link layer Equipment

1. Bridge

Concept of bridge; transparent bridge and Spanning Tree Calculation; source selection path bridge and source selection path algorithm.

2. LAN switches and their working principles.

Iv. Network Layer

(1) Functions of the network layer

1. heterogeneous network interconnection

2. Routing and forwarding

3. Congestion Control

(2) Routing Algorithm

1. Static Routing and Dynamic Routing

2. Distance-Vector Routing Algorithm

3. Link Status Routing Algorithm

4. hierarchical routing

(3) IPv4

1. IPv4 Group

2. IPv4 address and Nat

3. subnet division and subnet mask, CIDR

4. ARP, DHCP, and ICMP protocols

(4) IPv6

1. Main Features of IPv6

2. IPv6 address

(5) Routing Protocol

1. Autonomous System

2. Intra-Domain Routing and Inter-Domain Routing

3. Rip Routing Protocol

4. OSPF Routing Protocol

5. BGP routing protocol

(6) IP Multicast

1. Concept of Multicast

2. IP multicast address

3. multicast routing algorithm

(7) Mobile IP

1. Mobile IP Concept

2. Mobile IP communication process

(8) network layer devices

1. Router Composition and functions

2. Route table and route forwarding

V. Transport Layer

(1) Services provided by the Transport Layer

1. Functions of the transport layer

2. Transport Layer addressing and Port

3. No Connection Service and connection-oriented service

(2) UDP protocol

1. UDP datagram

2. UDP Verification

(3) TCP protocol

1. TCP segment

2. TCP connection management

3. Reliable TCP transmission

4. TCP traffic control and congestion control

Vi. Application Layer

(4) Network Application Model

1. Customer/server model

2. P2P model

(5) DNS System

1. Hierarchical Domain Name Space

2. Domain Name Server

3. domain name resolution process

(6) FTP

1. How FTP works

2. Control connections and data connections

(7) email

1. Structure of the email system

2. Email format and mime

3. SMTP and POP3 protocols

(8) www

1. concept and composition of WWW