First half of 2016 software designer exam questions morning Roll (51-75 questions)

Get martial arts cheats, repair a good kung fu, you can walk in the lake. Get the soft test real problem , get the direction of the proposition, successfully passed the exam. The Following is the first half of a 2016-year software designer exam for you to help you prepare for the test.

first half of 2016 software designer exam questions morning Roll (51-75 questions)

The physical independence and logical independence of the data are accomplished by modifying (51) respectively.

A Image between the outer and inner modes, and the image between the pattern and the inside mode

B Image between external mode and internal mode, image between external mode and pattern

C Image between the external mode and the pattern, and the pattern to the inside mode

D The image between the pattern and the inner mode, the image between the outside mode and the pattern

Relationship normalization is performed at the (52) stage of the database design.

A. Demand Analysis

B Conceptual design

C Logic Design

D Physical design

If the given relationship pattern is r<u,f>,u={a,b,c},f = {ab→c,c→b>, then the relationship R (53).

A. There are 2 candidate keywords AC and BC, and there are 3 main properties

B There are 2 candidate keywords AC and AB, and there are 3 properties

C There is only one candidate keyword AC, and there are 1 non-master properties and 2 main attributes

D There is only one candidate keyword AB, and there are 1 non-master properties and 2 main attributes

The component relationship mode in a company database is P (component number, component name, supplier, supplier location, inventory), and the function dependency set F is as follows:

f={component number → component name, (component number, supplier) → inventory, supplier → supplier Location}

The primary key for a component relationship is (54), which has problems such as redundancy and insertion and deletion exceptions. In order to solve this problem, we need to decompose the component relationship (55), and the decomposed relational pattern can reach (56).

(54) A Component number, component name

B Component number, Supplier

C Component number, supplier location

D Supplier, supplier location

(A). Element 1 (Component number, component name, stock), component 2 (supplier, supplier location)

B Element 1 (Component number, component name), component 2 (supplier, vendor location, stock)

C Element 1 (Component number, component name), component 2 (component number, supplier, stock), component 3 (supplier, supplier location)

D Element 1 (Component number, component name), component 2 (component number, quantity in stock), component 3 (supplier, supplier location), component 4 (vendor location, stock)

(+) A. 1NF

B 2NF

C 3NF

D 4NF

If the elements in the order of a,b,c,d into an initial empty stack, each element into the stack, out of the stack 1 times, requires the first element of the stack is D, then the legitimate stack sequence altogether (57).

A 4

B 5

C 6

D 24

With a two-fork sort tree (or binary lookup tree) as shown, the key code sequence to build the two-fork tree cannot be (58).

650) this.width=650; "Src=" http://www.educity.cn/article_images/2016-06-16/ E3f39b7e-4997-44d1-a9f4-a1d9a959a7d1.png "alt=" E3f39b7e-4997-44d1-a9f4-a1d9a959a7d1.png "/>

A 23 31 17 19 11 27 13 90 61

B 23 17 19 31 27 90 61 11 13

C 23 17 27 19 31 13 11 90 61

D 23 31 90 61 27 17 19 11 13

If the height of a binary tree (that is, the number of layers) is H, then the two-fork tree (59).

A. There are 2h nodes

B There's a 2h-1 node.

C Minimum of 2H-1 nodes.

D There are at most 2h-1 nodes.

A binary lookup (or a binary lookup, rounded down) is performed in an ordered table a[1..13] consisting of 13 elements. In the following narrative, the error is (60).

A. Regardless of which element you are looking for, compare with A[7] First

B To find the element equal to a[9], compare with a[7], a[11], a[9] respectively

C Regardless of whether the element you are looking for is in a[], you can compare up to 4 elements in a table

D If the element you are looking for is not in a[], you need to compare it with at least 3 elements in the table

The following is a description of the traversal of the graph, which is correct (61).

A The traversal of a graph is a process that accesses only once per vertex from a given source point

B The depth-first traversal method of graphs is not applicable to the non-graph

C Breadth-first traversal of graphs using queues

D Cannot traverse when there is a loop in the diagram

