PUNJAB COLLEGE OF TECHNICAL EDUCATION
Teacher Name: Sandeepjit Kaur (SJ) Class Name: MCA
Subject Name: Data Structure Max Marks:60
Subject Code: MCA-302 (N2) Total Lects Required: 50
No. of Tests: 5 No. of Assignments: 4
Instruction for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E
2. Use of non-programmable scientific calculator is allowed
Basic concepts and notations, data structures and data structure operations, mathematical
notation and functions, algorithmic complexity and time space trade off. Basic data
structures such as arrays, stack and queues and their applications, linked and sequential
representation. Linked list, representation of linked list, multi linked structures.
Trees-definitions and basic concepts, linked tree representation, representations in
contiguous storage, binary trees, binary tree traversal, searching insertion and deletion in
binary trees, heap tree and heap sort algorithm, AVL trees.
Graphs and their application, sequential and linked representation of graph – adjacency
matrix, operations on graph, traversing a graph, Dijkstra’s algorithm for shortest distance,
DFS and BFS, Hashing.
Searching and sorting use of various data structures for searching and sorting, Linear and
Binary search, Insertion sort, Selection sort, Merge sort, Radix sort, Bubble sort, Quick
sort, Heap Sort.
1. Programs are to be implemented in ‘C/C++’
2. Insertion, deletion, search and traversal operations are to be performed on all the data
1. A. Tannenbaum, Y. Lanhgsam and A.J.Augenstein,”Data Structures Using C”,
Prentice Hallof India, 1990
2. Seymour Lipschultz, “ Theory and Practice of Data structures”, Mc Graw Hill, 1988.
3. E. Horowitz and S.Sahni,”Data structures with Pascal”, Galgotia, 3rd edition,
Propose Lect. Topics Actual Assign Test
d Week No. DOD
1. Introduction to Data Structure:
• Basic concepts of data
• Problem analysis
2. Data Structure
• Types of data structures
• Data operations
3. Data Structure ( Continue…)
• Need of data structure
• Mathematical notations and functions
4. Algorithm Complexity
• Big O notation
• Time space trade off
5. Introduction to Arrays
• Memory representation of One
• Location of an element at in one
6. Introduction to Arrays
• Memory representation of two
• Location of an element at in two
8. TEST 1
9. Operations on array (Continue…)
Traversing of an array
Insertion of an element in an array
o in the beginning
o at Kth location
o at the end
10. Operations on array (Continue…)
Deletion of an element from an array
o from the beginning
o from Kth location
o from the end
Merging of two arrays
12. TEST 2
13. Stacks & Queues:
• Basics of stacks
• Operations on stack
14. Applications of Stack
• Expression evaluation
15. Applications of Stack (Continue…)
• Polish notation
16. REVISION OF STACK WITH
17. TEST 3
18. Introduction of Queues
• Operations on Queues
o Circular Queues
o Priority Queues
20. Linked Lists:
• Singular List
• Circular List
21. REVISION OF QUEUES WITH EXAMPLES
22. Operations Performed on link list:
o In the beginning
o At kth location
23. Insertion in Link list (Continue…)
o After a given no
o At the end
FIRST HALF SYLLABUS TEST
25. Deletion in Link list
o from the beginning
o from kth location
26. Deletion in Link List
o from the end
o Searching in link list
27. More in Link List:
o Doubly Linked List
o Dynamic storage management
28. More in Link List:
o Generalized list
o Garbage collection
30. TEST 4
• Definition & Concept, Basic Tree
• Binary Tree representation
32. Trees (Continue….)
• Threaded Storage representation
• Binary tree traversals
33. Trees (Continue….)
Searching in binary tree
34. Insertion and deletion in binary tree
35. Heap tree and heap sort
36. AVL tree
37. Graphs: introduction, sequential and linked
representation of graphs
38. Adjacency matrix, operations on graph,
traversing a graph
39. Dijkstra’s algorithm for shortest distance
40. DFS and BFS, Hashing.
41. Searching and Sorting:
• Use of various data structure for
searching & sorting
• Linear & Binary Search
42. Searching and Sorting (Continue…)
• Insertion Sort
• Selection Sort
43. Searching and Sorting (Continue…)
• Merge Sort
44. TEST 5
45. Searching and Sorting (Continue…)
• Radix Sort
46. Searching and Sorting (Continue…)
• Bubble Sort
47. Searching and Sorting (Continue….)
• Quick Sort
48. Searching and Sorting (Continue….)
• Heap Sort
FULL SYLLABUS TEST
Ques 1: Consider the linear Array NAME, which is stored alphabetically.
a) Suppose Daljit is to be inserted into the linear array. How many names must be
moved to new locations?
b) Suppose Gagan is to be deleted from the array. How many names must be moved
to new locations?
Ques 2: Consider the algebraic expression ( 7x + 5y ) (2a – 5b )3. Draw the corresponding
diagram for it.
Ques 3: The tree structure is given by means of level numbers. Draw the corresponding
01 Student 02 Name 03 First name
02Class 03Middle name
02Rollno 03 Last name
02Father’sName 03Father’s First name
02Age 03 Father’s first name
02Address 03 father’s middle name
02 Contactno 03father’s last name
1. What is threaded Binary Tree?
2. How the height of a binary search tree effects its performance?
3. What is the different between B-Tree, B + - Tree, B * Tree
4. How heap differs from binary tree?
1. For a binary Tree the in-order & post-order traversal sequences are as follows:
In order: D C K E A H B Q J I
Post order: D K E C H Q J I B A
Draw Binary Tree.
2. Write a search () function so that it not only returns the location of the element but
also return location of its parents in a binary search tree.
3. What is a thread? How it is useful? What are advantages of threading a binary
1. What is a Complete Binary Tree? Explain its related terminology.
2. What is the node structure of a tree (Binary)?
3. What is Tree Traversal?
1. What do you mean by Binary Search Tree? Explain how deletion of a node is
performed in the Binary Search Tree.
2. Describe the Binary Tree Traversing methods with the help of proper examples.
3. Traverse the following tree in inorder, preorder and postorder. Write the
D E F
Practical Software Lab – III
BC-207(N2) Max Marks 100
Internal Assessment 40
External Assessment 60
Note: Program should be fully documented with sample I/O data Flow
charts should be developed wherever necessary.
Write program in C
1. To insert and delete a node in a linked list
2. To add two polynomials using linked list
3. To insert and delete a node in a circular linked list.
4. To implement a stack using arrays and linked list.
5. To implement a queue using arrays and linked list.
6. To invert a linked list.
7. To merge two arrays.
8. To solve polish expression using stacks.
9. For tower of hanoi problem using recursion.
10 .To insert and delete node in binary search tree
11. To find traversals of expressions using binary tree
12. To search an element using binary tree.
1. Need Of Data Structure
2. Types of data structures
3. Operations performed on data structure
4. What is structure? Difference b/w structure and union.
5. What is self referential structure?
6. What is pointer & operations performed on pointer
7. What is an array? Types of array?
8. Operations of an array.
9. Complexity of an algorithm?
10.Hotel Taj Attack (reasons)
11.Future of IT
13.Advantages and Disadvantages of Internet
14. Stack and its operations
15.Applications of stack
16.Queues and its operations
17.Applications of Queues
18.Types of queues
19. Reliance telecom
21. RGTP (Rajiv Ghandhi Technology Park, Mohali)
22. Online Education