MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION

GOVERNMENT POLYTECHNIC VIKRAMGAD

MICRO PROJECT

Academic year 2024-2025

Branch : Computer Engineering

Semester: Fifth Semester

Subject Code: 22516

Guided by: Akshay Pakhare

Group Details:

Student Name Roll No Enrollment Number

Gaurav shrikrushna patil 2113 2215470014

Omkar rahul badgire 2155 2215470024

Sanket vaijnath ghogre 21__ 2215470057

1
 MAHARASHTRA STATE BOARD
OF TECHNICAL EDUCATION.
CERTIFICATE

This is to certify, that Mr. Gaurav shrikrushna patil Roll No: 2113 of Fifth Semester
of Diploma in Computer Engineering , Government Polytechnic Vikramgad
(Code:1547) has completed the Micro Project satisfactorily in Subject- Operating
System(22516) for the Academic year 2024- 2025 as prescribed in the curriculum..

Place: Vikramgad Enrollment No:2215470014

Date: Exam Seat No.:

Subject teacher Head of the Department Principal

2
 MAHARASHTRA STATE BOARD OF
TECHNICAL EDUCATION.
CERTIFICATE

This is to certify, that Mr. Omkar rahul badgire Roll No: 2155 of Fifth Semester of
Diploma in Computer Engineering,Government Polytechnic Vikramgad (Code:1547)
has completed the Micro Project satisfactorily in Subject- Operating System(22516) for
the Academic year 2024- 2025 as prescribed in the curriculum..

Place: Vikramgad Enrollment No:2215470024

Date: Exam Seat No.:

Subject teacher Head of the Department Principal

3
 MAHARASHTRA STATE BOARD OF
TECHNICAL EDUCATION.
CERTIFICATE

This is to certify, that Mr. Sanket vaijnath ghogre Roll No 2157of Fifth Semester of
Diploma in Computer Engineering , Government Polytechnic Vikramgad (Code:1547)
has completed the Micro Project satisfactorily in Subject- Operating System(22516) for
the Academic year 2024- 2025 as prescribed in the curriculum..

Place: Vikramgad Enrollment No:2215470057

Date: Exam Seat No.:

Subject teacher Head of the Department Principal

4
 Memory Protection and Security

Memory Protection and Security is a critical concept in computer systems, aimed at ensuring the
integrity, confidentiality, and availability of data and code in memory. In this micro project, the primary
focus is on understanding and implementing mechanisms that safeguard memory from unauthorized
access, accidental overwriting, or malicious attacks.

 Here’s a brief overview of the key elements:

Memory Protection:
Memory protection involves hardware and software techniques that manage and restrict access to certain
areas of memory. This is typically achieved through mechanisms such as:

1.Virtual Memory: Divides physical memory into segments, ensuring isolation between processes.
2.Access Control: Defines permissions (read, write, execute) for different memory regions.
3.Memory Segmentation and Paging: Segments the memory into blocks to control access and minimize
interference between applications

 Security Aspects:
Memory security focuses on preventing various threats and attacks, such as:

1.Buffer Overflow: Preventing malicious code execution by restricting memory access beyond allocated
limits.
2.Heap and Stack Protections: Ensuring that dynamic memory allocation doesn’t lead to vulnerabilities.

3.Data Execution Prevention (DEP): A technique that marks certain areas of memory as non-executable
to avoid code injection.

4.Address Space Layout Randomization (ASLR): Randomizing the location of memory segments to
thwart attackers from exploiting known addresses.

5
  Features :

1.Virtual Memory Management:

Isolation of Processes: Ensures that each process runs in its own memory space, preventing accidental or
malicious access to other processes’ memory.
Memory Mapping: Uses virtual memory addresses mapped to physical memory to enhance security.

2. Access Control:
Memory Region Permissions: Defines permissions for different memory regions (read, write, execute),
ensuring only authorized actions can be performed.
User and Kernel Mode: Differentiates between user-level access and kernel-level access to protect
critical system data from unauthorized user actions.

3. Security Vulnerability Testing: Simulates attacks and demonstrates mitigation strategies.

4.Segmentation & Paging: Divides memory to manage and protect data efficiently.

5. Access Control: Sets read, write, and execute permissions for memory regions.

6. Buffer Overflow Prevention: Uses techniques like stack canaries and heap protection.

7. Data Execution Prevention (DEP):Blocks code execution from non-executable areas.

6
 Advantages:

 Enhanced Security Awareness: Understand and prevent memory-related vulnerabilities like

buffer overflows.
 Practical Security Measures: Hands-on experience with stack canaries, DEP, and ASLR in
real-world applications.

 Vulnerability Testing: Simulate and analyze security threats to observe the effectiveness of
protection techniques.

 Real-time Threat Mitigation: Prevent attacks using memory protections like DEP and stack
canaries.

7
 Disadvantages:

 Performance Overhead: Memory protection mechanisms like ASLR and DEP can slow down
system performance due to additional checks.

 Increased Complexity: Implementing and debugging security features like stack canaries can be
complex, especially for beginners.

 Compatibility Issues: Some older software or systems may not support modern protection
techniques, causing integration challenges.

 False Positives: : Security mechanisms may sometimes flag legitimate actions as threats, leading
to unnecessary disruptions.

 Resource Consumption: Memory protection features may increase memory and CPU usage,
reducing system efficiency.