Consider a knapsack problem, a total of n=5 items, backpack capacity of w=10, the weight and value of the items are: w={2,2,6,5,4},v={6,3,5,4,6}, the maximum pack value of the knapsack problem. If this is a 0-1 knapsack problem, the analysis of this problem has the optimal substructure, which defines the recursive type as

650) this.width=650; "Src=" http://www.educity.cn/article_images/2016-06-16/ 83f8a670-8387-4d76-9d71-b94751f76190.png "style=" Float:none; "alt=" 83f8a670-8387-4d76-9d71-b94751f76190.png "/ >

where C (i,j) represents the maximum package value of the 0-1 knapsack problem for I items, the capacity J, and the Final Solution to C (n,w).

The maximum package value (62) is obtained by the bottom-up dynamic programming method, and the time complexity of the algorithm is (63).

If this is a partial knapsack problem, first use the merge sorting algorithm, according to the item's unit weight value from large to small sort, then put the item in the backpack until all items into the backpack or backpack no capacity, the maximum package value is (64), the algorithm time complexity is (65).

(+) A. 11

B 14

C 15

D 16.67

(+) A. Θ (NW)

B Θ (NLGN)

C Θ (N2)

D Θ (NLGNW)

(+) A. 11

B 14

C 15

D 16.67

(+) A. Θ (NW)

B Θ (NLGN)

C Θ (N2)

D Θ (NLGNW)

By default, the FTP server has a control port of (66) and the port for uploading the file is (67).

(A). Ports greater than 1024

B 20

C 80

D 21st

(+) A. Ports greater than 1024

B 20

C 80

D 21st

The ping command allows for network detection, and in the case of a series of tests, according to the from near principle, the first thing to do is (68).

A Ping Default Gateway

B Ping local IP

C ping127.0.0.1

D Ping remote Host

The Internet Protocol attribute parameter for a PC, as shown, is the IP address of the default gateway (69).

650) this.width=650; "Src=" http://www.educity.cn/article_images/2016-06-16/ Cd2befea-d350-46c3-ba70-08d2986c1b98.png "style=" Float:none; "alt=" cd2befea-d350-46c3-ba70-08d2986c1b98.png "/ >

A 8.8.8.8

B 202.117.115.3

C 192.168.2.254

D 202.117.115.18

In the SNMP configuration, the ability to respond to Manager2 's getrequest request is (70).

650) this.width=650; "Src=" http://www.educity.cn/article_images/2016-06-16/ C1553cd0-cc94-4e5a-a6bf-930191b21009.png "style=" Float:none; "alt=" c1553cd0-cc94-4e5a-a6bf-930191b21009.png "/ >

A Agentl

B Agent2

C Agent3

D Agent4

In the fields of physical security and information security,access control are the selective restriction of access to a PL Ace or other resource. The act of accessing may mean consuming,entering,or using. Permission to access a resource is called authorization (authorized).

       an access control mechanism () between a user (or a process exec Uting on behalf of a user) and system Resources,such as applications,operating Systems,firewalls,routers,files,and databas Es. The system must first authenticate (authentication) a user seeking access. Typically the authentication function determines whether the user is (a) to access the system at all. Then the access control function determines if the specific requested access by this user is permitted. A Security Administrator maintains an authorization database which specifies what type of access to which resources are Allo Wed for the This user. The access control function consults this database to determine whether to access. An auditing function monitors and keeps a record of the user accesses to system resources.

In Practice,a number of cooperatively share the access control function. All operating systems has at least a rudimentary (basic), and in many cases a quite robust,access control component. Add-on security packages can add to the () access control capabilities of the OS. Particular applications or Utilities,such as a database management system,also incorporate access control functions. External Devices,such as Firewalls,can also provide access control services.

() A. Cooperates

B Coordinates

C Connects

D Mediates

(A). Denied

B Permitted

C Prohibited

D Rejected

(A). Open

B Monitor

C Grant

D Seek

() A. Components

B Users

C Mechanisms

D Algorithms

(+) A. Remote

B Native

C Controlled

D Automated

First half of 2016 software designer exam questions morning Roll (51-75 questions)