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

Size: px
Start display at page:

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

Transcription

1 G. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session 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 to 20],UT- 2[2,from 1 to 20],PUT[3,1 TO 100],Total[3,from 1 to 140] User should able to add new, edit existing, view student in a list, delete the record also. 2.Write a program for two polynomial additions and subtraction without using records And by using records also. 3.Write a program for sorting into the linked list. 4. Write program to create, insert and delete elements in a linked list. 5. Write a program to implements a stack using array. 6.Write a program to insert,delete element in queue. 7. Write a program for addition and deletion in the circular queue. 8. Write a program for creation of binary search tree and Inorder traversal. 9.Write a program to create a BST by inserting a node & Preorder,Inorder and Postorder Traversal. 10. Write a program to store and retrive data of student in a class. The data is stored ina file name file.dat.

2 Experiment no. :--1 Aim :-- Make a database. The record tag,tstudent consists of these fields: Name[20],RollNo.[5],Address[40],Phone[12],UT-1[2,from1 to 20],UT-2[2,from 1 to 20],PUT[3,1 TO 100],Total[3,from 1 to 140] User should able to add new, edit existing, view student in a list, delete the record also. Theory:-- A record is a collection of data item, usually different datatypes which are logically combined into single unit. The record is a heterogeneous component datatype as it is composed of data element s that may be of different data types. The components of a records are called fields. Each fields has an identifier and a datatype. Declaration :-- 1)Record :- type<recordname>=record <Member 1>: <type> <member2> :<type>.. <member n> : <type> End; 2) Array of Record Var <nametype> : array of [l..u] of <recordname> Diagram :-- Flowchart of program. Algorithm Record:-- 1.Declare the Records, Array And type of variables. 2.Create the Menu a)add new Record. b)edit the Existing. c)view the List. d)delete the Record. 3.To Add new record in a list WhileA[i]<=u A[i].name= name ; A[i].roll=123;

3 A[i].address= Address ; A[i].phone= 12233; A[i].address= 19; A[i].address= 17; A[i].address= 99; A[i].address= 139; i=i+1; 4.To view the list Display all the fields of record by using write statement; 5.To delete the record from the list Sample input/sample output:--execute the program for sample values. Result :--- Viva voice What is mean by array. How to define it. What is the record. How to declare it. How to store value in the array How to use Array of record.

4 Experiment No.:--2 Aim: -- Write a program for two polynomial additions and subtraction without using records and by using records also. Theory:--An important application of linked list is to represent Polynomials and their manipulations. In addition and subtraction of two polynomials, say P & Q to get resultant polynomial R, have to compare their terms stating at the first nodes and moving towards the end one by one. Declaration:-- Type <PointerType> : ^<Referenced datatype>; Type intpointer = ^ integer; Var counter: intpointer; Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. 1.Declare the Records, Array And type of variables. 2.Create the Menu a)add new Record. b)subtraction. 3.Pptr=PHEADER.LINK,Qptr= QHEADER.LINK 4. RHEADER=GETNODE(NODE) 5.RHEADER.LINK=NULL RHEADER.EXP=NULL,RHEADER.COEFF=NULL 6.Rptr=RHEADER 7.WHILE(Pptr!=NULL)AND(Qptr!= NULL) do 1 CASE:Pptr.EXP 1. NEW= GETNODE(NODE) 2.Rptr.LINK=new, Rptr=new 3.Rptr.COEFF=P.COEFFptr.+ Qptr.COEFF 4.Rptr.EXP=Pptr.EXP 5. Rptr.LINK=NULL 6.Pptr=Pptr.LINK,Qptr=Qptr.LINK 2 CASE:Pptr.EXP>Qptr.Exp 1. NEW=GETNODE(NODE) 2.Rptr.LINK=new, Rptr=new 3.Rptr.COEFF=Pptr.COEFF

