Total Pageviews

Saturday, March 31, 2012

Web Technology CS 6B 2nd sessional marks

Web Technology CS 6B 2nd sessional marks



sess2
0915010065 PRATEEK KUMAR SINGH 6
0915010067 PREMANJALI 9
0915010068 PRIYA JAIN 13
0915010070 PRIYAM PARASHAR 14
0915010071 PRIYANKA 11
0915010072 PRIYANKA KUMARI GUPTA AB
0915010073 PRIYANSHU CHAUDHARY 13
0915010074 PRIYANSHU NIGAM 6
0915010075 RAHUL K SHARMA 11
0915010076 RAHUL YADAV 7
0915010077 RAJNI MEHLA 9
0915010078 RAVI KUMAR PANDEY 12
0915010079 RAVIRAJ SINGH 5
0915010081 SACHIN KUMAR VERMA 10
0915010082 SAGUN GUPTA 4
0915010083 SAHAJ TEBAK 9
0915010085 SANJEEV KUMAR MAURYA 8
0915010086 SAJIN K C 11
0915010087 SATISH KUMAR 8
0915010088 SATYA PRAKASH SOLANKI 13
0915010091 SHASHANK VERMA 9
0915010092 SHEEL NIDHI VERMA 10
0915010093 SHIVANGI SAXENA 11
0915010095 SHRUTI SURABHI AB
0915010096 SHWETA DUBEY 9
0915010098 SONAM PATEL 11
0915010101 SULABH DEEP PURI 10
0915010102 SUMIT SINGH PATEL 9
0915010103 SUNIL YADAV 6
0915010105 SWATI SHARMA 10
0915010106 SWATI SINGH 10
0915010107 TRIPTI GOEL 8
0915010108 UTKARSH SRIVASTAVA 7
0915010110 VANDANA MAURYA 14
0915010113 VINAY CHAURASIA 8
0915010116 VIRESH KUMAR TOMAR  6
0915010117 VISHAKHA SEHDEV 7
0915010401 VINEETA PANDEY 7
0915010402 VIJAY CHAUDHARY 9
0915010403 YADAV DEEPAK 5

Sunday, March 25, 2012

Automata assignment-1 (CS 4A)

Make an assignment which include all topic which we have covered in class. Atleast on question for every topic.

Topics:

  • Strings and Languages
  • Grammar
  • Deterministic finite Automata (DFA)
  • Language of DFA
  • Non-deterministic finite Automata (NFA)
  • NFA with epsilon transition
  • Equivalence of NFA and DFA
  • Minimization of Finite Automata
  • Distinguishing one string from other
  • Algebraic laws for Regular expressions
  • Kleen’s Theorem
  • Regular expression to FA
  • DFA to Regular expression
  • Arden Theorem- convert NFA to regular expression
  • Moore and Mealy machine
  • Equivalence of Moore and Mealy Machine

Web Technology 2nd sessional syllabus (CS 6 A+B)

ECS-604       Web Technology

Unit II:  Web Page Designing
 
Cascading Style Sheet; selectors, linking CSS files, html elements designing using CSS selectors.

Unit III:  Scripting

Java script: Introduction, documents, forms, statements, functions, objects;
Event and event handling; introduction to AJAX, VB Script, CGI.

Automata 2nd sessional syllabus (for CS 4 A+B)

ECS-403 : THEORY OF AUTOMATA AND FORMAL LANGUAGES  

Unit – I 

Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other.

Unit – II

Regular expression (RE) , Definition, Operators of regular expression and therr precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.

Tuesday, March 20, 2012

Automata Test (CS-4A)

Syllabus for test: Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata. Regular expression (RE) , Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.