# CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR:

Save this PDF as:

Size: px
Start display at page:

Download "CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR:"

## Transcription

1 CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR: SCHOOL OF COMPUTER SCIENCE & ENGINEERING SRM UNIVERSITY, SRM NAGAR, KATTANKULATHUR KANCHEEPURAM DISTRICT. 1

2 SCHOOL OF COMPUTER SCIENCE & ENGINEERING SRM UNIVERSITY, SRM NAGAR, KATTANKULATHUR SUBJECT : DATA STRUCTURES AND ALGORITHM SUBJECT CODE : CS0213 SEMESTER : III CLASS : II CSE HOURS / WEEK : 6 HOURS EX. NO NAME OF THE EXPERIMENTS PAGE NO LINEAR SEARCH 3 BINARY SEARCH 5 SELECTION SORT 7 BUBBLE SORT 9 INSERTION SORT 11 MERGE SORT 13 QUICK SORT 15 STACKS 17 QUEUES 19 MAXIMUM AND MINIMUM 21 KNAPSACK PROBLEM 23 SINGLY LINKED LIST 25 2

3 LINEAR SEARCH AIM: To find a given target number using linear search from the list of numbers. ALGORITHM: Step 1: Initialize the integer variables Step 2: Get the target number from user Step 3: Get the list of numbers to be searched Step 4: If the counter is equal to target the print the location Step 5: If it is not equal to then print that the location is not found 3

4 INPUT: Enter the number to be found: 25 Enter the number of elements in the list: 5 Enter the elements: OUTPUT: The number is found in location: 4 RESULT: The target number is found using linear search successfully 4

5 BINARY SEARCH AIM: To find a given target number using Binary Search from the list of number. ALGORITHM: Step 1: Initialize the integer variables Step 2: Get the values from the list Step 3: Sorted List of numbers is got as input. Step 4: Get the target number from the user. Step 5: Initialize first value as zero and last as n-1; Step 6: The mid value is found. Step 7: If the target is greater than mid then first is mid + 1 if not last is mid -1. Step 8: First is last +1 Step 9: The target is found, if its equal to a(mid) otherwise target is not found. 5

6 INPUT: Enter the number of elements in the list: 5 Enter the sorted list: Enter the target: 33 OUTPUT: The target is found in location: 3 RESULT: The target number is found using Binary Search successfully 6

7 SELECTION SORT AIM: To sort the given data using selection sort. ALGORITHM: Step 1: Initialize the integer variables. Step 2: Get the total number of values from the user. Step 3: Get the numbers to be sorted. Step 4: Initialize i to current Step 5: If current is less than j,then initialize j to current. Step 6: Assign j to temp, current to i and temp to current for swapping Step 7: print the sorted data 7

8 INPUT Enter the number of elements: 5 Enter the Numbers to be sorted: OUTPUT Sorted Data: RESULT: The given data is sorted and printed using selection sort. 8

9 BUBBLE SORT AIM: To sort the given data using Bubble sort. ALGORITHM: Step 1: Initialize the variables i,j,n, and temp. Step 2: Get the number of elements. Step 3: Get the numbers to be sorted. Step 4; Assign a[i] to temp Step 5: Assign a[i+1] to a[i] Step 6: Assign Temp to a[i+1] Step 7: The data is sorted. 9

10 INPUT Enter the number of elements: 6 Enter the numbers to be sorted: OUTPUT Sorted Data: RESULT: The given data is sorted and printed using Bubble sort. 10

11 INSERTION SORT AIM: To sort the given data using Insertion sort. ALGORITHM: Step 1: Initialize the variables i,j,n, curr and temp. Step 2: Get the number of elements. Step 3: Get the numbers to be sorted. Step 4: If the second element is less than the first element then assign it to temp. Step 5: Assign the first element to second element. Step 6: Assign Temp to first element. Step 7: The swapping is done Step 8: The data is sorted. 11

12 INPUT Enter the number of entries: 5 Enter the list of no to be sorted: OUTPUT The sorted list: RESULT: The given data is sorted and printed using Insertion Sort. 12

