Cinque Terre

II/IV B.TECH II Sem R13 Regulation



Free Open Source Software Lab
Ms.K. Kalpana,P.Gayathri

DSR

Laboretoy 1 :
Basics of UNIX utilities and Shell Programming

This Experiment provides an overview of the historical and modern context and operation of free and open source software (FOSS) and associated software.The Ability to gather information about Free and Open Source Software projects from software releases and from sites on the internet. It provides the Ability to use a version control system and to interface with version control.systems used by development communities. Ability to contribute software to and interact with Free and Open Source Software development projects.

Laboretoy 2 :
Basics of UNIX utilities and Shell Programming

This Experiment provides an overview of the historical and modern context and operation of free and open source software (FOSS) and associated software.The Ability to gather information about Free and Open Source Software projects from software releases and from sites on the internet. It provides the Ability to use a version control system and to interface with version control.systems used by development communities. Ability to contribute software to and interact with Free and Open Source Software development projects.

Laboretoy 3 :
Basics of UNIX utilities and Shell Programming

This Experiment provides an overview of the historical and modern context and operation of free and open source software (FOSS) and associated software.The Ability to gather information about Free and Open Source Software projects from software releases and from sites on the internet. It provides the Ability to use a version control system and to interface with version control.systems used by development communities. Ability to contribute software to and interact with Free and Open Source Software development projects.

Advanced Data Structures Lab
Ms.T.Sukanya,Mrs.K.Kalpana

DSR

Laboretoy 1 :
HASHING

Hash table is one of the important data structures, which plays a significant role in information retrieval. As an example, suppose a set of N distinct records with keys K1,K2,---Kn are stored in a file and if we want to find a record with a given key value k,the simplest way is to perform sequential search.

Laboretoy 2 :
AVL TREES

In computer science, (Adelson, Velski & Landis) AVL trees are height balancing binary search tree.
BalanceFactor = height(left-sutree) − height(right-sutree)
In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. To understand how to rebalance a tree using the LL rotation, LR rotation, RR rotation, and RL rotation.

Laboretoy 3 :
2-3 TREES

HIn 2-3 tree every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. All leaves are at the same level.All data is kept in sorted order.

Laboretoy 4 :
BINARY HEAP

A binary heap is a complete binary tree which satisfies the heap ordering property. The ordering can be one of two types: min-heap property: the value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root. max-heap property: the value of each node is less than or equal to the value of its parent, with the maximum-value element at the root.

Java Programming Lab
Dr S.Suresh,Mr Y.Siva Ramaiah

DSR

Laboretoy 1 :
UNDER CONSTRUCTION

MVR COLLEGE OF ENGINEERING AND TECHNOLOGY

kalam