2014年电大程序设计基础记分作业4答案(2014 TV program design basic scoring homework 4 answer).docVIP

  • 1
  • 0
  • 约9.73千字
  • 约 10页
  • 2017-08-31 发布于河南
  • 举报

2014年电大程序设计基础记分作业4答案(2014 TV program design basic scoring homework 4 answer).doc

2014年电大程序设计基础记分作业4答案(2014 TV program design basic scoring homework 4 answer)

2014年电大程序设计基础记分作业4答案(2014 TV program design basic scoring homework 4 answer) Radio examination. (a total of 16 questions, 3 points per subject) 01 1. The typical feature of a tree is that between nodes is (C). A. has no direct relationship B. one to one relationship C. one to many relationship D. many to many relationship 2, the use of sequential space as the storage space of the stack, in the operation of the stack (C). A. does not need to determine whether the stack is empty and does not need to determine whether the stack is full or not B. does not need to determine whether the stack is empty, but you need to determine whether the stack is full The C. needs to determine whether the stack is empty and does not need to determine whether the stack is full The D. needs to determine if the stack is empty and also needs to determine if the stack is full 3, when storing linear tables, (D). A. can only use sequential storage structures B. can only take chain memory structures C. can use sequential or chained storage structures at will D. has no definite conclusion 4, the meaning of linear table length is (C). The number of bytes of memory used by the A. linear table The number of bytes of B. linear table memory and storage. The number of elements contained in the C. linear table The number of elements in the memory of the D. linear table 5, using chain store to save linear table, and use sequential storage to save linear table for comparison, in chain storage linear table for insertion operation efficiency (C). A. is relatively low Same as B. C. is quite tall D. has no definite conclusions 6, for a general graph, the relation among the nodes is (D). A. set relation B. one to one relationship C. one to many relationship D. many to many relationship 7, the data storage structure is divided into (D). A. linear storage structure and nonlinear storage structure B. ordered storage structure and non ordered storage structure C. tree storage structure and pattern storage structu

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档