0% found this document useful (0 votes)
111 views4 pages

Analysis of Linux I/O Operations

This document contains lists of experiments for several computer science courses. The CS-506 list includes experiments on basic Unix/Linux commands, arithmetic operations, file manipulation and splitting, comparing files, file permissions, pipes, and shell scripting. The CS-504 list focuses on computer graphics topics like line drawing algorithms, circle generation, transformations, and clipping. The IT-701 list involves creating object diagrams, state diagrams, and data flow diagrams for various systems. The BE-205 list covers basic C++ concepts like functions, arrays, classes, constructors, destructors, operator overloading, and inheritance.

Uploaded by

Satyam Saxena
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
111 views4 pages

Analysis of Linux I/O Operations

This document contains lists of experiments for several computer science courses. The CS-506 list includes experiments on basic Unix/Linux commands, arithmetic operations, file manipulation and splitting, comparing files, file permissions, pipes, and shell scripting. The CS-504 list focuses on computer graphics topics like line drawing algorithms, circle generation, transformations, and clipping. The IT-701 list involves creating object diagrams, state diagrams, and data flow diagrams for various systems. The BE-205 list covers basic C++ concepts like functions, arrays, classes, constructors, destructors, operator overloading, and inheritance.

Uploaded by

Satyam Saxena
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

LIST OF EXPERIMENTS

CS-506 Unix/ Linux-Lab



1. To Study basic & User status Unix/Linux Commands.
2. Study & use of commands for performing arithmetic operations with Unix/Linux.
3. Create a file called [Link] with some lines and display how many lines, words and
characters are present in that file.
4. Append ten more simple lines to the [Link] file created above and split the
appended file into 3 parts. What will be the names of these split files? Display the
contents of each of these files. How many lines will be there on the last file?
5. Given two files each of which contains names of students. Create a program to display
only those names that are found on both the files.
6. Create a program to find out the inode number of any desired file.
7. Study & use of the Command for changing file permissions.
8. Write a pipeline of commands, which displays on the monitor as well as saves the information
about the number of users using the system at present on a file called [Link].
9. Execute shell commands through vi editor.
10. Installation, Configuration & Customizations of Unix/Linux.
11. Write a shell script that accepts any number of arguments and prints them in the reverse
order.
12. Write a shell script to find the smallest of three numbers that are read from the
keyboard.
13. Write a shell script that reports the logging in of a specified user within one minute after
he/she logs in. The script automatically terminates if the specified user does not login during a
specified period of time.
14. Installation of SAMBA, APACHE, TOMCAT.
15. Implementation of DNS, LDAP services,
16. Study & installation of Firewall & Proxy server.
LIST OF EXPERIMENTS
CS504 Computer Graphics & Multimedia

1. A brief study of various types of input and output devices.
2. Program to implement a line using slope intercept formula.
3. Program to implement line using dda algorithm.
4 .Program to implement line using bresenhams algorithm.
5. Program to implement circle using mid point algorithm.
6. Program to implement translation of a line and triangle
7. Program to implement rotation of a line and triangle
8. Program to implement scaling transformation.
9. Program to implement 3d rotation about an arbitrary axis.
10. Program to implement cohen sutherland line clipping.
11. Program to implement sutherland hodgman polygon clipping.
12. Program to draw bezier curve.
13. Program to draw b-spline curve.















LIST OF EXPERIMENTS
IT-701 Object Oriented Analysis and Design


1. Draw Object, state, Data flow Diagram of ATM.

2. Draw Object, state, Data flow Diagram of Telephone Call.

3. Draw Object, state, Data flow Diagram of Library Information System.

4. Draw Object, state, Data flow Diagram of Airline reservation System.

5. Draw Object, state, Data flow Diagram of Calculator.

6. Draw Object, state, Data flow Diagram of College Management system.

7. Draw Object, state, Data flow Diagram of Payroll System.

8. Draw Object, state, Data flow Diagram of Railway Reservation system.

9. Draw Object, state, Data flow Diagram of Online Sales.

10. Draw Object, state, Data flow Diagram of Examination result display System of a
University.















LIST OF EXPERIMENTS
BE-205 Basics of Computer Engineeering

