Code: 4330704
Credits: 5
Semester 3
COMPUTER
Data Structures and Algorithms
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
×
GTU Previous Year Papers
Data Structures and Algorithms Syllabus — Unit-wise Content
The official GTU curriculum for Data Structures and Algorithms (subject code 4330704) as prescribed for COMPUTER · Semester 3 divides the course into 6 units, covering 36 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (4330704)Unit 1 Basic Concepts of Data Structures
- 1.1. Data Structure Basic Concepts
- 1.2. Types of data structures
- 1.3. Primitive and non-primitive data structures
- 1.4. Introduction to Algorithms
- 1.5. Key features of an algorithm
- 1.6. Analysis Terms (for the definitions purpose only): a. Time Complexity b. Space Complexity c. Asymptotic Notations: Big Oh Notation, Big Omega Notation, Big Theta Notation, Best case Time Complexity, Average case Time Complexity, Worst case Time Complexity
- 1.7. Array: i. Row Major Arrays ii. Column Major Arrays
- 1.8. Overview of different array operations.
- 1.9. Searching an element into an array: i. Linear Search ii. Binary Search
Unit 2 Strings
- 2.1. String representation: Reading and Writing Strings
- 2.2. String operations : Finding length of a string, Converting Characters of a string into upper case and lower case, Concatenation of two strings to form a new string, Appending, Reversing a string, Copying a string, Comparing strings, Insertion, Substring, Deletion Data Structures and Algorithms Course Code: 4330704
Unit 3 Stack and Queues
- 3.1. Linear and Non-Linear Data Structures
- 3.2. Stack : Array representation of Stack, PUSH- POP Operations on Stack, Implementation of Stack, Application of Stack, Infix, Prefix and Postfix Forms of Expressions, Recursive Functions (Factorial, greatest common divisor, Fibonacci series) 3c.. Implement different operations on a Queue
- 3.3. Queue: Array representation of Queue Operations on a Queue (Add an element, delete an element, display all elements of a queue), Implementation of a Queue, Limitation of a Single Queue
- 3.4. Concepts of Circular Queue
- 3.5. Applications of a queue
- 3.6. Differentiate circular queue and simple queue
Unit 4 Linked List
- 4.2. Revision of Structure
- 4.3. Revision of structure using pointers
- 4.4. Dynamic Memory Allocation
- 4.5. Linked list Presentation
- 4.6. Types of Linked List
- 4.7. Basic operations on singly linked list : Insertion of a new node in the beginning of the list, at the end of the list, after a given node, before a given node, in sorted linked list, Deleting the first and last node from a linked list, Searching a node in Linked List, Count the number of nodes in linked list
- 4.8. Concepts of circular linked list
- 4.9. Difference between circular linked list and singly linked list
- 4.10. Doubly linked list: Representation
- 4.11. Difference between Doubly linked list and singly linked list
- 4.12. Applications of the linked list
Unit 5 Trees
- 5.1. Non-linear data structures: Tree, Graph
- 5.2. Basic Terms: General Tree, Forest, Binary trees, level number, degree, in-degree and out-degree, root node, leaf node, directed edge, path, depth Binary tree: Complete Binary Tree, Strict Binary Tree, Conversion of General Tree to Binary Tree Data Structures and Algorithms Course Code: 4330704
- 5.3. Binary Search Tree : Insertion of a node in binary tree, Deletion of a node in binary tree, Searching a node in binary tree
- 5.4. Binary Tree Traversal : Inorder, Preorder, Postorder
- 5.5. Applications of binary tree
Unit 6 Sorting and Hashing
- 6.1. Sorting Methods : a. Bubble Sort, b. Selection Sort, c. Quick Sort, d. Insertion Sort, e. Merge Sort, f. Radix Sort
- 6.2. Hashing Concepts
- 6.3. Hash functions: Division Method, Middle Square Method, Folding Method Note: The UOs need to be formulated at the ‘Application Level’ and above of Revised Bloom’s Taxonomy’ to accelerate the attainment of the COs and the competency.
Study on Android App:
