Search


Current filters:
Start a new search

Results 1-10 of 22 (Search time: 0.001 seconds).
Item hits:
Politecnico di Torino
The course allows the student to acquire adequate knowledge and skills in algorithms, data structures and their implementation in C to solve complex problems. The student should gradually evolve from more analytic to more design-oriented skills. Algorithmic solutions to "classical" problems are introduced, together with their theoretical foundations, and the implementations in C language. Advanced aspects of C are considered, like pointers, dynamic memory allocation, modularity and Abstract Data Type implementation. The student has the opportunity to analyze practical examples, describing solutions to complex problems, and the related algorithmic paradigms. Knowledge and programming skills are applied during lab sessions.
Politecnico di Torino
The course allows the student to acquire adequate knowledge and skills in algorithms, data structures and their implementation in C to solve complex problems. The student should gradually evolve from more analytic to more design-oriented skills. Algorithmic solutions to "classical" problems are introduced, together with their theoretical foundations, and the implementations in C language. Advanced aspects of C are considered, like pointers, dynamic memory allocation, modularity and Abstract Data Type implementation. The student has the opportunity to analyze practical examples, describing solutions to complex problems, and the related algorithmic paradigms. Knowledge and programming skills are applied during lab sessions.
Universidad Carlos III de Madrid
This course aims to introduce students to foundational programming techniques. The programming language that will be used in the course is Java, although students will acquire broad skills that can be applied to other programming languages. The knowledge acquired by the students in this class contains: - The fundamentals of the imperative programming - The fundamentals of structured programming - Language data types - Java syntax - Program testing and debugging
Tei of Athens
This lesson describes the programming methodologies and clarifies the reasons that prescribed their introduction. We examine: Structured programming, Functional Programming, Logic programming, Object Oriented Programming, Component based Programming and Rapid application development (RAD).\r\n\r\nStudents acquire a deep knowledge of the object model. The learn how to turn in advantage the software components through the rapid application development environments. They also learn to quickly develop applications with graphical user interfaces (GUI). This knowledge is used for designing, composing and creating applications from scratch or even integrating with existing applications.\r\n\r\nStudents with successful participation will be able to:\r\n\r\nUnderstand and utilize the concept of Abstract data types.\r\nBe able to classify the programming languages. \r\nDesign and implement Object-Oriented Programs.\r\nStructure his/her software applications on the base of events.\r\nDevelop software on the base of Components (Component-Oriented Programming).\r\nDesign and implement interfaces with the Rapid application development Environments.\r\nDo the above (build programs and interfaces that utilize components and event handlers) without the support of RAD Environments.\r\nCompare the various RAD Environments. \r\nDevelop applications and information systems with concrete object oriented languages (e.g. Java) and concrete RAD Environments (e.g. NetBeans, Eclipse, VB.NET, etc).\r\nDevelop multi thread applications.","language":null}, {"key":"dc.language.iso","value":"gr","language":null}, {"key":"dc.publisher","value":"TEI of Athens","language":null}, {"key":"dc.subject","value":"classes and objects console applications GUI applications browser micro applications Dialog items Layouts events and event handlers interface building programmatically Components Exceptions and Exception Handling Multithread applications Input/Output (char and byte) streams Data Structures (Tables, Lists, Trees, Maps) database interfacing interface building with GUI designers Case study: Information System development
Delft University
This module helps you skill in software management.
Politecnico di Torino
The course allows the student to acquire adequate knowledge and skills in algorithms, data structures and their implementation in C to solve complex problems. The student should gradually evolve from more analytic to more design-oriented skills. Algorithmic solutions to "classical" problems are introduced, together with their theoretical foundations, and the implementations in C language. Advanced aspects of C are considered, like pointers, dynamic memory allocation, modularity and Abstract Data Type implementation. The student has the opportunity to analyze practical examples, describing solutions to complex problems, and the related algorithmic paradigms. Knowledge and programming skills are applied during lab sessions.
Politecnico di Torino
This course, mandatory for all the students, has a twofold objective: on one hand, to introduce to the student to the issues related to computer science in particular from the "cultural" standpoint, but also from the technological one. On the other hand, the course aims at teaching the use of computer programming as a way to solve realistic problems.
Politecno di Torino
This course, mandatory for all the students, has a twofold objective: on one hand, to introduce to the student to the issues related to computer science in particular from the "cultural" standpoint, but also from the technological one. On the other hand, the course aims at teaching the use of computer programming as a way to solve realistic problems.
Politecnico di Torino
1. Refreshing skills in C-programming. 2. Data structures and their building principles: arrays and linked structures. Operations on data structures. 3. Some specific data structures: sparse matrixes, circular buffers, etc. 4. Abstract data structures. List, stack, queue, dictionary. 5. Algorithm complexity analyses. 6. Recursion and recursive algorithms. 7. Sequental search and binary search. 8. Trees. Tree balancing problem. AVL-trees. 9. Self-organizing trees. 10. B-trees and red-black trees. B*-trees. 11. Structures for data stored in external memory. B+ trees. 12. Digital search trees and tries. Existence tables. Trinary trees. 13. Priority queue and heap. Leftist heaps. Binomial queues. 14. Hashing. Hash functions. Separate chaining and open addressing. Extendible hashing. 15. Simple sorting algorithms. Shell sort. Quick sort. Merge sort. Radix sort. Heap sort. 16. Pattern matching problem. Boyer-Moore method. Rabin-Karp method. 17. Data compression. Huffman coding. Lempel-Zivi method principles. 18. Types of algorithms. Divide and conquer algorithms. Greedy algorithms. Dynamic programming principles. Randomized algorithms.
Universidad Carlos III de Madrid
This course aims to introduce students to foundational programming techniques. The programming language that will be used in the course is Java, although students will acquire broad skills that can be applied to other programming languages. The knowledge acquired by the students in this class contains: - The fundamentals of the imperative programming - The fundamentals of structured programming - Language data types - Java syntax - Program testing and debugging