Posts

Showing posts with the label MCS11

BCA MCS-011 BLOCK 1 Important Questions with answers

Image
BCA, MCS011  Problem solving                and programming πŸ‘‰πŸ‘‰πŸ‘‰πŸ‘‰πŸ‘‰Join Telegram group                  (C Language)[Sem-2] πŸ‘‰πŸ‘‰πŸ‘‰ Subscribe YouTube channel        Important Questions with                                answers         Block 1          πŸ€”πŸ€” Question 1. Draw flowchart with an algorithms of each? . The given number is prime number or not? . The given number is factorial number? Answer. Here are the flowcharts for determining whether a given number is prime or not ? and whether it is a factorial number? Flowchart for Prime Number:   Algorithm for Prime Number: 1. Start the algorithm 2. Take the input number. 3. Check if the number is less than or equal to 1. 4. If the number is less than or equal to 1, it is not a prime number. 5. If the number is greater than 1, iterate from 2 to the square root of the number. 6. For each iteration, check if the number is divisible by the current iteration. 7. If the number is divisible by any iteration, it is not a prime number. 8.