Dsu Micropr
Dsu Micropr
Mumbai. (M.S.)
MICRO PROJECT
On
“computer networks”
Submitted by
Sahil kedare
G.S. Mandal’s
Department of Computer Engineering
Marathwada Institute of Technology,
Polytechnic, Aurangabad.
CERTIFICATE
This is to certify that : -
Roll Enrollment Exam
No. No. Seat No.
82 2200660230
Date:
Principal
Marathwada Institute of Technology,
Polytechnic, Aurangabad
INDEX
3.0 Proposed Methodology (procedure in brief that will be followed to do the micro-
project in about 100-200 words.)
4.0 Action Plan (Sequence and time required for major activity.)
5.0 Resources required (major resources such as row material, some machining facility,
software etc.)
3.0 Course Outcomes Achieved (Add to the earlier list is more Cos are addressed)
5.0 Actual Methodology Followed (Write step wise work done, data collected and its
analysis (if any). The contribution of individual member may also be noted.)
7.0 Outputs of the micro projects (Drawings of the prototype, drawing of survey,
presentation of collected data, findings etc.)
Annexure-I
Micro-Project Proposal
3.0 Proposed Methodology (Procedure in brief that will be followed to do the micro-
First we decide topic for micro-project . then we collect information by book (Pankaj
brahmankar) and collect the information from online resources like w3 resources and
other websites. We see video lectures on YouTube by code with mosh for understanding
concepts of push and pop operations and overflow and underflow. We learn how to insert
Conditions for pop and push. After we decide who will make the program and report .
We will utilize a single integer array to represent two stacks. Each stack will occupy a
portion of the array, with stack 1 starting from the beginning and stack 2 starting from the
end of the array.When pushing an element onto a stack, we will increment the respective
stack and store the element at the corresponding position in the array. For popping an
element from a stack, we will retrieve the element at the current stack pointer position
and decrement the stack .Checks will be implemented to prevent stack overflow (pushing
onto a full stack) and stack underflow (popping from an empty stack).Then I will make
4.0 Action Plan (Sequence and time required for major activity.)
5.0 Resources required (major resources such as row material, some machining
facility, software etc.)
Sr. Name of Resource/Material Specification Qty. Remarks
No
1. Book By Pankaj 1
Brahmanakar
2. Laptop Windows 11 1
Turbo c 1
3. Compiler
4. Software
MS-word 1
5. Website W3 resources 1
Code with 5
6. YouTube
. mosh
81 Rohit kathar
Title of Micro-Project : -
À. Memory Efficiency: Using a single array to represent two stacks optimizes memory
implementation.
memory optimisation.
3.0 Course Outcomes Achieved (Add to the earlier list is more Cos are addressed):
various fields, including computer science, mathematics, and engineering. They follow
array is an efficient way to save memory space compared to using separate arrays for
knowledge of data structures and algorithms, which are essential for understanding
5.0 Actual Methodology Followed (Write step wise work done, data collected and its
analysis (if any). The contribution of individual member may also be noted.)
All the members of group will decide the topic. After deciding the topic Siddhesh
komte collect the information related to the topic. Siddhesh sees video lectures from
YouTube by code with mosh and make a notes and collect information from websites
like Geeks for geeks and w3 resources. Then Rohit read the books related to the topic
like book of data structure by pankaj brahmankar and etc books. Rohit use Do-while
represent two stacks. Each stack will occupy a portion of the array, with stack 1
starting from the beginning and stack 2 starting from the end of the array.When
pushing an element onto a stack, we will increment the respective stack and store the
element at the corresponding position in the array. For popping an element from a
stack, we will retrieve the element at the current stack position and decrement the
stack .Checks will be implemented to prevent stack overflow (pushing onto a full stack)
and stack underflow (popping from an empty stack).Then I will make report on topic.
with mosh
brahmankar
5. C Compiler Programiz 1
handling
7. Website W3 resources 1
1. Data Structures: A deep understanding of stack data structures and their efficient
implementation.Memory
2. Optimization: Proficiency in optimizing memory usage by using a single array for
manipulation.
expressions .
is limited.