Scribd
Upload
5 views13 pages

Intro

The document provides an introduction to a Data Structures and Algorithms course taught by Arifah Azhar at the University of Management and Technology. It outlines course objectives, evaluation criteria, classroom policies, and recommended textbooks, emphasizing the importance of attendance and academic integrity. The course will cover various data structures and algorithms, with a focus on practical implementation in C++.

Uploaded by

thezsk45
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views13 pages

Intro

The document provides an introduction to a Data Structures and Algorithms course taught by Arifah Azhar at the University of Management and Technology. It outlines course objectives, evaluation criteria, classroom policies, and recommended textbooks, emphasizing the importance of attendance and academic integrity. The course will cover various data structures and algorithms, with a focus on practical implementation in C++.

Uploaded by

thezsk45
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Data Structure &

Algorithms
Arifah Azhar
SST-SE
Topic 1: Introduction

1
Introduction
Instructor, Students and Course
Instructor
• Arifah Azhar
• Assistant Professor
• University of Management and Technology (UMT)
• Office
• Hall 506-08
• Contact
• [email protected]
• Research Area
• Software Engineering and Machine Learning
Students
• Answer these questions (Not graded!)
1. Your name and hobby?
2. The subject(s) you don’t like at all?
3. Who was your favorite teacher and why?
4. The most difficult programming concept for you so far?
2. OOP
1. PF
2. Iteration
1. Pointers
1. For 2. Class
2. While
3. Do…while 3. Inheritance
Selection
4. Nested
4. Polymorphism
5. If…else 1. Overloading
1.
2.
Exclusive
Mutually exclusive
2. Overriding
6. Switch 5. Composition
6. Aggregation
7. Nested
1. Selection
2. switch 7. association
• Functions
1. Pass by value
2. Pass by reference
3. Overloading
4. Friends
1. Arrays
Course Intro
• SE-Core Course
Note:
• Before Fall 2023 Since lab is separate 1 credit
Hr. make sure to
1. Attend it regularly
2. Enroll in the same section as theory

• Fall 2023 onwards

• Evaluation
Mid Scheme
Final Assignments Quizzes Project Class Activity

20% 40% 15% 10% 10% 5%

5
About Course
• A data structure is a named location that can be used to store and
organize data.
• An algorithm is a collection of steps to solve a particular problem.

• Learning data structures and algorithms allow us to write efficient and


optimized computer programs.
Data Structure & Algorithms
Following are the goals of this course:

• Prepare the students for (and is a pre-requisite for) the more advanced
material students will encounter in later courses.

• Cover well-known data structures such as dynamic arrays, linked lists,


stacks, queues, trees, heaps and graphs. Use recursion for efficient
sorting and searching.

• Implement data structures in C++


7
Course Policies and Outline
• Outline is available on LMS page
• Recommended Textbooks
• Data Structures using c++ by DS malik [EASIEST AND MOST EFFECTIVE]
• Data Structures and Algorithms in C++ by Adam Drozdek, 2012.
• Data Structures and Algorithm Analysis in Java by Mark A. Weiss, 2011.
• Data Structures and Abstractions with Java by Frank M. Carrano & Timothy M. Henry, 2014.
• Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss, 2005.
• Java Software Structures: Designing and Using Data Structures by John Lewis and Joseph
Chase, 2013.
• Any source which is understandable for you is the recommended source
• Technology
• C++, Visual Studio 2010 or later
• C++, codeblocks
Classroom Policy- attendance
policy
• At least 80% attendance required. Rest 20% includes all emergent cases.
• Inform (on email [email protected]) with a proof/evidence in case you have an
emergency on the same day before 12pm. Attendance cannot be
modified/altered after current day.
Classroom Policy
• Keep your mobiles switched off.
• Quizzes can be announced or unannounced.
• No retake of quizzes.
• No compensation for missed quiz
• Class Activities will always be unannounced.
• No retake of CA.
• No compensation for missed CA
• FAIR Contest policy
• Do not ask for undue favors
• LMS
• Ensure that you are enrolled on the correct page.
• Check it regularly for
• Lectures
• Assignments
• It is your responsibility to
• Make timely submissions
• not delete your assignment even after its submission.
• Submit it in the right folder

• All communication will be done via email.


• In case you are missing on emails, assignments or lectures, it is your responsibility to get it corrected.
• All evaluations will be viva based
• No re-evaluations again and again and again
• You are responsible for knowing the dates. NO CR, TA or teacher will be held responsible for it.
Plagiarism policy
• Assignment
• Straight 20% deduction if it is done via generative AI
• -10 if it is copied off a friend
• -5 in quiz
• -5 (each question) in mid/final
• Both copier and originator are equally guilty
• To save originator, copier has to confess
Bonus point policy
• Bonus point on every good deed (study relevant)
• Answering a tricky question
• Solving a class activity on board
• Being the only person attending a class/quiz/assignment submission 
• Helping teacher/TA identify a plagiarism case 
Online editor
• https://www.onlinegdb.com/online_c++_compiler

You might also like