PCTE Group Of Institutes

COURSE: BCA
SUBJECT NAME: Data Structures
SUBJECT CODE: UGCA1915
SEMESTER: 3rd
COURSE INSTRUCTOR: Mrs. Seema Bajaj
CREDITS: 4
EMAIL: [email protected]

Department of Computer Science Page 1

 PCTE Group Of Institutes

PROGRAM EDUCATIONAL OBJECTIVE

⮚ The application & usage of Stack, Queue, Linked List.

⮚ To make students aware about the searching and sorting methods used in computers to

manage the data.

⮚ The students need exposure about how the data records about entities is stored in

memory.

COURSE OUTCOME
Students will be able to:

CO# Course outcomes

CO1 Apply appropriate constructs of Programming language,
coding standards for application development
CO2 Use appropriate data structures for problem solving and
programming
CO3 Use algorithmic foundations for solving problems and
programming
CO4 Apply appropriate searching and/or sorting techniques for
application development.
CO5 Develop programming logic and skills.

Department of Computer Science Page 2

 PCTE Group Of Institutes

SYLLABUS
DATA STRUCTURES

Unit 1

Introduction to Data Structures:

Algorithms and Flowcharts, Basics Analysis on Algorithm,
Introduction and Definition of Data Structure, Classification of Data, Arrays, Various types of
Data Structure, Static and Dynamic Memory Allocation, Function, Recursion.
Arrays, Pointers and Strings:
Introduction to Arrays, Definition, One Dimensional Array and Multi-Dimensional Arrays,
Pointer, Pointer to Structure, various Programs for Array and Pointer. Strings. Introduction to
Strings, Definition, Library Functions of Strings.

Unit 2

Stacks and Queue

Introduction to Stack, Definition, Stack Implementation, Operations of Stack, Applications of
Stack and Multiple Stacks. Implementation of Multiple Stack Queues, Introduction to Queue,
Definition, Queue Implementation, Operations of Queue, Circular Queue, De-queue and Priority
Queue.

Unit 3

Linked Lists and Trees

Introduction, Representation and Operations of Linked Lists, Singly Linked List, Doubly Linked
List, Circular Linked List, And Circular Doubly Linked List.
Trees
Introduction to Tree, Tree Terminology Binary Tree, Binary Search Tree, Strictly Binary Tree,
Complete Binary Tree, Tree Traversal, Threaded Binary Tree, AVL Tree B Tree, B+ Tree.

Unit 4

Graphs, Searching, Sorting and Hashing

Graphs: Introduction, Representation to Graphs, Graph Traversals Shortest Path Algorithms.
Searching and Sorting: Searching, Types of Searching, Sorting, Types of sorting like quick sort,
bubble sort, merge sort, selection sort.
Hashing: Hash Function, Types of Hash Functions, Collision, Collision Resolution Technique
(CRT), Perfect Hashing

Department of Computer Science Page 3

 PCTE Group Of Institutes

TEXT BOOKS

1. Brijesh Bakariya. Data Structures and Algorithms Implementation through C, BPB

Publications.
2. Kruse R.L. Data Structures and Program Design in C; PHI
3. Aho Alfred V., Hopperoft John E., UIlman Jeffrey D., “Data Structures and Algorithms”,
AddisonWesley

REFERENCE BOOKS

1. Horowitz & Sawhaney: Fundamentals of Data Structures, Galgotia Publishers.

2. Yashwant Kanetkar, Understanding Pointers in C, BPB Publications.
3. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, Galgotia Pub. Pvt. Ltd., 1998.

Department of Computer Science Page 4

 PCTE Group Of Institutes

EVALUATION CRITERIA

PARAMETER MARKS
MSE I & II 24
Presentation* 5
Class Test/Task/Quiz 5
Attendance 6
Total 40

*ATTENDANCE MARKS

ATTENDANCE PERCENTAGE (%) MARKS

95 Above 6

91-95 5

86-90 4

81-85 3

76-80 2

75 Below 0

Department of Computer Science Page 5

 PCTE Group Of Institutes

PRESENTATION DETAILS
Presentations will be held during the semester about which you will be informed well in advance.
The rules for presentation are :

Evaluation Criteria for Presentations:

Max. Marks: 20 Weightage(5)
Break-up of marks will be as follows:
● Synopsis: 3 Marks
● Presentation Skills: 6 Marks
● Content: 6 Marks
● Query handling: 5 Marks

• Bibliography is a must.
• The standard template is to be followed for both the synopsis and the PPTs
• Students must be dressed formally on the day of the presentation. No student should be
allowed to deliver the presentation in informal dress.
• Sequence of presentation will be completely random(Slip system).
• If a student is absent when his name is called out, he/she will be awarded Reappear.
• A total of 6 sessions will be held during one and half days of each presentation. It is
mandatory for each student to attend at least 5 sessions failing which he/she will be
evaluated out of 50% marks only.

*IT IS COMPULSORY FOR ALL THE STUDENTS TO DELIVER AND

CLEAR PRESENTATION TO PASS IN INTERNAL.

