CSE R20

KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)

Department of Computer Science and Engineering

SEMESTER-V
S.N Code Course Title L T P C IM EM TM
o
THEORY
1 20CS5T01 Computer Networks 3 0 0 3 30 70 100
2 20IT5T02 Design and Analysis of Algorithms 3 0 0 3 30 70 100
3 20IT5T01 Operating systems 3 0 0 3 30 70 100
4 20EC5OXX Open Elective-I 3 0 0 3 30 70 100
5 20CS5EXX Professional Elective - I 3 0 0 3 30 70 100
1. Data warehousing and Data Mining
2. Software Project Management
3. Object Oriented Analysis and Design
4. Advanced Unix Programming
5. Advanced Computer Architecture
6 20GE5M01 Professional Ethics and Human Values 2 0 0 0 ---- --- ---
PRACTICAL
7 20CS5L01 Computer Networks Lab 0 0 3 1.5 15 35 50
8 20IT5L02 Unix Operating Systems Lab 0 0 3 1.5 15 35 50
9 20CS5S01 Skill Oriented CourseIII/Soft Skill Course 1 0 2 2.0 15 35 50
Summer Internship 2 Months
10 (Mandatory) after second year (to be 0 0 0 1.5 --- 50 50
evaluated during V semester)
Total Credits 21.5 195 505 700
11 Honor/Minor Courses 3 1 0 4 30 70 100

Theory: PCC-4, OE-1, HSMS-1 Practical: PCC-2, SC-1

SEMESTER -VI
S.No Code Course Title L T P C IM EM TM
THEORY
1 20CS6T01 Cryptography and Network Security 3 0 0 3 30 70 100
2 20CS6T02 Compiler Design 3 0 0 3 30 70 100
3 20CS6T03 Artificial Intelligence 3 0 0 3 30 70 100
4 20EC6OXX Open Elective-II 3 0 0 3 30 70 100
5 20CS6EXX Professional Elective - II 3 0 0 3 30 70 100
1. Cloud Computing
2. Big Data Analytics
3. Machine Learning
4. Network Programming
5. Internet of Things
Page | 3
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER -V
Course Code Course Name L T P C
20CS5T01 COMPUTER NETWORKS 3 0 0 3

Course Objectives:
The main objectives are
• Study the basic taxonomy and terminology of the computer networking and enumerate the
layers of OSI model and TCP/IP model
• Study data link layer concepts, design issues, and protocols
• Gain core knowledge of Network layer routing protocols and IP addressing
• Study Session layer design issues, Transport layer services, and protocols
• Acquire knowledge of Application layer and Presentation layer paradigms and protocols
Course Outcomes:
At the end of the course, the students will be able to:
CO-1: Illustrate the OSI and TCP/IP reference model
CO-2: Analyze MAC layer protocols and LAN technologies
CO-3: Summarize various Routing algorithms and Congestion control principles.
CO-4: Describe Transport layer protocols.
CO-5: Develop application layer protocols

UNIT I
Introduction: History and development of computer networks, Basic Network Architectures: OSI
reference model, TCP/IP reference model, and Networks topologies, types of networks (LAN,
MAN, WAN)
Physical layer: Different types of transmission media Guided and unguided, Multiplexing
methods : TDM, FDM

UNIT II
Data Link Layer: Design Issues and services: framing, error control, flow control, medium access
control. Error & Flow control mechanisms: sliding window protocols: stop and wait, Go back N
and selective repeat.
MAC Sub Layer: MAC protocols: Aloha, slotted aloha, CSMA, CSMA/CD, CSMA/CA, polling, token
passing, scheduling.

UNIT III
Network Layer: Network Layer Services, packet switching, Network Layer Performance, IPv4
addresses, Forwarding of IP packets, Internet Protocol (IP), IPv6 Protocol and addressing,
Transition from IPv4 to IPv6, Mobile IP.
Routing Algorithms: Least Cost Routing, Distance vector Routing, Link- State Routing, and
Hierarchical Routing.
Congestion control: Approaches to Congestion Control, Traffic-Aware Routing, Traffic

Page | 8
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

Throttling, Load shedding, traffic shaping.

Internet Control Protocols: ARP, RARP, ICMP and DHCP.

