Jawaharlal Nehru Engineering College

Size: px

Start display at page:

Download "Jawaharlal Nehru Engineering College"

Dominick Watson
5 years ago
Views:

1 Jawaharlal Nehru Engineering College Laboratory Manual DATA STRUCTURES For Second Year Students (Information Technology) ISO registered Prof. S. A. Dongre ( IT, Dept.) Author JNEC, Aurangabad

2 FORWARD It is my great pleasure to present this laboratory manual for Second year engineering students for the subject of Data Structures keeping in view the vast coverage required for visualization of concepts of Data Communication with simple language. As a student, many of you may be wondering with some of the questions in your mind regarding the subject and exactly what has been tried is to answer through this manual. As you may be aware that MGM has already been awarded with ISO 9000 certification and it is our endurance to technically equip our students taking the advantage of the procedural aspects of ISO 9000 Certification. Faculty members are also advised that covering these aspects in initial stage itself, will greatly relived them in future as much of the load will be taken care by the enthusiasm energies of the students once they are conceptually clear. Dr. S. D. Deshmukh Principal

3 Vision of JNEC College seeks to be the engineering college of choice in Maharashtra that can provide the best learning experience, the most productive learning community, and the most creative learning environment in Engineering Education and will be recognized as one of the best Engineering Colleges in India. Mission of JNEC To develop innovative engineers with human values, well equipped to solve complex technical problems, address the needs of modern society and pursue lifelong learning, by providing them competent, caring and committed faculty. IT Vision: IT department is committed to ensure the quality education to students by providing innovative resources & continuous up-gradation of the department. To achieve Heights of Excellence in the world we strive to organize regular interaction with Industry and Alumni. IT Mission: To impart core technical competency & knowledge in students through curriculum and certification programs to fulfill the industry requirements which ultimately benefits society at large. Program Educational Objectives: I. Preparation: To prepare students to excel in PG program or to succeed in Industry /Technical profession through global, rigorous education. II. Core Competence: To provide students with a solid foundation in mathematical, scientific and engineering fundamentals required to solve engineering problems and also to pursue higher studies. III. Breadth: To train students with good scientific and engineering breadth so as to comprehend, analyze, design and create novel product and solution for the real life problems. IV. Professionalism: To inculcate in students professional and ethical attitude, effective communication skills, team work skills, multi-disciplinary approach and an ability to relate engineering issues to broader social context. V. Learning Environment: To provide students with academic environment aware of excellence, leadership, written ethical codes and guidelines and lifelong learning needed for successful professional career.

4 LABORATORY MANUAL CONTENTS This manual is intended for the Second year students of IT & CSE branches in the subject of Data Structures. This manual typically contains practical/lab Sessions related Data Structures covering various aspects related the subject to enhanced understanding. We have made the efforts to cover various aspects of the subject covering computer hardware components, software components networking aspects, Operating System concepts and programming aspects will be complete in itself to make it meaningful, elaborative understandable concepts and conceptual visualization. Students are advised to thoroughly go though this manual rather than only topics mentioned in the syllabus as practical aspects are the key to understanding and conceptual visualization of theoretical aspects covered in the books. Good Luck for your Enjoyable Laboratory Sessions. Ms.S.A.Dongre

5 SUBJECT INDEX 1. Lab Exercises 1: Program for implementing Stacks using static array. 2. Lab Exercises 2: Program for implementing Stacks using Dynamic array. 3. Lab Exercises 3: Program for implementing Circular Queue. 4. Lab Exercises 4: Program for Evaluation of postfix expression. 5. Lab Exercises 5: Program for implementing Singly Linked list 6. Lab Exercises 6: Program for implementing Doubly Linked List. 7. Lab Exercises 7: Program for creation of Maxheap. 8. Lab Exercises 8: Program for creation of Binary Search Tree. 9. Lab Exercises 9: Program for Binary Search to search an element in the given sequence. 10. Quiz on the subject 11. Conduction of Viva-Voce Examinations 12. Submission 13. Evaluation and marking system

