LOVELY PROFESSIONAL UNIVERSITY

ASSIGNMENT
OF
CSE-366

Submitted to:
Submitted by:

Mr. RAMANDEEP SARVESH

ACHARYA

B.tech
(H)-CSE

SESSION 2008-12 B.Tech (Hons) Cse

1
 LOVELY PROFESSIONAL UNIVERSITY

Reg. No. 10805158

Roll
No.: RA1803A33

PART-1

Ques1. How do you visualize computer memory? Differentiate

different views of memory.

Ans-Our visualization design is driven by several goals: scalability,limited cluttering,

insight into fine-scale behavior,intuitiveness, and ease of use. Our core visualization
shows all events in each bin separately, as follows. We use a 2D Cartesian layout which
maps event time tj and memory addresses to the x and y axes respectively. Hence, every
event ei is an axis-aligned rectangle. This layout has several advantages. It is compact
(hundreds of thousands of elements can fit on a screen) and dense (no screen space is
wasted). Empty areas convey actual information, i.e. they show free Main visualization
Time axis Memory axis Occupancy barBlock detail view Context view memory.
Following the x axis, we can see what happens
over a given memory range in time. Following the y axis, we see a snapshot of the
memory at a given moment. Rectangle sizes show the lifetime and size of blocks. This
layout is fast and straightforward to compute. We color every rectangle to show a data
attribute ai j via a suitable color mapping scheme.

Ques2. State the method of mapping physical address from logical

address. Differentiate between virtual and physical address space.

Ans- An embodiment of the invention relates to a mass storage device including a

nonvolatile memory device with a plurality of memory management blocks and an
address translation table formed with pointers to locations of the memory management
blocks. A volatile memory device is included with an address index table formed with
pointers to the pointers to the locations of the memory management blocks. The address
index table is stored in the nonvolatile memory upon loss of bias voltage. Changes to
the address translation table are accumulated in the volatile memory and written to the
address translation table when at least a minimum quantity of the changes has been
accumulated. The changes to the logical block address translation table accumulated in
the volatile memory are written to a page in the address translation table after prior data
in the page has been updated, written to another page, and then erased.

1-The concept of a logical address space that is bound to a separate

physical address space is central to proper memory management.

SESSION 2008-12 B.Tech (Hons) Cse

1
 LOVELY PROFESSIONAL UNIVERSITY

2-Logical address generated by the CPU; also referred to as virtual address.

3-Physical address address seen by the memory unit.
4-Logical and physical addresses are the same in compile-time and load-
time address-binding schemes; logical (virtual) and physical addresses differ
in execution-time address-binding scheme.

Ques3. Consider any example of your choice and based upon that
compare different page replacement algorithms.

Ans- In a computer operating system that uses paging for virtual memory memory
management, page replacement algorithms decide which memory pages to page out
(swap out, write to disk) when a page of memory needs to be allocated. Paging happens
when a page fault occurs and a free page cannot be used to satisfy the allocation, either
because there are none, or because the number of free pages is lower than some
threshold.

When the page that was selected for replacement and paged out is referenced again it
has to be paged in (read in from disk), and this involves waiting for I/O completion.
This determines the quality of the page replacement algorithm: the less time waiting for
page-ins, the better the algorithm. A page replacement algorithm looks at the limited
information about accesses to the pages provided by hardware, and tries to guess which
pages should be replaced to minimize the total number of page misses, while balancing
this with the costs (primary storage and processor time) of the algorithm itself.

PART2

Ques4. Identify different types of files available in different operating

systems. Define file and explain operation performed on file.

Ans- An operating system (OS) is software, consisting of programs and data, that
runs on computers and manages the computer hardware and provides common services
for efficient execution of various application software

For hardware functions such as input and output and memory allocation, the operating
system acts as an intermediary between application programs and the computer
hardware, although the application code is usually executed directly by the hardware,
but will frequently call the OS or be interrupted by it. Operating systems are found on
almost any device that contains a computer—from cellular phones and video game
consoles to supercomputers and web servers.

SESSION 2008-12 B.Tech (Hons) Cse

1
 LOVELY PROFESSIONAL UNIVERSITY

A file manager or file browser is a computer program that provides a user interface to
work with file systems. The most common operations performed on files or groups of
files are: create, open, edit, view, print, play, rename, move, copy, delete, search/find,
and modify attributes, properties and permissions. Files are typically displayed in a
hierarchy. Some file managers contain features inspired by web browsers, including
forward and back navigational buttons.

Some file managers provide network connectivity via protocols, such as FTP, NFS,
SMB or WebDAV. This is achieved by allowing the user to browse for a file server
(connecting and accessing the server's file system like a local file system) or by
providing its own full client implementations for file server protocols.

Ques5. What are different schemes for giving the structure of

directory?

Ans- Scheme is one of the two main dialects of the programming language Lisp.
Unlike Common Lisp, the other main dialect, Scheme follows a minimalist design
philosophy specifying a small standard core with powerful tools for language extension.
Its compactness and elegance have made it popular with educators, language designers,
programmers, implementors, and hobbyists, and this diverse appeal is seen as both a
strength and, because of the diversity of its constituencies and the wide divergence
between implementations, one of its weaknesses.

Scheme was developed at the MIT AI Lab by Guy L. Steele and Gerald Jay Sussman
who introduced it to the academic world via a series of memos, now referred to as the
Lambda Papers, over the period 1975-1980. The Scheme language is standardized in
the official IEEE standard, and a de facto standard called the Revisedn Report on the
Algorithmic Language Scheme (RnRS). The most widely implemented standard is
R5RS (1998), and a new standard R6RS was ratified in 2007.

Scheme was the first dialect of Lisp to choose lexical scope and the first to require
implementations to perform tail-call optimization. It was also one of the first
programming languages to support first-class continuations. It had a significant
influence on the effort that led to the development of its sister, Common Lisp.

Ques6. Give different techniques and interfaces which allow i/o devices
to communicate in standard way.

Ans- Interfacing is a term used in electronics when different electronic devices are
connected in order to move information from one device to another. This information
may take the form of instructions for the function of a device, or feedback from a device
about the results of executing a function. Laboratory automation devices
function to either measure and/or act to control physical process. Electronic interfacing
in laboratory automation spans a very wide range of sophistication and complexity, but

SESSION 2008-12 B.Tech (Hons) Cse

1
 LOVELY PROFESSIONAL UNIVERSITY

in general does not tend to be cutting edge, simply because the demands placed on the
interface are usually moderate. The information passed through an interface may be
very simple, such as a two-state signal, high or low, open or closed. Or it may be a
complex, binary stream of serial or parallel data. Data rates can range from hundreds to
giga-bits of information per second.

SESSION 2008-12 B.Tech (Hons) Cse