UNIVERSITY INSTITUTE OF COMPUTING

Bachelor of Computer Application

Subject Name: Data Structure
24CAP-151/24SCT-151
 VISION

To be a Centre of Excellence for nurturing computer professionals with

strong application expertise through experiential learning and research
for matching the requirements of industry and society instilling in them
the spirit of innovation and entrepreneurship.

2
 Mission of the Department

M1. To provide innovative learning centric facilities and quality-

oriented teaching learning process for solving computational problems.
M2. To provide a frame work through Project Based Learning to
support society and industry in promoting a multidisciplinary activity.
M3. To develop crystal clear evaluation system and experiential
learning mechanism aligned with futuristic technologies and industry.
M4. To provide doorway for promoting research, innovation and
entrepreneurship skills incollaboration with industry and academia.
M5. To undertake societal activities for upliftment of rural/deprived
sections of the society.
3
 Program Outcomes
• PO1 Apply mathematics and computing fundamental and domain concepts to find out the solution of defined problems and requirements. (Computational
Knowledge)
• PO2 Use fundamental principle of Mathematics and Computing to identify, formulate research literature for solving complex problems, reaching appropriate
solutions. (Problem Analysis)
• PO3 Understand to design, analyze and develop solutions and evaluate system components or processes to meet specific need for local, regional and global public
health, societal, cultural, and environmental systems.
• PO4 (Design /Development of Solutions)Use expertise research-based knowledge and methods including skills for analysis and development of information to
reach valid conclusions. (Conduct Investigations of Complex Computing Problems)
• PO5 Adapt, apply appropriate modern computing tools and techniques to solve computing activities keeping in view the limitations. (Modern Tool Usage)
• PO6 Exhibiting ethics for regulations, responsibilities and norms in professional computing practices. (Professional Ethics)
• PO7 Enlighten knowledge to enhance understanding and building research, strategies in independent learning for continual development as computer applications
professional. (Life-long Learning)
• PO8 Establishing strategies in developing and implementing ideas in multi- disciplinary environments using computing and management skills as a member or
leader in a team. (Project Management and Finance)
• PO9 Contribute to progressive community and society in comprehending computing activities by writing effective reports, designing documentation, making
effective presentation, and understand instructions. (Communication Efficacy)
• PO10 Apply mathematics and computing knowledge to access and solve issues relating to health, safety, societal, environmental, legal, and cultural issues within
local, regional and global context. (Societal and Environmental Concern)
• PO11 Gain confidence for self and continuous learning to improve knowledge and competence as a member or leader of a team. (Individual and Teamwork)
• PO12 Learn to innovate, design and develop solutions for solving real life business problems and addressing business development issues with a passion for quality
competency and holistic approach. (Innovation and Entrepreneurship)

4
 Program Educational Objectives

PEO1 Demonstrate analytical and design skills including the ability to generate creative solutions and foster
team-oriented professionalism through effective communication in their careers.
PEO2 Expertise in successful careers based on their understanding of formal and practical methods of
application development using the concept of computer programming languages and design principles in
accordance to industry 4.0
PEO3 Exhibit the growth of the nation and society by implementing and acquiring knowledge of upliftment of
health, safety and other societal issues.
PEO4 Implement their exhibiting critical thinking and problem- solving skills in professional practices or tackle
social, technical and business challenges.

5
 Program Specific Outcomes

PSO1 Analyze their abilities in systematic planning, developing, testing

and executing complex computing applications in field of Social-Media
and Analytics, Web Application Development and Data Interpretations.
PSO2 Apprise in-depth expertise and sustainable learning that
contributes to multi-disciplinary creativity, permutation, modernization
and study to address global interest.

6
 Topic To be Covered

• Mathematical notation and functions (CO1)

 Mathematical Functions

1. Floor Functions: The floor function for any real number x is defined
as f (x) is the greatest integer 1 less than or equal to x. It is denoted
by [x].

Example: Determine the value of

(i)[3. 5] (ii)[-2.4] (iii)[3. 143].
Solution:
(i)[3 . 5] = 3 (ii) [-2 .4] = -3 (iii) [3. 143] = 3
 2. Ceiling Functions:

The ceiling function for any real number x is defined as h (x) is the
smallest integer greater than or equal to x. It is denoted by [x].