● Students will deliver this presentation by doing research on the Online System or software
or application.
● Students must discuss about:
1. Minimum 4 features of the software/application
2. Analyze data structure that can be used for the chosen feature (Array, Linked list,
Stack, Queues, Trees)
3. Understanding of any 2 features of the application/software.
4. Design an algorithm in simple English language to implement any one feature.
● Software/App or online system can be :

Department of Computer Science Page 6

 PCTE Group Of Institutes

1 Alibaba
2 Amazon
3 Any game
4 Applock
5 Aarogya setu
6 Bank bazaar
7 Big basket
8 Bitmoji
9 Book my show
10 Car dekho
11 Carwala
12 Coupon dunia
13 Cricbuzz
14 Crickinfo
15 Digilocker
16 Ebay
17 Facebook
18 Facebook Messenger
19 First cry
20 Flipkart
21 Food panda
22 Gmail
23 Goibibo
24 Google Pay
25 Groffers
26 Ola
27 Housing.com
28 Hotstar
29 Instagram
30 IRCTC
31 Magic Bricks
32 Make my Trip
33 Mobikwik
34 Myntra
35 My jio
36 Groupon
37 Olx
38 Paypal
39 Paytm
40 Phone pay
41 Photo-circle

Department of Computer Science Page 7

 PCTE Group Of Institutes

42 Policy bazaar
43 Rapido
44 Red bricks
45 Sharechat
46 Snapchat
47 Speedtest
48 Swiggy
49 Tiktok
50 Times of India app
51 Truecaller
52 Twitter
53 Uber
54 Uber eats
55 Urbanclap
56 Whatsapp
57 Yahoo mail
58 Youtube
59 Zomato
60 99 acres

Department of Computer Science Page 8

 PCTE Group Of Institutes

CLASSROOM POLICIES

● Be punctual for the class, try to minimize your disturbance if you are late. I may not
reject students who come after 5 minutes from the scheduled time but without attendance.
● During lecture delivery, if you have any kind of query, just raise your hand. Queries are
important for the understanding of the concepts. So, do ask queries but make sure they
are relevant to the subject.
● Be disciplined in the classroom and don’t make any noise while we are studying.
● It is compulsory for all the students to have minimum 75% attendance at the end of
the semester failing which the student will not be allowed to write the final exam.

Department of Computer Science Page 9

 PCTE Group Of Institutes

COURSE PLAN

LEC.
TOPICS
NO.
Introduction to Data Structures:

1. Introduction and Definition of Data Structures

Need of data structure

2. Types of data structures

3. Linear and Nonlinear

Algorithms and Flowcharts,
4.
Complexity of Algorithms.
Memory Allocation: Static & Dynamic
5.
Creation of object with new(), Array etc
6. Function, Recursion etc
Introduction to Arrays:
Types: 1D, 2D
7.
Memory representation
Location of an element
Traversing of an array
Insertion of an element in an array

8. ▪ in the beginning
▪ at Kth location
▪ at the end
Deletion of an element from an array
▪ from the beginning
9.
▪ from Kth location
▪ from the end
Pointers and Structures:
10. Declaration, assignment, uses

Department of Computer Science Page 10

 PCTE Group Of Institutes

Strings and Functions on Strings:

11.
strlen(), strcat(), etc

12. Stack and Queue:

Introduction and Applications

13. Operations on Stack

Implementation of Stack

14. Operations on Queue

Implementation of Queue
15.
Types of Queues
Linked List
16.
Memory Representation and operations
Insertion

17. ▪ In the beginning

▪ At kth location
Insertion

18. ▪ After a given no

▪ At the end
Deletion

19. ▪ from the beginning

▪ from kth location

20. Deletion from the end

21. Doubly Link List

▪ Representation

22. ▪ Insertion
▪ Deletion

23. Circular Linked List

24. Trees:
Introduction and examples: Family Tree
25.
Operations on Trees

26. Tree Traversal:

Department of Computer Science Page 11

 PCTE Group Of Institutes

In-order, Pre-Order, Post-Order

27. Types of Trees:

Binary Tree, Complete Binary Tree, BST
28.
AVL Tree, B+ Tree
Graphs:
29.
Introduction and Applications: Google Maps, Computer N/W

30.
Representation and Traversal
31.
32.
Shortest path algorithms
33.
Searching:
34.
Linear search
Binary Search
Sorting:
35.
Bubble Sort

36. Selection Sort

37. Quick Sort

38. Merge Sort

Hashing:

39. Introduction
Types of Hash functions
40.
Collision
Collision in Hashing
41. Collision Resolution Techniques (Chaining)
Collision Resolution Techniques (Open Addressing)
42.
43. Perfect Hashing

44. Review, Practice Problems, and Revision

Department of Computer Science Page 12

 PCTE Group Of Institutes

PROJECT:

Project work will be done in the computer lab, mobile phones etc will not be allowed, you can
carry your notebook.

Students will design and discuss:

● Their family hierarchy in the form of Tree data structure.
● Design of phone contact book in the form of Linked-List using structures and dynamic
memory allocation.
● Storing student information using structures and dynamic memory allocation.
● Implementation of one real life application of array/stack/queue data structure.

Department of Computer Science Page 13

 PCTE Group Of Institutes

Department of Computer Science Page 14