Podcast
Questions and Answers
What is the definition of a data structure?
What is the definition of a data structure?
An arrangement of data in a computer's memory or sometimes on a disk.
What percentage of the student evaluation is based on assessments?
What percentage of the student evaluation is based on assessments?
40
How many hours per week are allocated for lectures?
How many hours per week are allocated for lectures?
2
Which of the following data structures are covered in lectures? (Select all that apply)
Which of the following data structures are covered in lectures? (Select all that apply)
Signup and view all the answers
Name two programming languages used in the tutorials and labs.
Name two programming languages used in the tutorials and labs.
Signup and view all the answers
What is the weight of the final examination in student evaluation?
What is the weight of the final examination in student evaluation?
Signup and view all the answers
An example of an algorithm is __________.
An example of an algorithm is __________.
Signup and view all the answers
What type of problems will students solve in the tutorials?
What type of problems will students solve in the tutorials?
Signup and view all the answers
Which algorithm designing techniques are covered in the course?
Which algorithm designing techniques are covered in the course?
Signup and view all the answers
Study Notes
Course Overview
- Focus on Data Structures and Algorithms as part of IT2070 course.
- Faculty of Computing at SLIIT offers the program across multiple campuses.
Faculty Members
- Malabe Campus:
- Dr. Bhagya Nathali Silva
- Dr. Dinuka Wijendra
- Ms. Jenny Krishara
- Metro Campus:
- Ms. Mihiri Samaraweera
- Kandy Center:
- Ms. Chathurika Pinnaduwage
- Matara Center:
- Mr. Ravi Supunya
- Jaffna Center:
- Ms. Sangeetha Balasingam
Teaching Methods
- Lectures: 2 hours per week
- Tutorials: 2 hours per week
- Labs: 2 hours per week
Student Evaluation
- Two assessments contribute 40% of the final mark.
- Final examination accounts for 60% of the overall evaluation.
Lecture Content
-
Data Structures:
- Stack
- Queue
- Linked List
- Tree
-
Algorithms:
- Asymptotic Notations
- Designing techniques
- Searching and Sorting algorithms
Tutorials and Labs Focus
- Applications of lecture knowledge to solve practical problems.
- Programming experience in:
- Java
- Python
Key Concepts
- Data Structures: Arrangement of data in a computer's memory or disk (e.g., stacks, queues, linked lists, trees).
- Algorithms: Procedures that manipulate data within structures for tasks like searching and sorting.
Real-World Usage of Data Structures
- Data Storage: Organizing and managing data efficiently.
-
Modeling:
- Queue models customer service scenarios.
- Graphs represent routes, such as airline connections.
-
Programming Tools:
- Stacks and queues facilitate various programming operations.
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.
Related Documents
Description
Test your knowledge on Data Structures and Algorithms covered in the IT2070 course at SLIIT. This quiz will challenge your understanding of key concepts and applications in this essential area of computing.
