Scribd
Upload
67 views

Assignment - Software Subsystem

1. There is a software subsystem recruitment assignment with 3 questions worth a total of 70 marks. Submissions must be in PDF format with any references cited. 2. Question 1 involves logical reasoning puzzles about deducing letter combinations, chip colors after replacement rules, winning strategies for board games, and tile requirements for flooring. 3. Question 2 is about basic machine learning concepts like definitions, examples of supervised and unsupervised learning, areas of impact, differences between classification and regression, and neural networks. 4. Question 3 asks about color space, commonly used models, and how edge detection can produce one image from another grayscale image.

Uploaded by

sahil Barbade
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
67 views

Assignment - Software Subsystem

1. There is a software subsystem recruitment assignment with 3 questions worth a total of 70 marks. Submissions must be in PDF format with any references cited. 2. Question 1 involves logical reasoning puzzles about deducing letter combinations, chip colors after replacement rules, winning strategies for board games, and tile requirements for flooring. 3. Question 2 is about basic machine learning concepts like definitions, examples of supervised and unsupervised learning, areas of impact, differences between classification and regression, and neural networks. 4. Question 3 asks about color space, commonly used models, and how edge detection can produce one image from another grayscale image.

Uploaded by

sahil Barbade
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/ 3

Software Subsystem

Recruitment Assignment
____________________________________________________________________________

Instructions:

1. There are three questions in this assignment.


2. You need to attempt all the questions.
3. The total marks for the assignment are 70.
4. The submission needs to be submitted in a pdf format named roll_no.pdf.
Submission link: https://forms.gle/FTpAhjYdUcy7uHHi9
5. You are expected to work alone on this assignment. Also, you must cite every resource
consulted or used, whatever be the reason, in a file named references.txt, which must be
included in the submission. Failure to list any resource used/plagiarism will lead to
disqualification.
6. You can refer to online blogs while working on the assignment.
7. You should submit the answers properly, stating the meaning of each part of the logic
used.
8. If you have any other doubts, you can ask them on the Whatsapp group.
Link: https://chat.whatsapp.com/D64zGwb2FgU7dcgAnsqwMl
___________________________________________________________
Q1. Logical Reasoning [Marks: 35]

a) Person 1 (P1) and Person 2 (P2) have each been given a paper with two consecutive
letters written on it. Based on the dialogue below, deduce the possible combinations of
pairs of letters assigned to them and explain your reasoning.
P1: “We have consecutive letters on our papers.”
P2: “Yeah, I know.”
P1: “I don't know what your letter is.”
P2: “Neither do I know your letter.”
P1: “Now I know. “
(8)
b) There are 1729 color_1, 5186 color_2, and 8643 color_3 chips on a table. In each step,
you choose two chips of different colours and replace them with a chip of the third colour.
What are the possible colours of the last chip that remains at the end? Explain your
answer.
(4)
c) There are 2 players and they have a m x n array of bricks. The players alternate turns
and in each move you select a brick and remove all the bricks to the south and west of it.
The player that removes the last brick loses. For the case when m=n (square), find either
a winning strategy for the player who moves first or for the the one who moves second.
As a bonus prove that when m != n, the first player always has a winning strategy.
(6+4)
d) Like the previous subpart, we have two players that play alternately. They have two piles
of rocks, one with m and the other with n rocks. In a turn the player who is playing
removes any number of rocks (greater than or equal to 1) from a single pile (without
touching the other one). The player who removes the last rock wins. Mention and prove
the conditions on m and n for the first player to have a winning strategy. What about for
the second player to have a winning strategy. What are these winning strategies?
(7)
e) Given a square floor of side length 23 and square tiles of side lengths 1, 2 and 3. What
is the minimum number of 1 × 1 tiles needed for tiling the floor completely? Give proper
reasoning or show by an example.
(6)

Q2. Basic Machine Learning [Marks: 20]

a) What is Machine Learning? Why do you think it was introduced? (3)


b) Explain the following terms with examples: (4)
i) Supervised Learning.
ii) Unsupervised Learning.
c) State any five sectors/ industries where supervised or unsupervised ML has made an
impact. Identify which of the two was used and explain how they are used.
(You can also explain some areas where you think it can be applied to mitigate a
particular problem)
(6)
d) What is the difference between classification and regression? (3)
e) What do you understand by the term ‘Neural Network’? (4)

Note: You are expected to research these and answer them in your own words without copying
the content you get online.

Q3. Basic Image processing [Marks:15]


Note: You are free to search online, but you need to write the answers in your own words. No
need to write codes for any questions. Explain in words.
(a) Explain what the color space of a digital image is. What is the most commonly used color
space? (3)
(b) Explain theoretically how it is possible to obtain Image 2 from Image 1. Image 1 is a
grayscale image. (Hint: Research what is a grayscale image and think of how edge
detection is done). (12)

Image 1 Image 2

You might also like