8th Semester Editted Cse & Cse-leet-1.docx

a

SCHEME OF STUDY &SYLLABI BE CSE Batch 2015 – 2019 & 2016-19 (LEET) (With Specializations)

SCHEME (B.E. CSE& CSE-LEET) Batch 2015 – 2019 & 2016-19 (LEET) 8th Semester /4th year

S.NO

SUBJECT CODE

SUBJECT NAME

Hours Per Week L

T

P

Marks

Credits

INT EXT Total

1

CS*-4**

ELECTIVE-III

3

0

0

40

60

100

3

2

CS*-4**

ELECTIVE-IV

3

0

0

40

60

100

3

3

CS*-4**

ELECTIVE-III LAB

0

0

2

60

40

100

1

4

CS*-4**

ELECTIVE-IV LAB

0

0

2

60

40

100

1

5

CST-471

TECHNICAL TRAINING

0

2

0

40

60

100

1

6

CSR-472

PROJECT

0

0

1

60

40

100

4

7

UCY-497 (MNG)

Life skill development and Mentoring-4

0

1

0

00

00

00

0.5

6

3

5

Total

13

SCHEME (B.E. CSE& CSE-LEET) Batch 2015 – 2019 & 2016-19 (LEET) (Information Security) 8th Semester/4th year

SUBJECT CODE

SUBJECT NAME

1

CSC-481

2

S.NO

Hours Per Week

Marks

Credits

L

T

P

Web Service Security

3

0

0

40

60

100

3

CSC-483

Securing Windows and Linux

3

0

0

40

60

100

3

3

CSC-485

Web Service Security Lab

0

0

2

60

40

100

1

4

CSC-487

Securing Windows and Linux Lab

0

0

2

60

40

100

1

5

CST-471

Technical Training

0

2

0

40

60

100

1

6

CSR-472

Project

0

0

1

60

40

100

4

7

UCY-497 (MNG)

Life skill development and Mentoring-4

0

1

0

00

00

00

0.5

6

3

5

Total

S.NO

SUBJECT CODE

INT EXT Total

13

SCHEME (B.E. CSE& CSE-LEET) Batch 2015 – 2019 & 2016-19 (LEET) (Computational Intelligence) 8th Semester/4th year Hours Per Week SUBJECT NAME L

T

P

Marks

Credits

INT EXT Total

1

CSA-462

Genetic Algorithm

3

0

0

40

60

100

3

2

CSA-463

Information Retrieval

3

0

0

40

60

100

3

3

CSA-466

Genetic Algorithm Lab

0

0

2

60

40

100

1

4

CSA-467

Information Retrieval Lab

0

0

2

60

40

100

1

5

CST-471

Technical Training

0

2

0

40

60

100

1

6

CSR-472

Project

0

0

1

60

40

100

4

7

UCY-497 (MNG)

Life skill development and Mentoring-4

0

1

0

00

00

00

0.5

6

3

5

Total

13

ELECTIVES-Information Security Electives

Subject Code

Subject Name

CSC- 481

Web Service Security

CSC -482

Mobile Application & Security

CSC-483

Securing Windows and Linux

CSC-484

Big Data

CSC-485

Web Service Security Lab

CSC-486

Mobile Application & Security Lab

CSC-487

Securing Windows and Linux Lab

CSC-488

Big Data Lab

Elective III-IV

ELECTIVES-Computational Intelligence Electives

Subject Code

Subject Name

CSA -461

Real Time Systems

CSA -462

Genetic Algorithm

CSA -463

Information Retrieval

CSA -464

High Performance Computing Architecture

CSA-465

Real Time Systems Lab

CSA-466

Genetic Algorithm Lab

CSA-467

Information Retrieval Lab

CSA-468

High Performance Computing Architecture Lab

Elective III-IV

CHANDIGARH UNIVERSITY, GHARUAN Web Service Security (CSC-481) L T P Credit 3 00 - 3 Total Hours: 48 Course Objectives:

  

 To recognize how Web application risks apply to Web Services, including SOAP and REST Authentication, Authorization, and Auditing.   To recognize specific Web Services and XML attack patterns.   To recognize the benefits of using static analysis in Web Services.   To recognize the key security issues in SOA and Web Services.  UNIT-I