13 MERGE SORT AIM: To sort the given data using Merge sort. ALGORITHM: Step 1: Initialize the variables i,j,n,h,k,low,high. Step 2: Get the number of elements. Step 3: Get the numbers to be sorted. Step 4: If low is less than high then find the mid value. Step 5: Initialize h and i to low. Step 6: Initialize a[h] to b[i] else a[j] to b[i]. Step 7: If h is greater than mid then a[k] == b[i] else b[k] == a[k] Step 8 The data is sorted and printed. 13

14 INPUT Enter the number of elements: 7 The elements: OUTPUT Sorted Data: RESULT: The given data is sorted and printed using Merge Sort. 14

15 QUICK SORT AIM: To sort the given data using Quick Sort. ALGORITHM: Step 1: Initialize the variables i,j,n,r,p,q. Step 2: Get the number of elements. Step 3: Get the numbers to be sorted. Step 4: If p is less than q then the function is called. Step 5: If i is less than j, then interchange them. Step 6: If I is less than pivort interchange them. Step 7: The data is sorted and printed. 15

16 INPUT Enter the number of elements: 5 Enter the unsorted list: OUTPUT The sorted list is: RESULT: The given data is sorted and printed using Quick Sort. 16

17 STACKS AIM: To perform all stacks operation. ALGORITHM: Step 1: Initialize the integer variables. Step 2: In a switch case, in case 1 the number to be pushed is got Step 3:Top is now equal to top+1 Step 4: Else the stack is full Step 5: In case 2 the number to be deleted is got Step 6: Top is now equal to top-1 Step 7: Else the stack is empty Step 8: In case 3 if the top is less than 0 the stack is full Step 9: Else the stack is printed Step 10: Default is no such choice INPUT / OUTPUT Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 17

18 1 Enter the number to be Added: 11 Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 1 Enter the number to be Added: 22 Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 1 Enter the number to be Added: 33 Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 1 Enter the number to be Added: 44 Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 2 Enter the number to be Added: 44 Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 3 The stack is Enter the operation to be performed: 1) push 2) pop 3) display 4) exit 4 RESULT: All the stack operations are performed using the switch case 18

19 QUEUES AIM: To perform all the queue operations ALGORITHM: Step 1:Initialize the integer variables Step 2:In a switch case in case 1 get the number to be added in the queue Step 3: Else the queue is full Step 4: In case 2 get the number to be deleted from the queue Step 5: Else the queue is full Step 6: If tail and head are less than 0 then in case 3 the queue is full Step 7: Else the queue is printed Step 8: The default case is no such choice 19

20 INPUT / OUTPUT: Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 1 Enter the number to be added 11 Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 1 Enter the number to be added 22 Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 1 Enter the number to be added 33 Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 1 Enter the number to be added 44 Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 2 The number to be deleted is 11 Enter the operation to be performed: 1)Enqueue 2)Dequeue 3)Display 4)Exit 3 The queue is RESULT: All the queue operations are performed 20

21 MAXIMUM AND MINIMUM AIM: To find the maximum and minimum value in a given list of numbers ALGORITHM: Step 1:Initialise the variables in the main function Step 2: Get the total number of items Step 3: Get the numbers from the user Step 4: The function is called. If there is only one element then the max and min is the same element Step 5: If there is two element then check if a[x] is less than a[y] then a[x] is min and a[y] is max Step 6: If there is more number of items mid value is found Step 7: Now max is assigned to t1 and min to t2 Step 8: If the max is less than t1 the max is t1,if min is greater than t2 the min t2 Step 9: The min and max values are found and printed 21

22 INPUT Enter the no of numbers: 6 Enter the numbers: OUTPUT Maximum Number = 92 Minimum Number = 05 RESULT: The maximum and minimum number is found and printed. 22

23 KNAPSACK PROBLEM AIM: To find the maximum profit from the items in the bag. ALGORITHM: Step 1: Initialize the variables, profit, weight, p/w and maxprofit. Step 2: Get the number of elements. Step 3: Get the capacity of the bag. Step 4: Get the profit of items in the bag. Step 5: Get the weight of each item in the bag. Step 7: Assign pw[j] to t1, p[j] to t2 and w[j] to t3. Step 8: If w[i] > capacity then find the ratio of capacity to weight of each item. Step 9: Else subtract the weight of the item from the total capacity. Step 10: Solution vector is found and printed. Step 11: The maximum profit is found and printed. 23