5 4.Rptr.EXP=Pptr.EXP 5. Rptr.LINK=NULL 6.Pptr=Pptr.LINK 3 CASE:Pptr.EXP<Qptr.Exp 1. NEW=GETNODE(NODE) 2.Rptr.LINK=new, Rptr=new 3.Rptr.COEFF=Qptr.COEFF 4.Rptr.EXP=Qptr.EXP 5. Rptr.LINK=NULL 6.Qptr=Qptr.LINK 8.Endwhile 9.If(Pptr1!=NULL)AND(Qptr=NULL) then 1.While((Pptr1= Null)do 1. NEW=GETNODE(NODE) 2.Rptr.LINK=new, Rptr=new 3.Rptr.COEFF=Pptr.COEFF 4.Rptr.EXP=Pptr.EXP 5. Rptr.LINK=NULL 6.Qptr=Qptr.LINK 2. Endwhile 10. Endif 11. If(Pptr1=NULL)AND(Qptr!=NULL) then 1.While((Pptr1= Null)do 1. NEW=GETNODE(NODE) 2.Rptr.LINK=new, Rptr=new 3.Rptr.COEFF=Qptr.COEFF 4.Rptr.EXP=Qptr.EXP 5. Rptr.LINK=NULL 6.Qptr=Qptr.LINK 2. Endwhile 12. Endif 13. Return(RHeader) 14. stop. Sample Input/Sample Output: --- Execute the program for some sample values. Result:-- Viva voice:-- Definition of pointers How to declare the pointer. General form of the polynomial.

6 How to add two polynomials. Experiment No.:--3 Aim: -- 3.Write a program for search an element in sorted the linked list. Theory:--A link list is an ordered collection of finite, homogeneous data element s called nodes where the linear order is maintained by means of links or pointers. Declaration:-- Type <PointerType> : ^<Referenced datatype>; Type intpointer = ^ integer; Var counter: intpointer; Diagram:-- Flowchart of program. Algorithm: -- Steps use to sort the elements in linked list. SRCHSL(INFO,LINK,START,ITEM,LOC) LIST is a sorted list in memory. This algorithm find the location LOC of the node where ITEM first appears in LIST, or sets LOC = NULL 1. Set PTR :=START Repeat Steps 3 while PTR <> NULL 3. If ITEM<INFO[PTR], then: Set PTR=LINK[PTR] Else if ITEM:=INFO[PTR],Exit. Else: Set LOC :=NULL,and Exit. 4. Set LOC :=NULL 5. Exit. Sample Input/Sample output: --- Execute the program for some sample values. Result:--

7 Viva voice:-- Definition of pointers How to declare the pointer. Definition of pointer to pointer What is single link list Circular linked list Double link list.

8 Experiment No.:--4 Aim: Write program to create, insert and delete elements in a linked list. Theory:--An important operation on a linked list. Traversing a list Insertion of a node into a list. Deletion of a node from the list. Searching for an element in a list. Merging two linked list into a larger list. Declaration:-- Type <Pointer Type> : ^<Referenced datatype>; Type intpointer = ^ integer; Var counter: intpointer; Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. INSERT-SL-ANY(HEADER,X,KEY) 1. new = GETNODE(NODE) 2. If (new = NULL) then a. Print Memory is insufficient : Insertion is not possible b. Exit. 3. Else a. Ptr= HEADER b. While(PTR.DATA<>key)and(ptr.LINK<> NULL) do 1. ptr = ptr1.link c. Endwhile e. If (ptr.link = NULL) then 1. Print Key is not available in the list 2. Exit f. Else 1. new.link = ptr.link 2. new.data= x 3. ptr.link= NEW g. Endif 4. Endif 5. Stop

9 Sample Input/Sample output :--- Execute the program for some sample values. Result:-- Viva voice:-- Definition of pointers How to declare the pointer. How to insert node in the linked list. Define the Header. How to delete the node at the last position in the linked list.

10 Experiment No.:--5 Aim: --.Write a program to implement stack using array. Theory:--A stack is an ordered collection of homogeneous data element where the insertion and deletion operation take place at one end only. An n-element array can be used to implement a stack with capacity n. The stack top is indicated by the the index top and it points to the element that was entered into the stack. Declaration:-- Type Stack = array [1.. stacksize] of integer; Stacklimit = 0..stacksize; Var s: stack Diagram:-- Flowchart of program. Algorithm: -- STATUS_A() Input :-- A stack with elements. Output : States whether it is empty or full, available free space and item at TOP. Data Structure : An Array A with TOP as the pointer. Steps 1. If TOP<1 1. Print Stack is Empty 2. Else 1.If(TOP>= SIZE) then a. Print Stack is full 2. Else 1. Print The element at TOP is. A[TOP] 2. free = (SIZE- TOP)/SIZE * Print Percentage of free stack,free 3. Endif 4. Stop. Sample Input /Sample output: --- Execute the program for some sample values. Result:--

11 Viva voice:-- Definition of Stack What are the different operations on the stack. Applications of the stack. Define PUSH operation Define POP operation.

12 Experiment No.:--6 Aim: -- Write a program to insert,delete element in queue. Theory:-- A Queue is an ordered collection of homogeneous data elements where the insertion and deletion operation take place at two extreme ends. Declaration:-- Type queue = array [1.. n] of integer; Var p: queue Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. ENQUEUE(ITEM) Input : An element ITEM that has to be inserted. Output : The ITEM is at the REAR of the Queue. Data Structure : Q is the array representation of queue structure ; two pointers FRONT and REAR of the queue Q are known. Steps: 1. If(REAR = N) then a. Print Queue is full b. Exit 2. Else 1. If (REAR = 0)and (FRONT = 0) a.front = 1 2. Endif 3. REAR = REAR+1 4. Q[REAR] = ITEM 3. Endif 4. Stop. Sample Input/Sample Output: --- Execute the program for some sample values. Result:--

13 Viva voice:-- Definition of Queue How to use queue in program Explain the operations on the Queue Types of Queue Application of Queue..

14 Experiment No.:--7 Aim: -- Write a program for addition and deletion in the circular queue. Theory:-- A Queue is an ordered collection of homogeneous data elements where the insertion and deletion operation take place at two extreme ends. Declaration:-- Type queue = array [1.. n] of integer; Var p: queue Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. ENQUEUE(ITEM) Input : An element ITEM that has to be inserted into the circle queue. Output : The circular queue with the ITEM is at the FRONT if the Queue is not full. Data Structure :CQ is the array to represent the circular queue ; two pointers FRONT and REAR of the queue CQ are known. Steps: 1. If(FRONT = 0) then 1.FORNT = 1 2. REAR = 1 3. CQ[FRONT] = ITEM 2. Else 1. next = (REAR MOD LENGTH)+1 2. If(next<>FRONT) then 1. REAR = next 2. CQ[REAR] = ITEM 3. Else 1. Print Queue is full 4. Endif 3. Endif 4. stop Sample Input/Sample output: --- Execute the program for some sample values. Result:--

15 Viva voice:-- Definition of Queue How to use queue in program Explain the operations on the Queue Types of Queue Application of Queue.. Define CIRCULAR queue

16 Experiment No.:--8 Aim: -- Write a program for creation of binary search tree and Inorder traversal. Theory:-- A binary tree t is termed as binary search tree if each node N of T satisfies the value at N is greater than every value in the left sub-subtree of N and is less than every value in the right sub tree of N. In INORDER traversal, before visiting the root node,left sub-tree of the root is to be visited then root node and after the visit of the root node right sub-tree of the root node will be visited. Visit of both Sub-trees again will be in the same fashion. Declaration:-- Type ptr = ^node; Node = record Lptr :ptr; Val: char: Rptr : ptr; Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. Algorithm INORDER(ROOT) Input : ROOT is the pointer to the root node of the binary tree. Out put : Visiting of all the nodes inorder fashion. Data Structure : Linked structure of Binary tree. Steps 1. ptr = ROOT 2. If (ptr <> NULL) 1. INORDER(ptr.LC) 2. VISIT(ptr) 3. INORDER(ptr.rc) 3. Endif 4. Stop Sample Input/Sample output: --- Execute the program for some sample values. Result:--

17 Viva voice:-- Define BINARY tree How to represent binary tree in memory location Advantages and Disadvantages of binary tree. Operations on binary tree. Traversals of the binary tree

18 Experiment No.:--9 Aim: -- Write a program to create a BST by inserting a node & Preorder,Inorder and Postorder Traversal. Theory :-- A binary tree t is termed as binary search tree if each node N of T satisfies the value at N is greater than every value in the left sub-subtree of N and is less than every value in the right sub tree of N. Declaration:-- Type ptr = ^node; Node = record Lptr :ptr; Val: char: Rptr : ptr; Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. Input: ITEM is the data component of a node that has to be inserted. Output : If there is no node having data ITEM, it is inserted into the tree else a message. Data Structure : Linked Structure of binary tree, Pointer to the root ROOT Steps 1. ptr = ROOT, flag = FALSE 2. While(ptr<> NULL) and (flag = FALSE) 1. Case : ITEM < ptr.data 1. ptr1 = ptr 2. ptr = ptr.lchild 2. Case : ITEM> ptr.data 1. ptr1 = ptr 2. ptr = ptr.rchild 3. Case : ptr.data =ITEM 1. flag = TRUE 2. Print ITEM already exits 3. Exit 4. End Case 3. End while node is Sample Input/Sample output: --- Execute the program for some sample values. Result:--

19 Viva voice:-- Define BINARY tree How to represent binary tree in memory location Advantages and Disadvantages of binary tree. Operations on binary tree. Traversals of the binary tree

20 Experiment No. :--10. Aim :--Write a program to store and retrieve data of student in a class. The data is stored in a file name file.dat. Theory:-- The various types of the file organization are 1)Sequential 2)Random 3) Linked 4)Internal Files Declaration:-- Type <PointerType> : ^<Referenced datatype>; Type intpointer = ^ integer; Var counter: intpointer; Diagram:-- Flowchart of program. Algorithm: -- Steps use to implement the coding. Input: ITEM is the data component of a node that has to be inserted. Output : If there is no node having data ITEM, it is inserted into the tree else a message. Data Structure : Linked Structure of binary tree, Pointer to the root ROOT node is Steps 1.start 2. Declare record type variable name student having 3 fields 1 string type variable & integer variable storing the name,rollno & marks of a student respty. 3. Declare two integer variable 4. Declare a variable of the type student 5. Declare the file variable having having the information student in the data type student 6. Display the message Program to create a sequential file of student 7. Asign the file variable with the file name 8. write in the file new 9. Repeat steps 10 &1 for n>0 10. Display the massage Enter the no of Sequential files 11. Accept the response from the user 12. Repeat steps 13 to 21 for n times 13. with the record type variable do steps 14 to Display message Name is 15. Accept the name from user 16. Display message age is