Introduction to Web Service Technologies: Introduction to web services, Security for WebServices and Security Goals, Need of security and Privacy in web services, applications of web service security, SOA and Web Services Principles, Web Services Architecture, Web Services Technologies and Standards, SOAP, Web Services Description Language (WSDL), Service Discovery: Universal Description, Discovery, and Integration (UDDI) Considerations Web Services Infrastructure. [14] UNIT-II Web Services Threats, Vulnerabilities, and Countermeasures: Threats and Vulnerabilities, Threat Modeling, Vulnerability Categorizations and Catalogs, Threat and Vulnerabilities Metrics. [6] Standards for Web Services Security: The Concept of Standard Web Services Security,Standards Framework, An Overview of Current Standards, XML Data Security ,Security Assertions Markup Language (SAML), SOAP Message Security, Key and Trust Management standards, Standards for Policy Specification, Access Control Policy Standards, Implementations of Web Services Security Standards. [12] UNIT-III Digital Identity Management and Trust Negotiation: Overview of Digital IdentityManagement, Overview of Existing Proposals Liberty Alliance, WS-Federation, Comparison of Liberty Alliance and WS-Framework, Other Digital Identity Management Initiatives, Discussion on Security of Identity Management Systems, Business Processes. [8]

Access Control for Web Services: Approaches to Enforce Access Control for Web Services,WS-AC: An Adaptive Access Control Model for Stateless, Web Services, The WS-AC Model, WS-AC Identity Attribute Negotiation, WS-AC Parameter Negotiation. [8] Text Books: 1. Elisa Bertino, Lorenzo D. Martino, Federica Paci, Anna C. Squicciarini, “Security for Web Services and Service Oriented Architectures”, Springer Science, 2009.

Instructions for paper setter: The syllabus has been divided into three equal units. The paper setter is required to set Ten questions in all, three questions from each unit and a compulsory question consisting of five sub parts and based on the whole syllabus. The candidate will be required to attempt six questions including the compulsory question number no 1 and not more than two questions from each unit.

CHANDIGARH UNIVERSITY, GHARUAN Securing Windows and Linux (CSC-483) L T P Credit 300- 3 Total Hours: 48 Course Objectives:



 To use security risk assessments to identify security requirements and to select controls for systems.   To use cryptographic controls to protect your information. 

UNIT-I Introduction to General Security Concepts: Principles of Information Security, InformationSecurity Standards, Regulations, and Compliance, Authentication, Authorization, and Accounting (AAA). [8] Cryptography: Basic Cryptography Concepts, PKI Concepts, Implementing PKI and Certificate Management. [6] UNIT-II Network Security: General Network Concepts and Vulnerabilities, Network Services andNetwork Devices, Internet Security and Vulnerabilities, Network Security Tools and Devices.[8] Application Security: HTTP Security, Electronic Mail, Samba Security.

[3]

System Security: General System Security Threats, Hardware and Peripheral Devices, OS andApplication Security, Virtualization, System-Based Security Applications, Understanding Linux Security, System Monitoring and Auditing. [8] UNIT-III Organizational and Operational Security: Physical Security Concepts and Vulnerabilities,Policies and Procedures, Risk Analysis, Business Continuity and Disaster Recovery, Network layer firewalls, transport layer firewalls, application layer firewalls. [8] Security Assessments and Audits: Vulnerability Assessments and Testing, Monitoring, Logging and Auditing.

[4]

Remote Access and Authentication: Virtual Private Networking, Strong User au th en tic ati on .[3 ] Text Books: 1. Derrick Rountree ,”Security for Microsoft Windows System Administrators, Introduction to key Information Security concepts”, Elsevier. 2. Ramón J. Hontanon, Sybex, ”Linux Security”, ISBN: 0-7821-2741-X. 3. Daniel J. Barrett, Richard E. Silverman, Robert G. Byrnes,” Linux Security Cookbook,” O'Reilly, ISBN: 0-596-00391-9. Instructions for paper setter: The syllabus has been divided into three equal units. The paper setter is required to set Ten questions in all, three questions from each unit and a compulsory question consisting of five sub parts and based on the whole syllabus. The candidate will be required to attempt six questions including the compulsory question number no 1 and not more than two questions from each unit.