UNIT IV
Transport Layer: The Transport Service-Services Provided to the Upper Layers, Transport
Service Primitives, Elements of Transport Protocols –Addressing, Connection Establishment,
Connection Release, Error Control and Flow Control, Congestion control-Desirable Bandwidth
allocation, Regulating the sending rate, The Internet Transport Protocols: Introduction to UDP,
Remote procedure call, Real-Time transport protocols, Introduction to TCP, The TCP Service
Model, The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP
Connection Release, SCTP.

UNIT V
Application Layer: Domain Name Space (DNS), SNMP, Electronic mail: MIME,SMTP, IMAP, WWW,
FTP, HTTP

Text Books:
1) Computer Networks, Andrew S. Tanenbaum, David J. Wetherall, Pearson Education India;
5th Edition, 2013
2) Data Communication and Networking, Behrouz A. Forouzan, McGraw Hill, 5th Edition, 2012

Reference Books:
1) Computer Networks: A Systems Approach, LL Peterson, BS Davie, Morgan-Kauffman, 5th
Edition, 2011.
2) Computer Networking: A Top-Down Approach JF Kurose, KW Ross, Addison-Wesley, 5th
Edition, 2009
3) Data and Computer Communications, William Stallings, Pearson, 8th Edition, 2007

E-Resources:

1)https://nptel.ac.in/courses/106/105/106105183/

Page | 9
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER -V
Course Code Course Name L T P C
20IT5T02 DESIGN AND ANALYSIS OF ALGORITHMS 3 0 0 3

Course Objectives:
• To provide an introduction to formalisms to understand, analyze and denote time complexities
of algorithms
• To introduce the different algorithmic approaches for problem solving through numerous
example problems
• To provide some theoretical grounding in terms of finding the lower bounds of algorithms and
the NP-completeness

Course Outcomes:
At the end of the course, the students will be able to:
CO-1: Describe asymptotic notation used for analyze the performance of algorithms, denote its
time complexity, apply sets and graph search algorithms to real world problems
CO-2: Solve problems using divide and conquer and greedy method algorithmic approaches
CO-3: Solve problems using dynamic programming algorithmic approaches
CO-4: Solve problems using backtracking and branch and bound algorithmic approaches
CO-5: Demonstrate an understanding of NP- Completeness theory and string matching

UNIT-I
Introduction: Algorithm Definition, Algorithm Specification, Pseudo code for expressing
algorithm, performance Analysis, asymptotic notation.
Sets & Disjoint set union: introduction, union and find operations.
Basic Traversal & Search Techniques: Techniques for Graphs, connected components and
Spanning Trees, Bi-connected components and DFS.

UNIT-II
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the
maximum and minimum, Merge sort, Quick sort.
The Greedy Method: The general Method, container loading, knapsack problem, Job sequencing
with deadlines, minimum-cost spanning Trees.

UNIT-III
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths, single-
source shortest paths: general weights, optimal Binary search trees, 0/1 knapsack, reliability
Design, The traveling salesperson problem

UNIT-IV
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring,

Page | 10
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

Hamiltonian cycles
Branch and Bound: FIFO Branch-and-Bound, LC Branch-and-Bound, 0/1 Knapsack problem,
Traveling salesperson problem.

UNIT-V
NP-Hard and NP-Complete problems: Basic concepts, Cook’s Theorem.
String Matching: Introduction, String Matching-Meaning and Application, Naive String Matching
Algorithm, Rabin-Karp Algorithm, Knuth-Morris-Pratt Automata.

Text Books:
1) Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, 2nd Edition, Universities Press.
2) Harsh Bhasin, “Algorithms Design & Analysis”, Oxford University Press.

Reference Books:
1) Horowitz E. Sahani S: “Fundamentals of Computer Algorithms”, 2nd Edition, Galgotia
Publications, 2008.
2) S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press.

E-Resources:

1)http://nptel.ac.in/courses/106101060/

Page | 11
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER -V
Course Code Course Name L T P C
20IT5T01 OPERATING SYSTEMS 3 0 0 3

Course Objectives:
The objectives of this course are to
• Introduce to the internal operation of modern operating systems
• Define, explain, processes and threads, mutual exclusion, CPU scheduling, deadlock, memory
management, and file systems
• Understand File Systems in Operating System like UNIX/Linux and Windows
• Understand Input Output Management and use of Device Driver and Secondary Storage (Disk)
Mechanism
• Analyze Security and Protection Mechanism in Operating System

