2012年沈阳理工大学专升本考试大纲（In 2012, ShenYang Ligong University upgraded the examination syllabus）

2012年沈阳理工大学专升本考试大纲（In 2012, ShenYang Ligong University upgraded the examination syllabus） 2012年沈阳理工大学专升本考试大纲(In 2012, ShenYang Ligong University upgraded the examination syllabus) 2012 ShenYang Ligong University undergraduate syllabus -- "computer science and technology" The designated reference materials [] 1. "data structure (C language version)" Tsinghua University press, edited by Yan Yumin 2. "Introduction to database systems" of Higher Education Press, watermarking, edited by Wang Shan 3. "SQL Server 2000 application development guide", Tsinghua University press, edited by Ceng Hui Li Chunbao 4. "the course" computer network application technology Tsinghua University press, edited by Wu Gongyi 5. "computer network technology" ShenYang Ligong University Institute of Applied Technology of internal materials 6. C language (self) Fractional distribution: the theory exam 200 points, 150 minutes, the written test of basic skills; 100 minutes, 60 minutes, check. The theory of the exam is divided into three parts: Part 70 data structure, the database Part 70, part 60 computer network. The first part of the data structure A basic part 1 objective assessment Understand: the analysis of the data structure of the curriculum task, four kinds of logical structure, physical structure, four kinds of Algorithm five and algorithm of space-time characteristics Master: the analysis of Algorithm five characteristics and algorithm of space time 2 assessment requirements Remember: the data structure of the curriculum task, four kinds of logical structure, physical structure four Simple application: simple estimation of time complexity. Comprehensive application: Two, linear table 1 objective assessment Understand: the linear form of the type definition and the order of the linear form, and realize that the linear form of the chain and the realization of the concept. Master: the order of the linear form, and realize that the linear form of the chain and achieve. Master key: the order of the linear form, and realize that the linear form of the chain and achieve. 2 assessment requirements Remember: the order of the linear form, and realize that the linear form of the chain and achieve. Understand: the order of the linear form representation and implementation. Simple application: Application: the linear form of the chain and achieve. Three, stack and queue 1 objective assessment Understand: the definition and characteristics, stack, stack and queue, the representation and Realization of the application stack, queue chain and circular queue representation and Implementation Master: the stack representation and realization, the application stack, queue chain and circular queue representation and Implementation Master key: the application stack, queue chain and circular queue representation and implementation. 2 assessment requirements Remember: the definition and characteristics, stack, stack and queue, the representation and Realization of the application stack, queue chain and circular queue representation and implementation. Understand: the definition and characteristics of the stack and queue, stack, queue and realize that the chain and circular queue representation and implementation. Simple application: representation and implementation, chain queue and circular queue and stack said. Application: stack representation and implementation, representation and implementation of circular queue. Four, on 1 objective assessment Understand: definition, string type string and the fixed length sequence of storage, heap allocated storage representation. Master: on the representation and Realization of the fixed length sequence of storage, heap allocated storage representation. Master key: heap allocated storage representation. 2 assessment requirements Remember: definition, string type string and the fixed length sequence of storage, heap allocated storage representation. Understanding: on the representation and Realization of the fixed length sequence of storage, heap allocated storage representation. Simple application: on the representation and Realization of the fixed length sequence of storage, heap allocated storage representation. Comprehensive application: Five, and an array of generalized list 1 objective assessment Understand: array definition, array sequence representation and realization, matrix compression and storage, a special matrix, the definition of generalized list Master: array definition, array sequence representation and realization, matrix compression and storage, a special matrix, the definition of generalized list. Master key: compressed storage, special matrix. 2 assessment requirements Remember: array definition, array sequence representation and realization, matrix compression and storage, a special matrix, the definition of generalized list. Understanding: an array of sequential representation and realization, matrix compression and storage, special matrix. Simple application: compressed storage, special matrix. Six trees and two fork tree 1 objective assessment Understand: the tree and the two fork tree definition and basic terminology, two tree properties, two binary tree storage structure, binary tree traversal two clues and two tree trees and forests, and the two fork tree transformation, tree and forest traversal, Huffman tree Huffman encoding and its application Master: the two fork tree properties, two binary tree storage structure, binary tree traversal two clues and two tree trees and forests, and the two fork tree transformation, tree and forest traversal, Huffman tree Huffman encoding and its application. Master key: binary tree traversal two, tree and forest and two fork tree conversion, Huffman tree Huffman encoding and its application.. 2 assessment requirements Remember: the two fork tree properties, two binary tree storage structure, binary tree traversal two clues and two tree trees and forests, and the two fork tree transformation, tree and forest traversal, Huffman tree Huffman encoding and its application. Understand: binary tree traversal two clues and two tree trees and forests, and the two fork tree transformation, tree and forest traversal, Huffman tree Huffman encoding and its application. Simple application: binary tree traversal two, tree and forest and two fork tree transformation, tree and forest traversal, Huffman tree Huffman encoding and its application. Seven. 1 objective assessment Understand: storage structure definition and terminology, map: array representation, adjacency table, graph depth first search and breadth first search, minimum spanning tree, topological sorting, critical path Master: storage structure definition and terminology, map: array representation, adjacency table, graph depth first search and breadth first search, minimum spanning tree, topological sorting, critical path. Master key: map storage structure: array representation, adjacency table, graph depth first search and breadth first search, minimum spanning tree 2 assessment requirements Remember: storage structure definition and terminology, map: array representation, adjacency table, graph depth first search and breadth first search, minimum spanning tree, topological sorting, critical path. Understand: map storage structure: array representation, adjacency table, graph depth first search and breadth first search. Simple application: graph depth first search and breadth first search, minimum spanning tree, topological sorting. Eight, search 1 objective assessment Understanding: in order to find the table and ordered the table to find, two binary sort tree and the balanced binary tree two, Hashi table: construction method, Hashi function method to deal with conflict. Master: the order table lookup, order table lookup, two binary sort tree, Hashi: the construction method, Hashi function method to deal with conflict. Master key: in order to find the table and ordered the table to find, two binary sort tree, Hashi: the construction method, Hashi function method to deal with conflict. 2 assessment requirements Remember: in order to find the table and ordered the table to find, two binary sort tree, Hashi: the construction method, Hashi function method to deal with conflict. Understanding: in order to find the table and ordered the table to find, two binary sort tree, Hashi: the construction method, Hashi function method to deal with conflict. Simple application: in order to find the table and ordered the table to find, two binary sort tree, Hashi: construction method and Hashi function of dealing with conflicts. Nine, internal sorting 1 objective assessment Understand: direct insertion sort, Hill sort, relatively quick sort, simple selection sort, heap sort, merge sort method, the various internal sorting. Master: direct insertion sort, Hill sort, relatively quick sort, simple selection sort, heap sort, merge sort method, the various internal sorting. Master key: direct insertion sort, quick sort, simple selection sort, heap sort. 2 assessment requirements Remember: direct insertion sort, Hill sort, relatively quick sort, simple selection sort, heap sort, merge sort method, the various internal sorting. Understand: direct insertion sort, Hill sort, simple selection sort, merge sort method, the various internal sorting. Simple application: direct insertion sort, quick sort, relatively simple selection sort, heap sort method, the various internal sorting. Exam paper: Capacity ratio: 10%, to understand the comprehensive applications of the 20% memory 40%, a simple application, 30%. Required degree ratio: 20%, master 40%, understand master key 40%. Difficulty ratio: 30%, more difficult, more difficult to moderate 50% 30%. The second part of the database part A database of basic knowledge 1, in order to check: Understand the content: the development of data management technology, database management system, the characteristics of the database system Master: the three layer structure of the database, the database system. The key to master: the data model definition 2, assessment requirements: Remember: the data, information, mode, mode, mode, entity, contact To understand the relationship between data and information, the three layer structure, two level mapping, data independence Simple application: database structure Application: to establish the conceptual model, to achieve the establishment of entity relationship model Two relational database and structured query language 1, in order to check: Understand the content: basic terminology of relational database Master: the relational database model, data integrity meaning The key to master: the structured query language operation 2, assessment requirements: Remember: relations, tuples, attributes, keys, foreign keys, primary attribute, non primary attribute, full code Understand: the relational data model, relational model, entity integrity, referential integrity Simple application: to determine the relationship between the referential integrity Comprehensive application: combining the data definition language to create multiple tables, and the relationship between tables, use data manipulation language to achieve a single basic table, table query and update operation. Three relational database design 1, in order to check: Understand the content: the meaning of the relationship between standardization Master: the paradigm of meaning, the basic steps of database design and the main work The key to master: the normalized method of relationship model 2, assessment requirements: Remember: the basic concept and classification of functional dependency first paradigm, second model, third model Understand: Several Problems of relational model, relational schema decomposition Simple application: standardized mode (a problem of relationship mode decomposition process, to grasp the third paradigm range) The comprehensive application of database design: simple Four SQL Server 2000 database management system 1, in order to check: Understand the content: the use of commonly used tools for SQL Server 2000 and provide the operating environment Master: the use of basic data types, methods of data integrity, the use of flow control statements in Transact-SQL The key to master: the creation and maintenance of database and database objects 2, assessment requirements: Remember: the data type and classification, constraints, rules, stored procedures, triggers, index Understand: the use of flow control statements, the only value constraint, key constraint, foreign key constraint, non empty constraint, check constraint Simple application: use of stored procedure and trigger. The comprehensive application of the creation and maintenance of the database, table, view and define constraints Five the proportion of test scores 1, the proportion of 20%: the ability of memorizing, understanding 30%, simple application 30%, the comprehensive application of 20% 2, the proportion of about 20%, degree: Master 35%, master key 45% 3, the proportion of difficulty: more easy 20%, medium difficulty 30%, 30% is more difficult, more difficult 20% The third part of computer network An overview of computer network 1. familiar with the definition and function of network 2. grasp the network classification and the topological structure Two, data communications infrastructure 1. understand the basic concepts of data communication, Including signal, channel, bandwidth, channel capacity, transmission rate, signal transmission rate, baseband transmission, band transmission and broadband transmission. 2. familiar with modulation technology, understand the role of modem. 3. to master a variety of transmission media and their characteristics. 4. master the classification of multiplexing and their characteristics. 5. to master three kinds of data exchange technology. 6. familiar with parity. Three, network architecture 1. grasp the basic concepts of architecture and network protocol elements. 2. understand the OSI reference model and the functions of each layer. 3. master TCP/IP hierarchical structure and function of each layer and the main protocol. Four, the network and the Internet 1. familiar with several major traditional networks, including 10BASE-T 100BASE-T, can draw the topology of P2P network. The basic function of 2. master card MAC address and function. 3. familiar with CSMA/CD medium access control method. 4. understand the working process of the bridge. 5. master IP address definition, representation and classification. 6. master subnet and subnet to subnet. 7. familiar with the function of router. Five, network application 1. familiar with the information organization and the working mode of WWW. 2. to master the composition of the domain name and domain name. 3. master the email address used by the agreement and said. Six, network security and management 1. familiar with network management objectives. 2. familiar with network management model. Familiar with the 3. main functions of network management. 4. understanding of network information security. 5. understand the information technology security standard, 7 security level information security standards in the United States Department of defense. 6. to master the definition and characteristics of computer virus Definition 7. familiar with firewall Seven, the network operating system 1. familiar with the basic functions of the operating system in LAN 2. familiar with LAN operating system composed of non equivalence Explain: Capacity ratio: 30%, 30%, and understand the application of memory 30%. Required degree ratio: 30%, 30%, familiar with the understanding of master 40%. Difficulty ratio: 30%, moderate difficulty is 30%, difficult 20%, difficulty 20% Professional skills test syllabus Test subjects: C language program design Test time: 60 minutes Exam score: 100 points Examination: Examination I, the basic requirements 1, familiar with the Visual C++ 6 integrated development environment. 2, master the method of structured programming, with good programming style. 3, master program design simple data structure and algorithm and can read simple procedures. In 4, Visual C++ 6 integrated development environment, able to write simple C program, and the ability of basic debugging and error correction. II, exam content A basic part (a) assessment purposes Understand the basic structure of the C program; the memory storage form of various types of data. Master: the definition of constants and variables and methods of use; variable initialization; arithmetic operators and expressions; The relationship between operators and logical operators and expressions; expression; assignment expression and compound assignment expression; expression; the format of the input and output functions. Master key: arithmetic and relational operators and expressions; expression; logical operators and expressions; assignment expression and compound assignment expression; the format of the input and output functions. (two) assessment requirements Remember: the definition and use of variable and constant. Understand: variable initialization; arithmetic operators and expressions; relational operators and logical operators and expressions; expression; assignment expression and compound assignment expression; expression; the format of the input and output functions. Simple application: all kinds of expressions to correctly calculate the value of the. Comprehensive application: Two, the general program design (a) assessment purposes Understand the concept of sequence structure, branch structure and circulation structure. Master: sequence structure statement; branch structure (if) statement (statement); if (statement 1 2 else statements; (switch) statement); circular statements (while statement; DO-WHILE statement; for statement). Master key: branch structure statement; loop structure statement. (two) assessment requirements Remember: sequence structure statement. Understand: branch structure statement; loop structure statement. Simple application: the use of sequential structure statements complete simple sequence structure program design. Application: the use of branch statements and loop structure statement completion complex programming. Three, the use of an array (a) assessment purposes Understand the concept of two-dimensional array and array. Master: the definition and initialization of the use of an array. The key to master: the use of an array. (two) assessment requirements Remember: the concept of one-dimensional array and two-dimensional array. Understand: definition and initializing an array of arrays using. Simple application: using the cyclic output array element value. Application: sort (sort, simple selection sort, bubble sort); from the array (pick number to determine the number of primes and satisfy a certain condition the output format of the 2D array). Four, function (a) assessment purposes Understand: the definition of function parameter and argument of the concept. Master: the function calls the return value of the function. Transfer mode and reference value. Master key: function calls. (two) assessment requirements Remember: the definition of the function parameter and argument of the concept. Understand: the function calls the return value of the function. Transfer mode and reference value. Simple application: write a function and call a function. The comprehensive application of recursive function. Five, pointer (a) assessment purposes Understand the concept of pointers. Master: a pointer to a pointer variable; array and pointer (pointing to a one-dimensional array pointer to the character array pointer); two-dimensional array; function pointers and return a pointer; pointer as a function parameter and reference. Master key: pointer array and pointer (pointing to a one-dimensional array pointer to an array of characters). (two) assessment requirements Remember: the concept of pointer. Understand: a pointer to the pointer variable; array and pointer (pointing to a one-dimensional array pointer to the character array pointer); two-dimensional array; function pointers and return a pointer; pointer as a function parameter and reference. Simple application: using pointer access method of one-dimensional array. Comprehensive application: Six, preprocessor (a) assessment purposes Understand the concept of macro definition. Master: the use of macros. Key: Master macros. (two) assessment requirements Remember: the concept of macro definition. Understand: macros. Simple application: expression with the correct calculation of the value of the macro. Comprehensive application: Seven, structures and unions (a) assessment purposes Understand the concept of structures and unions. Master: the definition and initialization of structure variables; using structure variables; using a pointer to a structure variable; the definition and use of nested structures and unions. Master: the use of structure variables. (two) assessment requirements Remember: the concept structure and the federation. Understand: the definition and initialization of structure variables; using structure variables; using a pointer to a structure variable; nested definition and use of the structure and the federation. Simple application: members correctly calculate and output structure variables and common body variables. Comprehensive application: Eight, bit operation (a) assessment purposes Understand the basic concepts of bit operation. Master: bitwise operation rules. Master key: bitwise operation rules. (two) assessment requirements Remember: the basic concept of bit operation. Understand: bitwise operation rules. Simple application: the correct calculation of computing the value of the expression. Comprehensive application: Nine, file (a) assessment purposes Understand the basic concepts of file. Master: open the file, file establishment, read and output. Master key: open files, file establishment, read and output. (two) assessment requirements Remember: the basic concept of documents. Understand: open file, file establishment, read and output. Simple application: copy the text file. Comprehensive application: Third, test methods The "examination system" C language program design for the examination, a computer in the room, for examination. Test time: 60 minutes. The examination procedure: fill in the blanks, modify the program, program design question. The number of questions: three types of the 1 questions.