CHANDIGARH UNIVERSITY, GHARUAN Genetic Algorithms (CSA-462) L T P Credits 3 0 0- 3 Total Hours:48 Course Objectives:   Concepts of Genetic Algorithms and its applications    Genetic Operators and modeling    Applications of Genetic Algorithms   Genetic Based Machine Learning  UNIT-I Introduction To Genetic Algorithm: Introduction to Genetic Algorithm – History – Basicconcepts – Creation of Off-springs – Working principle - Encoding – binary encoding – octal encoding – hexadecimal encoding – permutation encoding- value encoding – tree encoding – fitness function. [8] GA OPERATORS :Reproduction- Roulette-wheel Selection – Boltzmann Selection – Tournament Selection-Rank Selection – Steady –state selection – Elitism – generation gap and steady-state selection - Inheritance operators - Crossover- Single-point crossover – Two-point cross over – Multi-point cross over – Uniform Cross over – Matrix Cross Over – Cross Over rate - Mutation operators – mutation – mutation rate. [8] UNIT-II Genetic Modeling: Inversion and deletion : Inversion – deletion and duplication - deletion andregeneration – segregation – cross over and inversion – Bit-wise operators – one’s complement operator – logical bit-wise operators – shift operators – bit-wise operators used in GA – generational cycle – convergence of GA - Differences and Similarities between GA and Other Traditional Methods . [8] Applications of GA : The rise of GA – GA application of Historical Interaction. – Dejung &Function optimization – Current applications of GA -Techniques in genetic search Dominance, Diploidy & abeyance –Niche & Speciation – Multi objective optimization – Knowledge-Based Techniques. – GA & parallel processes- Real Life Problem. [8] UNIT-III Genetics-Based Machine Learning: Genetics – Based Machined learning – Classifier system – Rule & Message system – Apportionment of credit: The bucket brigade – Genetic Algorithm – A simple classifier system in Pascal. – Results using the simple classifier system-The Rise of

GBMC – Development of CS-1, the first classifier system. – Smitch’s Poker player–Current Applications. [16] Text books 1. David E. Goldberg, “Genetic Algorithms in Search, Optimization & Machine Learning”, Pearson Education, 2001. 2. S.Rajasekaran, G.A.Vijayalakshmi Pai, “ Neural Networks, Fuzzy Logic and Genetic Algorithms”, Pearson Education , 2003. Reference Book 1. Kalyanmoy Deb ,”Optimization for Engineering Design , Algorithms and examples” PHI 1995. Instructions for paper setter: The syllabus has been divided into three equal units. The paper setter is required to set Ten questions in all, three questions from each unit and a compulsory question consisting of five sub parts and based on the whole syllabus. The candidate will be required to attempt six questions including the compulsory question number no 1 and not more than two questions from each unit.

CHANDIGARH UNIVERSITY, GHARUAN Information Retrieval (CSA-463) L T P Credits 3 0 0- 3 Course Objectives:   Information retrieval techniques    Web Crawling techniques and page ranking   Index construction and sorting 

UNIT I Introduction : Introduction to Information Retrieval. Inverted indices and boolean queries.Query optimization. The nature of unstructured and semi-structured text. [4] The term vocabulary and postings lists: Text encoding: tokenization, stemming,lemmatization, stop words, phrases. Optimizing indices with skip lists. Proximity and phrase queries. Positional indices. [6] Dictionaries and tolerant retrieval: Dictionary data structures. Wild-card queries, permutermindices, n-gram indices. Spelling correction and synonyms: edit distance, soundex, language detection. [6] UNIT II Index construction: Postings size estimation, sort-based indexing, dynamic indexing, positionalindexes, n-gram indexes, distributed indexing, real-world issues. [8] Scoring : Term weighting and the vector space model. Parametric or fielded search. Documentzones. The vector space retrieval model. tf.idf weighting. The cosine measure. Scoring documents. [8] UNIT III Computing scores in a complete search system: Components of an IR system. Efficient vectorspace scoring. Nearest neighbor techniques, reduced dimensionality approximations, random projection. [5] Classification: Naive Bayes models. Spam filtering, K Nearest Neighbors, Decision Trees,Support vector machine classifiers. [4]

