Bachelor of Computer Application (BCA) Community Share and Help
Syllabus BCA202
Data and File Structure
hr> Gujarat University SY BCA Syllabus (Revised) Effective from June, 2006| 1. | INTRODUCTION | |
| Data Structure and its classification (Primitive, non-primitive: linear, non-linear) | ||
| 2. | ARRAYS | 10% |
| Array Concept ( One Dimension, Two Dimension ) | ||
| Memory representation of Single Dimension Array & Two Dimension Array ( Row Major, Column Major) | ||
| Operations for One Dimension Array (Insertion, Deletion, Traversal), | ||
| Sparse Matrix | ||
| Memory Representation of Sparse Matrix (Vector Notation ) | ||
| Representation of Polynomial | ||
| 3. | Searching And Sorting | 15% |
| Sequential Search | ||
| Binary Search | ||
| Comparison in terms of efficiency | ||
| Bubble Sort | ||
| Selection Sort | ||
| Insertion Sort | ||
| Quick Sort | ||
| Merge Sort | ||
| Comparison in terms of their efficiency | ||
| 4. | Stacks And Queues | 20% |
| Prosperities of Stacks | ||
| Stack | ||
| Representation using Array | ||
| Stack operations ( Push, Pop, Peep, Change) | ||
| Application of Stack ( Recursion, Expression: Infix, Postfix with their conversions) | ||
| Properties of Queues | ||
| Circular Queue | ||
| Priority Queue | ||
| Double ended queue | ||
| Queue representation using Array | ||
| Queue Operations ( Insert Delete) | ||
| Application of queue | ||
| 5. | Linked Lists | 15% |
| Singly linked lists | ||
| Doubly Linked List | ||
| Circular Linked List | ||
| Header Linked List | ||
| Operations of linked list (Insertion, Deletion, Traversal, Split, and Join) | ||
| Application of linked list | ||
| Representation of Polynomial Implementation of Stack and Queue | ||
| 6. | Trees | 20% |
| Definition | ||
| Binary Trees and its properties | ||
| Binary Search Tree | ||
| Representation of using Array Linked List | ||
| Operations on Binary trees ( Creation Traversal: Preorder, Post order, In order, converse ,Preorder Converse In order ,Converse Post order,Search,Deletion) | ||
| Application of Binary trees | ||
| Threaded Binary tree | ||
| Heap Tree | ||
| B-trees | ||
| AVL trees | ||
| Expression tree | ||
| Forests ( Introduction ) | ||
| Conversion of Forest into Binary Tree | ||
| Heap Sort | ||
| 7. | Graphs | 20% |
| Introduction to Graphs | ||
| Weighted Graphs | ||
| Representation of Graph: | ||
| Adjacency Matrix | ||
| Adjacency List | ||
| DFS , BFS algorithms | ||
| Minimum Spanning | ||
| Trees :Prim’s Algorithm, Greedy Method | ||
| Application: Traveling Salesman problem PERT and CPM | ||
| TEXT BOOK: | ||
| Classical Data Structure, D. Samanta, PHI | ||
| REFERNCE BOOKS | ||
| Data Management and Files Structure, Mary, E.S. Loomis PHI | ||
| Data Structures Using C, M. Radhakrishanan & V. Srinivasan | ||
| Data Structures And Algorithm Analysis In C Mark Allen Weiss | ||
| Data Structures Using C & C++, Tananbaum, PHI | ||
| Data Strictures And Algorithm Trembley & Sorenson, THM | ||
| Data Strictures, Lipschuists Schaum’s Series McGraw Hill | ||
| Data Strictures & Program Design In C: Robert Kruse C.L. Ton do Bruse Leung ,PHI |
| Total Marks of this Subject | 100 Marks |
| External (University ) Examination | 70 Marks |
| Internal Sessional Examination | 20 Marks |
| Term Work | 10 Marks |
| Teaching Hours per week | 3 Hrs |
| Practicals | BASED ON SYLLABUS USING C & C++ ONLY. |
Last Updated on 10th Jun 2009