6 DOs and DON Ts in Laboratory: 1. Do not handle any equipment before reading the instructions/instruction manuals 2. Read carefully the power ratings of the equipment before it is switched on whether ratings 230 V/50 Hz or 115V/60 Hz. For Indian equipments, the power ratings are normally 230V/50Hz. If you have equipment with 115/60 Hz ratings, do not insert power plug, as our normal supply is 230V/50 Hz, which will damage the equipment. 3. Observe type of sockets of equipment power to avoid mechanical damage 4. Do not forcefully place connectors to avoid the damage 5. Strictly observe the instructions given by the teacher/lab Instructor Instructions for Laboratory Teachers: 1. Submission related to whatever lab work has been completed should be done during the next lab session. The immediate arrangements for printouts related to submission on the day of practical assignments. 2. Students should be taught for taking the printouts under the observation of lab teacher. 3. The promptness of submission should be encouraged by way of marking and evaluation patterns that will benefit the sincere students.

7 1. Lab Exercises: Exercise No 1: (2 Hours) 1 Practical 1.1 Program for implementing stack using static array Review: 1. A collection of data and its relationship among the elements forms a data structure. 2. A stack is ordered collection of items in which all insertion, deletion are done at the same end called the top. 3. The basic operations on stack are push and pop. It is often called LIFO data structure. 1.2 Operations on Stack: Algorithm to push an element: 1. Check whether stack is full or not. (i.e. if(top==maxsize)) 2. Otherwise increase the top by 1(else top=top+1) 3. Insert the element, elem. stack[top]=elem; Algorithm to pop an element: 1. Check whether stack is empty or not (if (top==-1)) 2. Otherwise decrement top by To check whether the stack is empty or not (STACK EMPTY) To check whether the stack is full or not (STACK FULL). 1.3 Declaration of Stack: Int top=-1; Int Stack[MAXSIZE];/*MAXSIZE is maximum size of stack*/

8 Example: 2. Lab Exercises: Exercise No 2: (2 Hours) 1 Practical 2.1 Program for implementing singly linked list and doubly linked list 1.4 Conclusion: Thus we implement the stack using static array.

9 2. Lab Exercises: Exercise No 2: (2 Hours) 1 Practical 2.1 Program for implementing stack using Dynamic memory allocation. Review: 1. A collection of data and its relationship among the elements forms a data structure. 2. A stack is ordered collection of items in which all insertion, deletion are done at the same end called the top. 3. The basic operations on stack are push and pop. It is often called LIFO data structure. 4. Static memory allocation may insert in wastage of memory and also shortage of memory. (Like in array implementations) 5. To outcome these problems, dynamic memory allocation is used. 2.2 Operations on Stack: Algorithm to push an element: 1. Check whether stack is full or not. (i.e. if(top==n)) 2. Otherwise increase the top by 1(else top=top+1) 3. Insert the element, elem. stack[top]=elem; Algorithm to pop an element: 1. Check whether stack is empty or not (if (top==-1)) 2. Otherwise decrement top by To check whether the stack is empty or not (STACK EMPTY) To check whether the stack is full or not (STACK FULL). 2.3 Declaration of Stack: Typedef struct { Int key; /* other field*/ } element ; Element *stack; MALLOC(stack, sizeof(*stack)); Int top=-1; 2.4 Conclusion: Thus we implement the stack using dynamic memory allocation.

10 3. Lab Exercises: Exercise No 3: (2 Hours) 1 Practical 3.1 Program for implementing circular queue Review: 1. A Queue is a non-primitive linear data structure. It is ordered collection of element in which elements are added at one end called rear and elements are deleted at other end called front. 2. The basic operations on Queue are insert and delete. It is called as FIFO data structure. 3. A circular queue is implemented by visualizing the 1D array as circular queue. The circular queue overcomes the problems associated when the deletion is made from the front, it gives queue full condition even if in reality, it is empty. 3.2Operation on Circular Queue: 3.2.1Algorithm for insertion of an item into circular queue: 1. Initialize front=-1,rear=0 and MAXSIZE=10 2. if(front==(rear+1)%maxsize) Print Queue Overflow and return Else 3. if(front==-1) Set front=rear=0,else Rear=((rear+1)%MAXSIZE) Queue[rear]=item 3.2.2Algorithm for deletion of an item from circular queue: 1. if(front==-1) Print Queue underflow and return Else Item=queue[front] 2. if(front==rear) Assign front=-1 rear=-1 Else Front=((front+1)%MAXSIZE)

