|Status||Compulsory/Courses of Limited Choice|
|Level and type||Undergraduate Studies, Academic|
|Field of study||Computer Science|
|Academic staff||Natālija Prokofjeva, Igors Ščukins, Lāsma Lēruma-Gūtmane|
|Credit points||3.0 (4.5 ECTS)|
Concept and classification of data structures. Abstract data structures. Basic data structures. Linear data structures: arrays, lists, tables, stacks, queues. Non-linear data structures: trees and graphs. Logical and physical data structures. Pointers and lists. Simple linked list specification, representation and design. Double linked lists and their usage..
Goals and objectives
of the course in terms
of competences and skills
|The aim of the course is to introduce data types and data structure (DS) specifications for data structures and methods of presentation techniques, with efficient algorithms for work with commonly used data structures. To teach students to choose optimal DS and algorithms and use them in practice in software development process. Students should clearly understand the concepts of data structures, meaning and classification principles. Students learn the DS display types and technologies. Students learn the DS model building and description of data structure design and implementation, students must be able to use it all in practice.|
Knows general questions about values and arrays. - Completed computerized knowledge test (theme "Indicators and arrays), that has been positively evaluated.
Knows the character string processing operations and their algorithms. - Completed the computerized knowledge test (theme "Character strings"), that has been positively evaluated.
Knows the lists of the display models, specifications and processing operations. - Completed the computerized knowledge test (theme "Lists"), that has been positively evaluated.
Knows the stack and queue processing operations. - Completed the computerized knowledge test (theme "stack and row"),that has been positively evaluated.
Is able to create and manage special arrays. - Independently completed and positively evaluated first laboratory work.
Is able to create various types of linear lists and to implement their processing functions. - Independently completed and positively evaluated second laboratory work.
Is able to create different types of data structures and carry out the processing functions. - Independently completed and positively evaluated third laboratory work.
Knows data structure concept, meaning and classification principles, as well as the data structure representation types and technologies. - Passed examination for which a positive evaluation has been received.
|Course prerequisites||Computer Lessons I, II.|