NEW

WEST BENGAL BOARD

CLASS 12 PYTHON MCQ ONLINE EXAMINATION

Python Output-Based • Syntax • Variables • Data Types • Operators • If-Else • For/While • Strings

মোট প্রশ্ন: ৬০   |   সময়: ৬০ মিনিট   |   পূর্ণমান: ৬০

Assertion–Reason প্রশ্ন: ২০টি

শিক্ষার্থীর নাম

বিদ্যালয়ের নাম

⚠️ পরীক্ষা শুরু করার পরে Full Screen চালু হবে। Full Screen থেকে বের হলে পরীক্ষা স্বয়ংক্রিয়ভাবে জমা হবে।

⏱ 60:00

পরীক্ষা

👨‍🎓
🏫

🏆 পরীক্ষার ফলাফল

নাম:

বিদ্যালয়:

0 / 60

সঠিক উত্তর:

ভুল উত্তর:

উত্তর না দেওয়া:

সময়:

📋 উত্তর পর্যালোচনা

CLASS 12 PYTHON MCQ QUESTION WEST BENGAL BOARD SAMPLE PAPER 2026

AI & MACHINE LEARNING ASSESSMENT

Professional Online MCQ Examination

Full Name:

School / Institution:

Student:

School:

⏳ 60:00

🏆

Assessment Completed Successfully

Your performance report has been generated securely via AI engine.

Name:

School:

Total Score: / 60

Remarks:

📊 Histogram Specification / Matching

Match the histogram of an input image with a target image

📁 Select Input Image 🎯 Select Target Image

Upload an input image and a target image.

1. Input Image

2. Target Image

3. Input Histogram

4. Target Histogram

5. Input CDF

6. Target CDF

7. Gray-Level Mapping

Input Gray	Input H	Input CDF	Target Gray	Target CDF	New Map

8. New Mapped Image

9. Histogram After Mapping

10. Mapping Result

Waiting for histogram matching...

🧮 Histogram Matching Mathematics

Step 1 — Convert image to grayscale

For an RGB pixel:

Gray = 0.299R + 0.587G + 0.114B

Step 2 — Calculate histogram

For each gray level r_k, count the number of pixels.

H(r_k) = n_k

Step 3 — Calculate probability

If N is the total number of pixels:

P(r_k) = n_k / N

Step 4 — Calculate input CDF

C_input(r_k) = Σ P(r_j)

where j = 0 to k.

Step 5 — Calculate target CDF

C_target(z_q) = Σ P(z_j)

Step 6 — Find the matching gray level

For every input gray level, find the target gray level whose CDF is closest to the input CDF.

Find z such that C_target(z) ≈ C_input(r)

Step 7 — Create the mapping

r → z

Every pixel having gray level r is replaced with the mapped gray level z.

Example

Input CDF = 0.60

Suppose the target histogram has:

Target CDF at gray 150 = 0.58 Target CDF at gray 151 = 0.61

The closest target CDF is 0.61, therefore:

Input gray level → Target gray level r → 151

Complete process

Input Image → Grayscale → Input Histogram → Input CDF → Target Histogram → Target CDF → Mapping → New Image

Interactive Digital Image Processing — Histogram Specification / Histogram Matching

📊 Histogram Equalization Visualizer

Upload an image and explore grayscale conversion, histogram analysis, histogram equalization and its mathematics.

📁 Upload Image

Please upload an image to begin.

1. Original Image

2. Grayscale Image

3. Grayscale Histogram

4. Histogram Values

Gray Level	Frequency	Probability	CDF	New Gray Level

5. Equalized Image

6. Histogram After Equalization

🧮 Histogram Equalization Mathematics

Step 1: Find the frequency

For every grayscale intensity r_k, count how many pixels have that intensity.

n_k = Number of pixels having intensity r_k

Step 2: Calculate probability

Let n be the total number of pixels.

p(r_k) = n_k / n

Step 3: Calculate cumulative distribution function (CDF)

CDF(r_k) = Σ p(r_j)    for j = 0 to k

The CDF adds the probabilities from the first gray level up to the current gray level.

Step 4: Histogram equalization formula

s_k = (L - 1) × CDF(r_k)

Where:

• L = number of possible gray levels
• For an 8-bit image, L = 256
• Therefore L − 1 = 255
• r_k = original gray level
• s_k = new equalized gray level

Step 5: Example calculation

Suppose an intensity level has:

CDF = 0.60

For an 8-bit image:

s = 255 × 0.60

s = 153

Therefore, the original gray level is mapped to approximately gray level 153.

Complete process

Image → Grayscale → Histogram → Probability → CDF → Mapping → Equalized Image

Interactive Image Processing Demonstration — Grayscale & Histogram Equalization

➕ ARRAY INSERTION AT FRONT

➕ ARRAY INSERTION AT FRONT

Insert a new value at index 0 by shifting every existing element one position to the RIGHT

📥 Enter Array and New Value

Existing Array Value to Insert at Front

🎬 Step-by-Step Animation

Enter an array and a new value, then press START INSERTION.

📊 Operation Statistics

Array Size 0

Shifts Completed 0

📝 Step-by-Step Explanation

🧮 Mathematical Representation

Suppose:
A = [10, 20, 30, 40, 50]

New value:
5

To insert at the FRONT, all existing elements must move one position RIGHT.

A[5] ← A[4]

50 moves from index 4 to index 5.

A[4] ← A[3]

40 moves from index 3 to index 4.

A[3] ← A[2]

30 moves from index 2 to index 3.

A[2] ← A[1]

20 moves from index 1 to index 2.

A[1] ← A[0]

10 moves from index 0 to index 1.

Finally:
A[0] = 5

Final Array:
[5, 10, 20, 30, 40, 50]

💻 Algorithm

INSERT_FRONT(A,n,value)

Step 1: Start from the last element.

Step 2: Move each element one position RIGHT.

For: i = n − 1 down to 0

Perform: A[i + 1] = A[i]

Step 3: A[0] = value

Step 4: n = n + 1

⏱️ Time and Space Complexity

Time Complexity O(n)

Number of Shifts n

🎯 Final Result

Result will appear here.

B.K. PAUL

Bhairab Ganguly College

Data Structures • Array • Insertion at Front