Test-1 Syllabus CSE 6th sem

Artificial Intelligence:


COI1:-

Predicates 

Variables

Rules



COI2:-

Input and Output

Arithmetic operations

Cut & Fail predicates



COI3:-

Recursion

String operations

Lists

------------------------------------------------------------------------------------------------------------------------------------------------



Automata Theory and Formal Languages:




DFA  (COI-1):-

1.Definition

2.Examples




NFA & NFA with ∈ Transitions(COI-2):-

1.Definition

2.Examples






Theorms (COI-3):-

1.Equivalence of NFA with DFA

2.Equivalence of NFA with and without ∈ Transitions.

3.Problems on both theorms
--------------------------------------------------------------------------------------------------------------------------------------------------

Distributed Computing:



COI-1:-

Formal models for message passing systems

Broad cast and converge cast on a spanning tree

Flooding

Building a spanning tree

Construction of a DFS spanning tree



COI-2:-

Construction of a DFS spanning tree without a specified root 

Formal model of distributed communication system for simulations



COI-3:-

Specification of broadcast services and implementing a broadcast service

--------------------------------------------------------------------------------------------------------------------------------------------------

Advanced Employability Skills:



Correction of Sentences



Summarizing



Assertiveness



Sentence Completion



Reading Comprehension