24 INPUT/OUTPUT: Enter the number of elements: 4 Enter the capacity: 4 Enter the profit: Enter the weight: Enter the p/w ratio: Solution vector: Profit: 16 RESULT: The maximum profit is found and printed on the screen. 24

25 SINGLY LINKED LIST AIM: To perform all the singly linked list operations ALGORITHM: Step 1: Declare the functions to create,display,count. Step 2: Declare the variables in the main function. Step 3: In a switch case get each functions number. Step 4: To append the list create the memory by using malloc function. Step 5: Assign a variable temp using pointers. Step 6: To delete a node create a dummy variable. Step 7: Check if the list is empty otherwise display the list using for statement. Step 8: To insert a node in middle, allocate memory using malloc function 25

26 INPUT / OUTPUT: Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit Enter your Choice: 1 Enter any number: 12 Enter more(y/n): y Enter any number: 13 Enter more(y/n): n Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit Enter your Choice: 2 Enter the Data to be inserted at Beginning: 11 Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit 26

27 Enter your Choice: 3 Enter the Position to be Inserted: 2 Enter the Data: 14 Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit Enter your Choice: 4 Enter the Data to be Deleted: 12 Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit Enter your Choice: 5 The Number of Nodes: 3 27

28 Singly Linked List: 1. Create or Append List 2. Insert in Beginning 3. Insert in Middle 4. Remove from the List 5. Count 6. Display 7. Quit Enter your Choice: RESULT: All the Singly Linked List operations are performed. 28

### DATA STRUCTURES USING C

DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give

### MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) -----------------------------------------

=============================================================================================================================== DATA STRUCTURE PSEUDO-CODE EXAMPLES (c) Mubashir N. Mir - www.mubashirnabi.com

### 10CS35: Data Structures Using C

CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a

### AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm

AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm Time: Three Hours] [Maximum Marks: 60 Note Attempts all the questions. All carry equal marks Section A

### PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

### Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in

### Data Structures. Level 6 C30151. www.fetac.ie. Module Descriptor

The Further Education and Training Awards Council (FETAC) was set up as a statutory body on 11 June 2001 by the Minister for Education and Science. Under the Qualifications (Education & Training) Act,

### Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that

### 12 Abstract Data Types

12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

### Analysis of a Search Algorithm

CSE 326 Lecture 4: Lists and Stacks 1. Agfgd 2. Dgsdsfd 3. Hdffdsf 4. Sdfgsfdg 5. Tefsdgass We will review: Analysis: Searching a sorted array (from last time) List ADT: Insert, Delete, Find, First, Kth,

### VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 603 203 DEPARTMENT OF COMPUTER APPLICATIONS QUESTION BANK IN REVISED BLOOM S TAXONOMY

ACADEMIC YEAR: 0 7 VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 0 0 SEMESTER: ODD BRANCH: MCA YEAR: I SEMESTER: I SUBJECT CODE AND NAME: MC70 Problem Solving and Programming NAME OF THE FACULTY

### Data Structures and Data Manipulation

Data Structures and Data Manipulation What the Specification Says: Explain how static data structures may be used to implement dynamic data structures; Describe algorithms for the insertion, retrieval

### 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

### 6 March 2007 1. Array Implementation of Binary Trees

Heaps CSE 0 Winter 00 March 00 1 Array Implementation of Binary Trees Each node v is stored at index i defined as follows: If v is the root, i = 1 The left child of v is in position i The right child of

### CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards

CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards Course Title: TeenCoder: Java Programming Course ISBN: 978 0 9887070 2 3 Course Year: 2015 Note: Citation(s) listed may represent

### CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we learned about the ADT Priority Queue. A

### Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

Quiz 4 Solutions Q1: What value does function mystery return when called with a value of 4? int mystery ( int number ) { if ( number

### Linked Lists Linked Lists, Queues, and Stacks

Linked Lists Linked Lists, Queues, and Stacks CSE 10: Introduction to C Programming Fall 200 Dynamic data structure Size is not fixed at compile time Each element of a linked list: holds a value points

### \Mankinds's progress is measured by the number of. Elementary data structures such as stacks, queues,

Elementary Data Structures \Mankinds's progress is measured by the number of things we can do without thinking." Elementary data structures such as stacks, queues, lists, and heaps will be the \of-the-shelf"

### Data Structures and Algorithm Analysis (CSC317) Intro/Review of Data Structures Focus on dynamic sets

Data Structures and Algorithm Analysis (CSC317) Intro/Review of Data Structures Focus on dynamic sets We ve been talking a lot about efficiency in computing and run time. But thus far mostly ignoring data

### BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester

### Linked Lists, Stacks, Queues, Deques. It s time for a chainge!

Linked Lists, Stacks, Queues, Deques It s time for a chainge! Learning Goals After this unit, you should be able to... Differentiate an abstraction from an implementation. Define and give examples of problems

### Common Data Structures

Data Structures 1 Common Data Structures Arrays (single and multiple dimensional) Linked Lists Stacks Queues Trees Graphs You should already be familiar with arrays, so they will not be discussed. Trees

### Analysis of Binary Search algorithm and Selection Sort algorithm

Analysis of Binary Search algorithm and Selection Sort algorithm In this section we shall take up two representative problems in computer science, work out the algorithms based on the best strategy to

### CMPS 102 Solutions to Homework 1

CMPS 0 Solutions to Homework Lindsay Brown, lbrown@soe.ucsc.edu September 9, 005 Problem..- p. 3 For inputs of size n insertion sort runs in 8n steps, while merge sort runs in 64n lg n steps. For which

### Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate

### Data Structures and Algorithms Stacks and Queues

Data Structures and Algorithms Stacks and Queues Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/23 6-0: Stacks and

### Binary Heaps. CSE 373 Data Structures

Binary Heaps CSE Data Structures Readings Chapter Section. Binary Heaps BST implementation of a Priority Queue Worst case (degenerate tree) FindMin, DeleteMin and Insert (k) are all O(n) Best case (completely

### QUEUES. Primitive Queue operations. enqueue (q, x): inserts item x at the rear of the queue q

QUEUES A queue is simply a waiting line that grows by adding elements to its end and shrinks by removing elements from the. Compared to stack, it reflects the more commonly used maxim in real-world, namely,

### UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE

STUDENT IDENTIFICATION NO UNIVERSITI MALAYSIA SARAWAK 94300 KOTA SAMARAHAN SARAWAK FAKULTI SAINS KOMPUTER & TEKNOLOGI MAKLUMAT (Faculty of Computer Science & Information Technology) Diploma in Multimedia

### 1/1 7/4 2/2 12/7 10/30 12/25

Binary Heaps A binary heap is dened to be a binary tree with a key in each node such that: 1. All leaves are on, at most, two adjacent levels. 2. All leaves on the lowest level occur to the left, and all

### Data Structures and Algorithms

Data Structures and Algorithms Lecture 4 2016 Stacks and... 1/28 1 2 Circular Linked 3 Queue Syntax and Functions in C++ 4 Stacks and... 2/28 FIFO and LIFO Outline Data structures can be specialized versions

### Cpt S 223. School of EECS, WSU

Priority Queues (Heaps) 1 Motivation Queues are a standard mechanism for ordering tasks on a first-come, first-served basis However, some tasks may be more important or timely than others (higher priority)

### Algorithms and Data Structures

Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2

### GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: 3330704)

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT Course Curriculum DATA STRUCTURES (Code: 3330704) Diploma Programme in which this course is offered Semester in which offered Computer Engineering,

### Bhakta Kavi Narsinh Mehta University, Junagadh

Bhakta Kavi Narsinh Mehta University, Junagadh Draft Syllabus for B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1) Effective From June - 2016 B.Sc. (C.S.) (Semester - 1) CS-101:

### Data Structure [Question Bank]

Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:

### 7.1 Our Current Model

Chapter 7 The Stack In this chapter we examine what is arguably the most important abstract data type in computer science, the stack. We will see that the stack ADT and its implementation are very simple.

### 6. Standard Algorithms

6. Standard Algorithms The algorithms we will examine perform Searching and Sorting. 6.1 Searching Algorithms Two algorithms will be studied. These are: 6.1.1. inear Search The inear Search The Binary

### INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK A REVIEW ON THE USAGE OF OLD AND NEW DATA STRUCTURE ARRAYS, LINKED LIST, STACK,

### Introduction to Data Structures and Algorithms

Introduction to Data Structures and Algorithms Chapter: Elementary Data Structures(1) Lehrstuhl Informatik 7 (Prof. Dr.-Ing. Reinhard German) Martensstraße 3, 91058 Erlangen Overview on simple data structures

1 ADTs,, Arrays, Linked Lists Outline and Required Reading: ADTs ( 2.1.2) Arrays ( 1.5) Linked Lists ( 4.3.1, 4.3.2) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic Abstract Data Type (ADT) 2 abstract

### Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

### Sample Questions Csci 1112 A. Bellaachia

Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k

### 5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

### 1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated

### Data Structures Using C++ 2E. Chapter 5 Linked Lists

Data Structures Using C++ 2E Chapter 5 Linked Lists Doubly Linked Lists Traversed in either direction Typical operations Initialize the list Destroy the list Determine if list empty Search list for a given

### Data Structures and Algorithms V22.0102. Otávio Braga

Data Structures and Algorithms V22.0102 Otávio Braga We use a stack When an operand is read, output it When an operator is read Pop until the top of the stack has an element of lower precedence Then push

### 22c:31 Algorithms. Ch3: Data Structures. Hantao Zhang Computer Science Department http://www.cs.uiowa.edu/~hzhang/c31/

22c:31 Algorithms Ch3: Data Structures Hantao Zhang Computer Science Department http://www.cs.uiowa.edu/~hzhang/c31/ Linear Data Structures Now we can now explore some convenient techniques for organizing

### Binary Heap Algorithms

CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell

### CHAPTER 4 ESSENTIAL DATA STRUCTRURES

CHAPTER 4 ESSENTIAL DATA STRUCTURES 72 CHAPTER 4 ESSENTIAL DATA STRUCTRURES In every algorithm, there is a need to store data. Ranging from storing a single value in a single variable, to more complex

### STACKS,QUEUES, AND LINKED LISTS

STACKS,QUEUES, AND LINKED LISTS Stacks Queues Linked Lists Double-Ended Queues Case Study: A Stock Analysis Applet 1 Stacks Astack is a container of objects that are inserted and removed according to the

### BCS2B02: OOP Concepts and Data Structures Using C++

SECOND SEMESTER BCS2B02: OOP Concepts and Data Structures Using C++ Course Number: 10 Contact Hours per Week: 4 (2T + 2P) Number of Credits: 2 Number of Contact Hours: 30 Hrs. Course Evaluation: Internal

### KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL

### ASSEMBLY PROGRAMMING ON A VIRTUAL COMPUTER

ASSEMBLY PROGRAMMING ON A VIRTUAL COMPUTER Pierre A. von Kaenel Mathematics and Computer Science Department Skidmore College Saratoga Springs, NY 12866 (518) 580-5292 pvonk@skidmore.edu ABSTRACT This paper

### A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION Tao Chen 1, Tarek Sobh 2 Abstract -- In this paper, a software application that features the visualization of commonly used

### Data Structures. Jaehyun Park. CS 97SI Stanford University. June 29, 2015

Data Structures Jaehyun Park CS 97SI Stanford University June 29, 2015 Typical Quarter at Stanford void quarter() { while(true) { // no break :( task x = GetNextTask(tasks); process(x); // new tasks may

### PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?

1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members

### csci 210: Data Structures Stacks and Queues

csci 210: Data Structures Stacks and Queues Summary Topics stacks and queues as abstract data types implementations arrays linked lists analysis and comparison application: searching with stacks and queues

### C++ Programming Language

C++ Programming Language Lecturer: Yuri Nefedov 7th and 8th semesters Lectures: 34 hours (7th semester); 32 hours (8th semester). Seminars: 34 hours (7th semester); 32 hours (8th semester). Course abstract

### Zabin Visram Room CS115 CS126 Searching. Binary Search

Zabin Visram Room CS115 CS126 Searching Binary Search Binary Search Sequential search is not efficient for large lists as it searches half the list, on average Another search algorithm Binary search Very

### Chapter 3: Restricted Structures Page 1

Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both

### Module 2 Stacks and Queues: Abstract Data Types

Module 2 Stacks and Queues: Abstract Data Types A stack is one of the most important and useful non-primitive linear data structure in computer science. It is an ordered collection of items into which

### Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010 Problem 1. In each of the following question, please specify if the statement

### DATA STRUCTURE - QUEUE

DATA STRUCTURE - QUEUE http://www.tutorialspoint.com/data_structures_algorithms/dsa_queue.htm Copyright tutorialspoint.com Queue is an abstract data structure, somewhat similar to stack. In contrast to

### G. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session 2006-2007 DEPARTMENT CSE Semester IV SUBJECT DSPD

G. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session 2006-2007 DEPARTMENT CSE Semester IV SUBJECT DSPD LIST OF EXPERIMENTS 1.Make a database. The record tag,tstudent consists of these fields: Name[20],RollNo.[5],Address[40],Phone[12],UT-1[2,from1

### What is a Stack? Stacks and Queues. Stack Abstract Data Type. Java Interface for Stack ADT. Array-based Implementation

Stacks and Queues What is a Stack? Stores a set of elements in a particular order Accessed in Last-In In-First-Out (LIFO) fashion Real life examples: Pile of books PEZ dispenser Cup trays in cafeteria

### C programming: exercise sheet L2-STUE (2011-2012)

C programming: exercise sheet L2-STUE (2011-2012) Algorithms and Flowcharts Exercise 1: comparison Write the flowchart and associated algorithm that compare two numbers a and b. Exercise 2: 2 nd order

### Binary Heaps * * * * * * * / / \ / \ / \ / \ / \ * * * * * * * * * * * / / \ / \ / / \ / \ * * * * * * * * * *

Binary Heaps A binary heap is another data structure. It implements a priority queue. Priority Queue has the following operations: isempty add (with priority) remove (highest priority) peek (at highest

### Class Overview. CSE 326: Data Structures. Goals. Goals. Data Structures. Goals. Introduction

Class Overview CSE 326: Data Structures Introduction Introduction to many of the basic data structures used in computer software Understand the data structures Analyze the algorithms that use them Know

### Unit 1. 5. Write iterative and recursive C functions to find the greatest common divisor of two integers. [6]

Unit 1 1. Write the following statements in C : [4] Print the address of a float variable P. Declare and initialize an array to four characters a,b,c,d. 2. Declare a pointer to a function f which accepts

### Data Structures and Algorithms

Data Structures and Algorithms CS245-2016S-04 Stacks and Queues David Galles Department of Computer Science University of San Francisco 04-0: Abstract Data Types An Abstract Data Type is a definition of

### Sequential Data Structures

Sequential Data Structures In this lecture we introduce the basic data structures for storing sequences of objects. These data structures are based on arrays and linked lists, which you met in first year

### CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.

Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure

### Day 1. This is CS50 for MBAs. Harvard Busines School. Spring 2015. Cheng Gong

This is CS50 for MBAs. Harvard Busines School. Spring 2015. Cheng Gong Table of Contents Gangnam Style... 1 Internet Issues... 2 Course info... 6 Day 0, recap... 7 Peanut butter jelly time... 8 Sorting...

### List, Stack and Queue. Tom Chao Zhou CSC2100B Data Structures Tutorial 3

List, Stack and Queue Tom Chao Zhou CSC2100B Data Structures Tutorial 3 Outline Structure Linked List Overview Implementation Stack Overview Implementation Queue Overview Implementation Structure A collection

### CS 6202 PROGRAMMING & DATA STRUCTURES-I PART-B UNIT-I ANNA UNIVERSITY QUESTIONS

PART-B UNIT-I 1. Write a function that returns a pointer to the maximum value of an array of double s.if the array is empty,return null? (8) Double*maximum(double*a,int size); 2. Write a c program to find

### L T P C Course Name: Linux Lab 0 0 4 2. Course Code: PBC - 602

Course Code: PBC - 602 Course Name: Linux Lab 0 0 4 2 1) Write a shell script to input two numbers and perform all mathematical operations on them 2) Write a shell script to print the information about

### The Elective Part of the NSS ICT Curriculum D. Software Development

of the NSS ICT Curriculum D. Software Development Mr. CHEUNG Wah-sang / Mr. WONG Wing-hong, Robert Member of CDC HKEAA Committee on ICT (Senior Secondary) 1 D. Software Development The concepts / skills

### BM267 - Introduction to Data Structures

BM267 - Introduction to Data Structures 3. Elementary Data Structures Ankara University Computer Engineering Department BLM267 1 Objectives Learn about elementary data structures - Data structures that

### Course: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1

Definition Course: Programming II - Abstract Data Types The ADT Stack The ADT Stack is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit insertions

### Queues Outline and Required Reading: Queues ( 4.2 except 4.2.4) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic

Queues Outline and Required Reading: Queues ( 4. except 4..4) COSC, Fall 3, Section A Instructor: N. Vlajic Queue ADT Queue linear data structure organized according to first-in/first-out (FIFO) principle!

### PROBLEMS (Cap. 4 - Istruzioni macchina)

98 CHAPTER 2 MACHINE INSTRUCTIONS AND PROGRAMS PROBLEMS (Cap. 4 - Istruzioni macchina) 2.1 Represent the decimal values 5, 2, 14, 10, 26, 19, 51, and 43, as signed, 7-bit numbers in the following binary

### Chapter 7. Ch.7 Problem Solving and Algorithms

Chapter 7 Ch.7 Problem Solving and Algorithms QUIZ: Match the steps in Polya s method to the ones in the computer method for problem solving Devise a plan Look back Understand Carry out the plan Analysis

### UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming

UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything

### COMPUTER SCIENCE. Paper 1 (THEORY)

COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

### This lecture. Abstract data types Stacks Queues. ADTs, Stacks, Queues 1. 2004 Goodrich, Tamassia

This lecture Abstract data types Stacks Queues ADTs, Stacks, Queues 1 Abstract Data Types (ADTs) An abstract data type (ADT) is an abstraction of a data structure An ADT specifies: Data stored Operations

### Node-Based Structures Linked Lists: Implementation

Linked Lists: Implementation CS 311 Data Structures and Algorithms Lecture Slides Monday, March 30, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org

### SANKALCHAND PATEL COLLEGE OF ENGINEERING, VISNAGAR ODD/EVEN ACADEMICSEMESTER (2014-15) ASSIGNMENT / QUESTION BANK (2110003) [F.Y.B.E.

SANKALCHAND PATEL COLLEGE OF ENGINEERING, VISNAGAR ODD/EVEN ACADEMICSEMESTER (2014-15) ASSIGNMENT / QUESTION BANK Subject: Computer Programming and Utilization (2110003) [F.Y.B.E.: ALL BRANCHES] Unit 1

### Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

### TIE-20106 1 TIE-20106 2

TIE-20106 1 1 List structures In this chapter, a few simple data structures (stack and queue) that can be implemented with arrays and/or lists are covered. Two more complex structures based on lists are

### Project No. 2: Process Scheduling in Linux Submission due: April 28, 2014, 11:59pm

Project No. 2: Process Scheduling in Linux Submission due: April 28, 2014, 11:59pm PURPOSE Getting familiar with the Linux kernel source code. Understanding process scheduling and how different parameters

### International Journal Of Engineering Research & Management Technology

International Journal Of Engineering Research & Management Technology ISSN: 2348-4039 September- 2014 Volume 1, Issue-5 Dynamic Implementation Using Linked List Karuna Department of Information and Technology

### Pseudo code Tutorial and Exercises Teacher s Version

Pseudo code Tutorial and Exercises Teacher s Version Pseudo-code is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy

### Storage Classes CS 110B - Rule Storage Classes Page 18-1 \handouts\storclas

CS 110B - Rule Storage Classes Page 18-1 Attributes are distinctive features of a variable. Data type, int or double for example, is an attribute. Storage class is another attribute. There are four storage

### Figure 1: Graphical example of a mergesort 1.

CSE 30321 Computer Architecture I Fall 2011 Lab 02: Procedure Calls in MIPS Assembly Programming and Performance Total Points: 100 points due to its complexity, this lab will weight more heavily in your

### DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN

ERODE SENGUNTHAR ENGINEERING COLLEGE (Approved by AICTE, New Delhi, Permanently Affiliated to Anna University - Chennai & Accredited by NAAC & National Board of Accreditation (NBA), New Delhi, Accredited

### Java Software Structures

INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition