Algoritmos e Estrutura de Dados II - Aula 1 - Apresentação da Disciplina

Summary

Professor Frederico Oliveira introduces the Algorithms and Data Structures course for engineering students at UFMT Campus Várzea Grande. The course covers fundamental topics like pointers, sorting algorithms, stacks, queues, lists, and algorithm analysis. The primary focus is on practical applications using C programming, although C is not the main focus of the course. The professor highlights the importance of the subject and its role in shaping students' success in other areas of computer science. Assessments will include four practical assignments, with a final grade based on the average of these tasks.

Takeaways

• 😀 The course is about Algorithms and Data Structures, taught online by Professor Frederico Oliveira from UFMT Campus Várzea Grande.
• 😀 The course will cover important topics like pointers, data structures, sorting algorithms, stacks, queues, and lists.
• 😀 The main goal is to teach the application of data structures in solving problems, using the C programming language, though the course isn't focused on teaching C itself.
• 😀 The course materials will include video lectures, which are asynchronous, and synchronous classes for doubt clarification.
• 😀 The assessment will consist of four practical assignments, each worth 25% of the final grade, with a minimum final grade of 5 to pass.
• 😀 The course content is divided into six units: memory allocation, abstract data types, asymptotic analysis, sorting algorithms, binary search, and data structures.
• 😀 In Unit 1, students will learn about memory allocation in C.
• 😀 Unit 2 focuses on creating abstract data types (using 'struct' and 'typedef' in C).
• 😀 Unit 3 covers asymptotic analysis to understand the time complexity of algorithms (best, worst, and average cases).
• 😀 Unit 4 will cover various sorting algorithms, from simpler ones like Bubble Sort to more efficient ones like Quick Sort and Merge Sort.
• 😀 In Unit 5, students will explore binary search techniques and compare them with sequential search methods.
• 😀 Unit 6 will introduce core data structures like lists, stacks, and queues, with emphasis on dynamic memory allocation.
• 😀 The course will use several textbooks, including "Algorithms: Design and Analysis" by Viviane, and books focused on C programming like "C How to Program" by Deitel and "Programming in C" by Serhiy.

Q & A

Who is the professor of this course, and what is his academic background?

The professor of the course is Frederico Oliveira. He holds a Bachelor's and Master's degree in Computer Science from the Federal University of Lavras. He is currently a Ph.D. candidate in Computer Science at the Federal University of Goiás, focusing on Artificial Intelligence.

What is the main objective of the Algorithms and Data Structures course?

The main objective of the course is to present the principal data structures and demonstrate their applications in solving problems. The course aims to develop students' understanding of algorithms and data structures, emphasizing their practical use.

Which programming language will be used for the assignments in this course?

The programming language used for assignments will be C. However, the course does not aim to teach C programming from scratch, as it focuses on data structures and algorithms. Pseudocode will also be used for explaining algorithms.

What is the structure of the course syllabus and which topics will be covered?

The course syllabus is divided into six units. These topics include memory allocation, creation of abstract data types using C, asymptotic analysis of algorithms, sorting algorithms, binary search, and key data structures like lists, stacks, and queues.

What is the professor's approach to teaching this course?

The professor will use a combination of asynchronous video lectures and synchronous sessions for doubt clarification. The course will include practical exercises, which will be made available through the Ava platform, and potentially Google Hangouts for additional interaction.

How will students be evaluated in this course?

Students will be evaluated through four practical assignments, each contributing 25% to the final grade. The final grade is based on a simple average of the four assignments. A score of 5 or higher is required to pass.

What books will be used in this course, and which ones are recommended for additional study?

The primary textbooks for the course include 'Introduction to Algorithms' by Viviane and others (with implementations in C and Pascal), 'C How to Program' by Deitel, and 'Data Structures and Algorithms in C' by Sergio. Additional resources may include the 'C Programming Language' by Kernighan and Ritchie.

What is the significance of the Algorithms and Data Structures course for engineering students?

The course is considered a critical subject for computer engineering students as it lays the foundation for understanding key concepts in computing. Success in this course often correlates with success in later, more advanced courses.

How does the professor plan to introduce the concept of memory allocation in the course?

In Unit 1, the professor will introduce the concept of memory allocation, which is fundamental for understanding how data is stored and managed in memory. This is important for working with data structures and algorithms in C.

What specific sorting algorithms will be taught in this course?

The course will cover both simple and advanced sorting algorithms, including Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Counting Sort. Students will learn both the implementation and efficiency of these algorithms.