Teaching GuideTerm Faculty of Computer Science |
Grao en Enxeñaría Informática |
Subjects |
Programming II |
Contents |
|
|
|
Identifying Data | 2023/24 | |||||||||||||
Subject | Programming II | Code | 614G01006 | |||||||||||
Study programme |
|
|||||||||||||
Descriptors | Cycle | Period | Year | Type | Credits | |||||||||
Graduate | 2nd four-month period |
First | Basic training | 6 | ||||||||||
|
Topic | Sub-topic |
Dynamic Memory Management | Program memory organization. Definition of pointer variables. Dynamic memory allocation and deallocation. Pointer assignment and comparison. |
Introduction to Abstract Data Types (ADT) | Abstraction in programming: Concept, Evolution through computer programming history, ADT and Object Oriented Programming. Modularity in programming. Abstract Data Types: Definition and concept, Differences between datatype, data structure and ADT, ADT construction, Advantages of data abstraction. |
Lists | Informal specification of List ADT. Implementations of List ADT. Ordered list ADT: specification and implementations. Multilists and multiordered lists: concept, representations and usage. |
Stacks | Informal specification of Stack ADT. Implementations of Stack ADT. Applications on computer science. |
Queues | Informal specification of Queue ADT. Implementations of Queue ADT. Queue variants. Priority queues. Applications on computer science. |
Trees | Tree definition and terminology. Binary Tree ADT: Informal specification, Implementation. Binary Tree traversals. |
Binary Search Trees | Binary Search Trees. AVL Trees. |
|