Course Outcomes:
At the end of the course, the students will be able to:
CO-1: Describe various generations of Operating System and functions of Operating System
CO-2: Describe the concept of program, process and thread and analyze various CPU Scheduling
Algorithms and compare their performance
CO-3: Solve Inter Process Communication problems using Mathematical Equations by various
methods
CO-4: Compare various Memory Management Schemes especially paging and Segmentation in
Operating System and apply various Page Replacement Techniques
CO-5: Outline File Systems in Operating System like UNIX/Linux and Windows

UNIT I
Operating Systems Overview: Operating system functions, Operating system structure,
Operating systems operations, Open-Source Operating Systems.
System Structures: Operating System Services, User and Operating-System Interface, systems
calls, Types of System Calls.

UNIT II
Process Concept: Process scheduling, Operations on processes, Inter-process communication.
Multithreaded Programming: Multithreading models, Thread libraries, threading issues. Process
Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Thread scheduling.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Classical IPC
Problems - Dining philosopher’s problem.

UNIT III
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation,

Page | 12
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

Paging, Segmentation.
Virtual Memory Management: Introduction, Demand paging, Page replacement Algorithms.

UNIT IV
Deadlocks: Resources, Conditions for resource deadlocks, Deadlock detection and recovery,
Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling.

UNIT V
System Protection: Goals of protection, Principles and domain of protection, Access control.
System Security: Introduction, Program threats, System and network threats, Cryptography for
security, User authentication, implementing security defenses, Firewalling to protect systems and
networks.
Case Studies: Linux, Microsoft Windows.

Text Books:
1) Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley, 2013.
2) Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008. (for Inter
process Communication and File systems.)

Reference Books:
1) Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-Hill,
2012.
2) Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
Education, 2009
3) Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004.

E-Resources:
1)https://nptel.ac.in/courses/106/105/106105214/

Page | 13
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

Course Code Course Name L T P C

PROFESSIONAL ELECTIVE-I 3 0 0 3
20CS5E01
1. DATA WAREHOUSING AND DATA MINING

Course Objectives:
• To understand data warehouse concepts, architecture, business analysis and tools
• To understand data pre-processing and data visualization techniques
• To study algorithms for finding hidden and interesting patterns in data
• To understand and apply various classification and clustering techniques using tools

Course Outcomes:
At the end of the course, the students will be able to:
CO-1: Design a Data warehouse system and perform business analysis with OLAP tools
CO-2: Apply suitable pre-processing and visualization techniques for data analysis
CO-3: Apply frequent pattern and association rule mining techniques for data analysis
CO-4: Apply appropriate classification techniques for data analysis
CO-5: Apply appropriate clustering techniques for data analysis.

UNIT I
Data Warehousing, Business Analysis and On-Line Analytical Processing (OLAP): Basic
Concepts, Data Warehousing Components, Building a Data Warehouse, Database Architectures for
Parallel Processing, Parallel DBMS Vendors, Multidimensional Data Model, Data Warehouse
Schemas for Decision Support, Concept Hierarchies, Characteristics of OLAP Systems, Typical
OLAP Operations, OLAP and OLTP.

UNIT II
Data Mining – Introduction: Introduction to Data Mining Systems, Knowledge Discovery
Process, Data Mining Techniques, Issues, applications, Data Objects and attribute types, Statistical
description of data, Data Preprocessing – Cleaning, Integration, Reduction, Transformation and
discretization, Data Visualization, Data similarity and dissimilarity measures.

UNIT III
Data Mining - Frequent Pattern Analysis: Mining Frequent Patterns, Associations and
Correlations, Mining Methods, Pattern Evaluation Method, Pattern Mining in Multilevel, Multi-
Dimensional Space – Constraint Based Frequent Pattern Mining, Classification using Frequent
Patterns.

UNIT IV
Classification: Decision Tree Induction, Bayesian Classification, Rule Based Classification,
Classification by Back Propagation, Support Vector Machines, Lazy Learners, Model Evaluation
and Selection, Techniques to improve Classification Accuracy.

Page | 14
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

UNIT V
Clustering: Clustering Techniques, Cluster analysis, Partitioning Methods, Hierarchical methods,
Density Based Methods, Grid Based Methods, Evaluation of clustering, Clustering high
dimensional data, Clustering with constraints, Outlier analysis, outlier detection methods.

