Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
5 views

Program Distribution List

Uploaded by

pagalbaba.ji2000
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Program Distribution List

Uploaded by

pagalbaba.ji2000
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 8

Shambhunath Institute of Engineering & Technology

Department of Computer Science & Engineering


Lecture Plan
Name of Course B. Tech
AKTU Course Code BCS 351
Branch CS
Semester 2nd
Section ALL(CS1,CS2,CS3)
Total Number of Students 195
Name of Faculty VAIBHAV TRIPATHI

Number of Lab Proposed 22

No. of
S.No Topic Labs/Date

Implementing Sorting Techniques:


A. bubble Sort,
B. Insertion Sort,
1 C. Selection Sort, 1st Lab/
D. Shell ,
E. Sort,
F. Radix Sort,
G. Quick sort
Implementing Searching and Hashing Techniques: Linear
search, Binary search, Methods for Hashing:
2 Modulo Division, Digit Extraction, Fold shift, Fold Boundary, LAB3
Linear Probe for Collision Resolution.
Direct and Subtraction hashing
Implementing Stacks: Array implementation, Linked List
3 implementation, Evaluation of postfix LAB3
expression and balancing of parenthesis , Conversion of infix
notation to postfix notation
Implementing Queue: Linked List implementation of ordinary
4 queue, Array implementation of circular LAB2
queue, Linked List implementation of priority queue, Double
ended queue
Implementing Linked List: Singly Linked Lists, Circular Linked
List, Doubly Linked Lists : Insert, Display,
5 a) Delete, Search, Count, Reverse(SLL), Polynomial , Addition ,
Comparative study of arrays and linked list LAB4
b)

Implementing Trees: Binary search tree : Create, Recursive


traversal: preorder, post order, in order,
6 Search Largest , Node, Smallest Node, Count number of nodes,
Heap: Min Heap, Max Heap: reheap Up,
reheap Down, Delete , Expression Tree, Heapsort LAB4
7 Implementing Graphs: Represent a graph using the Adjacency LAB3
Matrix, BFS, Find the minimum
spanning tree (using any method Kruskal’s Algorithm or Prim’s
Algorithm) Self Learning Topics :
Shortest Path Algorithm

Shambhunath Institute of Engineering & Technology


Department of Computer Science & Engineering
Lecture Plan

Name of Course B. Tech


AKTU Course Code BCS 353
Branch CS
Semester 2nd
Section ALL(CS1,CS2,CS3)
Total Number of Students 195
Name of Faculty VAIBHAV TRIPATHI

Number of Lab Proposed 24

No. of
S.No Topic
Labs

1 LAB6
2 4
3 2
4 3
5 2
6 3
7 2
8 3
9 2
10 3

Shambhunath Institute of Engineering & Technology


Department of Computer Science & Engineering
Lecture Plan

Name of Course B. Tech


AKTU Course Code BCS 451
Branch CS
Semester 2nd
Section ALL(CS1,CS2,CS3)
Total Number of Students 195
Name of Faculty VAIBHAV TRIPATHI

Number of Lab Proposed 23


No. of
S.No Topic
Labs

Study of hardware and software requirements of different


1 operating systems (UNIX,LINUX,WINDOWS XP, LAB3
WINDOWS7/8

Execute various UNIX system calls for


i. Process management
2 LAB2
ii. File management
iii. Input/output Systems calls
Implement CPU Scheduling Policies:
i. SJF
3 ii. Priority LAB2
iii. FCFS
iv. Multi-level Queue
Implement file storage allocation technique:
i. Contiguous(using array)
4 LAB2
ii. Linked –list(using linked-list)
iii. Indirect allocation (indexing)
Implementation of contiguous allocation techniques:
i. Worst-Fit
5
ii. Best- Fit
iii. First- Fit
LAB2
Calculation of external and internal fragmentation
i. Free space list of blocks from system 6
ii. List process file from the system LAB2

Implementation of compaction for the continually changing


6 memory layout and calculate total movement
of data

LAB1
7 Implementation of resource allocation graph RAG)