21 17. Accept the age from user 18. Display message Enrolment is 19. Accept the enrolment from user 20. write all the information in a file 21. end for loop 22. Reset file pointer of the file 23. Display the massage the data file contain the following information 24. Repeat steps 25,26 as long as the end of file is reached 25. Read the information for the student from file 26. Display the information for each from the file 27. stop Sample Input/Sample output: --- Execute the program for some sample values. Result:-- Viva voice:-- Explain the types of file organization Advantages of sequential file Disadvantage of the random file Advantage of the Internal files Explain operation on the file.

DATA STRUCTURES USING C

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

More information

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

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

More information

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

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

More information

10CS35: Data Structures Using C

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

More information

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.

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

More information

Data Structure [Question Bank]

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:

More information

TREE BASIC TERMINOLOGIES

TREE BASIC TERMINOLOGIES TREE Trees are very flexible, versatile and powerful non-liner data structure that can be used to represent data items possessing hierarchical relationship between the grand father and his children and

More information

Binary Search Trees (BST)

Binary Search Trees (BST) Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search

More information

PES Institute of Technology-BSC QUESTION BANK

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

More information

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1 Data Structure By Ajay Raiyani Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1 Linked List 4 Singly Linked List...4 Doubly Linked List...7 Explain Doubly Linked list: -...7 Circular Singly Linked

More information

Ordered Lists and Binary Trees

Ordered Lists and Binary Trees Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:

More information

Data Structures and Data Manipulation

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

More information

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

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

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

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,

More information

Analysis of a Search Algorithm

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,

More information

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. 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

More information

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

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,

More information

Module 2 Stacks and Queues: Abstract Data Types

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

More information

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

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

More information

Data Structures Using C++

Data Structures Using C++ Data Structures Using C++ 1.1 Introduction Data structure is an implementation of an abstract data type having its own set of data elements along with functions to perform operations on that data. Arrays

More information

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. 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

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms CS245-2016S-06 Binary Search Trees David Galles Department of Computer Science University of San Francisco 06-0: Ordered List ADT Operations: Insert an element in the list

More information

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and: Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

More information

Binary Search Trees CMPSC 122

Binary Search Trees CMPSC 122 Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than

More information

Sample Questions Csci 1112 A. Bellaachia

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

More information

Data Structures, Practice Homework 3, with Solutions (not to be handed in)

Data Structures, Practice Homework 3, with Solutions (not to be handed in) Data Structures, Practice Homework 3, with Solutions (not to be handed in) 1. Carrano, 4th edition, Chapter 9, Exercise 1: What is the order of each of the following tasks in the worst case? (a) Computing

More information

