operations on strings Can be .....
Anonymous Quiz
5%
concatenation
1%
returning substrings
3%
Inserting characters
91%
All of Them
......... is a group of items divided into levels. An item at one level can have successor items located at the next lower level
Anonymous Quiz
16%
Diagram Collection
84%
hierarchical collection
....... is a set of nodes and a set of edges that connect the nodes
Anonymous Quiz
85%
graph
12%
network
3%
weight
........ is a special type of graph where each of the edges is assigned a weight
Anonymous Quiz
10%
Graph
54%
network
36%
weight
.......... is associated with a cost for using that edge to move from one node to another
Anonymous Quiz
8%
Graph
16%
network
76%
weight
Nonlinear collections can be .....
Anonymous Quiz
11%
hierarchical
9%
grouped
80%
hierarchical or grouped
..........composite data type that holds data that may consist of many different data types.
Anonymous Quiz
10%
Array
19%
ListArray
41%
Struct
29%
ِArraylist
latest enhanced CPU systems, recursion is more efficient than iterations.
Anonymous Quiz
86%
true
14%
false
space complexity of recursive function may go .........than that of a function with iteration
Anonymous Quiz
31%
Less
60%
higher
9%
Equal
........when this condition is met the function stops calling itself recursively
Anonymous Quiz
81%
Base criteria
19%
Progressive approach
............. each time a recursive call is made it comes closer to the base criteria.
Anonymous Quiz
13%
Base criteria
87%
Progressive approach
most common application of recursion is in mathematics and computer science
Anonymous Quiz
94%
true
6%
false
in implementation of Recursion ........... function has to suspend its execution temporarily and resume later when the execution control returns from the callee function.
Anonymous Quiz
91%
caller
9%
callee
The Fibonacci sequence is defined by which mathematical formula?
Anonymous Quiz
51%
F(n) = F(n-1) + F(n-2)
22%
F(n) = F(n+1) + F(n+2)
17%
F(n) = F(n) * F(n-1)
10%
F(n) = F(n) / F(n-1)