SE ETC DSA

Embed Size (px)

Citation preview

  • 7/25/2019 SE ETC DSA

    1/4

    LessName of Subject

    Unit Topic Name

    Unit I

    Unit II

    Unit III

    Introduction to C andAlgorithm

    Searching andSorting

    Stack and Queues

  • 7/25/2019 SE ETC DSA

    2/4

    Unit IV

    Unit V

    Unit VI

    Total : 45 Hours

    Linked List

    Trees

    Graphs

  • 7/25/2019 SE ETC DSA

    3/4

    n Plan format

    Topics Discritpion

    Constants, aria!les and ke"#ords in C $operators in C $

    $

    $

    $

    structure, union $

    $

    $

    D"namic memor" management $

    $

    $

    Searching methods% Linear, !inar" search and $

    &i!onacci Search $

    Sorting methods% 'u!!le, insertion, $

    selection, merge $

    $

    (ashing Techni)ues $

    Stacks% Concept, 'asic Stack operations $

    Arra" representation o* stacks, Stack as ADT $

    $

    Queue Concept, Queue operations $

    Arra" representation o* )ueues, Queue as ADT$

    Circular )ueues $

    $

    Concept o* linked organi+ation, Linked list as ADT $

    singl" linked list $

    No o* Lecture-e)uired

    control structure in c.decision, loop andcase/

    &unctions% 0arameter passing call !" alue and call!" re*erence, macros

    arra"s and string manipulation, Stringmanipulations using Arra"s

    enumeration, !it#ise

    operations , scope rules

    *unctions and pointers, *unction returning pointer,pointer to *unction,pointer to pointer

    Anal"sis o* algorithm% *re)uenc" count and itsimportance in anal"sis o* an algorithm, Timecomple1it" 2 Space comple1it" o* an algorithm, 'ig345 notation

    Need o* searching and sorting, #h" ariousmethods o* searching and sorting

    Time comple1it" o* each searching andsorting algorithm

    Stack Applications% -eersing data, Arithmetice1pressions conersion and ealuation

    Application o* )ueues% Categori+ing data,Simulation o* )ueues

  • 7/25/2019 SE ETC DSA

    4/4

    stack using linked list, $

    )ueue using linked list $

    dou!l" linked list, circular linked list $

    $

    $

    Introduction to trees% 'asic Tree Concepts $

    'inar" Trees%Concept 2 Terminologies $

    -epresentation o* 'inar" Tree in memor" $

    Traersing a !inar" tree 6

    'inar" Search Trees .'ST/% 'asic Concepts $

    'ST operations $

    'asic Concepts 2 terminolog", $

    $

    Linked representation o* a graph,0ath matri1, $

    4perations on graph, Traersing a graph $

    Spanning trees7 8inimum Spanning tree, $

    9ruskal5s Algorithm, 0rim5s Algorithm $

    Di:kstra;s Shortest 0ath Algorithm $

    -epresentation and manipulations o* pol"nomialsusing linked lists

    comparison o* se)uential linked

    organi+ation #ith linked organi+ation

    Se)uential representation o* graphs7 Ad:acenc"matri1