Pie Classes

Dear Students and Parents,

New Coaching / Tuition Batches for Academic Year 2023 - 2024 will start soon.

Batch details are as follows -
****************************************************
Classes XI and XII - Maths, Physics and Chemistry
Classes VI to X - Maths and Science
****************************************************

Join fast and enjoy early mover advantage.

Regards,
Pie Classes

For College Students & Professionals
====================================
Solutions to selected problems of sheet 2017/SX-0L64

Problem 1
=========
Compute the strongly connected components of G. Then construct a new graph G’, and use one vertex to present one component. We know G’ is a DAG. If there’s more than one vertex in G’ whose in-degree is 0, G doesn’t have a mother vertex; otherwise we have a vertex v in G’ that can visit all other components, so any vertex in the component which v presents would be a mother vertex.

Problem 5
=========
There are 7 diffrent ways or C(20) = 7.
20 equals to:
1. Twenty 1
2. Fourteen 1, one 6
3. Four 1, two 6
4. Two 1, three 6
5. Ten 1, One 10
6. Four 1, One 6, One 10 7
7. Two 10.

Problem 6
=========
We can solve this problem using Dynamic Programming. We fill matrix C, where C[n, k] is the number of ways to make a change of n, using 1st k denominations only. C[n, k] = C[n - dk, k] + C[n, k - 1]

For College Students & Professionals
=============================
Problem PS-0X-SP00037
Time Given = 60 minutes.

Once you get an initial idea of solving it via Non Deterministic Finite Automaton then it becomes a implementation heavy graph problem.

Outline of Steps
1) Build NFA corresponding to Regular Expression.
2) Create Graph representing NFA.
3) Pass input string and check if Final State is reached.

A Sample Code is attached -

For School Students
================
Marking Scheme and Solutions of Class 10th SA-2 Science Mock Test conducted on 15/03/2017 are attached.