Converting a Number from Decimal to Binary

Converting a Number from Decimal to Binary Converting a Number from Decimal to Binary Convert nonnegative integer in decimal format (base 10) into equivalent binary number (base 2) Rightmost bit of x Remainder of x after division by two Recursive

More information

Data Structures UNIT III. Model Question Answer

Data Structures UNIT III. Model Question Answer Data Structures UNIT III Model Question Answer Q.1. Define Stack? What are the different primitive operations on Stack? Ans: Stack: A stack is a linear structure in which items may be added or removed

More information

DATA STRUCTURE - QUEUE

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

More information

Data Structures Fibonacci Heaps, Amortized Analysis

Data Structures Fibonacci Heaps, Amortized Analysis Chapter 4 Data Structures Fibonacci Heaps, Amortized Analysis Algorithm Theory WS 2012/13 Fabian Kuhn Fibonacci Heaps Lacy merge variant of binomial heaps: Do not merge trees as long as possible Structure:

More information

Exercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013

Exercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013 Exercises Software Development I 11 Recursion, Binary (Search) Trees Towers of Hanoi // Tree Traversal January 16, 2013 Software Development I Winter term 2012/2013 Institute for Pervasive Computing Johannes

More information

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 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

More information

Data Structure with C

Data Structure with C Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which

More information

Symbol Tables. Introduction

Symbol Tables. Introduction Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The

More information

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

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,

More information

S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M.

S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M. A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST S. Muthusundari Research Scholar,

More information

Chapter 3: Restricted Structures Page 1

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

More information

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 Instructions: No aides. Turn off all electronic media and store them under your desk. If

More information

Binary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R

Binary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R Binary Search Trees A Generic Tree Nodes in a binary search tree ( B-S-T) are of the form P parent Key A Satellite data L R B C D E F G H I J The B-S-T has a root node which is the only node whose parent

More information

Algorithms and Data Structures

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

More information

COMPUTER SCIENCE. Paper 1 (THEORY)

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) -----------------------------------------------------------------------------------------------------------------------

More information

Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child

Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child Binary Search Trees Data in each node Larger than the data in its left child Smaller than the data in its right child FIGURE 11-6 Arbitrary binary tree FIGURE 11-7 Binary search tree Data Structures Using

More information

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.

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

More information

1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)

1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2) Chapter 7 Data Structures for Computer Graphics (This chapter was written for programmers - option in lecture course) Any computer model of an Object must comprise three different types of entities: 1.

More information

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 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

More information

Stacks. Linear data structures

Stacks. Linear data structures Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations

More information

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical

More information

Pseudo code Tutorial and Exercises Teacher s Version

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

More information

Stack & Queue. Darshan Institute of Engineering & Technology. Explain Array in detail. Row major matrix No of Columns = m = u2 b2 + 1

Stack & Queue. Darshan Institute of Engineering & Technology. Explain Array in detail. Row major matrix No of Columns = m = u2 b2 + 1 Stack & Queue Explain Array in detail One Dimensional Array Simplest data structure that makes use of computed address to locate its elements is the onedimensional array or vector; number of memory locations

