Answer:
Transition section helps us to move from one shot to the next.
Explanation:
Synopsis: This tells actually what is the story is all about. We can call that as a “short description about the story”.
Sketch: It is the drawing window, where we pictorially represent the story.
Transition: This actually tells us about the next move.
Shot description: We can consider a “shot” as one of the scene in the story. So, it shot contain image and its description.
Shot Sequence: This is for “Pre-visualizing” video.
Among all the choice, Transition option takes the write definition.
Answer:
Structured programming also known as Modular programming in which the program is made as a single structure.The execution is instruction by instruction.It mainly focuses on improving the quality,clarity and development time of a computer program.
The top-down approach works by breaking a complex algorithm into smaller parts called modules. The modules keep breaking until there is no space left for breaking them without hindering the originality.The breaking of the modules is prohibited after achieving a certain level of modularity . C language uses this approach.
Bottom up works exactly opposite of how the top-down approach works.This approach works in the most elemental level of solving a problem and going up with combination of several parts of the solution to achieve required results.
Answer:
The program in C++ is as follows:
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> nums;
int num;
cin>>num;
while(num != -1){
nums.push_back(num);
cin>>num; }
for (auto i = nums.begin(); i != nums.end(); ++i){
cout << *i <<endl; }
return 0;
}
Explanation:
This declares the vector
vector<int> nums;
This declares an integer variable for each input
int num;
This gets the first input
cin>>num;
This loop is repeated until user enters -1
while(num != -1){
Saves user input into the vector
nums.push_back(num);
Get another input from the user
cin>>num; }
The following iteration print the vector elements
<em> for (auto i = nums.begin(); i != nums.end(); ++i){
</em>
<em> cout << *i <<endl; }
</em>
Answer:
Please check the attachment.
Explanation:
The adjacency matrix is the matrix that has nodes as rows and columns. The nodes if connected is stated as 1 or else 0. And the adjacency list representation is the list with nodes and connected nodes. The nodes that are not connected are not being listed. The diagram and list as well as matrix can be found in the attachment.
I may be wrong, BUT here is what i think
b) line graph
d) pie graph