8
  Conclusion :

The Memory Protection and Security project underscores the importance of safeguarding memory
against vulnerabilities like buffer overflows. By implementing techniques such as stack canaries, Data
Execution Prevention (DEP), and Address Space Layout Randomization (ASLR), the project illustrates
effective methods for enhancing application security.

While challenges such as increased complexity and potential performance overhead exist, the
advantages of robust memory protection significantly outweigh these drawbacks. This project serves as
a valuable educational resource, equipping developers with essential skills to protect applications from
memory-based exploits and improve overall software security.

9
 Tree Structured Directory:

A tree-structured directory is a hierarchical file organization system in which files and folders are
arranged in a tree-like structure, starting from a single root directory. Each directory can contain
subdirectories and files, forming branches that lead to leaves, which are the individual files. This
structure allows for efficient storage, retrieval, and management of files, enabling users to navigate
through directories using pathnames that reflect the hierarchical relationships.

A tree is the most common and popular directory structure. It is very useful because it solves the
problem of grouping. It can group different users or directories. The tree has a root directory and every
file in the system has a unique path name. A directory contains a set of files or sub directories. All
directories have the same internal organization . One bit in each directory entry defines the entry as a file
or as a subdirectory. These subdirectories further may have files or again some directories. Each process
has a current directory. This helps users to organize their data in a particular and efficient manner. Path
describes where exactly that file or directory is stored. Path names can be of two types absolute and
relative.

An absolute path name begins at the root and follows a path down to the specified file giving the
directory names on the path. A relative path name defines a path from the current directory.

The important issue is how to delete a file directory if it already contains subdirectory or may be files.
Some O.S. directly allows deleting this type of directory, But other O.S do not allow the same thing. If a
directory is empty, its entry in the directory can simply be deleted. If the directory to be deleted is not
empty, the none of the two approaches can be done. User must first delete all the files and sub
directories in that directory. If a request is made to delete a directory, the entire directory's files and

10
subdirectories are also to be deleted.

 Specifications :

1.Hierarchy: The directory structure starts from a root directory and branches out into subdirectories,
much like a family tree.

2. Nodes and Leaves:

Root Node: The top-level directory (often called the root).
Branches: Subdirectories that can contain other directories or files.
Leaves: The final nodes in the structure, which contain files.

3. Path Representation: Each file or directory can be uniquely identified by its path, which indicates
the sequence of directories leading to it (e.g., /home/user/documents/file.txt).

4.Organization: This structure allows for organized storage of files, making it easier to manage and
locate them.

5.Scalability: Tree structures can grow dynamically as more directories and files are added, without a
significant loss in performance.

6.Common Usage: Tree-structured directories are commonly used in operating systems (like
UNIX/Linux, Windows) and file management systems.

11
  Key Components of a Tree Structure Directory:

 Root Directory: The top-most directory in the tree. In Unix/Linux systems, the root directory is
represented by a single slash (/). In Windows systems, each drive (like C:\) has its own root.

 Subdirectories: These are directories within other directories. A directory can contain files or
other subdirectories. Subdirectories can be nested to any depth, allowing for a detailed, organized
system.

 Leaf Nodes (Files): Files are the end points in the tree structure. They do not have children.
Each file is uniquely identified by its path, which includes all parent directories from the root
to the file itself.

 Parent-Child Relationship: Every directory or file (except the root) has a parent, which is the
directory immediately above it in the hierarchy.The "child" is the directory or file within a parent
directory.

12
Daigram :

13
 Advantages :

 Organized File System: It helps keep files systematically arranged and easy to navigate.

 Efficient Search: Files can be located easily based on their position in the hierarchy.

 Hierarchical organization: Files are arranged logically for easy categorization and navigation.

 Efficient file management: Simple structure allows scalable and organized file placement.

 Avoids naming conflicts: Unique file paths prevent duplicate names in different directories.

 Granular access control: Permissions can be set at various levels of the directory tree.

 Efficient search: Structured grouping reduces search time by narrowing search scopes.

 Readable paths: Intuitive file paths make it easy to locate files.

 Modularity and flexibility: Organizes projects into separate, modular branches.

 Simplified backup/restore: Allows easy backup and selective restoration of directories.

14
 Disadvantages :

 Complexity: As the structure grows, it can become complex and difficult to manage.

 Long paths: Deeply nested directories can lead to long, cumbersome file paths.

 Navigation difficulty: Moving through multiple levels to find files can be time-consuming.

 Redundancy: Duplicating similar files across branches can lead to wasted space.

 Permission inheritance issues: Incorrect permission settings at higher levels may affect
subdirectories unintentionally.

 File location ambiguity: Users might forget where a specific file is stored within a large
directory tree.

 Performance overhead: Traversing deep directory trees can slow down file access operations.

 Rigid structure: Difficult to reorganize or restructure without affecting existing files and paths.

15
  Conclusion :

In conclusion, a tree-structured directory offers a logical and hierarchical way to organize files,
making it easier to manage, categorize, and navigate large sets of data. It provides advantages like
scalable organization, unique file paths, and efficient access control. However, as the directory grows,
complexity can increase, leading to longer paths, potential navigation difficulties, and performance
overhead. For effective use, careful planning is required to avoid excessive nesting and ensure proper
permissions. Overall, it is a widely used structure that balances organization and flexibility but requires
thoughtful management.

16