More information

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

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

More information

Binary Heap Algorithms

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

More information

Any two nodes which are connected by an edge in a graph are called adjacent node.

Any two nodes which are connected by an edge in a graph are called adjacent node. . iscuss following. Graph graph G consist of a non empty set V called the set of nodes (points, vertices) of the graph, a set which is the set of edges and a mapping from the set of edges to a set of pairs

More information

Common Data Structures

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

More information

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

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

More information

root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain

root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain inary Trees 1 A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each

More information

BCS2B02: OOP Concepts and Data Structures Using C++

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

More information

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit Data Structures Page 1 of 24 A.1. Arrays (Vectors) n-element vector start address + ielementsize 0 +1 +2 +3 +4... +n-1 start address continuous memory block static, if size is known at compile time dynamic,

More information

Lecture 6: Binary Search Trees CSCI 700 - Algorithms I. Andrew Rosenberg

Lecture 6: Binary Search Trees CSCI 700 - Algorithms I. Andrew Rosenberg Lecture 6: Binary Search Trees CSCI 700 - Algorithms I Andrew Rosenberg Last Time Linear Time Sorting Counting Sort Radix Sort Bucket Sort Today Binary Search Trees Data Structures Data structure is a

More information

Linked Lists Linked Lists, Queues, and Stacks

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

More information

Lecture Notes on Binary Search Trees

Lecture Notes on Binary Search Trees Lecture Notes on Binary Search Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 17 March 17, 2010 1 Introduction In the previous two lectures we have seen how to exploit the structure

More information

A binary search tree is a binary tree with a special property called the BST-property, which is given as follows:

A binary search tree is a binary tree with a special property called the BST-property, which is given as follows: Chapter 12: Binary Search Trees A binary search tree is a binary tree with a special property called the BST-property, which is given as follows: For all nodes x and y, if y belongs to the left subtree

More information

Lecture 1: Data Storage & Index

Lecture 1: Data Storage & Index Lecture 1: Data Storage & Index R&G Chapter 8-11 Concurrency control Query Execution and Optimization Relational Operators File & Access Methods Buffer Management Disk Space Management Recovery Manager

More information

Learning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees

Learning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees Learning Outcomes COMP202 Complexity of Algorithms Binary Search Trees and Other Search Trees [See relevant sections in chapters 2 and 3 in Goodrich and Tamassia.] At the conclusion of this set of lecture

More information

Sources: On the Web: Slides will be available on:

Sources: On the Web: Slides will be available on: C programming Introduction The basics of algorithms Structure of a C code, compilation step Constant, variable type, variable scope Expression and operators: assignment, arithmetic operators, comparison,

More information

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 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

More information

Algorithms and Data Structures Written Exam Proposed SOLUTION

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

More information

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

\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"

More information

Algorithms and Abstract Data Types

Algorithms and Abstract Data Types Algorithms and Abstract Data Types Informally, algorithm means is a well-defined computational procedure that takes some value, or set of values, as input and produces some other value, or set of values,

More information

Chapter 14 The Binary Search Tree

Chapter 14 The Binary Search Tree Chapter 14 The Binary Search Tree In Chapter 5 we discussed the binary search algorithm, which depends on a sorted vector. Although the binary search, being in O(lg(n)), is very efficient, inserting a

More information

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

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

More information

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

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

More information

Parallelization: Binary Tree Traversal

Parallelization: Binary Tree Traversal By Aaron Weeden and Patrick Royal Shodor Education Foundation, Inc. August 2012 Introduction: According to Moore s law, the number of transistors on a computer chip doubles roughly every two years. First

More information

Physical Data Organization

Physical Data Organization Physical Data Organization Database design using logical model of the database - appropriate level for users to focus on - user independence from implementation details Performance - other major factor

More information

The ADT Binary Search Tree

The ADT Binary Search Tree The ADT Binary Search Tree The Binary Search Tree is a particular type of binary tree that enables easy searching for specific items. Definition The ADT Binary Search Tree is a binary tree which has an

