Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    DAA Phase 1

    Uploaded by

    Aravinda A Kumar
    The document describes several algorithms: 1. Add at End inserts a new node with a given data value at the end of a linked list. 2. Print List traverses and prints the data in all nodes of a linked list. 3. Enqueue adds an item to the rear of a queue. Dequeue removes and returns the front item. The document also discusses priority queues and using them to schedule tasks by priority and importance. Pseudocode is provided for various linked list and queue operations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    DAA Phase 1

    Uploaded by

    Aravinda A Kumar
    17 views13 pages
    The document describes several algorithms: 1. Add at End inserts a new node with a given data value at the end of a linked list. 2. Print List traverses and prints the data in all nodes of a linked list. 3. Enqueue adds an item to the rear of a queue. Dequeue removes and returns the front item. The document also discusses priority queues and using them to schedule tasks by priority and importance. Pseudocode is provided for various linked list and queue operations.

    Original Description:

    Design and analysis of algorithm

    Original Title

    DAA phase 1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes several algorithms: 1. Add at End inserts a new node with a given data value at the end of a linked list. 2. Print List traverses and prints the data in all nodes of a linked list. 3. Enqueue adds an item to the rear of a queue. Dequeue removes and returns the front item. The document also discusses priority queues and using them to schedule tasks by priority and importance. Pseudocode is provided for various linked list and queue operations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    17 views13 pages

    DAA Phase 1

    Uploaded by

    Aravinda A Kumar
    The document describes several algorithms: 1. Add at End inserts a new node with a given data value at the end of a linked list. 2. Print List traverses and prints the data in all nodes of a linked list. 3. Enqueue adds an item to the rear of a queue. Dequeue removes and returns the front item. The document also discusses priority queues and using them to schedule tasks by priority and importance. Pseudocode is provided for various linked list and queue operations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 13

    Dig

    to w atle aay

    alloat'oa

    int n,i, 0C]


    do

    do
    foR i e n to i u

    Algon;Mu
    Node head e NuLL

    iuwut AtByiunig Chad ,


    od
    Pritlist Chead)
    "8Pd tauct Nada
    iut data
    3tAutt Nodh nt

    t u

    value

    Rutulu Ahad

    Agosithu ; Caai NadaCata)

    Ro Wed date date

    Noda
    wit
    funetie

    Calle

    aud twivaty.

    }it("Ctaubing

    Paint(" wain fume fiasud eucuti'en);


    3
    Algo athm : aat At End ( hend , data)
    at eud t Wst

    n luput uad aud ato value

    9utun uad
    Noda
    sNode

    Cuunt

    autun uad

    Algoa tau! auliyt ( Nod al)

    ohile hao NuLe

    kuad had ent;

    |Pro

    4
    data
    Valuu

    Algoa thw?

    iwtaliy C4 gueu)

    Enqurue Cdque, o)

    int datHax. 1ze J

    Quue

    Algoni thm

    Aqoac twn? engueu ( uue queue) int itu)


    iu t quus Jata (quuufnout

    utueu i m

    6
    fiet
    afanee Tmpoatante
    iupo
    Tast Stanetule
    MAy.Srze datCa Talk
    Stuce
    tast) tak. tia, tak. (ouy)
    ul, task. 28, tak? %, tiwe;
    tak Taik
    do
    (4*do, tuquu
    task) (4
    todo, tuqueue
    )
    LModERATE taskl
    < Task
    )
    tark} (akal finisk(Nole), tima CITICA taskt Task
    todoPrieaityQue
    ue
    Nainc) Algoai
    modal, wgl,(eniheal, impoatanle au ie
    wig at ToDo Tmpumdoa I/
    uzue Prioiy Study5 Case
    CRITI CAL

    MoDERATE,
    Low

    fuuu Taue

    9utuu Falu

    Agos:la

    Autn Taue
    tun Falu

    4uue Tauk task)


    Poiton

    quu’ diyy tt

    (Poutan -) /2 J. i-pudon de

    quudatapoita
    quw ’dato Cpauitian

    LCeITAL, 0, No task y

    ueueoda (o1
    ut

    iut Aualleit pod

    achild< quuie aud queue data lall ]. inpodanca <


    que data CAnallitJ. lupoeue

    Awallst aclid

    do

    qeuesdasa (Amalst

    baak

    Rutuu diquued ask


    Coa Sudy 6 Biany
    evaluatia
    Biaty tees
    Coupies aud intupetas.

    Nodi 9oot NUL

    Tujut (oot

    iuet Cot, 4o)


    iwut (aot

    insut (ast

    Paut (iguord teaal")


    in-oaltraal (at)

    Piut("auordu tlaueal)

    podtordtaeJal (aot)
    Staucts: Noda
    t dta

    Caalenate (iut dota)

    nod

    gutun KQNod

    Agoncka
    Il inp ut : koot mada aud data to i t

    do

    iusat (aot ’ t , data)

    (
    at ’ aigt, data)
    Agonth: iuonda.tautal (Nod t)
    fae

    do

    data)

    do
    Rot’ data)
    PauodutRalsal Cat y)
    Puoada

    do

    peltedu tiamsel Cnoot’glt)

    output -
    50

    /
    6o

    13

    You might also like