Hey friends , this time I am gonna tell you about ZIO .
Most of you might be familiar with it . However In this post I am gonna talk about ZIO .
What is it ???
Many of us( Indians :) ) would be familiar with science olympiad , math olympiad . There is a similar olympiad in the field of Computer Science . It is better called as Indian Computing Olympiad .
The Indian Computing Olympiad is a nationwide competition organized annually by IARCS(Indian Association For Research in Computer Science ). The goal of the competition is to identify school students with outstanding skills in algorithms and computer programming. This competition is open for all students upto class 12.
The Indian Computing Olympiad is used to select the team of four students to represent India at the International Olympiad for Informatics (IOI). IOI is one of the twelve international Science Olympiads held annually.
The IOI is held in two subsequent rounds :
1. (ZOI)The Zonal Informatics Olympiad (ZIO) is a written exam. held at centres across the country.
2. The Zonal Computing Olympiad (ZCO), a programming contest.
Students selected in INOI are trained for IOI .
for further info you can refer to this link of IOI
Yesterday I came thorugh some past year subjective questions of ZIO .
Believe me , those questions where so interesting and mind freaking as well as tough . The questions use your algorithmic skills and problem skills . If you have free time to kill , I would suggest you to go through the previous year papers and try to solve them .
I would write one of such questions here :
A binary string of length N is a sequence of 0s and 1s. For example, 01010 is a binary string of length 5. For a string A we write Ai to refer to the letter at the i th position. Positions are numbered starting from 1. For example, if A = 01010 then A1 = 0 and A4 = 1. Let A be a string of length N. We say that a string B is a substring of A if B = Ai A(i+1)...Aj for some 1 ≤ i ≤ j ≤ N. So, 1 is a substring of A = 01010, since 1 = A2. The string 101 is a substring of A because 101 = A2, A3 ,A4. In this problem you have to count the number of binary strings of length N which contain 11011 as a substring. Take, for example, N = 6. We have 4 binary sequences of length 6 which contain 11011 as a substring. They are 011011, 111011, 110110 and 110111. Therefore, the answer for N = 6 is 4. Your task is to report the answer for three values of N.
(a) N = 9: How many binary strings of length 9 contain 11011 as a substring?
(b) N = 10: How many binary strings of length 10 contain 11011 as a substring?
(c) N = 11: How many binary strings of length 11 contain 11011 as a substring?
for answers visit here .
Don't think it as simple as it seems :)
Thank you :)
Most of you might be familiar with it . However In this post I am gonna talk about ZIO .
What is it ???
Many of us( Indians :) ) would be familiar with science olympiad , math olympiad . There is a similar olympiad in the field of Computer Science . It is better called as Indian Computing Olympiad .
The Indian Computing Olympiad is a nationwide competition organized annually by IARCS(Indian Association For Research in Computer Science ). The goal of the competition is to identify school students with outstanding skills in algorithms and computer programming. This competition is open for all students upto class 12.
The Indian Computing Olympiad is used to select the team of four students to represent India at the International Olympiad for Informatics (IOI). IOI is one of the twelve international Science Olympiads held annually.
The IOI is held in two subsequent rounds :
1. (ZOI)The Zonal Informatics Olympiad (ZIO) is a written exam. held at centres across the country.
2. The Zonal Computing Olympiad (ZCO), a programming contest.
Students selected in INOI are trained for IOI .
for further info you can refer to this link of IOI
Yesterday I came thorugh some past year subjective questions of ZIO .
Believe me , those questions where so interesting and mind freaking as well as tough . The questions use your algorithmic skills and problem skills . If you have free time to kill , I would suggest you to go through the previous year papers and try to solve them .
I would write one of such questions here :
A binary string of length N is a sequence of 0s and 1s. For example, 01010 is a binary string of length 5. For a string A we write Ai to refer to the letter at the i th position. Positions are numbered starting from 1. For example, if A = 01010 then A1 = 0 and A4 = 1. Let A be a string of length N. We say that a string B is a substring of A if B = Ai A(i+1)...Aj for some 1 ≤ i ≤ j ≤ N. So, 1 is a substring of A = 01010, since 1 = A2. The string 101 is a substring of A because 101 = A2, A3 ,A4. In this problem you have to count the number of binary strings of length N which contain 11011 as a substring. Take, for example, N = 6. We have 4 binary sequences of length 6 which contain 11011 as a substring. They are 011011, 111011, 110110 and 110111. Therefore, the answer for N = 6 is 4. Your task is to report the answer for three values of N.
(a) N = 9: How many binary strings of length 9 contain 11011 as a substring?
(b) N = 10: How many binary strings of length 10 contain 11011 as a substring?
(c) N = 11: How many binary strings of length 11 contain 11011 as a substring?
for answers visit here .
Don't think it as simple as it seems :)
Thank you :)
what is time given in the ZIO ? Pls tell
ReplyDelete