11 Example: 3.4 Conclusion: Thus we implement the circular queue

12 4 Lab Exercises: Exercise No 4: (2 Hours) 1 Practical 4.1 Program for Evaluation of postfix expression Review: 1. Stack can be used for evaluation of a postfix expression 2. Here we will use the stack for storing operand rather than operators 3. Each operator in a postfix expression refers to a previous two operands in the expression.(out of these two operands one may be the result of applying a previous operator) operands are taken as numeric value. 4.2 Algorithm for evaluation of postfix expression: 1. Read the postfix expression from left to right. 2. If the input symbol read is an operand then push it onto stack 3. If the operator is read, pop top two operands and perform arithmetic operation.if operator is + result=operand 1 + operand 2 - result=operand 1 - operand 2 * result= operand1 * operand 2 / result = operand1 / operand 2 $ result = operand1 $ operand Example: For infix expression =(3+5)*(7-6) its post fix expression =35+76-* Evaluation of Postfix expression: Step1: Assume the array contains the input. Array * Read the element of array, one by one, if it is operand push it onto stack. Stack Array * 5 Top 3 reading

13 Step2: If the operator is read, pop two operands Perform op1 + op2 5 3 Op2 Op1 Result = = 8 push 8 Step 3: push next element into stack Top * Again pop two operand and perform the operation Perform op1 op2 Result=7-6=1 Push the result onto the stack 1 8 Top

14 Step4: * 1 8 Again pop Two operand and perform the operation 8 Perform op1 *op2 Result=8*1=8 Push the result onto stack. Result=8 At this point input is null,therefore stop the evaluation procedure and remove the value from the stack i.e. the final result=8 4.4 Conclusion: Thus we evaluate the postfix expression using stack.

15 5. Lab Exercises: Exercise No 5: (2 Hours) 1 Practical 5.1 Program for implementing singly linked list Review 1. Static memory allocation may insert in wastage of memory and also shortage of memory. (Like in array implementations) 2. To outcome these problems, dynamic memory allocation is used. 3. Linked list is a linear data structure which consists of number of nodes created dynamically. 4. A linked list has no fix size but grows or shrinks as elements are added or deleted from the list. 5. A singly linked list is a dynamic data structure. It may grow or shrink. Growing or shrinking depends on operation made. 6. Every node of list has two fields, information and next address. Next address field contains memory address location of next node. 5.2 Operations on Singly Linked List: Algorithm for inserting a node at the beginning 1. Allocate memory for the new node, temp=malloc(). 2. Assign the value of the data field of the new node, temp->info 3. Make the link field of the new node to point to the starting node of the linked list, temp->next=start. 4. Then, set the external pointer (which was pointing to the starting node) to point to the new node, start=temp Algorithm for inserting a node at the end 1. If the list is empty then create the new node, temp=malloc (). 2. If the list is not empty, then go to the last node and then insert the new node after the last node, r=start; go till last node then r->next=temp Algorithm for inserting node at the specified position 1. Allocate memory for the new node, temp=malloc (). 2. Assign value to the data field of the new node, temp->info. 3. Go till node R, also mark next node as S. 4. Make the next field of node temp to node S and next field of node R to point to new node.

