Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Cs 205: Data Structures (Ktu B Tech Iii Sem) : Modul e Hour S

    Uploaded by

    er_pravesh
    The document outlines the modules and contents of the CS 205: Data Structures course offered at KTU B Tech III. The 6 modules cover topics including algorithm analysis, data structures like arrays, linked lists, stacks, queues, trees and graphs. Specific data structures and algorithms discussed include vectors, linked lists, binary trees, binary search trees, sorting techniques like merge sort and quick sort, and hashing functions. The modules total 57 hours and cover fundamental data structures and algorithms.

    Copyright:

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

    Cs 205: Data Structures (Ktu B Tech Iii Sem) : Modul e Hour S

    Uploaded by

    er_pravesh
    20 views1 page
    The document outlines the modules and contents of the CS 205: Data Structures course offered at KTU B Tech III. The 6 modules cover topics including algorithm analysis, data structures like arrays, linked lists, stacks, queues, trees and graphs. Specific data structures and algorithms discussed include vectors, linked lists, binary trees, binary search trees, sorting techniques like merge sort and quick sort, and hashing functions. The modules total 57 hours and cover fundamental data structures and algorithms.

    Original Description:

    KTU B Tech Syllabus III Sem

    Original Title

    Syllabus

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines the modules and contents of the CS 205: Data Structures course offered at KTU B Tech III. The 6 modules cover topics including algorithm analysis, data structures like arrays, linked lists, stacks, queues, trees and graphs. Specific data structures and algorithms discussed include vectors, linked lists, binary trees, binary search trees, sorting techniques like merge sort and quick sort, and hashing functions. The modules total 57 hours and cover fundamental data structures and algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    20 views1 page

    Cs 205: Data Structures (Ktu B Tech Iii Sem) : Modul e Hour S

    Uploaded by

    er_pravesh
    The document outlines the modules and contents of the CS 205: Data Structures course offered at KTU B Tech III. The 6 modules cover topics including algorithm analysis, data structures like arrays, linked lists, stacks, queues, trees and graphs. Specific data structures and algorithms discussed include vectors, linked lists, binary trees, binary search trees, sorting techniques like merge sort and quick sort, and hashing functions. The modules total 57 hours and cover fundamental data structures and algorithms.

    Copyright:

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

    CS 205: DATA STRUCTURES (KTU B TECH III

    Sem)
    Modul Contents Hour
    e s
    I Introduction to Programming Methodologies structured approach, stepwise 9
    refinement techniques, programming style, documentation analysis of algorithms:
    frequency count, definition of Big O notation, asymptotic analysis of simple
    algorithms. Recursive and iterative algorithms.
    II Abstract and Concrete Data Structures- Basic data structures vectors and arrays. 9
    Applications, Linked lists: singly linked list, doubly linked list, Circular linked list,
    operations on linked list, linked list with header nodes, applications of linked list:
    polynomials.
    III Applications of linked list (continued): Memory management, memory allocation 9
    and de-allocation. First-fit, best-fit and worst-fit allocation schemes.
    Implementation of Stacks and Queues using arrays and linked list, DEQUEUE
    (double ended queue). Multiple Stacks and Queues, Applications.
    IV String: representation of strings, concatenation, substring searching and deletion. 10
    Trees: m-ary Tree, Binary Trees level and height of the tree, complete-binary tree
    representation using array, tree traversals (Recursive and non-recursive),
    applications. Binary search tree creation, insertion and deletion and search
    operations, applications.
    V Graphs representation of graphs, BFS and DFS (analysis not required) 9
    applications.
    Sorting Techniques Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick
    sort, Heaps and Heap sort. Searching algorithms (Performance comparison
    expected. Detailed analysis not required)
    VI Linear and Binary search. (Performance comparison expected. Detailed analysis not 10
    required)
    Hash Tables Hashing functions Mid square, division, folding, digit analysis,
    collusion resolution and Overflow handling techniques.

    * *

    You might also like