[nilesh]

Discuss about data structure bput here. Welcome to Courses.ind.in and this page is for data structure bput discussion. If you are looking for information on data structure bput then ask your question is as much details as possible in the “Reply” box provided below. The more detailed your question will be, the more easy will it be for our experts to answers your query. And if you have any updated or latest information on data structure bput, then please share you knowledge with our experts in the “Reply” box below. Your reply will be published here and your knowledge can help many people. Thanks for stopping by at Courses.ind.in. Please visit again.

Hi buddy here I am looking for BPUT B.Tech (2 sem, cse) data structure using c old question paper, so would you plz provide me same ??

[prince karak]

As you want here I am providing BPUT B.Tech (2 sem, cse) data structure using c old question paper on your demand :

BPUT B.Tech (2 sem, CSE) data structure using c old question paper





DATA STRUCTURE USING ‘C’ paper syllabus
Development of Algorithms : Notations and Analysis. Storage structures for arrays -
sparse matrices - structures and arrays of structures. Stacks and Queues:
Representations and applications.
Linked Lists : singly linked lists - Linked stacks and queues - operations on
Polynomials - Linked Dictionary - Doubly Linked Lists - Circularly Linked Lists.
Dynamic storage management - Garbage collection and compaction.
Binary Trees : Binary Search Trees - General Trees - Tree Traversing - Operations on
Binary Trees - Expression Manipulations - Symbol Table construction - Height
Balanced Trees.
Graphs : Representation of Graphs - Path Matrix - BFS, DFS – Bi-connected Graphs -
Topological sort - Shortest path problems. Strings - Representation - Manipulations -
Pattern Matching.
Sorting Techniques : Selection, Bubble, Insertion, Merge, Heap, Quick, Radix and
address calculation. Linear searching - Binary Searching . Hash Table Methods.
Module 1 (8 hrs)
Development of Algorithms : Notations and Analysis. Storage structures for arrays -
sparse matrices - structures and arrays of structures. Stacks and Queues:
Representations and applications.
Module 2 (8 hrs)
Linked Lists : singly linked lists - Linked stacks and queues - operations on
Polynomials - Linked Dictionary - Doubly Linked Lists - Circularly Linked Lists.
Dynamic storage management - Garbage collection and compaction.
Module 3 ( 8 hrs) :
Binary Trees : Binary Search Trees - General Trees - Tree Traversing - Operations on
Binary Trees - Expression Manipulations - Symbol Table construction - Height
Balanced Trees.
Module 4 ( 16 hrs)
Graphs : Representation of Graphs - Path Matrix - BFS, DFS – Bi-connected Graphs -
Topological sort - Shortest path problems. Strings - Representation - Manipulations -
Pattern Matching.
Sorting Techniques : Selection, Bubble, Insertion, Merge, Heap, Quick, Radix and
address calculation. Linear searching - Binary Searching . Hash Table Methods.