Text Books:
1) Jiawei Han and MichelineKamber, “Data Mining Concepts and Techniques”, Third Edition,
Elsevier, 2012.
2) Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to Data Mining, Pearson,
2016.

Reference Books:
1) Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata McGraw –
Hill Edition, 35th Reprint 2016.
2) K.P. Soman, ShyamDiwakar and V. Ajay, ―Insight into Data Mining Theory and Practice‖,
Eastern Economy Edition, Prentice Hall of India, 2006.
3) Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and Techniques,
Elsevier, Second Edition.

E-Resources:
1) https://www.saedsayad.com/data_mining_map.htm
2) https://nptel.ac.in/courses/106/105/106105174/
3) (NPTEL course by Prof.PabitraMitra) http://onlinecourses.nptel.ac.in/noc17_mg24/preview
4) (NPTEL course by Dr. Nandan Sudarshanam) http://www.saedsayad.com/

Page | 15
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER -V
Course Code Course Name L T P C
Employability skills-I 2 0 0 0
20GE5M01
Professional Ethics and Human Values
Course Objectives:
 To give basic insights and inputs to the student to inculcate Human values to growas
a responsible human being with proper personality.
 Professional Ethics instills the student to maintain ethical conduct and dischargetheir
professional duties.
COURSE OUTCOMES:
At the end of the course, the students will be able to:
CO 1: Student can be able to Define, Civic Values, Ethics, Behavior, Honesty, Co-
Operation& Commitment
CO 2: Student can be able to Discuss Engineering Ethics and Social Experimentation for
the benefit of stakeholders
CO 3: Analyze the responsibilities of Engineers towards Safety & risk, to improve the
Safety and minimize the risk.
CO 4: Present the duties & rights of Engineers
CO 5: Elucidate the role of Engineers in the ever changing the global Marketing

UNIT I:
Human Values & Principles for Harmony: Morals, Values and Ethics – Integrity -
Work Ethics – Service Learning – Civic Virtue – Respect for others – Living Peacefully –
Caring – Sharing – Honesty –Courage – Value Time – Co-operation – Commitment–Self-
confidence – Spirituality- Character. Truthfulness – Customs and Traditions -Value
Education –Human Rights – Fundamental Duties - Aspirations and Harmony (I, We &
Nature) – Gender Bias - Emotional Intelligence.

UNIT II:
Engineering Ethics and Social Experimentation:
History of Ethics - Need of Engineering Ethics - Senses of Engineering Ethics- Profession
and Professionalism ––Self Interest - Moral Autonomy – Utilitarianism – Virtue Theory
- Uses of Ethical Theories - Deontology- Types of Inquiry –Kohlberg’s Theory - Gilligan’s
Argument –Heinz’s Dilemma - Comparison with Standard Experiments –– Learning
from the Past –Engineers as Managers – Consultants and Leaders – Balanced Outlook on
Law - Role of Codes – Codes and Experimental Nature of Engineering.

UNIT III:
Engineers’ Responsibilities towards Safety and Risk:
Concept of Safety - Safety and Risk – Types of Risks – Voluntary v/s Involuntary Risk –

Page | 24
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

Consequences - Risk Assessment – Accountability – Liability - Reversible Effects -

Threshold Levels of Risk - Delayed v/s Immediate Risk - Safety and the Engineer –
Designing for Safety – Risk-Benefit Analysis-Accidents.

UNIT IV:
Engineers’ Duties and Rights:
Concept of Duty - Professional Duties – Collegiality - Techniques for Achieving
Collegiality - Professional and Individual Rights –Confidential and Proprietary
Information - Conflict of Interest-Ethical egoism - Collective Bargaining – Confidentiality
- Gifts and Bribes - Problem solving- Occupational Crimes- Industrial Espionage- Price
Fixing-Whistle Blowing.

UNIT V:
Global Issues:
Globalization and MNCs –Cross Culture Issues - Business Ethics – Media Ethics -
Environmental Ethics – Endangering Lives - Bio Ethics - Computer Ethics - War Ethics –
Research Ethics -Intellectual Property Rights.

Text Books:
1. Professional Ethics, R. Subramaniam – Oxford Publications, New Delhi.
2. Professional Ethics and Morals, A. R. Aryasri, Dharanikota Suyodhana – Maruthi
Publications.

