tailieunhanh - Faculty of Computer Science and Engineering Department of Computer Science LAB SESSION 1

OBJECTIVE The objectives of Lab 1 are (1) to introduce on how to represent a linked list as an OO class; (2) to implement some basic operations on linked list and (3) to use an preimplemented class of linked list; 2. EXAMPLE This section gives an example on how to represent a linked list as a class, as well as implement some basic operations of the linked list. The way to use an implemented linked list is also introduced. Listing 1 gives an example of a class representing a node in a linked list. As stated in the lectures, a. | Faculty of Computer Science and Engineering Department of Computer Science LAB SESSION 1 BASIC OPERATIONS ON LINKED LIST 1. OBJECTIVE The objectives of Lab 1 are 1 to introduce on how to represent a linked list as an OO class 2 to implement some basic operations on linked list and 3 to use an preimplemented class of linked list 2. EXAMPLE This section gives an example on how to represent a linked list as a class as well as implement some basic operations of the linked list. The way to use an implemented linked list is also introduced. Listing 1 gives an example of a class representing a node in a linked list. As stated in the lectures a node in a linked list consists of two parts data and the link to the next node. class Node public Node next Listing 1 Listing 2 illustrates a simple way to create a linked list using the Node class. The list consisted of 3 elements 2 3 5 . We use the pointer pHead to keep track of the first element of the list meanwhile count reflecting the number of list elements. We also use a temporary pointer pTemp for our work. To check that our code runs correctly we use a loop to print out all of elements data. void main declaration Node pHead NULL int count 0 Node pTemp NULL make the list pTemp new Node count pTemp- data 5 pTemp- next NULL pHead pTemp the list now is 5 pTemp new Node count Page 1 5 Faculty of Computer Science and Engineering Department of Computer Science pTemp- data 3 pTemp- next pHead pHead pTemp the list now is 2 3 pTemp new Node count pTemp- data 2 pTemp- next pHead pHead pTemp the list now is 2 3 5 print them out while pTemp NULL cout pTemp- data pTemp pTemp- next Listing 2 In that way our program looks ill-organized. In Listing 3 we then improve it by combining pHead count into a class named List. Then the operation of inserting a new element into the list will be implemented as the method addFirst. We also implement method display to print out the list elements. Note that we use constructor to initialize the head of .

• Thư viện thông tin
• simple way
• lectures
• data
• objective
• litting 2
• linked list
• Biogeography
• Intertidal Barnacles
• Heartwood
• Javanese Teak
• Using GC MS
• Gas Chromatographic
• object
• báo cáo khoa học
• báo cáo y học
• công trình nghiên cứu về y học
• tài liệu về y học
• cách trình bày báo cáo
• BMC Cancer
• Interval cancer
• Program evaluation
• Quality measure
• Background incidence
• Bài giảng Cấu trúc dữ liệu và giải thuật
• Cấu trúc dữ liệu
• Cấu trúc dữ liệu và giải thuật
• Array List
• Kiểu lưu trữ dữ liệu
• Lecture Data Structures and Algorithms
• Data Structures and Algorithms
• Bài giảng Cấu trúc dữ liệu và thuật toán
• Multiple links
• Big O notation
• Singly linked list
• Computer Science
• Engineering Computer
• Linear List Concepts
• List ADT
• Specifications for List ADT
• Implementations of List ADT
• Contiguous List
• Singly Linked
• Lecture Data Structures
• Bài giảng Cấu trúc dữ liệu
• Data structures
• C++ code for linked list
• List usage
• Analysis of linked list
• Josephus problem
• List data structures
• Doubly linked list
• Circularly linked list
• Cấp phát bộ nhớ động
• Single linked list
• Hàm malloc
• Hàm free
• bài tập lập trình C
• Cấu trúc dữ liệu và giải thuật assignment 01
• Unrolled linked list
• Giải thuật assignment 01
• Danh sách liên kết mở
• Doubly Circular linked list
• Khai báo nút kiểu cấu trúc
• Danh sách liên kết đôi
• Linked list operations
• The Node class
• Array implementation
• Other linked lists
• Lecture CIS 190
• C++ programming
• Lecture C++ programming
• Linked lists
• Linked list anatomy
• Lập trình C++
• thủ thuật lập trình
• mẹo lập trình
• kỹ thuật lập trình
• lập trình Java cơ bản
• stack và queue
• node
• null
• cài đặt linked list
• Khoa học máy tính
• Kỹ thuật máy tính
• Quản trị cơ sở dữ liệu
• Lập trình cơ sở dữ liệu
• Danh sách liên kết
• Lecture Data Structure and Algorithms
• Data Structure and Algorithms
• Linear list
• Lecture Data Structure and Algorithm
• Data Structure and Algorithm
• Link list data structure
• Data structure
• Storage structures
• Single link
• Double links
• Kiểu dữ liệu trừ tượng
• Đệ qui (Recursion)
• Hàng đợi (Queue)
• Danh sách kề (Contiguous list)
• Danh sách liên kết (Linked list)
• Cây nhị phân (Binany tree)
• Basic concepts
• Hash functions
• Collision resolution
• Open addressing
• Linked list resolution
• Bucket hashing
• Introduction to Computing
• Circular queue
• Binary tree
• Programming languages
• Programming in C++
• Lecture Programming in C++
• Linked list classes
• Stack classes
• Queue class
• Cấu trúc dữ liệu Chương 5
• Cấu trúc phi tuyến tính
• Symbol Tables
• Binary search implementation
• Linked list implementation
• Binary search trees
• Using array for implementation
• Using dynamic memory