Tuesday, June 5, 2012

Results!

I never really prepared seriously.
And I ended with 432 rank. (Appears to be highest this year in CSE/IT in BIT Mesra)
I think a good preparation would have really fetched me 10-15 more marks.
That's it. Blog will RIP now.

Friday, November 18, 2011

When will I start preparing seriously?

After having some inspiration from last SRM-524, I have decided to come back to blogging.
First I will be concentrating on ICPC preparation, after that I will be preparing for the gate.

Basically the regional will be over on 14th dec. After that hangover of the contest will remain for about 10 days so, the preparation may start from 25th December(The date sounds familiar).
Till then see you on my other blog.
Bye.

Saturday, August 27, 2011

Theory of computation and Compiler Design.

Syllabus:
Theory of Computation:
Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Regular Languages :
In simple terms , languages generated by regular-grammar are regular languages.
If you don't know what are regular grammar, here is quick review of chomsky classification:

Symobols:
A = Non-Terminals.
(a) = Anything (non terminals or terminals or their combo. or can be null if not specified..)
a = terminals.
L = Left context.
R = Right context.

Type-0 : kuch bhi , matlab kuch bhi.
Type-1 : LAR -> L(a)R , where (a) != null here.
I will explain the meanings soon.
(I will use the latex later :P)
Type-2 : A -> (a)
Type-3 : A -> a , A -> aB

Type-3 is also called Regular grammar.