[Link] to print hello C++.
[Link] to calculate simple intrest.
[Link] to print the number is even or odd.
04. WAP to calculate compound intrest.
[Link] to print the year is leap year or not.
06. WAP to illustrate Arrays.
07. WAP to illustrate functions.
08. WAP to illustrate constructor & Destructor
09. WAP to illustrate Object and classes.
10. WAP to illustrate Operator overloading
11. WAP to illustrate Function overloading
12. WAP to illustrate Inheritance

Common questions

Powered by AI

To split a text file in Unix/Linux after appending lines, you can use the 'cat' command to append lines, and 'split' command to divide the file. If you append ten more lines to 'wlcc.txt' and use 'split -l 10 wlcc.txt splitfile_', it will create files named 'splitfile_aa', 'splitfile_ab', etc., each with the specified number of lines. The final file may contain fewer lines depending on the total line count. The naming follows alphabetical sequence and ensures easily distinguishable parts .

Studying and using Unix/Linux commands for arithmetic operations is crucial because it enables the automation of tasks involving mathematical calculations directly within scripts. This capability is vital for tasks such as processing numerical data, automating system resource management, or even in monitoring and maintaining system health. Potential applications include generating reports, logging system metrics, or automatically adjusting resources based on system load .

Installing firewalls and proxy servers in Unix/Linux is beneficial in scenarios requiring enhanced network security and access control. Firewalls filter incoming and outgoing traffic based on predefined security rules, providing protection against unauthorized access. Proxy servers, meanwhile, act as intermediaries for requests from clients seeking resources, offering anonymity and content filtering. The fundamental difference lies in firewalls focusing on traffic control and proxies on request handling and privacy .

Inheritance in object-oriented programming allows new classes to adopt properties and behaviors of existing ones, promoting reusability and modular code structure. Function overloading provides multiple implementations of a function name with different parameters, enhancing code readability and flexibility. Together, they facilitate more efficient coding practices by reducing redundancy, simplifying complex systems, and allowing for scalable code that can be easily extended and maintained .

Understanding object and data flow diagrams is essential in designing a Library Information System because they offer a clear, visual representation of how data moves through the system and how different objects interact within it. This aids in identifying system requirements, establishing clear relationships between components, and detecting potential bottlenecks or redundancies. Ultimately, these diagrams serve as a blueprint for efficient system design and implementation .

Shell scripting plays a crucial role in monitoring user logins by automating the tracking of user activity and responding to system events. A structure for such a script involves using 'watch' or 'sleep' commands to periodically check login status with 'who' or 'last'. A sample script might loop for a minute, check if 'who | grep username' returns a result, and if so, logs the event; otherwise, it exits. This automation of monitoring allows for efficient tracking without continuous manual input .

Bresenham’s algorithm is a more efficient line-drawing algorithm compared to DDA because it uses integer computations which are faster and more precise on digital systems, reducing potential rounding errors. In contrast, DDA uses floating-point arithmetic, which can introduce inaccuracies and is computationally heavier. Bresenham's method is typically preferred in systems where performance and precision are critical .

In computer graphics, rotation transformations for 2D objects are typically implemented using rotation matrices that apply trigonometric functions of the rotation angle to the object's coordinates. For 3D objects, rotations require more complex quaternion or matrix algebra that accounts for an arbitrary axis around which the object rotates. The key principle involves altering the object's coordinate space such that it simulates a rotation when projected onto the viewing plane .

An effective command sequence to both display and store the current user count on a Unix/Linux system is using a combination of 'who' and 'tee': 'who | wc -l | tee usere.ux'. This pipeline command uses 'who' to list currently logged-in users, 'wc -l' to count the lines (i.e., the number of users), and 'tee' to simultaneously display the count on the terminal and store it in the file 'usere.ux'. This approach is efficient because it leverages piping to execute multiple operations in a streamlined, sequential manner .

The Cohen-Sutherland algorithm enhances the graphical clipping process by efficiently determining the line segments that are within the clipping boundary before rendering, saving computational resources. It uses a divide-and-conquer approach that classifies line segments based on outcodes, quickly discarding those that are wholly outside the clipping area. However, its limitations include dealing with complex polygons and computational intensity for cases not easily reduced by outcode classification .

You might also like