Menu

CSE_LAB2

 

CSE_LAB1

CSE LAB-I

NAME OF THE LABORATORIES:

  • CS 2208 / DATA STRUCTURES LAB
  • CS 2209 / OBJECT ORIENTED PROGRAMMING LAB
  • CS 2257 / OPERATING SYSTEMS LAB

List of Experiments:

CS 2208 DATA STRUCTURES LAB

  1. Implement singly and doubly linked lists.
  2. Represent a polynomial as a linked list and write functions for polynomial addition.
  3. Implement stack and use it to convert infix to postfix expression
  4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
  5. Implement an expression tree. Produce its pre-order, in-order, and post-order traversals.
  6. Implement binary search tree.
  7. Implement insertion in AVL trees.
  8. Implement priority queue using binary heaps
  9. Implement hashing with open addressing.
  10. Implement Prim's algorithm using priority queues to find MST of an undirected graph.

CS 2209 OBJECT ORIENTED PROGRAMMING LAB

  1. Design C++ classes with static members, methods with default arguments, friend functions. (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)
  2. Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.
  3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper constructor, destructor, copy constructor, and overloading of assignment operator.
  4. Overload the new and delete operators to provide custom dynamic allocation of memory.
  5. Develop a template of linked-list class and its methods.
  6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.
  7. Design stack and queue classes with necessary exception handling.
  8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning tree in a graph.
  9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism and RTTI.
  10. Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).

CS 2209 OBJECT ORIENTED PROGRAMMING LAB

  1. Design C++ classes with static members, methods with default arguments, friend functions. (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)
  2. Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.
  3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper constructor, destructor, copy constructor, and overloading of assignment operator.
  4. Overload the new and delete operators to provide custom dynamic allocation of memory.
  5. Develop a template of linked-list class and its methods.
  6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.
  7. Design stack and queue classes with necessary exception handling.
  8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning tree in a graph.
  9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism and RTTI.
  10. Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).

CS 2257 OPERATING SYSTEMS LAB

  1. Write programs using the following system calls of UNIX operating system: fork, exec, getpid, exit, wait, close, stat, opendir, readdir
  2. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)
  3. Write C programs to simulate UNIX commands like ls, grep, etc.
  4. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions)
  5. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions)
  6. Developing Application using Inter Process communication (using shared memory, pipes or message queues)
  7. Implement the Producer – Consumer problem using semaphores (using UNIX system calls).
  8. Implement some memory management schemes – I
  9. Implement some memory management schemes – II
  10. Implement any file allocation technique (Linked, Indexed or Contiguous)

Example for exercises 8 & 9 :

Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space. When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit.

CSE LAB-II

NAME OF THE LABORATORY:

IT2307 / SYSTEM SOFTWARE LAB

LIST OF EXPERIMENTS:

CS2308 SYSTEM SOFTWARE LAB

(Using C)

  1. Implement a symbol table with functions to create, insert, modify, search, and display.
  2. Implement pass one of a two pass assembler.
  3. Implement pass two of a two pass assembler.
  4. Implement a single pass assembler.
  5. Implement a two pass macro processor
  6. Implement a single pass macro processor.
  7. Implement an absolute loader.
  8. Implement a relocating loader.
  9. Implement pass one of a direct-linking loader.
  10. Implement pass two of a direct-linking loader.
  11. Implement a simple text editor with features like insertion / deletion of a character,word, and sentence.
  12. Implement a symbol table with suitable hashing

(For loader exercises, output the snap shot of the main memory as it would be, after the loading has taken place)

CSE LAB-III

NAME OF THE LABORATORIES:

  • CS2307 / NETWORKS LAB
  • CS2358 / INTERNET PROGRAMMING LAB

LIST OF EXPERIMENTS:

CS2307 NETWORK LAB

  1. Programs using TCP Sockets (like date and time server & client, echo server & client, etc..)
  2. Programs using UDP Sockets (like simple DNS)
  3. Programs using Raw sockets (like packet capturing and filtering)
  4. Programs using RPC
  5. Simulation of sliding window protocols Experiments using simulators (like OPNET)
  6. Performance comparison of MAC protocols
  7. Implementing Routing Protocols
  8. Performance comparison of Routing protocols
  9. Study of UDP performance
  10. Study of TCP performance.

CS2358 INTERNET PROGRAMMING LAB

1.Create a web page with the following using HTML

i) To embed an image map in a web page

ii) To fix the hot spots

iii) Show all the related information when the hot spots are clicked.

2. Create a web page with all types of Cascading style sheets.

3. Client Side Scripts for Validating Web Form Controls using DHTML

4. Write programs in Java to create applets incorporating the following features:

5. Create a color palette with matrix of buttons

  1. Set background and foreground of the control text area by selecting a color from color palette.
  2. In order to select Foreground or background use check box control as radio buttons to set background images

6. Write programs in Java using Servlets:

  1. To invoke servlets from HTML forms
  2. To invoke servlets from Applets

7. Write programs in Java to create three-tier applications using JSP and Databases

  1. for conducting on-line examination.
  2. for displaying student mark list. Assume that student information is available in a database which has been stored in a database server.

8. Programs using XML – Schema – XSLT/XSL

9. Programs using AJAX

10. Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is searching for an airline. Implement this scenario using Web Services and Data base.

CS2406 OPEN SOURCE LAB

