Scribd
Upload
3 views2 pages

Programming Suggestion

The document outlines the syllabus for BTCSC201 – Programming for Problem Solving, divided into three groups: MCQs, short answer questions, and long answer questions. Key focus areas include data types, operators, pointers, control flow, and memory concepts, along with specific topics for deeper understanding such as recursion and variable scope. It emphasizes practice on pattern programs and numeric logic-based problems, alongside theoretical definitions and example codes.

Uploaded by

manojgamer.15464
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Programming Suggestion

The document outlines the syllabus for BTCSC201 – Programming for Problem Solving, divided into three groups: MCQs, short answer questions, and long answer questions. Key focus areas include data types, operators, pointers, control flow, and memory concepts, along with specific topics for deeper understanding such as recursion and variable scope. It emphasizes practice on pattern programs and numeric logic-based problems, alongside theoretical definitions and example codes.

Uploaded by

manojgamer.15464
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BTCSC201 – Programming for Problem Solving

🔹 Group A – MCQ Section (1 Mark each)


Main Focus Areas:

1. Data Types & Keywords in C


o int, float, char, invalid types like real
o Keywords: for, while, do, etc.
2. Operators
o Arithmetic (%, /), Logical (==, !=, &&, ||), Assignment (=), Ternary (?:)
o Understand precedence and associativity.
3. Pointers & Addressing
o Syntax for pointer declaration
o Use of &, *, and address-related operations
4. Input/Output Functions
o printf, scanf, gets, getchar, etc.
o Correct format specifiers like %d, %f, %c
5. Control Flow
o Loop types: for, while, do-while
o Loop control: break, continue, return
6. Memory Concepts
o sizeof, default values of variables, pointer basics
7. Basic Code Output Prediction
o Pre/post increment, ternary operator, logical expressions, simple conditionals

🔹 Group B – Short Answer Questions (5 Marks)

Must-Prepare Topics:

1. Ternary Operator – Syntax and example


2. Compiler vs Interpreter – At least 3 points difference
3. Entry vs Exit Controlled Loops – while vs do-while with examples
4. Call by Value vs Call by Reference – Function examples
5. Static vs Global Variables – Memory and scope difference with code
6. Recursion & Fibonacci Series
7. Palindrome and Factorial Programs – Must know logic
8. sizeof Operator & Format Specifiers
🔹 Group C – Long Answer Questions (15 Marks)

1. Pattern Printing – Using nested for loops


2. Armstrong Number / 4-digit check / Sum of Digits
3. Sum of first n prime numbers
4. Type Casting & Ternary Operator – Output analysis
5. Preprocessor Directives – #include, #define, #ifdef, etc.
6. Function Concepts: Call by Value, Reference
7. Scope of Variables – Local, Global, Static
8. Arrays – Definition, Advantages, Disadvantages

Practice 5–6 pattern programs and numeric logic-based problems (Armstrong, Prime, Palindrome).
Also prepare theoretical definitions with example codes.

You might also like