16 5.2.4 Algorithm for deleting the first node 1. Mark the first node as temp. 2. Then, make start point to the next node. 3. Make next field of temp, null. 4. Free temp Algorithm for deleting the last node 1. Mark the last node as temp & last but one node as R. 2. Make the next field of R as NULL. 3. Free temp Algorithm for deleting a middle node 1. Mark the node to be deleted as temp. 2. Mark the previous node as R & next nodes as S. 3. Make the next field of R to point S. 4. Make the next field of temp, NULL. 5. Free Temp. 5.3Declaration of linked list in C: struct node { Int info; struct node *next; }; If we see the declaration of a node for a linked list, the first variable is for storing information. The second variable is a struct variable, next address field which stores address location. It actually contains a complete node. start Info next Fig. Structure of a node

17 5.4 Example: 5.5 Conclusion: Thus we study and implement singly linked list.

18 6. Lab Exercises: Exercise No 6: (2 Hours) 1 Practical 6.1 Program for implementing Doubly linked list Review: 1. Although c circular linked list has advantageous over a linear list, it still has several drawbacks. 2. One cannot traverse such a list backward, not a node be deleted from a circular linked list, given only a pointer to that node. 3. In cases, where these facilities are required, the appropriate data structure is a Doubly linked list. Each node in such a list contain contains two pointer, one to its predecessor and another to its successor. 6.2 operations on Doubly Linked List Algorithm to insert a node: 1. Allocate memory for new node, temp. 2. If this is first node, start=temp. 3. If temp is to be inserted after last node, mark last node as R. Make R->next=temp & temp->prev=r. 4. If this node is to be inserted at the starting of the list Start->prev=temp Temp->next=start Start=temp. 5. Otherwise, if the node is to be inserted after the specific node mark that node as R & next node as S. R->next=temp Temp->next=S S->prev=temp Temp->prev=R Algorithm to delete a node 1. Mark node to be deleted, temp. 2. If this is first node, then make start point to next node (start=start->next) Make next field of temp NULL (temp->next=null) & free(temp).

19 3. If this is last node, mark the last but one node as R. Make the next field of R, NULL &prev field of temp NULL, R->next=NULL Temp->prev=NULL Free(temp) 4. If this is some middle node, mark the previous node as R & next node as S, then make, R->next=S S->prev=R Temp->next=NULL Temp->prev=NULL Free(temp) 6.3 Declaration of node for Doubly linked list: PREV INFO NEXT Struct node { Int info; Struct node *next,*prev; } 6.4 Example: 6.5 Conclusion: Thus we study and implement Doubly linked list

20 7. Lab Exercises: Exercise No 7: (2 Hours) 1 Practical 7.1 Program for creation of Maxheap Review: 1. A max heap is complete binary tree that is also a max tree. 2. From the definition, it follows that the key in the root of max tree is the largest than the key values in its children 7.2 For example: operation on Maxheap Insertion : - A maxheap is a 5 element shown in fig.1 when an element is added to this heap, the resulting six elements heap must have the structure, because a heap is a complete binart tree. - To correct the place for the element that is being inserted, we use a bubbling up process that begins at the new node of tree and move towards the root. The element to be inserted bubbles up as far as necessary to ensure a max heap following the insertion. - If the element to be inserted has key value 1, it may be inserted asa left chile of 2. If inserted the key value of the new element is 5, then this cannot be inserted as left child of 2. So, the 2 is move down to its left child and we determine if placing the 5 at old position of 2 results in a maxheap. - Since the parent (20) is atleast as large as the element being inserted (5), it is all right to insert the new element at the position shown in fig

21 - Suppose that the new element has value 21 rather than 5 here, two moves down to its left child the 21 cannot be inserted into the old position occupied by 2, as the parent of this position is smaller than 21. Hence the 20 is move down to it,s right child and 21 inserted into the root of the heap (a) (b) ( c) ( d ) 7.4 Conclusion: hence we have create a max heap

