第一章 Basic Concepts：Introduces some basic concepts, such as the algorithm and flow chart1.1introduction:introduce what is computer Science[单选题]The algorithm and flowchart can help us to选项:[To store the data
1.2Algorithm and Flowcharts:introduce what is algorithm
1.3Flowcharts:introduce some basic flowcharts and Pseudocode
1.4Basic Concepts:Some basic concepts about data structure
1.5Time Complexity of Algorithms:introduce time complexity of Algorithms
, To know the memory capacity
, Specify the problem completely and clearly
, Identify the data type of a variable
]
[单选题] The rhombus or diamond shape in flowcharting denotes选项:[Initialization
, Decision
, Output
, Input
]
[单选题]Which of the following is not an advantage of a flowchart?选项:[Better communication
, Systematic testing
, Improper documentation
, Efficient coding
]
[单选题]The flowchart symbols used for start and stop operations are called as_______.
选项:[connectors, processing
, terminals
, decision
]
[单选题]The formula Fn = Fn-1+Fn-2 will produce选项:[Euler Number
, Ramanujan Number
, Prime Number
, Fibonacci Number
]
[单选题]The main measures for the efficiency of an algorithm are选项:[Processor and memory
, Data and space
, Complexity and capacity
, Time and space
]
[单选题]Which one of the following is the constant time complexity in terms of Big-Oh notation选项:[O(n3)
, O(n)
, O(n2)
, O(1)
]
[单选题]
What is the time complexity of the following code?
int a=0;
for(i=0;i<n;i++){
for(j=n;j>i;j--){
a=a+i+j;}}
选项:[O(nlogn), O(1)
, O(n2)
, O(n)
]
[单选题]Which one of the following is an example for exponential time complexity?选项:[O(n)
, O(2n)
, O(1)
, O(n2)
]
[单选题] For larger values of n, which one represents the slowest time?选项:[O(n)
, O(2n)
, O(n2)
, O(n!)
]
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