Web Crawling What makes the web different? Web search overview, web structure, the user, paid placement, search engine optimization. Web size measurement, Crawling and web indexes. Near-duplicate detection, Link analysis, Learning to rank, focused web crawler & its different architectures. [7] Text Books: 1. C. Manning, P. Raghavan, and H. Schütze , Introduction to Information Retrieval, Cambridge University Press,2008 Reference Books: 1. R. Baeza-Yates, B. Ribeiro-Neto Modern Information Retrieval, Addison-Wesley, 1999 Reference Books: Instructions for paper setter: The syllabus has been divided into three equal units. The paper setter is required to set Ten questions in all, three questions from each unit and a compulsory question consisting of five sub parts and based on the whole syllabus. The candidate will be required to attempt six questions including the compulsory question number no 1 and not more than two questions from each unit.

Chandigarh University, Gharuan Web Service Security Lab Subject Code

Total Contact Hours : 45 Hours

CSC- 485

Common to all Specializations of CSE 4th Year

L

T

P

C

0

0

2

1

Prerequisite: Knowledge to secure our websites from intruders. Marks-100 Internal-60

External-40

Course Objectives

  Unit

o To recognize how Web application risks apply to Web Services, including SOAP and REST Authentication, Authorization, and Auditing.  o To recognize specific Web Services and XML attack patterns.  o To recognize the benefits of using static analysis in Web Services.  o To recognize the key security issues in SOA and Web Services. Course Outcome

Understood about the working of web services, WSDL, UDDI, HTTP, etc. Learn how to secure web based and window applications. Learn how to create and use digital certificates, keys and identity.

List of Experiments UNIT I 1. Write a program to implement WSDL Service (HelloService.WSDL File) 2.Write a program to implement business UDDI Registry entry 3.Write a program the service provider can be implement a single get price (), static bind () and get product operation. 4. Write a program to implement to create a simple web service that converts the temperature from Fahrenheit to Celsius (using HTTP Post Protocol) UNIT-II

5. Write a program to implement Web based service consumer. 6. Write a program to implement the operation can receive request and will return a response in two ways. a) One-Way operation b) Request – Response 7. Write a program to implement Windows application based web service consumer. UNIT III 8. Write a program to generate the public and private key for sender and receiver.

9. Write a program to identify website’s identity. 10. Write a program to generating digital certificates.

Course Code

Web Service Security Lab CSC-485 Department Teaching the Subject Program Outcome

Department of Computer Science and Engineering a

b

c

d

E

F

G

h

I

j

k

Mapping of Course outcome with Program outcome BS

ES

PD

PC

PE

OE

Category

Approval

Date of meeting of the Board of Studies

Project/Training

Chandigarh University, Gharuan Securing Windows and Linux Lab Subject Code

Total Contact Hours : 45 Hours

CSC- 487

Common to all Specializations of CSE 4th Year

L

T

P

C

0

0

2

1

Prerequisite: Basic Knowledge of Security concepts of Windows/Linux Marks-100 Internal-60

External-40

Course Objectives

·To use the security risk assessments to identify security requirements and to select controls for systems. ·To use cryptographic controls to protect your information. Unit

Course Outcome

Knowledge about security threats, vulnerabilities and attacks and Familiarization with VI editor and security of windows/website. Knowledge about vulnerabilities. Understand Linux and windows configurations.

List of Experiments UNIT I 1. Installation Process of Windows and Linux. 2. Knowledge about the CA server Using Certificates and SSL in windows. 3. Familiarization with the VI editor. 4. Familiarization with the Windows Client Configuration.

UNIT-II 5. To research the Various System Vulnerabilities for the target machine (Internet access CVE database of vulnerabilities) 6. Various GUI-Based Vulnerability Scanners to check for Vulnerabilities a-- NeWT - Using a Vulnerability Scanner in Windows. 7. How to Install Samba Server in Linux.

UNIT III 8. Familiarization with the Name Resolution in Windows. 9. Understanding the Linux Client Configuration. 10. Write a shell script that displays a list of all the files in the current directory to which the user has read, write and execute permissions.

Course Code