Example: Determine the value of

(i)[3. 5] (ii) [-2.4] (iii) [3. 143].
Solution:
(i)[3. 5] = 4 (ii) [-2 .4] = -2 (iii) [3. 143] = 4.
 3. Remainder Functions:

The integer remainder is obtained when some a is divided by m. It is

denoted by a (MOD m). We can also define it as, a (MOD m) is the
unique integer t such that a = Mq + t. Here q is quotient 0 ≤ r < M.

Example: Determine the value of the following:

(i) 35 (MOD 7) (ii) 20 (MOD 3) (iii) 4 (MOD 9)
Solution:
(i) 35 (MOD 7) = 0 (ii) 20 (MOD 3) = 2 (iii) 4 (MOD 9) = 4
 4. Exponential Functions:
Consider two sets A and B. Let A = B = I+ and also let f: A → B be defined
by f (n)= kn. Here n is a +ve integer. The function f is called the base k
exponential function.
Note
1: kt = k. k. k.......k (t times).
2: k0=1, k-M=
3. For rational number, a/b, the exponential function is
Example: Determine the value of the following:
(i) 103 (ii) 51/2 (iii) 3-5
Solution:
103= 10. 10. 10 = 1000
51/2 = 2.23607
3-5=
 5. Logarithmic Functions:

A Logarithm is a mathematical function that represents the exponent to

which a fixed number, known as the base, must be raised to produce a
given number. In other words, it is the inverse operation of
exponentiation.
 5. Logarithmic Functions:
• Expanding and Condensing Logarithm
• A logarithmic expression can be expanded and condensed using the
following Properties of Log:
• Product Rule of Log: logxab = logxa + logxb
• Quotient Rule of Log: logxa/b = logxa – logxb
• Power Rule of Log: logxab = b.logxa
Example: Expand log(2a3b2)
Solution: log(2a3b2) = log 2 + log a3 + log b2
= log 2 + 3 log a + 2 log b
 5. Logarithmic Functions:
Consider two sets A and B. Let A = B = R (the set of real numbers and also let
f_n:A→B be defined for each positive integer n > 1 as f n (x)=logn(x) the base n of
x.
Note1: k = logn x and nk are equivalent.
2. For any base n, logn 1=0 as n0=1.
3. For any base n, logn n=1 as n1=n.

Example: Determine the value of the following:

(i) log216 (ii) log2 100 (iii) log2 0.001
Solution:
(i)log216 = 4 as 24=16.
(ii)log2 100 = 6 as 26= 64 but 27=128 which is greater
(iii)log2 0.001=-9 as 2-9= but 2-10= which is greater.
 6. Sigma Notation (∑)

• Sigma notation is used to represent the summation of a series of

terms. It is often used in the analysis of algorithms to describe the
total cost or resource consumption over a sequence of operations.

• Example: ∑(i=1 to n) i
 7. Set Notation ({}):

• Set notation is used to represent collections of elements. In data

structures, it can be used to represent sets, multisets, or other data
structures that involve collections of items.

• Example: {1, 2, 3}, {x | x is an integer and x > 0}

 8. Function Notation (f()):

• Function notation is used to describe operations or transformations

applied to data structures. It can represent functions that map input
data to output data or functions that operate on data structures
directly.

• Example: f(x) = 2x, f(S) = |S| (where S is a set)

 Book References
TEXT BOOKS
• Seymour Lipchitz, Schaum's Outlines Series Data Structures TMH. J.P. Hayes,
Computer Organization and Architecture, Third Edition, TMH.
• Data Structure Theory Problem and Algorithms, R.S. Salaria, Khanna Book
Publishing Company, Delhi.
REFERENCE BOOKS
• Introduction to Data Structures Applications, Trembley&Soreson, Second
Edition, Pearson Education Robert L. Britton, MIPS Assembly Language
Programming, Pearson Prentice Hall.
• A. Tanenbaum, Y. Lanhgsam and A. J. Augenstein, Data Structures Using C++,
Prentice Hall of India, 1990
 Video Links

https://www.youtube.com/watch?v=lGfsp2CWjok
THANK YOU

Created by: Mehak Bhatia (E16757)

[email protected]