MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 477 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 451. |
What type of structure is this? |
| A. | sequence |
| B. | case |
| C. | repetition |
| D. | process |
| Answer» D. process | |
| 452. |
The action performed by a                        structure must eventually cause the loop to terminate. |
| A. | sequence |
| B. | case |
| C. | repetition |
| D. | process |
| Answer» D. process | |
| 453. |
A Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â is a connector showing the relationship between the representative shapes. |
| A. | line |
| B. | arrow |
| C. | process |
| D. | box |
| Answer» C. process | |
| 454. |
What type of a structure is this? |
| A. | sequence |
| B. | case |
| C. | repetition |
| D. | process |
| Answer» C. repetition | |
| 455. |
Which of the following is not a flowchart structure? |
| A. | process |
| B. | sequence |
| C. | repetition |
| D. | case |
| Answer» B. sequence | |
| 456. |
The operation represented by parallelograms. |
| A. | input/output |
| B. | assignment |
| C. | comparison |
| D. | conditions |
| Answer» B. assignment | |
| 457. |
Terminals are represented by diagonals in a flowchart. |
| A. | true |
| B. | false |
| Answer» C. | |
| 458. |
A Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â is diagram that depicts the flow of a program. |
| A. | algorithm |
| B. | hash table |
| C. | graph |
| D. | flowchart |
| Answer» E. | |
| 459. |
A flowchart that outlines the main segments of a program. |
| A. | queue |
| B. | macro |
| C. | micro |
| D. | union |
| Answer» C. micro | |
| 460. |
Which of the following is not an advantage of a flowchart? |
| A. | better communication |
| B. | efficient coding |
| C. | systematic testing |
| D. | improper documentation |
| Answer» E. | |
| 461. |
A detailed flowchart is called |
| A. | stack |
| B. | macro |
| C. | micro |
| D. | union |
| Answer» D. union | |
| 462. |
There should be certain set standards on the amount of details that should be provided in a flowchart. |
| A. | true |
| B. | false |
| Answer» C. | |
| 463. |
A box that can represent two different conditions. |
| A. | rectangle |
| B. | diamond |
| C. | circle |
| D. | parallelogram |
| Answer» C. circle | |
| 464. |
The following box denotes? |
| A. | decision |
| B. | initiation |
| C. | initialization |
| D. | i/o |
| Answer» B. initiation | |
| 465. |
The process of drawing a flowchart for an algorithm is called |
| A. | performance |
| B. | evaluation |
| C. | algorithmic representation |
| D. | flowcharting |
| Answer» E. | |
| 466. |
Actual instructions in flowcharting are represented in |
| A. | circles |
| B. | boxes |
| C. | arrows |
| D. | lines |
| Answer» C. arrows | |
| 467. |
In computer science, algorithm refers to a pictorial representation of a flowchart. |
| A. | true |
| B. | false |
| Answer» C. | |
| 468. |
The symbol denotes |
| A. | i/o |
| B. | flow |
| C. | terminal |
| D. | decision |
| Answer» D. decision | |
| 469. |
A data structure that follows the FIFO principle. |
| A. | queue |
| B. | ll |
| C. | stack |
| D. | union |
| Answer» B. ll | |
| 470. |
Another name for 1-D arrays. |
| A. | linear arrays |
| B. | lists |
| C. | horizontal array |
| D. | vertical array |
| Answer» B. lists | |
| 471. |
A system wherein items are added from one and removed from the other end. |
| A. | stack |
| B. | queue |
| C. | linked list |
| D. | array |
| Answer» C. linked list | |
| 472. |
Any algorithm is a program. |
| A. | true |
| B. | false |
| Answer» C. | |
| 473. |
The time that depends on the input: an already sorted sequence that is easier to sort. |
| A. | process |
| B. | evaluation |
| C. | running |
| D. | input |
| Answer» D. input | |
| 474. |
This characteristic often draws the line between what is feasible and what is impossible. |
| A. | performance |
| B. | system evaluation |
| C. | modularity |
| D. | reliability |
| Answer» B. system evaluation | |
| 475. |
When an algorithm is written in the form of a programming language, it becomes a |
| A. | flowchart |
| B. | program |
| C. | pseudo code |
| D. | syntax |
| Answer» C. pseudo code | |
| 476. |
In computer science, algorithm refers to a special method usable by a computer for the solution to a problem. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 477. |
The word                         comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi. |
| A. | flowchart |
| B. | flow |
| C. | algorithm |
| D. | syntax |
| Answer» D. syntax | |