More information

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 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

More information

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr; 50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)

More information

The Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!

The Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)! The Tower of Hanoi Recursion Solution recursion recursion recursion Recursive Thinking: ignore everything but the bottom disk. 1 2 Recursive Function Time Complexity Hanoi (n, src, dest, temp): If (n >

More information

CompSci-61B, Data Structures Final Exam

CompSci-61B, Data Structures Final Exam Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.

More information

CSE 326: Data Structures B-Trees and B+ Trees

CSE 326: Data Structures B-Trees and B+ Trees Announcements (4//08) CSE 26: Data Structures B-Trees and B+ Trees Brian Curless Spring 2008 Midterm on Friday Special office hour: 4:-5: Thursday in Jaech Gallery (6 th floor of CSE building) This is

More information

Unordered Linked Lists

Unordered Linked Lists Unordered Linked Lists Derive class unorderedlinkedlist from the abstract class linkedlisttype Implement the operations search, insertfirst, insertlast, deletenode See code on page 292 Defines an unordered

More information

Introduction to Data Structures and Algorithms

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

More information

Java Software Structures

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

More information

Lecture 2: Data Structures Steven Skiena. http://www.cs.sunysb.edu/ skiena

Lecture 2: Data Structures Steven Skiena. http://www.cs.sunysb.edu/ skiena Lecture 2: Data Structures Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena String/Character I/O There are several approaches

More information

2 SYSTEM DESCRIPTION TECHNIQUES

2 SYSTEM DESCRIPTION TECHNIQUES 2 SYSTEM DESCRIPTION TECHNIQUES 2.1 INTRODUCTION Graphical representation of any process is always better and more meaningful than its representation in words. Moreover, it is very difficult to arrange

More information

B-Trees. Algorithms and data structures for external memory as opposed to the main memory B-Trees. B -trees

B-Trees. Algorithms and data structures for external memory as opposed to the main memory B-Trees. B -trees B-Trees Algorithms and data structures for external memory as opposed to the main memory B-Trees Previous Lectures Height balanced binary search trees: AVL trees, red-black trees. Multiway search trees:

More information

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

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

More information

1 Classical Universal Computer 3

1 Classical Universal Computer 3 Chapter 6: Machine Language and Assembler Christian Jacob 1 Classical Universal Computer 3 1.1 Von Neumann Architecture 3 1.2 CPU and RAM 5 1.3 Arithmetic Logical Unit (ALU) 6 1.4 Arithmetic Logical Unit

More information

Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.

Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program. Name: Class: Date: Exam #1 - Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN

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

More information

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

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

More information

Introduction to data structures

Introduction to data structures Notes 2: Introduction to data structures 2.1 Recursion 2.1.1 Recursive functions Recursion is a central concept in computation in which the solution of a problem depends on the solution of smaller copies

More information

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 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

More information

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

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,

More information

Data Structures and Algorithms(5)

Data Structures and Algorithms(5) Ming Zhang Data Structures and Algorithms Data Structures and Algorithms(5) Instructor: Ming Zhang Textbook Authors: Ming Zhang, Tengjiao Wang and Haiyan Zhao Higher Education Press, 2008.6 (the "Eleventh

More information

Big Data and Scripting. Part 4: Memory Hierarchies

Big Data and Scripting. Part 4: Memory Hierarchies 1, Big Data and Scripting Part 4: Memory Hierarchies 2, Model and Definitions memory size: M machine words total storage (on disk) of N elements (N is very large) disk size unlimited (for our considerations)

More information

Binary Trees and Huffman Encoding Binary Search Trees

Binary Trees and Huffman Encoding Binary Search Trees Binary Trees and Huffman Encoding Binary Search Trees Computer Science E119 Harvard Extension School Fall 2012 David G. Sullivan, Ph.D. Motivation: Maintaining a Sorted Collection of Data A data dictionary

More information

International Journal of Software and Web Sciences (IJSWS) www.iasir.net

International Journal of Software and Web Sciences (IJSWS) www.iasir.net International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

More information

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

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

More information

6. Standard Algorithms

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

More information