Current filters:

Start a new search

Results 1-9 of 9 (Search time: 0.0 seconds).
  • previous
  • 1
  • next
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
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
University of Montpellier
This course gives bases on structured programming and enables the students to get familiar with the use of calculators for resolving engineering problems. Algorithmic complexity is addressed through C language study.
Tallinn University of Technology
Positional and non-positional numeral systems. Converting numbers from one numeral system to another. Fixed point and floating point numbers. Computer architecture (software layer). OS and PS. Types of compilers. Program life-cycle. Languages. Language classification. Algorithmic languages. Presenting algorithmic languages using syntax diagrams. Definition of an algorithm, ways to present and construct algorithms. Separating a task into subtasks. Various data types and their representation in a computer. Scalar and structural data types. Static variables. Declaring variables. Converting data from one type to another. Mixed data types. Operator priority. Formatting results. Organizing branches (including several conditions). Iterative statements with condition checking before and after the statement, examples. Global and local variables. Data exchange between various program modules. Declaring and indexing of arrays. Strings as arrays. Multidimensional arrays. Converting a two-dimensional array into a one-dimensional array. Sorting arrays. Calendar.
Universidad Carlos III de Madrid
Introductory course about C programming language
Universidad Carlos III de Madrid
The content of the program is divided in three blocks: Part I. Introduction 1. Operating systems for mobile devices. 2. General Concepts of development of mobile applications. Part II. Development of mobile applications: 1. Android platform . 1.1. Introduction. 1.2. Creating applications and activities. 1.3. User interfaces. 1.4. Intents, Broadcast Receivers and Internet. 1.5. Files, state and preferences. 1.6. Databases and content providers. 1.7. Maps and location based services. 1.8. Services and threads. 1.9. Audio, vídeo, camara. 1.10. Telephony and SMS. 1.11. Bluetooth, networks and WiFi. 1.12. Sensors. 1.13. Advance topics. 2. Other platforms. Part III. Design and implementation of a mobile application.
Universidad Carlos III de Madrid
A basic course of Software Engineering