22 8. Lab Exercises: Exercise No 8: (2 Hours) 1 Practical 8.1 Program for traversal of Binary search Tree Review: 1. Trees are non linear data structures that can be used to represent data items processing hierarchical relationship between them. 2. Binary search tree may be used to store ordered information which can reduce search time for any particular element. 3. Trees can be traversed in inorder, preorder and postorder. 4. Inorder traversal of binary search tree will result in elements arranged in ascending order. 5. Binary trees can be used to evaluate mathematical expressions 8.2 Algorithm for creation of binary tree and inserting an element 1. Read an element, make it root node. 2. Read next element, elm, compare it with the root node, if it is less then insert it in left else insert right. 3. Repeat step 2 till you insert all elements. 8.3 Traversal Methods: Algorithm for Preorder Traversal 1. Visit the node. 2. Traverse the left sub-tree in preorder. 3. Traverse the right sub-tree in preorder. Example:

8.3.2 Algorithm for Inorder Traversal 1. Traverse the left sub-tree in inorder. 2. Visit the node. 3. Traverse the right sub-tree in inorder. Example: 8.3.3 Algorithm for Postorder Traversal 1.

23 8.3.2 Algorithm for Inorder Traversal 1. Traverse the left sub-tree in inorder. 2. Visit the node. 3. Traverse the right sub-tree in inorder. Example: Algorithm for Postorder Traversal 1. Traverse the left sub-tree in postorder. 2. Traverse the right sub-tree in postorder. 3. Visit the node. Example: 8.4 Conclusion: Thus we have traverse a binary search tree.

24 9. Lab Exercises: Exercise No 9: (2 Hours) 1 Practical 9.1 Program for Binary Search to search an element in the given sequence 1. Enter the sorted numbers, n and key. 2. Set low=0, high=n-1 3. Mid=low+high/2 4. If (key == a [mid]) return mid as position of element found. 5. If(key<a[mid]) search for key in a[low] to a[mid-1] 6. If(key>a[mid]) search for key in a[mid+1] to a[high]. 9.2 Example: 9.3 Conclusion: Thus we have search a element in a given sequence

25 10. Quiz on the subject: Quiz should be conducted on tips in the laboratory, recent trends and subject knowledge of the subject. The quiz questions should be formulated such that questions are normally is from the scope outside of the books. However twisted questions and self formulated questions by the faculty can be asked but correctness of it is necessarily to be thoroughly checked before the conduction of the quiz. 11. Conduction of Viva-Voce Examinations: Teacher should conduct oral exams of the students with full preparation. Normally, the objective questions with guess are to be avoided. To make it meaningful, the questions should be such that depth of the students in the subject is tested Oral examinations are to be conducted in co-cordial environment amongst the teachers taking the examination. Teachers taking such examinations should not have ill thoughts about each other and courtesies should be offered to each other in case of difference of opinion, which should be critically suppressed in front of the students.

26 12. Submission: Document Standard: A] Page Size A4 Size B] Running text Justified text C] Spacing 1 Line D] Page Layout and Margins (Dimensions in Cms) Normal Page Horizontal Description Font Size Boldness Italics Underline Capitalize College Name Arial Yes Document Title Tahoma Document Subject Century Gothic Capital Class Bookman old Style Document No Bookman old Style Copy write inf Bookman old Style Forward heading Bookman old Yes Capital Style Forward matter Bookman old Style Lab man Contents Bookman old Yes Capital title Style Index title Bookman old 12 Yes Yes Capital Style Index contents Bookman old

27 Style Heading Tahoma 14 Yes Yes Yes Running Matter Comic Sans MS Evaluation and marking system: Basic honesty in the evaluation and marking system is absolutely essential and in the process impartial nature of the evaluator is required in the examination system to become popular amongst the students. It is a wrong approach or concept to award the students by way of easy marking to get cheap popularity among the students to which they do not deserve. It is a primary responsibility of the teacher that right students who are really putting up lot of hard work with right kind of intelligence are correctly awarded. The marking patterns should be justifiable to the students without any ambiguity and teacher should see that students are faced with unjust circumstances.

Jawaharlal Nehru Engineering College

Jawaharlal Nehru Engineering College Laboratory Manual Operating System For Third Year Students CSE Dept: Computer Science & Engineering (NBA Accredited) Author JNEC, Aurangabad 1 FOREWORD It is my great