INFORMATION TECHNOLOGY ENGINEERING KTU B-TECH Modified S3 SYLLABUS 2016,Data structures,Digital Circuits Lab,Data structures Lab

INFORMATION TECHNOLOGY ENGINEERING KTU B-TECH Modified S3 SYLLABUS 2016,Data structures,Digital Circuits Lab,Data structures Lab


7. CS205 Data structures



    Syllabus:-


    Introduction to various programming methodologies, terminologies and basics of algorithms analysis, Basic Abstract and Concrete Linear Data Structures.


    Non-linear Data Structures, Memory Management, Sorting Algorithms, Searching Algorithms, Hashing.


    INFORMATION TECHNOLOGY ENGINEERING KTU B-TECH Modified S3 SYLLABUS 2016



    Text Books:-


     1. Samanta D. Classic Data Structures, Prentice Hall India, 2/e, 2009. 

    2. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with
        C, 2/e, Cengage Learning, 2005. 


    8. CS231 Data structures Lab


      List of Exercises/Experiments:- (Minimum 12 are to be done) 



      1. Implementation of Stack and Multiple stacks using one dimensional array. ** 

      2. Application problems using stacks: Infix to post fix conversion, postfix and pre-fix evaluation, MAZE problem etc. ** 

      3. Implementation of Queue, DEQUEUE and Circular queue using arrays. 

      4. Implementation of various linked list operations. ** 

      5. Implementation of stack, queue and their applications using linked list. 



      INFORMATION TECHNOLOGY ENGINEERING KTU B-TECH Modified S3 SYLLABUS 2016




      6. Implementation of trees using linked list 

      7. Representation of polynomials using linked list, addition and multiplication of polynomials. ** 

      8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion and traversal. ** 

      9. Implementation of binary search trees – creation, insertion, deletion, search 

      10. Application using trees 

      11. Implementation of sorting algorithms – bubble, insertion, selection, quick (recursive and non-recursive), merge sort (recursive and non-recursive), and heap sort.** 

      12. Implementation of searching algorithms – linear search, binary search.** 

      13. Representation of graphs and computing various parameters (in degree, out degree etc.) - adjacency list, adjacency matrix. 

      14. Implementation of BFS, DFS for each representation. 

      15. Implementation of hash table using various mapping functions, various collision and overflow resolving schemes.** 

      16. Implementation of various string operations.

      17. Simulation of first-fit, best-fit and worst-fit allocations. 

      18. Simulation of a basic memory allocator and garbage collector using doubly linked list.


      9. IT231 Digital Circuits Lab



        List of Exercises / Experiments (Minimum of 8 mandatory out of 10) 



        1. Realization of functions using basic and universal gates. 

        2. Adders and Subtractors (Any four) i) Half adder using NAND and NOR only.



        ii) Full adder using NAND and NOR only. 

        iii) Full adder using two half adders

        iv) Half subtractor using NAND and NOR only. 

        v) Full subtractor using NAND and NOR only. 



        INFORMATION TECHNOLOGY ENGINEERING KTU B-TECH Modified S3 SYLLABUS 2016



        3. 2/3 bit binary comparator. 

        4. BCD to Decimal and BCD to 7 segment decoder & display 

        5. Multiplexers, De-multiplexers using gates and ICs. (74150, 74154) 

        6. Realization of combinational circuits using MUX & DEMUX. 

        7. Realization of flip flops using gates. (Any four) i) RS flip-flops 



        ii) T flip-flops 

        iii) D flip-flops 

        iv) JK flip-flops 

        v) Master Slave flip-flops 



        8. Random sequence generator. 

        9. Realisation of Shift Registers. 

        10. Counters (using flip flops) 



        i) Synchronous counters 

        ii) Asynchronous counters 

        iii) Ring counter

         iv) Johnson counter 



        Class Project (Minimum one mandatory per group)

        i) Implementation of digital clock 

        ii) Implementation of digital timer 

        iii) Implementation of event counter 

        iv) Implementation of token display

        No comments:

        Powered by Blogger.