Securing Windows and Linux Lab CSC-487 Department Teaching the Subject Program Outcome

Department of Computer Science and Engineering a

b

c

d

E

F

G

h

I

j

k

Mapping of Course outcome with Program outcome BS

ES

PD

PC

PE

OE

Category

Approval

Date of meeting of the Board of Studies

Project/Training

Chandigarh University, Gharuan Genetic Algorithm Lab Subject Code

Total Contact Hours : 45 Hours

CSA- 466

Common to all Specializations of CSE 4th Year

L

T

P

C

0

0

2

1

Prerequisite: Basic Knowledge of MATLAB Marks-100 Internal-60

External-40

Course Objectives   Unit

To use GA operators for solving the problems based on functions. To use Applications of Genetic Algorithm for LCS. Course Outcome Knowledge of various Operators of Genetic Algorithm and Introduction to Genetic Algorithm

and GA Operators Genetic Modeling and Applications of GA Genetic Based Machine Learning List of Experiments UNIT I 1.Write a MATLAB program to plot a few activation functions that are being used in Genetic Algorithm. 2. Study and analysis of Genetic Algorithm life cycle. 3. Illustrate different types of generalized bell membership functions using Matlab program. 4.Using Matlab program find the crisp lambda cut set relations for λ = 0.2, the fuzzy matrix is given by R= 0.2

0.7

0.8

1

1

0.9

0.5

0.1

0

0.8

1

0.6

0.

0.4

1

0.3

. UNIT-II 5.Write a MATLAB program for Bit-wise Operators. 6. Write a MATLAB program to show Multi objective optimization in Genetic Algorithm. 7. Write a MATLAB program to show Classifier system. UNIT III 8.Write a Matlab program (m.file) to calculate union, intersection, complement of two fuzzy sets

9. Write a MATLAB program to recognize the number 0, 1, 2, 39. A5*3 matrix forms the numbers. For any valid point it is taken as 1 and invalid point it is taken as 0. The net has to be trained to recognize all the numbers using The Bucket Brigade. 10. Write a MATLAB program to illustrate Smitch’s Poker player application.

Course Code

Genetic Algorithm Lab CSA-466 Department Teaching the Subject Program Outcome

Department of Computer Science and Engineering a

b

c

d

E

f

g

h

i

j

K

Mapping of Course outcome with Program outcome BS

ES

PD

PC

PE

OE

Category

Approval

Date of meeting of the Board of Studies

Project/Training

Chandigarh University, Gharuan Information Retrieval Lab Subject Code

Total Contact Hours : 45 Hours

CSA- 467

Common to all Specializations of CSE 4th Year

L

T

P

C

0

0

2

1

Prerequisite: Marks-100 Internal-60

External-40

Course Objectives

 

Web Crawling techniques and page ranking  Information retrieval techniques 

Unit

Course Outcome Study of Weka mining tool GUI Explorer reduced error Pruning

List of Experiments UNIT I 1.To list all the categorical (or nominal) attributes and the real valued attributes using Weka mining tool 2.To identify the rules with some of the important attributes by a) manually and b) Using Weka 3. To create a Decision tree by training data set using Weka mining tool. 4.To find the percentage of examples that is classified correctly by using the above

created decision tree model i.e. testing on the training set. UNIT-II 5.To create a Decision tree by cross validation training data set using Weka mining tool. 6.Delete one attribute from GUI Explorer and see the effect using Weka mining tool.

.

7.Select some attributes from GUI Explorer and perform classification and see the effect using Weka mining tool.

UNIT III 8.To create a Decision tree by cross validation training data set by changing the cost matrix in Weka mining tool. 9.To create a Decision tree by using Prune mode and reduced error Pruning and show accuracy for cross validation trained data set using Weka mining tool. 10.To compare OneR classifier which uses single attribute and rule with J48 and PART classifier’s, by training data set using Weka mining tool.

Course Code

Information Retrieval Lab CSA-467 Department Teaching the Subject Program Outcome

Department of Computer Science and Engineering a

b

c

d

E

f

g

h

i

j

K

Mapping of Course outcome with Program outcome BS

ES

PD

PC

PE

OE

Category

Approval

Date of meeting of the Board of Studies

Project/Training