Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Zero Lecture Cse68d

    Uploaded by

    Prithu Misra

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Zero Lecture Cse68d

    Uploaded by

    Prithu Misra
    8 views22 pages

    Original Title

    ZERO_LECTURE_CSE68D

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    8 views22 pages

    Zero Lecture Cse68d

    Uploaded by

    Prithu Misra

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 22

    CSE68D:ANALYSIS AND

    DESIGN OF ALGORITHM
    Lecture #0

    The kick start session


    Course details
    • LTP – 4 0 0 [Four Lectures/week]

    • Text Book
    • DATA STRUCTURES AND ALGORITHM USING C by R.
    SALARIA, KHANNA PUBLISHERS
    • Reference Book:
    DESIGN AND ANALYSIS OF ALGORITHMS by DAVE AND
    DAVE, PEARSON
    COURSE OUTCOMES
    CO1 :: Identify the basic concepts of algorithms and analyze the
    performance of algorithms.
    CO2 :: Explore the efficiency and asymptotic notations in algorithms and analyze algorithm on
    the basis of Best, average and worst case.

    CO3 :: Explore various sorting techniques and analyze the time and space complexity of their
    algorithms.

    CO4 :: Analyze and design various divide and conquer algorithm design techniques for different
    problem solution.

    CO5 :: Analyze , design and general characterization of various Greedy algorithm design
    techniques for different problem solution.

    CO6 :: Analyze , design and apply the principle of Optimality in various Dynamic Programming design
    techniques for different problem solution.
    Revised Bloom’s Taxonomy
    Programme Outcomes
    1. Basic and Discipline specific knowledge: Apply knowledge of basic mathematics, science and
    engineering fundamentals and engineering specialization to solve the engineering problems.

    2. Problem analysis: Identify and analyse well-defined engineering problems using codified standard
    methods.

    3. Design/ development of solutions: Design solutions for well-defined technical problems and assist
    with the design of systems components or processes to meet specified needs.

    4. Engineering Tools, Experimentation and Testing: Apply modern engineering tools and
    appropriate technique to conduct standard tests and measurements.

    5. Engineering practices for society, sustainability and environment: Apply appropriate


    technology in context of society, sustainability, environment and ethical practices.

    6. Project Management: Use engineering management principles individually, as a


    team member or a leader to manage projects and effectively communicate about
    well-defined engineering activities.

    7. Life-long learning: Ability to analyse individual needs and engage in updating in the context of
    technological changes.
    Programme Specific Outcomes
    PSO1 : Understand the basics of mathematics, sciences and basic Computer Engineering and
    Information Technology and develop environment friendly solutions.

    PSO2 : Demonstrate and participate in analysis and apply the knowledge in the field
    of data structures, networks, programming, animation and web development.

    PSO3 : Ability to develop applications, program and find best effective solutions to
    real world problems.

    PSO4 : Inculcate the knowledge of Engineering and Management principles as an


    individual or as a team member to plan, prepare and execute various types of
    projects effectively.

    PSO5 : Utilize principles, methods, codes of practices to keep abreast in Industry and on-site
    exposure.
    Course Assessment Model
    • Marks break up*
    • Attendance 5
    • CA (One best out of two tests) 25
    • MTE 20
    • ETE 50
    • Total 100
    • * Proposed:
    • One class tests before MTE
    • One Class test after MTE and One home assignment
    The course contents
    • Definition and characteristic of an algorithm, Rules to write an
    algorithm, concepts and analysis of algorithm.

    • The efficient algorithm, Average and worst case analysis,


    Asymptotic Notations, Amortized Analysis.

    • Selection Sort, Bubble Sort, Insertion Sort, Heap Sort and


    Complexity analysis of each Sorting algorithm.
    The course contents
    • Introduction to Divide and Conquer, Problem Solving using
    divide and conquer algorithm-Binary Search Tree, Sorting
    Techniques: Merge Sort, Quick Sort.

    • General Characteristics of greedy algorithms, Minimum


    Spanning trees (Kruskal’s algorithm, Prim’s algorithm, Single
    source/Shortest paths, The Knapsack Problem, Job Scheduling
    Problem.

    • Introduction. The Principle of Optimality, BFS(Breadth First


    Search) and DFS(Depth First Search), Floyd Warshall
    Algorithm.
    Division of course
    Syllabus is divided into a total of 6 units:
    UNIT 1- Basics of Algorithms
    UNIT 2- Analysis of Algorithm
    UNIT 3- Sorting Techniques
    Division of course
    • UNIT 4- Divide and Conquer Algorithm
    • UNIT 5- Greedy Algorithm
    • UNIT 6- Dynamic Programming
    During the Journey of this Course...
    We will Explore.......
    Phases in Algorithms
    Solving Puzzles
    What is an Algorithm?
    • Algorithms are instructions for solving a
    problem or completing a task.
    • Recipes are algorithms, as are math equations.
    Computer code is algorithmic.
    • The internet runs on algorithms and all online
    searching is accomplished through them.
    Email knows where to go thanks to
    algorithms.
    • Smartphone apps are nothing but algorithms.
    Cont..
    • Computer and video games are algorithmic
    storytelling.
    • Online dating and book-recommendation and
    travel websites would not function without
    algorithms.
    • GPS mapping systems get people from point A
    to point B via algorithms.
    Cont..
    • Artificial intelligence (AI) is naught but
    algorithms.
    • The material people see on social media is
    brought to them by algorithms.
    • In fact, everything people see and do on the web
    is a product of algorithms.
    • Every time someone sorts a column in a
    spreadsheet, algorithms are at play, and most
    financial transactions today are accomplished by
    algorithms.
    Cont..
    • Algorithms help gadgets respond to voice
    commands, recognize faces, sort photos and
    build and drive cars.
    • Hacking, cyber-attacks and cryptographic
    code-breaking exploit algorithms.
    • Self-learning and self-programming
    algorithms are now emerging, so it is possible
    that in the future algorithms will write many if
    not most algorithms.
    PUZZLE 1
    • Next door to me live four brothers of different
    heights. Their average height is 74 inches, and
    the difference in height among the first three
    men is two inches. The difference between
    the third and the fourth man is six inches.
    • Can you tell how tall is each brother?
    PUZZLE 2
    • BROTHERS AND SISTERS
    • A family I know has several children. Each boy
    in this family has as many sisters as brothers
    but each of the girls has twice as many
    brothers as sisters.
    • How many brothers and sisters are there?
    PUZZLE 3
    • THE GONG
    • Supposing a clock takes 7 seconds to strike 7,
    how long does it take for the same clock to
    strike 10?
    Explore your abilities

    Gear up ….Fasten your seat belts

    You might also like