diff --git a/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/Regular Expression.md b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/Regular Expression.md
new file mode 100644
index 0000000..db7a778
--- /dev/null
+++ b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/Regular Expression.md	
@@ -0,0 +1,24 @@
+# Regular Expression-Defenition
+A Regular Expression are useful for representing certain sets of strings in algebraic fashion. It 
+describes the language accepted by FSA.Regular expressions are a notation system for regular 
+languages.
+Regular expressions have become a standard tool to describe patterns of strings in such programs as 
+editors or search algorithms.
+
+# A Regular Expression can be recursively defined as follows −
+
+1)ε is a Regular Expression indicates the language containing an empty string. (L (ε) = {ε})
+2)φ is a Regular Expression denoting an empty language. (L (φ) = { })
+3)a is a Regular Expression where L = {a}
+If X is a Regular Expression denoting the language L(X) and Y is a Regular Expression denoting the language L(Y), then
+a)X + Y is a Regular Expression corresponding to the language L(X) ∪ L(Y) where L(X+Y) = L(X) ∪ L(Y).
+b)X . Y is a Regular Expression corresponding to the language L(X) . L(Y) where L(X.Y) = L(X) . L(Y)
+c)R* is a Regular Expression corresponding to the language L(R*)where L(R*) = (L(R))*
+If we apply any of the rules several times from 1 to 5, they are Regular Expressions
+
+# Regular Grammar : 
+A grammar is regular if it has rules of form A -> a or A -> aB or A -> ɛ where ɛ is a special 
+symbol called NULL.
+
+# Regular Languages : 
+A language is regular if it can be expressed in terms of regular expression.
\ No newline at end of file
diff --git a/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/SUMMARY.md b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/SUMMARY.md
new file mode 100644
index 0000000..a79c5d2
--- /dev/null
+++ b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST301/SUMMARY.md
@@ -0,0 +1,8 @@
+# cst301
+# Formal languages and Automated Theory
+
+# Module 1 :Introduction to Formal Languages and Regular Languages
+# Module 2 :More on Regular Languages
+# Module 3 :Myhill-Nerode Relations and Context Free Grammar
+# Module 4 :More on context-free languages
+# Module 5 :Context Sensitive Languages,Turing Machine
\ No newline at end of file
diff --git a/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST303/SUMMARY.md b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST303/SUMMARY.md
new file mode 100644
index 0000000..809dc8d
--- /dev/null
+++ b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST303/SUMMARY.md
@@ -0,0 +1,8 @@
+# CST303
+# COMPUTER NETWORKS
+
+# Module 1 :Introduction and physical layer
+# Module 2 :Data Link Layer
+# Module 3 :Network Layer
+# Module 4 :Network Layer in the Internet
+# Module 5 :Transport Layer and Application Layer
\ No newline at end of file
diff --git a/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST305/SUMMARY.md b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST305/SUMMARY.md
new file mode 100644
index 0000000..9694b66
--- /dev/null
+++ b/src/WikiSyllabus/KTU/2019_Scheme/S5/CSE/CST305/SUMMARY.md
@@ -0,0 +1,8 @@
+# CST305
+# SYSTEM SOFTWARE
+
+# Module 1: Introduction
+# Module 2: Assembly Language Programming and Assembling
+# Module 3: Assembler Features and Designer Options
+# Module 4: Loader and Linker
+# Module 5: Macro processor,Device driver,Text editor and Debugger
\ No newline at end of file