8 Implementation of Banker‟s algorithm LAB1

Conversion of resource allocation graph (RAG) to wait for


9 graph (WFG) for each type of method used for LAB2
storing graph.

Implement the solution for Bounded Buffer (producer-


10 consumer)problem using inter process LAB3
communication techniques-Semaphores

Implement the solutions for Readers-Writers problem using


11 inter process communication technique - LAB3
Semaphore
Shambhunath Institute of Engineering & Technology
Department of Computer Science & Engineering
Lecture Plan

Name of Course B. Tech


AKTU Course Code BCS 452
Branch CS
Semester 2nd
Section ALL(CS1,CS2,CS3)
Total Number of Students 195
Name of Faculty VAIBHAV TRIPATHI

Number of Lab Proposed 20

No. of
S.No Topic
Labs

Use Java compiler and eclipse platform to write and execute


1 LAB2
java program.

2 Creating simple java programs using command line arguments LAB1


3 Understand OOP concepts and basics of Java programming. LAB3

4 Create Java programs using inheritance and polymorphism. LAB2

Implement error-handling techniques using exception handling


5 LAB2
and multithreading.

6 Create java program with the use of java packages. LAB2

7 Construct java program using Java I/O package. LAB2

Create industry oriented application using Spring Framework.


8 LAB2

9 Test RESTful web services using Spring Boot. LAB3

10 Test Frontend web application with Spring Boo t LAB3


Shambhunath Institute of Engineering & Technology
Department of Computer Science & Engineering
Lecture Plan

Name of Course B. Tech


AKTU Course Code BCS 453
Branch CS
Semester 2nd
Section ALL(CS1,CS2,CS3)
Total Number of Students 195
Name of Faculty VAIBHAV TRIPATHI

Number of Lab Proposed 22

Module 1: Packet Analysis using Wire shark

No. of
S.No Topic
Labs

Basic Packet Inspection: Capture network traffic using Wire


shark and analyze basic protocols like
1 HTTP, DNS, and SMTP to understand how data is transmitted LAB3
and received.
Detecting Suspicious Activity: Analyze network traffic to
identify suspicious patterns, such as repeated
2 connection attempts or unusual communication between LAB2

hosts.

Malware Traffic Analysis: Analyze captured traffic to identify


3 signs of malware communication, such as LAB2
command-and-control traffic or data infiltration.
Password Sniffing: Simulate a scenario where a password is
transmitted in plaintext. Use Wireshark to
4 capture and analyze the packets to demonstrate the LAB2

vulnerability and the importance of encryption.


ARP Poisoning Attack: Set up an ARP poisoning attack using
tools like Ettercap. Analyze the captured
5 packets to understand how the attack can lead to a Man-in- LAB2

the-Middle scenario.

Module 2: Web Application Security using DVWA

No. of
S.No Topic
Labs

SQL Injection: Use DVWA to practice SQL injection attacks.


Demonstrate how an attacker can
1 manipulate input fields to extract, modify, or delete database LAB3
information.
Cross-Site Scripting (XSS): Exploit XSS vulnerabilities in DVWA
to inject malicious scripts into web pages.
2 Show the potential impact of XSS attacks, such as stealing LAB2

cookies or defacing websites.


Cross-Site Request Forgery (CSRF): Set up a CSRF attack in
DVWA to demonstrate how attackers can
3 manipulate authenticated users into performing unintended LAB2

actions.
File Inclusion Vulnerabilities: Explore remote and local file
inclusion vulnerabilities in DVWA. Show how
4 attackers can include malicious files on a server and execute LAB2

arbitrary code.
Brute-Force and Dictionary Attacks: Use DVWA to simulate
login pages and demonstrate brute-force
5 and dictionary attacks against weak passwords. Emphasize LAB2

the importance of strong password policies.

You might also like