1.3 - Hardvard architecture

1.2 - Von newmann Architecture

1.1 - Computer functional units

2.2 - cloud architecture issues

2.1 - cloud security consideration

1.11 - cloud Infrastructure security

1.10 - cloud security architecture

1.9 - cloud security patterns

1.6 - Virtualization security

1.7 - Cloud security requirements

1.8 - Securing private and public Clouds

1.4 - security challanges in the cloud

1.5 - Security policies in the cloud

1.3 - Risks in the cloud

1.2 - Security & privacy challanges in cloud computing

1.1 - What is cloud security (user perspective)

4.4 - Parameter estimation in nlp

4.3 - Language model evaluation

4.2 - N- Gram models

4.1 - Language modeling - An introduction

3.11 - Meaning representation - ATIS , communicator , Gro Query and robo cup- Clang

3.10 - SRL resources - Frame net & Prop bank

3.9 - predicate argument structure and semantic role labeling

3.8 - Word sense systems - Semi Supervised systems

3.7 - word sense systems - unsupervised system

3.6 - word sense systems - Supervised systems

3.3 - Entity and event resolution, predicate argument structure and meaning representation

3.5 - word sense systems - rule based or knowledge based systems

3.4 - System paradigms

3.2 - Structural Ambiguity

3.1 - Semantic parsing introduction and semantic interpretation

1.2 - Evolutionary COMPUTING

1.4 - Soft computing methods

1.1 - Introduction to soft computing

2.9 - Models for ambiguity resolution in parsing

1.3 - Hard computing vs soft computing

1.29 - WHAT IS NFA | non deterministic finite automata

1.30 - Difference between DFA and NFA | deterministic finite automata and non deterministic Finite A

1.28 - DFA which accepts strings starting and ending with same symbol

1.27 - Design DFA that accepts language L={awa}|| wE(a+b)*

1.26 - DFA of language with all strings starts with a and ends with b

2.8 - Minimum spinning tree in nlp

2.5 - Representation of syntactic structure in nlp

2.7 - Parsing algorithms|| CKY algorithm || Hypergraph and chart parsing regex parser

2.6 - Shift reduce parser || parsing algorithms

2.4 - parts of sppech (POS) Tagging

2.3 - stop words, correcting words and stemming and lemmatization in nlp

2.2 - a data driven approach to syntax

2.1 - Introduction - what is syntax and parsing

1.25 - Design DFA to accept all binary strings which are divisible by 5

1.24 - Design DFA to accept all binary strings which are divisible by 4

1.23 - DFA for number of a's are divisible by 3

1.22 - Design DFA to accept all binary strings which are divisible by 3

1.21 - Design a DFA for strings with 3 consecutive 0's|| without 3 consecutive 0's || a's || b's

1.20 - DFA Examples 17 & 18 set of all strings starts with 1 and ends with 0

1.19 - DFA EXAMPLES 16 || set of all strings containing the sub string ab or ba || substring 01or10

1.18 - DFA EXAMPLES 15 || set of all strings with even no of a's and even no of b's || ODD

1.16 - DFA EXAMPLES 14 || set of all strings not containing the sub string aab

1.17 - DFA for atmost 2 a's || atmost 3 a's

1.15 - DFA EXAMPLESS 12 & 13 & set of all strings with at least one a || with atleast two a's