References:
1. Engineering Ethics, Harris, Pritchard and Rabins, Cengage Learning, New Delhi.
2. Engineering Ethics & Human Values, M. Govindarajan, S. Natarajan and V. S.
SenthilKumar- PHI Learning Pvt. Ltd – 2009.
3. Professional Ethics and Human Values, A. Alavudeen, R.Kalil Rahman and M.
Jayakumaran – University Science Press.
4. Professional Ethics and Human Values, D. R. Kiran-Tata McGraw-Hill – 2013

E-Resources:
1. https://nptel.ac.in/courses/109106117

Page | 25
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER- V
Course Code Course Name L T P C
20CS5L01 COMPUTER NETWORKS LAB 0 0 3 1.5
Course Objectives:
• Understand and apply different network commands
• Analyze different networking functions and features for implementing optimal
solutions Apply different networking concepts for implementing network solution
• Implement different network protocols
Course Outcomes:
At the end of the course, the students will be able to:
CO-1: Apply the basics of Physical layer in real time applications
CO-2: Apply data link layer concepts, design issues, and protocols
CO-3: Apply Network layer routing protocols and IP addressing
CO-4: Implement the functions of Application layer paradigms and protocols
CO-5: Implement the functions of Presentation layer paradigms and Protocols

Experiments:
1) Implement the data link layer framing methods such as character stuffing and bit
stuffing.
2) Write a C program to develop a DNS client server to resolve the given hostname.
3) Implement on a data set of characters the three CRC polynomials – CRC-12, CRC-16
and CRC-CCIP.
4) Implement Dijkstra’s algorithm to compute the Shortest path in a graph.
5) Take an example subnet graph with weights indicating delay between nodes. Now
obtain Routing table art each node using distance vector routing algorithm
6) Take an example subnet of hosts. Obtain broadcast tree for it.
7) Write a client-server application for chat using UDP
8) Implement programs using raw sockets (like packet capturing and filtering)
9) Write a C program to perform sliding window protocol.
10) Get the MAC or Physical address of the system using Address Resolution Protocol.
11) Simulate the Implementing Routing Protocols using border gateway protocol(BGP)
12) Simulate the OPEN SHORTEST PATH FIRST routing protocol based on the cost
assigned to the path.

Page | 26
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

SEMESTER- V
Course Code Course Name L T P C
20IT5L02 UNIX OPERATING SYSTEM LAB 0 0 3 1.5

Course Objectives:
• To understand the design aspects of operating system
• To study the process management concepts & Techniques
• To study the storage management concepts
• To familiarize students with the Linux environment
• To learn the fundamentals of shell scripting/programming

Course Outcomes:
At the end of the course, the students will be able to:
CO-1: To use UNIX utilities and perform basic shell control of the utilities
CO-2: To use the UNIX file system and file access control
CO-3: To use of an operating system to develop software
CO-4: Students will be able to use Linux environment efficiently
CO-5: Solve problems using bash for shell scripting

1) a) Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps,
ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd,
cal, logout, shutdown.
b) Study of vi editor
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system
d) Study of Unix/Linux files system (tree structure)
e) Study of .bashrc, /etc/bashrc and Environment variables.

2) Write a C program that makes a copy of a file using standard I/O, and system calls

3) Write a C program to emulate the UNIX ls –l command.

4) Write a C program that illustrates how to execute two commands concurrently with
a command pipe. Ex: - ls –l | sort

5) Simulate the following CPU scheduling algorithms:

(a) Round Robin (b) SJF (c) FCFS (d) Priority

6) Multiprogramming-Memory management-Implementation of fork (), wait (), exec()

and exit (), System calls

Page | 27
CSE R20
KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCE(AUTONOMOUS)
Department of Computer Science and Engineering

7) Simulate the following:

a) Multiprogramming with a fixed number of tasks (MFT)
b) Multiprogramming with a variable number of tasks (MVT)

8) Simulate Bankers Algorithm for Dead Lock Avoidance

9) Simulate Bankers Algorithm for Dead Lock Prevention.

10) Simulate the following page replacement algorithms:

a) FIFO b) LRU c) LFU

11) Simulate the following File allocation strategies

(a) Sequenced (b) Indexed (c) Linked

12) Write a C program that illustrates two processes communicating using shared
memory

13) Write a C program to simulate producer and consumer problem using semaphores

14) Write C program to create a thread using pthreads library and let it run its
function

Page | 28