1. Kernel configuration, compilation and installation : Download / access the latest kernel source code from kernel.org,compile the kernel and install it in the local system.Try to view the source code of the kernel .

2. Virtualisation environment (e.g., xen, kqemu or lguest) to test an applications,new kernels and isolate applications. It could also be used to expose students to other alternate OSs like *BSD .

3. Compiling from source : learn about the various build systems used like the auto* family, cmake, ant etc. instead of just running the commands. This could involve the full process like fetching from a cvs and also include autoconf, automake etc.,

4. Introduction to packet management system : Given a set of RPM or DEB, how to build and maintain, serve packages over http or ftp. and also how do you configure client systems to access the package repository.

5. Installing various software packages Either the package is yet to be installed or an older version is existing. The student can practice installing the latest version. Of course, this might need internet access.

  1. Install samba and share files to windows
  2. Install Common Unix Printing System(CUPS)

6. Write userspace drivers using fuse -- easier to debug and less dangerous to the system (Writing full-fledged drivers is difficult at student level)

7. GUI programming : a sample programme – using Gambas since the students have VB knowledge. However, one should try using GTK or QT

8. Version Control System setup and usage using RCS, CVS, SVN

9. Text processing with Perl: simple programs, connecting with database e.g., MYSQL

10. Running PHP : simple applications like login forms after setting up a LAMP stack

11. Running Python : some simple exercise – e.g. Connecting with MySql database

12. Set up the complete network interface usinf ifconfig command like setting gateway, DNS, IP tables, etc.,

CSE LAB-IV

NAME OF THE LABORATORIES:

  • CS 2258 / DBMS LAB
  • CS2306 / JAVA PROGRAMMING LAB
  • CS2357 / OBJECT ORIENTED ANALYSIS AND DESIGN LAB
  • CS2405 / COMPUTER GRAPHICS LAB

LIST OF EXPERIMENTS:

CS2309 JAVA LAB CS2309 JAVA LAB

  1. Develop Rational number class in Java. Use JavaDoc comments for documentation. Your implementation should use efficient representation for a rational number, i.e.(500 / 1000) should be represented as (1⁄2).
  2. Develop Date class in Java similar to the one available in java.util package. Use JavaDoc comments.
  3. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and 'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5].
  4. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations.
  5. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate polymorphism.
  6. Design classes for Currency, Rupee, and Dollar. Write a program that randomly generates Rupee and Dollar objects and write them into a file using object serialization. Write another program to read that file, convert to Rupee if it reads a Dollar, while leave the value as it is if it reads a Rupee.
  7. Design a scientific calculator using event-driven programming paradigm of Java.
  8. Write a multi-threaded Java program to print all numbers below 100,000 that are both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe. Design another thread that generates fibonacci numbers and writes them to another pipe. The main thread should read both the pipes to identify numbers common to both.
  9. Develop a simple OPAC system for library using even-driven and concurrent programming paradigms of Java. Use JDBC to connect to a back-end database.
  10. Develop multi-threaded echo server and a corresponding GUI client in Java.
  11. [Mini-Project] Develop a programmer's editor in Java that supports syntax-highlighting, compilation support, debugging support, etc.

CS 2258 DBMS LAB

  1. 1. Data Definition, Table Creation, Constraints,
  2. Insert, Select Commands, Update & Delete Commands.
  3. Nested Queries & Join Queries
  4. Views
  5. High level programming language extensions (Control structures, Procedures and Functions).
  6. Front end tools
  7. Forms
  8. Triggers
  9. Menu Design
  10. Reports.
  11. Database Design and implementation (Mini Project).

CS2405 COMPUTER GRAPHICS LABORATORY

  1. Implementation of Bresenhams Algorithm – Line, Circle, Ellipse.
  2. Implementation of Line, Circle and ellipse Attributes
  3. Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear.
  4. Composite 2D Transformations
  5. Cohen Sutherland 2D line clipping and Windowing
  6. Sutherland – Hodgeman Polygon clipping Algorithm
  7. Three dimensional transformations - Translation, Rotation, Scaling
  8. Composite 3D transformations
  9. Drawing three dimensional objects and Scenes
  10. Generating Fractal images

CS2357 OOAD LAB

  1. To develop a problem statement.
  2. Develop an IEEE standard SRS document. Also develop risk management and project plan (Gantt chart).
  3. Identify Use Cases and develop the Use Case model.
  4. Identify the business activities and develop an UML Activity diagram.
  5. Identity the conceptual classes and develop a domain model with UML Class diagram.
  6. Using the identified scenarios find the interaction between objects and represent them using UML Interaction diagrams.
  7. Draw the State Chart diagram.
  8. Identify the User Interface, Domain objects, and Technical services. Draw the partial layered, logical architecture diagram with UML package diagram notation.
  9. Implement the Technical services layer.
  10. Implement the Domain objects layer.
  11. Implement the User Interface layer.
  12. Draw Component and Deployment diagrams.
portable tower lights portable towers
In the formal social occasions, replica rolex watches are often treated as jewelry, usually only for a ring jewelry to wear men, is very popular. Some people even stressed: "rolex replica watches are not only men's jewelry, but also the most important men's jewelry." In western countries, replica watches, pens, lighters adult man was replica watches uk once known as the "three treasures", every man must never be away from the body.