/
Department Name: Computer College
Professional Name: Computer Science and Technology
The number of students to be enrolled in this major: 220.
Research direction name: computer system structure, computer application technology, computer software and theory.
Professional remarks: the basic study period is 2.5 years.
Examination subject unit examination subject code examination subject name
The first exam subject is 10 1 politics.
Second Examination Subject 20 1 English
The third exam subjects 30 1 math I
The fourth examination subject, 96 1 computer specialty synthesis
Among them, mathematics, English and politics are the same all over the country, which is a unified examination! Go to the postgraduate bookstore and ask!
Professional course reference book: 96 1 computer professional synthesis
Data structure course (second edition, third edition)
Beihang press
Author: Tang
principles of computer composition
Higher education press
Edited by Tang Shuofei
Operating system practice course
Tsinghua university press
Editor-in-Chief Ren Aihua
Discrete mathematics (part of mathematical logic)
Higher education press
Yin et al.
Outline: 96 1 Comprehensive Examination Outline for Computer Major (2008 Edition)
First, the examination composition
96 1 Computer Specialty Comprehensive * * includes four courses: computer composition principle, data structure, operating system and mathematical logic, accounting for 40 points, 40 points, 40 points and 30 points respectively.
Second, the computer composition principle part of the examination outline
(1) reference books
Principles of Computer Organization, Higher Education Press, edited by Tang Shuofei.
(2) Review the content
1. storage system
(1) main memory: memory cell circuit and its working principle, memory chip structure and its working principle, refresh principle and refresh mode of DRAM, and expansion method of memory.
(2) Cache: the basic structure and working principle of Cache, the address mapping mode of cache, and the replacement strategy of cache.
(3) Auxiliary storage: the structure, access characteristics and performance parameter calculation of disk storage.
2. Instruction system
(1) instruction format: the general format of machine instructions and the functions and characteristics of each field in the instruction word.
(2) Addressing mode: effective address calculation method, addressing range, functions and characteristics of common addressing modes.
(3) Instruction system design: related factors and basic methods of instruction format design, and expanded operation code technology.
3. Central processing unit
(1) Function and structure of CPU: basic function, internal structure, data path and control signal of CPU.
(2) Functions of the control unit: instruction cycle, multi-level sequential system, control mode and micro-operation flow analysis of instruction execution process.
(3) The design of control unit: the structure and working principle of microprogram controller, the format and coding mode of microinstruction, and microprogram design.
4. Input and output technology
(1) Bus: bus classification, bus arbitration control mode and bus communication control mode.
(2)I/O control mode: the working principle of interrupt response and interrupt handling and DMA mode.
Third, the operating system part of the exam outline
(1) Specify reference books
Practical Course of Operating System (2nd Edition), Ren Aihua, Tsinghua University Publishing House.
(2) Review the content
1. procedure
Process, process synchronization and communication, process scheduling, deadlock and other basic concepts and related algorithms. It is required to clearly understand the basic concepts such as process and thread, and master various basic algorithms skillfully.
2. Storage management
Memory management, including relocation and virtual memory, partition, paging, segmentation and page-by-page storage management and other basic concepts. It is required to clearly understand the basic concepts and master various allocation algorithms.
3. Equipment management
I/O device management, scheduling, distribution mechanism, RAID, etc. It is required to master the basic concepts of I/O management.
4. File system
File system, including file organization, directory structure, access control and so on. You need to clearly understand the basic concepts of the file system.
Fourth, the examination outline of the data structure part
(1) Specify reference books
Data Structure Course (Second Edition), edited by Tang, Beijing University of Aeronautics and Astronautics Press (recommended third print).
(2) Review the content
1. Linear table
(1) linear relation, definition of linear table and basic operation of linear table;
(2) The construction principle of sequential storage structure and chain storage structure (single linked list, circular linked list and bidirectional linked list) of linear tables;
(3) Based on the above two storage structures, an algorithm corresponding to the basic operation of linear table is designed.
2. Stacks and queues
(1) Basic concepts and operations of stacks and queues;
(2) The construction principle of sequential storage structure and chain storage structure of stack and queue;
(3) Based on the above two storage structures, the algorithm design of basic operations such as inserting, deleting stack and queue is realized.
3. Binary tree
Basic concepts and terms of (1) binary tree;
(2) Complete binary tree and complete binary tree, the basic properties of binary tree;
(3) The basic construction principle of binary tree sequential storage structure and binary linked list storage structure, the design of preorder traversal, middle traversal and postorder traversal of binary tree and the corresponding algorithm (non-recursive algorithm);
(4) The basic concept of binary sort tree, the establishment (insertion) and search of binary sort tree.
4. Numbers
Definition and basic terms of (1) graph;
(2) The basic construction principles of adjacency matrix storage method and adjacency table storage method of graphs;
(3) Depth-first traversal and width-first traversal of graphs;
(4) Basic concepts and construction process of minimum spanning tree and shortest path.
5. Files and searches
(1) Construction of "decision tree" corresponding to sequential search method, semi-search method and semi-search method;
(2) The basic concept of B-tree, the insertion and search of B-tree;
(3) The construction of hash table, hash function, hash conflict and the method of dealing with hash conflict.
6. Internal sorting
(1) insertion sorting method (including folding and semi-insertion sorting method), selection sorting method, bubbling sorting method, quick sorting method and (big top) stacking sorting method;
(2) The basic principles and characteristics of various internal sorting methods.
Five, mathematical logic part of the examination outline.
(1) reference books
Discrete Mathematics (the first part of mathematical logic), edited by Yin et al., Higher Education Press.
(2) Review the content
1. Propositional logic
Basic concepts and methods of propositional logic: connectives, assignment, equivalence calculus, duality theorem, complete connectives, paradigms and logical reasoning.
2. Predicate logic
Basic concepts and methods of predicate logic: predicates and quantifiers, terms and formulas, interpretation and assignment, eternal truth, equivalence calculus and logical reasoning.
3. Axiomatic system
Axiomatic system: Axiomatic system, reliability and completeness of propositional logic and predicate logic.
4. Principle of decomposition method
Principle of resolution: the resolution of toe-in paradigm, Schellen paradigm, propositional logic and predicate logic.
One more:
College Name: Software College
Professional Name: Software Engineering
The number of students to be enrolled in this major: 80.
Name of research direction: integrated circuit design Japanese application software development embedded software
Remarks: The basic study period is 2.5 years, and the training fee is * * * 40,000 yuan. This major only recruits "self-funded" and "entrusted training".
The first exam subject is 10 1 politics.
Second Examination Subject 20 1 English
Or 203 Japanese.
The third exam subjects 30 1 math I
Data structure and C language programming fourth exam question 99 1
Professional course reference book: 99 1 data structure and c language programming
Data structure course, second edition
Beihang University Press
Author: Tang
C program design
Tsinghua university press
Author: Tan Haoqiang
Outline: 99 1 Data Structure and C Language Programming Examination Outline (2008 Edition)
First, the examination composition
Data structure and C language programming include data structure and C language programming, each accounting for 75 points, with a total score of 150.
Second, the examination outline of the data structure part
(1) Specify reference books
Data Structure Course (2nd Edition) edited by Tang, Beijing University of Aeronautics and Astronautics Press.
(It is recommended to choose the book printed for the third time in June 2006)
(2) Review content and basic requirements
1, overview
(1) Basic concepts of logical structure and storage structure of data;
(2) The definition, basic properties and basic concepts of algorithm analysis, including "big"? Form represents the complexity of time or space.
2. Linear table
(1) linear relation, definition of linear table and basic operation of linear table;
(2) The construction principle of sequential storage structure and chain storage structure of linear table (including single linked list, circular linked list and bidirectional linked list);
(3) Basic operations on linear tables based on the above two storage structures, including algorithm design (including recursive algorithm design) corresponding to operations such as insertion and deletion of sequential tables, establishment of linked lists, insertion and deletion, and retrieval.
3. Stacks and queues
(1) Basic concepts and operations of stacks and queues (including circular queues);
(2) The construction principle of sequential storage structure and chain storage structure of stack and queue;
(3) Basic operations such as inserting and deleting stacks and queues are performed on the basis of different storage structures.
4. Trees and binary trees
Basic concepts, characteristics and terms of (1) tree and binary tree;
(2) The concepts of complete binary tree and complete binary tree, and the basic properties of binary tree;
(3) The construction principle of sequential storage structure of binary tree and binary linked list storage structure, the algorithms of preorder traversal, intermediate traversal, postorder traversal and hierarchical traversal of binary tree (with emphasis on non-recursive algorithm) and other operations related to traversing binary tree;
(4) Basic concepts and construction principles of clue binary tree;
(5) Basic concept, establishment (insertion) and search of binary sort tree, and search for the average search length ASL of nodes in binary sort tree.
5. Numbers
Basic concepts and terms of (1) graphs;
(2) The basic construction principles and characteristics of adjacency matrix storage method and adjacency table storage method;
(3) The process of depth-first search and width-first search of graphs, and the basic function of graph traversal;
(4) The characteristics, solving process, topological ordering and uses of the minimum spanning tree and the shortest path.
6. Filing and searching
(1) sequential search method, semi-search method and the construction of "decision tree" corresponding to the search process;
(2) The basic concept of index file;
(3) The structure of B-tree and B+ tree, their similarities and differences, the insertion and search of B-tree;
(4) The characteristics of hash file, the concepts of hash function and hash conflict, the handling method of hash conflict and the search of hash file.
7. Internal sorting
Sorting principles, rules and characteristics of sorting methods such as insertion sorting, selection sorting, bubbling sorting, quick sorting, stacking sorting (big top stacking) and bidirectional merging sorting.
Third, the C language programming part of the examination outline
(1) Specify reference books
C Programming, edited by Tan Haoqiang, Tsinghua University Publishing House.
(2) Review content and basic requirements
1 and basic knowledge of c language
(1) The characteristics of C language and the composition of C language programs;
(2) Data types, including integers, real numbers, characters and other constants and variables and variable assignment; Define types with typedef;
(3) Mixed operation between various types of data;
(4) Operating rules and priorities of each operator; Conditional operator;
(5) Arithmetic expression, relational expression and logical expression, comma operator and comma expression, and the meaning of expression sizeof.
Step 2 make a statement
(1) assignment statements (including conditional assignment statements), conditional statements (including if, if-else, switch), loop statements (including while, do-while, for statements, including loop nesting and break statements);
(2) Input/output statements, including format input function scanf and format output function printf for integer, real number and character (including character string) data.
Step 3 arrange
(1) Definition of one-dimensional array and two-dimensional array, reference of array elements and initialization of array;
(2) Definition of character array, initialization of character array, reference of character array, input and output of character array, string and string processing function.
4. Function
(1) function definition, function parameters (formal parameters and arguments), and function return value;
(2) Function calls, including nested calls of functions and recursive calls of recursive functions;
(3) The concept of command line parameters (main function with parameters).
5. Macro definition
(1) Macro definition with parameters;
(2) Handling of included files.
6. Pointer
(1) The concepts of pointer, pointer to variable and pointer variable to variable, including definition, reference and pointer variable as function parameters;
(2) Pointer to the array, including the definition and assignment of pointer variables to the array, which refers to array elements and array names as function parameters;
(3) Pointer to the character string and pointer variable to the character string.
7. Structure
Basic concepts and characteristics of (1) structure, initialization and reference of structure;
(2) Structure array.
8. Documentation
(1) Basic concept of text file, type pointer file of text file, and usage mode of text file;
(2) Open the text file (fopen function) and close the text file (fclose function);
(3) The state of the text file, including feof function and ferror function;
(4) Read and write text files, including fputc function and fgetc function, fgets function and fputs function.
(5) The input function fscanf and the output function fprintf of the text file.
Duplex: Computer College of Beihang University
Rules and arrangements for postgraduate re-examination in 2008
The basic arrangements for the re-examination of postgraduate enrollment in Beihang Computer College are as follows:
1. Re-examination arrangement for students taking the unified examination (only applicable to students taking the unified examination)
1. Re-examination scores: The re-examination scores of Computer Science and Technology (08 1200) and Cartography and Geographic Information Engineering (08 1603) are: total score 350, politics and foreign languages 50, mathematics and majors 80. In addition, in 2008, the Computer College continued to recruit some software engineering masters (double certificates) from the unified examination students. Please refer to the provisions and arrangements for the second-round exam of the Master of Software Engineering in 2008 in the School of Computer Science, Beihang University for the results and second-round exam methods.
2. Re-examination method: Re-examination adopts the method of difference re-examination. The second interview is divided into two parts: C language computer test and comprehensive interview, each part is 150, and the total score of the second interview is 300. There is no written test. Only those who pass all parts (90 points or above) are eligible for admission.
C language computer test only tests candidates' C language programming ability, and it is conducted directly on the computer. The system environment is Microsoft Visual Studio 6.0, and standard C programming is recommended.
The comprehensive interview content includes oral English, listening, mathematics foundation and comprehensive professional quality. Comprehensive professional quality will involve computer basics and professional knowledge, candidates' development and research work in related fields, candidates' undergraduate professional background, various honors won, and various scientific and social activities they participated in. The second interview focuses on practical ability and potential that can be cultivated.
3. Qualification examination: All candidates who take part in the re-examination must prepare the re-examination qualification examination materials according to the requirements of Annex 1 of these Provisions, and submit them to the college for qualification examination when applying for the re-examination.
4. Re-examination registration: On March 23rd, at 8: 30am, the candidates who participated in the re-examination reported at G849, the new main building, submitted the re-examination qualification materials, conducted the re-examination qualification examination for the candidates (see Annex 1 for the re-examination qualification examination method), and received the tutor profile and tutor volunteer form.
5.C Computer Test: At 2:00 pm on March 23rd, the candidates who participated in the re-examination went to the Teaching Experimental Center of Computer College to take the C language computer test, and the test time was 2 hours.
6. Comprehensive interview of cartography and geographic information engineering: At 8:30 am on March 24th, students who applied for cartography and geographic information engineering participated in the tutor group interview. Announce the results of the second interview after the interview.
7. Computer Science and Technology Professional Comprehensive Interview Process
Candidates who take part in the re-examination of computer science and technology major should fill in two volunteer forms of tutors according to the introduction of tutors and the number of tutors who have signed up, and return the volunteer forms to G849 before noon 12:00 on March 24th (failure to hand them in without reason is regarded as automatic abandonment of the re-examination). The first batch of interview groups will be announced at 6:00 pm on March 24th.
The first batch of candidates interviewed (8:30 am on March 25th) are the first batch of candidates who volunteered to fill in the position of professor tutor, and the first batch of candidates who volunteered to fill in the position of associate professor tutor did not participate in the first batch of interviews. The number of interviews for each tutor generally does not exceed 150% of the enrollment. If the candidate ranked after 65,438+050% is the first volunteer to be transferred, the college will transfer the candidate to the interview group where less than 65,438+050% of the professors sign up for the interview. At about 5: 30 pm on March 25th, the list of the first batch of candidates and the list of the second batch of interview groups on the morning of March 26th were announced.
The second batch of interviews was held at 8:30 am on March 26th. Candidates who volunteer to be associate professors queue up for interviews according to their first choice, and those who volunteer to be professors but are not admitted. The number of interviews for each tutor generally does not exceed 150% of the enrollment. Candidates ranked after 150% will be adjusted according to the specific situation to ensure that everyone has at least one interview opportunity.
There is still no full tutor in the two rounds of interviews, and the college will adjust the admission from the remaining candidates according to the candidates' unified examination results and whether the candidates obey the distribution.
All the proposed admission lists will be announced around 5:30 pm on March 26th. The final admission is subject to the formal admission notice of the graduate school.
At about 5:30 pm on March 26th, all candidates to be admitted will go to the college office to receive the political examination form. The admission category is self-raised candidates and a self-raised agreement is signed. The admission category is entrusted training candidates who accept the directional entrusted training agreement.
8. Re-examination with the same academic level: Candidates with the same academic level who take the re-examination (adult undergraduate graduates with nationally recognized academic qualifications or those who have worked continuously for two years or more after obtaining a nationally recognized college diploma) are required to take C language programming and compilation principles courses respectively (C language programming is replaced by computer test scores), and the compilation principles scores are not less than 60 points before they are eligible for admission.
Two, push the exemption, single recruit and strong military plan students retest arrangements
Students who are exempt from the exam will not be re-examined.
Candidates who take the single test and the strong military plan take the equal re-test method and do not take the C language computer test.
At 2:30 pm on March 23, candidates who participated in the single-test and strong-military plan re-test reported to the conference room (such as Heart Building 407) and received the comprehensive interview record form and political review form.
On March 24th, the candidates of single-test and strong-military plan contacted the volunteer tutor and participated in the comprehensive interview of the tutor group with the consent of the tutor.
Computer College of Beihang University
March 2008 18
Computer College Postgraduate Admissions Consultation Tel:
0 10-823 17630
Attachment 1:
Computer College of Beihang University
Qualification examination and material submission method for postgraduate entrance examination in 2008
Candidates who take part in the second interview should submit the following materials for qualification examination before taking part in the second interview:
1. One original and one copy of the admission ticket for candidates to take the postgraduate entrance examination;
2. The original and photocopy of my valid ID card (ID card, active military officer's card, civilian cadre's card) 1 copy, and the current undergraduate graduates should also submit the original and photocopy of my student ID card 1 copy, and the original will be returned to the candidates on the spot after review;
3. Non-undergraduate graduates are required to submit: (1) the original and photocopy of the academic certificate; (2) A copy of the student status certificate provided by the personnel department of the unit to which the file belongs (the original should be stamped with the official seal of the graduation school), and the personnel department of the unit to which the file belongs should be stamped with the official seal.
4. This year's undergraduate graduates are required to submit a copy of the academic achievement form with the official seal provided by the Academic Affairs Office of their school.
5. Copy of CET-6 or CET-4 certificate.
Adult undergraduates with nationally recognized academic qualifications can participate in the re-examination according to the same academic qualifications, but they must meet the following conditions before they are eligible for admission:
Pass the additional test (additional test subject: C language programming and compilation principle);
Obtain the undergraduate diploma before the end of August 2008;
Published more than one paper (including) as the first author in core journals in computer-related fields;
Pass CET-4 before the end of August 2008.
After obtaining a college diploma recognized by the state and working continuously for more than two years (inclusive) until September 1 day, 2008, you can take the second interview according to the same academic level, but you must meet the following conditions at the same time before you are eligible for admission:
Pass the additional test (additional test subject: C language programming and compilation principle);
Full-time colleges and universities minor in and pass all the main courses of the professional undergraduate course (submit transcripts stamped with the official seal of the academic affairs office of the school);
Published more than one paper (including) as the first author in core journals in computer-related fields;
Pass CET-4 before the end of August 2008.
The following materials are not required for the re-examination qualification examination, but candidates are expected to provide:
Candidates' self-report;
A copy of the award-winning certificate obtained by the candidate at or above the school level (if any)
Where the submitted information is inconsistent with my actual situation, once found, I will immediately cancel the re-examination or the proposed admission qualification. Regardless of admission or not, the information submitted by candidates at the time of re-examination will not be returned.
All submitted materials are bound in A4 paper size on the left side in the following order (if the transcript exceeds A4, it will be folded into A4 size after binding):
1) cover (see Annex 2)
2) a copy of the admission ticket;
3) Copy of valid ID card. Fresh graduates copy their ID cards and student ID cards on the same A4 paper;
4) Candidates' self-report;
5) Copies of previous students' academic qualifications and scores, and new students' scores;
6) Copy of CET-6 or CET-4 certificate (if there is CET-6 certificate, don't provide CET-4 certificate)
7) Other certification materials that candidates with the same academic qualifications should submit;
8) A copy of the award certificate at or above the field level.
Computer College of Beihang University
March 2008 18
Attachment 2:
Computer College of Beihang University
Review materials of postgraduate enrollment re-examination in 2008
Admission ticket number:
Name of candidate:
Graduate school:
Major of study:
Initial test score (total score):
I solemnly declare:
All the materials submitted here are in line with the actual situation. If there is anything untrue, I am willing to bear the relevant responsibilities arising therefrom.
Signature:
Time: Year Month Day