Diploma Engineering

Semester IV

CE,IT,AIML,Cloud Computing &

Big Data,Gaming & Animation
 An Overview of Major Computer & Technology Disciplines

Computer Engineering is a branch of engineering

that integrates several fields of computer science and
electronic engineering required to develop computer
hardware and software. Computer engineers design,
test, implement and maintain computer software and
hardware systems.

Information Technology (IT) is the use of computers

to store or retrieve data and information. IT is typically
used within the context of business operations as
opposed to personal or entertainment technologies.
You can find IT specialization in every branch of
education, from IT & Software, Engineering, Aviation
and Medicine to MBA and even Hospitality.

Artificial Intelligence (AI) is intelligence

demonstrated by machines, as opposed to the natural
intelligence displayed by humans or animals. AI
applications include advanced web search engines,
recommendation systems used by YouTube, Amazon
and Netflix, Siri or Alexa, Tesla, and strategic game
systems (such as chess and Go).

Cloud Computing & Big Data is the on-demand

availability of computer system resources, especially
data storage (cloud storage) and computing power,
without direct active management by the user. Big data
is a field that treats ways to analyze, systematically
extract information from, or otherwise, deal with data
sets that are too large or complex to be dealt with by
traditional data-processing application software.

Gaming & Animation is the process of

developing/designing a game. The effort is
undertaken by a developer, ranging from a single
person to an international team dispersed across the
globe. Animation is a method in which figures are
manipulated to appear as moving images. Various
tools available in the market today, ease out the tasks
of game development and animation.
 Disclaimer
This handbook is compiled to provide subject information to the students. Every
effort has been made to avoid errors & omissions and ensure accuracy. Any error
noted may be brought to the notice of the compiler, which shall be taken care of in
the updated edition of this handbook. The sources of information/material are
provided in the appendix.
The information contained in this handbook is strictly for education and learning
purposes and not for any commercial use.
Furthermore, The University reserves the right to unilaterally and without notice
make changes to this handbook at any time.
Evaluation Methodology
Theory Marks
PA: Progressive Assessment
Units’ examinations will be conducted during the semester. Each unit examination is
compulsory. Unit examination may be taken from objectives, short questions, long questions,
etc.
Unit-1 Exam: Maximum Marks 10
Unit-2 Exam: Maximum Marks 10
Unit-3 Exam: Maximum Marks 10
Unit-4 Exam: Maximum Marks 10

Total Marks 40

ESE: End Semester Exam

End semester examination will be conducted from all Five (5) units and it is compulsory. It may
be taken in the form of objectives, short questions, long questions etc.

End Semester Exam: Maximum Marks 50

CA: Continuous Assessment

Continuous assessment will be evaluated from the activity assigned in the semester and the
attendance of that particular subject.

Activity Assessment / Attendance: Maximum Marks 10

Practical Marks
PV: Practical Viva
Practical viva will be conducted through group task. Thereafter viva will be conducted
individually based on the given task of the concerned subject.

Practical Viva: Maximum Marks 20

TW: Term Work

Term work will be considered from the assignment and laboratory work done by the student
during the semester of that particular subject.

Term Work: Maximum Marks 30

 EVALUATION SCHEME

The performance of students is evaluated on the basis of continuous and semester-end

examinations with letter grades O+++, O++, A++, B, etc. Which have numerical equivalents called
grade points as indicated below:

Percentage Grade Point Grade Class

95 100 10 O+++
90 94 9.5 O++
85 89 9 O+ First Class with
80 84 8.5 O Distinction
75 79 8 A++
70 74 7.5 A+
65 69 7 A
First Class
60 64 6.5 B++
55 59 6 B+ Higher Second Class
50 54 5.5 B
45 49 5 C Second Class

ic
40 44 4.5 D
35 39 4.0 E Pass Class
less than 35 0 F Fail

hn
The performance of a student in a semester is indicated by a number called SPI (Semester
Performance Index). The SPI is the weighted average of the grade points obtained in all the subjects
taken by the student during the semester. Example: Suppose in a given semester a student has taken
ec
subjects having credits C1, C2, C3, C4, C5..... And the numerical equivalent of grades obtained in
those subjects are G1, G2, G3, G4, and G5 respectively.
yt
Grade Points Earned ∑𝑛
𝑖=1 𝐶𝑖 𝐺𝑖
Then his/her SPI = Total Offered Credits = ∑𝑛
𝑖=1 𝐶𝑖

SPI will be calculated (after re-examination, if any) up to two decimal places on the basis of the final
ol

grades.
An overall assessment from the time the student entered the course is obtained by calculating PPI
P

(Progressive Performance Index). The PPI is the weighted average of the grade points obtained in
all the subjects taken by the student since he/she entered the course. It is calculated in the same
manner as the SPI. The CGPA (Cumulative Grade Points Average) is the weighted average of the
LJ

grade points obtained in all the subjects in the last six semesters of the course.
Detention:
Formula for conversion of equivalent percentage of PPI
An equation to find equivalence between PPI or CGPA may be obtained as follows:
Percentage Marks = (PPI or CGPA — 0.5) x 10. SPI or PPI or CGPA equivalent class shall be as
follows:
Below 4.00 : Fail
4.00 – 4.49 : Pass Class
4.50 – 5.50 : Second Class
5.51 – 6.00 : Higher Second Class
6.01 – 7.49 : Firsrt Class
7.50 and above : First Class with Distinction

For all courses, where the duration of the course is more than 2 years, the degree shall be awarded
to the students on the basis of CGPA of the last six semester's performance in the exams.

In case of the courses where duration is of two years, the degree shall be awarded to students based
on PPI considering the performance in all four semesters.
About Bloom’s Taxonomy
Bloom’s Taxonomy is a classification of the different objectives and skills that educators set for
their students (learning objectives). The taxonomy was proposed in 1956 by Benjamin Bloom, an
educational psychologist at the University of Chicago. The terminology has been recently updated
to include the following six levels of learning. These 6 levels can be used to structure the learning
objectives, lessons, and assessments of your course.
1. Remembering: Retrieving, recognizing, and recalling relevant knowledge from long‐term
memory.
2. Understanding: Constructing meaning from oral, written, and graphic messages through
interpreting, exemplifying, classifying, summarizing, inferring, comparing, and explaining.
3. Applying: Carrying out or using a procedure for executing, or implementing.
4. Analyzing: Breaking material into constituent parts, determining how the parts relate to one
another and to an overall structure or purpose through differentiating, organizing, and
attributing.
5. Evaluating: Making judgments based on criteria and standards through checking and
critiquing.
6. Creating: Putting elements together to form a coherent or functional whole; reorganizing
elements into a new pattern or structure through generating, planning, or producing.
ADVANCED DATABASE MANAGEMENT SYSTEM

ADVANCED DATABASE
MANAGEMENT SYSTEM

Prepared and Compiled by

CE & IT Department

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

Course
Course Name Advanced Database Management System
Course Type HSSC BSC ESC PCC OEC PEC
Legends: HSSC: Humanities and Social Sciences Courses
BSC: Basic Science Courses
ESC: Engineering Science Courses
PCC: Program Core Courses
OEC: Open Elective Courses
PEC: Program Elective Courses

Teaching and Evaluation Scheme

Evaluation Scheme
Teaching Hours / Week
Theory Marks Practical Marks
Theory
Total Marks
L T P ESE CA PA Total PV TW Total
Credit
3 - 4 5 50 10 40 100 20 30 50 150

Legends: ESE: End Semester Exam

CA: Continuous Assessment (Attendance + Activity)
PA: Progressive Assessment
PV: Practical Viva
TW: Term Work

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

Contents

%
Unit Learning
Topics Sub-Topics Weight Hours
No. Outcomes
age
• Basics of
Function
Dependency(
FD)

• Fully
Function
Dependency(
FFD)
1.1. Introduction
1.2. Functional • Armstrong’s
Function
Dependency Axioms for
Dependency
1.3. Fully Function
1 and 10 6
Functional Dependency
Decompositi
Dependency
on
1.4. Decomposition • Redudant
and its types functional
dependencies

• Concept of
Decompositi
on and types
of
Decompositi
on
• Normalizatio
n

• Various types
2.1.Introduction of Normal
2.2.Normalization Forms
2.3.Types of Normal i.1st Normal
Normalizati
2 Forms Form 10 6
on
2.4.Solve Problems ii.2nd Normal
of Normalization Form
iii.3rd Normal
Form
iv.Boyce-
codd Normal
Form
3.1.Introduction • Transaction
Advanced 3.2.Transaction Control
3 30 10
SQL Control Language
Language (TCL) Commands:C

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

3.3.Data Control ommit,Rollba

Language(DCL) ck,Savepoint
3.4.Types of Locks
3.5.Database • Data Control
Objects:View,Se Language
quence, Commands:
Index,Synonym Grant,Revoke

• Types of
Locks:Implic
it
Lock,Explicit
Lock,
Rowlevel
Lock, Table
level Lock

• View

• Sequence

• Index

• Synonym
• Basics of
PL/SQL

• Datatype

• Merits of
PL/SQL

• Control
4.1. Introduction
Structure:
4.2. Datatype
Conditional,
4.3. Control
Iterative,
Structures
Sequential
PL/SQL 4.4. Exception
4 30 12
Concept 4.5. Cursor
• Exception
4.6. Trigger
and its types
4.7. Package
4.8. Procedure and
Function • Cursor and its
types

• Trigger and
its types

• Package
Specification,
Package
Body,

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

Advantages
of Package

• Procedure:
Stored
Procedure vs
Function
• Concept of
Transaction

• Transaction
Properties

• Concurrency
Control
5.1.Introduction
5.2.Concurrency
Transaction Control • Deadlock
5 20 8
Processing 5.3.Methods of
Concurrency • Methods of
Control Concurrency
Control:
i.Locking
method
ii.Time-
Stamp
method
iii.Optimistic
method

Total Hours 42

Suggested Specification Table with Hours

Distribution of Topics
According to Bloom’s
Unit Teaching
Chapter Name Taxonomy
No. Hours
R U App C E An
% % % % % %
Function Dependency and
1 6 25 40 20 0 10 5
Decomposition
2 Normalization 6 20 25 30 10 10 5
3 Advanced SQL 10 20 25 40 10 5 -
4 PL/SQL Concept 12 20 25 40 5 5 5
5 Transaction Processing 8 30 30 20 10 5 5

Legends: R: Remembering U: Understanding

App: Applying C: Creating
E: Evaluating An: Analyzing

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

Textbooks
1. Database System Concept,Design and Applications by S.K.Singh,Pearson Education
SQL-PL/SQL by Ivan Baryons,Bbp Publication

Reference Books
1. An introduction to database systems by C.J date, Addison Welsley
2. Database System Concepts, Silberschatz, Korth and Sudarshan, McGraw Hill
3. Oracle 11g: Complete reference, Kevin Loney, McGraw Hill.
4. Mastering SQL, Martin Gruber, B.P.B.

Open Sources (Website, Video, Movie)

1. https://www.coursera.org/learn/database-management
2. https://www.sqlcourse.com/
3. https://www.tutorialspoint.com/dbms/index.htm
4. https://nptel.ac.in/courses/106/106/106106220/

LJ Polytechnic
ADVANCED DATABASE MANAGEMENT SYSTEM

Introduction
Computer engineers have to write programs to cater to various IT solutions. To develop a
program, they have to build logic, develop SQL and PL/SQL programs. This course has been
designed keeping in view of developing these skills. Besides its use to write codes for SQL
programming such as developing a banking system, railway reservation system and so on.
Database Management System has been widely used as a general-purpose language to develop
basic applications. This course deals with fundamental syntactic information about database
and SQL and PL/SQL programming that will help students to apply the basic concepts,
program structure of SQL and PL/SQL programming paradigm to build given application.

Objectives
✓ This course aims to help the students to attain the following industry-identified competency
through various teaching-learning experiences.
✓ Designing and Implementation of relational database management system.
✓ Development of programming & coding ability using ‘SQL’ and ‘PL/SQL’.

Subject’s Learning Outcomes

This course aims to the concepts of relational database management system, SQL and PL/SQL
programming. The special track is organized as a series of lectures and exercises using the SQL
and PL/SQL. It also focuses on discussing how to write a program of moderate complexity by
using SQL and PL/SQL. Students will enhance the ability to design, develop, analyzes, and
interprets different concepts of Function Dependency, Normalization, Advanced Structured
Query Language, PL/SQL, and Transaction Processing. The students will also develop the
skills to design advanced database system and develop application programs to manage &
retrieve data from different perspective using Structured Query Language (SQL) and PL/SQL
in ORACLE.

LJ Polytechnic
 Function Dependency and Decomposition Unit-1

Function Dependency
and
Decomposition
Short Questions

Q. Sample Questions Bloom’s

No. Taxonomy
1. What is Function Dependency? Understand
2. What is Full Function Dependency? Understand
3. Define: Prime Attributes Remember
4. Define: Non-Prime Attributes Remember
5. What is Trivial Function Dependency? Understand
6. What is Non-Trivial Function Dependency? Understand
7. Define: Decomposition. Remember
8. List types of Decomposition. Remember
9. Write Reflexivity rule of Armstrong’s Axioms of Function Remember
Dependency.
10. Write Augmentation rule of Armstrong’s Axioms of Function Remember
Dependency.

Long Questions

Q. Sample Questions Bloom’s

No. Taxonomy
1. Explain Function Dependency with example. Remember
2. Explain Full Function Dependency with example. Remember
3. List rules of Armstrong’s Axioms for Function Dependency. Remember
Explain any one of them.
4. Differentiate FD and FFD. Remember
5. Explain Decomposition with its types. Understand

Essential Assignments
1. Differentiate Trivial Dependency and Non-Trivial Dependency.
2. Define Function Dependency and explain related example of it.
3. Define Full Function Dependency and explain related example of it.
4. Explain Rules of Armstrong’s Axioms for Function Dependency.
5. Explain Lossy Decomposition with example.

LJ Polytechnic
Advanced Database Management System

6. Explain Lossless Decomposition with example.

Activities

1. Consider following relation Student (Id,Name,Address,Class,Contact_no,Course_id)

and decompose the relation and bifurcate into various types of Decomposition.
2. Consider following relation Course (Course_id,Course_name,Student_id) and show
function dependency in above relation also check full function dependency is present
or not.

Learning Outcomes

❖ Concept of Function Dependency and Full Function Dependency will be learnt.

❖ Fundamental rules of Armstrong’s Axioms for Function Dependency will be
understood.
❖ Basic concept of Decomposition in Function Dependency and its types will be learnt.

LJ Polytechnic
 Normalization Unit-2

Normalization

Short Questions

Q. Bloom’s
Sample Questions
No. Taxonomy
1. Define Normalization. Remember
2. What is Normal Form? Understand
3. What is an Anomalies? Understand
4. List different types of Normal Forms. Remember
5. Write goal of Normalization. Remember
6. List out criteria of 1st Normal Form. Understand
7. List out criteria of 2nd Normal Form. Remember
8. List out criteria of 3rd Normal Form. Remember
9. What do you mean by Transitively dependent for Function Remember
Dependency?
10. Differentiate Transitive dependency and Non-Transitive Remember
dependency.

Long Questions

Q. Bloom’s
Sample Questions
No. Taxonomy
1. What do you mean by Normalization? List types of various Understand
Normal Forms.
2. Explain criteria of 1st Normal Form with related real time Understand
scenario.
3. Explain criteria of 2nd Normal Form with related real time Understand
scenario.
4. Explain criteria of 3rd Normal Form with related real time Understand
scenario.
5. Differentiate 1st Normal Form and 2nd Normal Form. Understand

LJ Polytechnic
Advanced Database Management System

Essential Assignments

1. Write a short note on Normalization.

2. Explain 1st Normal Form with example.
3. Explain 2nd Normal Form with example.
4. Explain 3rd Normal Form with example.

Activities

1. Consider a following relation

Project(Project_code,Project_name,Project_Manager,Project_Budget,Employee_No,E
mployee_Name,Dept_No,Dept_Name,Hourly_rate) and bifurcate into various types of
Normalization such as 1st Normal Form,2nd Normal Form, 3rd Normal Form. Students
can make a ppt for the same.

Learning Outcomes

❖ Basic concepts of Normal Form and Normalization will be understood.

❖ Criteria of various types of Normal Forms will be learnt.
❖ Problem solving methods through Normalization at certain level will be learnt.

LJ Polytechnic
Advanced Structured Query Language Unit-3

Advanced
Structured
Query Language
Practical List

1. Implement SQL queries to perform Data Control Language (DCL)

Commands.
2. Implement SQL queries to perform Transaction Control Language (TCL)
Commands.
3. Execute SQL queries to various operations of View.
4. Execute SQL queries to various operations of Sequence.
5. Execute SQL queries to various operations of Index.
6. Execute SQL queries to various operations of Synonym.
ss
Short Questions

Q. Sample Questions Bloom’s

No. Taxonomy
1. List TCL commands. Remember
2. List DCL commands. Remember
3. TCL stands for____________. Remember
4. DCL stands for____________. Remember
5. Define Sequence? Evaluate
6. Define Synonym. Remember
7. List out different types of Index. Remember
8. What is a View? Understand
9. What is an Index. Understand
10. Write a syntax of GRANT command. Remember
11. Write a syntax of REVOKE command. Remember
12. Write a syntax to create and destroy a Sequence. Remember
13. Write a syntax to create and destroy an Index. Remember
14. Write a syntax to create and destroy a Synonym. Remember

LJ Polytechnic
Advanced Database Management System

Long Questions

Q. Sample Questions Bloom’s

No. Taxonomy
1. Explain TCL commands with example. Apply

2. Explain DCL commands with example. Apply

3. Write a short note on View. Apply

4. Write a short note on Sequence. Apply

5. Explain Index with its different types. Apply

6. Explain ROWID with example. Apply

7. Explain Synonym with example. Evaluate

Essential Assignments

1. Write short note on TCL and DCL commands.

2. Explain View and mention advantage of it.
3. Explain Sequence and NEXTVAL, CURRVAL with example.
4. Explain Index with example.
5. Write a short note on Synonym.

Desirable Assignments
Activities
1. Develop a program to create view from multiple tables.
2. Develop a program to create sequence from 1 to 100 and accordingly enter such records
of students using NEXTVAL.
3. Develop a program to create an Index and apply ROWID and display it with such
columns.
4. Develop a program to an alias name of particular database object.

Activities

1. Consider two users named ‘user1’ and ‘user2’. ‘user1’ is the owner of employee table
which have following structure. Employee (empno, ename, salary, deptno)
SQL queries are following:
• user1 gives permissions for insert, update, delete and select privileges to user2 with
further grant option.
• User1 take away the permissions for insert and select privileges from user2.

LJ Polytechnic
Advanced Structured Query Language Unit-3

Learning Outcomes

❖ Basic concepts of TCL and DCL commands will be learnt.

❖ Concept of various types of View will be learnt and program could be developed for
the same.
❖ Concept of Sequence will be learnt and developed programs of SQL functions.
❖ Concept of Synonym and Index will be learnt and various types of SQL constraints
programs could be developed.

LJ Polytechnic
 PL/SQL Concept Unit-4

PL/SQL Concept

Practical List

1. Implement various types of Control Structure using PL/SQL.

2. Implement Exception handling using PL/SQL.
3. Implement PL/SQL program using Cursor.
4. Implement PL/SQL program using Trigger.
5. Implement Procedure and Functions using PL/SQL.

Short Questions
Bloom’s
Q. Sample Questions Taxonomy
No.
1. List advantages of PL/SQL. Remember
2. List datatypes of PL/SQL. Remember
3. Draw PL/SQL generic block. Remember
4. Write a syntax of IF-ELSE control structure. Remember
5. Write a syntax of IF-ELSE-IF control structure. Remember
6. Write a syntax of WHILE loop with example. Remember

7. Write a syntax of For loop with example. Remember

12. What is Package? Understand
13. What is Cursor? Understand
14. What is Trigger? Understand
15. Write a syntax to create Function. Remember

Long Questions
Q. Bloom’s
Sample Questions
No. Taxonomy
1. Explain PL/SQL generic block with example. Understand
2. Explain how to create and destroy Sequence with example. Understand
3. Explain how to create and destroy View with example. Understand
4. Explain how to create and destroy Index with example. Understand
5. Explain exception with example. Understand

LJ Polytechnic
Advanced Database Management System

6. Explain Cursor with example. Understand

7. Explain Trigger with example. Understand
8. Explain Conditional Control with example. Understand

Essential Assignments

1. Write a short note on PL/SQL program structure with example.

2. Explain Iterative Control with example.
3. Explain types of Triggers with example.
4. Explain Implicit Cursor and Explicit Cursor with example.
5. Differentiate Procedure and Function.
6. Explain Package with example.

Desirable Assignments
1. Write a PL/SQL program to print integers from 1 to 10 by using PL/SQL FOR
loop.
2. Write PL/SQL program to display maximum numbers among given three numbers.

3. Write PL/SQL program to fetch odd-even numbers from 1 to 10.

4. Given an integer i, write a PL/SQL procedure to insert the tuple (i, 'xxx') into a
given relation.
5. Write PL/SQL function to find fact to factorial of a given number.

6. Given the table EMPLOYEE (EmpNo, Name, Salary, Designation, DeptID) write
a cursor to select the five highest paid employees from the table.
EMPLOYEE (EmpNo, Name, Salary, Designation, DeptID)
7. Create a Trigger that prevents user of account table on SUNDAY.

Activities

1. Develop PL/SQL program to print Fibonacci Series from 1 to 10.

2. Develop PL/SQL program to swap two numbers with and without using temporary
variable.
3. Develop PL/SQL program for Armstrong Number. For example, 407 is Armstrong
number as 43 + 03 + 73 = 64 + 0 + 343 = 407.
4. Develop PL/SQL program to display following pattern.
*
**
***
****
Develop same pattern for numbers and alphabets.

Learning Outcomes
❖ Basic concepts of PL/SQL and advantages of PL/SQL will be learnt.

LJ Polytechnic
 PL/SQL Concept Unit-4

❖ Various types of Control Structures will be understood.

❖ Concept of PL/SQL exception will be learnt.
❖ Concept of Cursor and Trigger will be understood.
❖ Concept of Function and Procedure will be learnt.

LJ Polytechnic
 Transaction Processing Unit-5

Transaction
Processing

Short Questions

Q. Bloom’s
Sample Questions
No. Taxonomy

1. What is Transaction? Remember

2. Define Transaction Log. Remember

3. Draw Transition State Diagram of Transaction. Remember

4. List ACID properties of Transaction. Remember

5. What do you mean by Concurrency Control. Remember

6. What is Lock and list types of Lock? Remember

7. What is a Deadlock? Remember

8. List various types of Lock. Understand

9. Define Schedule, Scheduler. Remember

10. List three phases which are execution phases of Optimistic Method Remember
of Concurrency Control.

Long Questions
Q. Bloom’s
Sample Questions
No. Taxonomy

1. Write a short note on Transition state diagram of Transaction. Understand

2. Explain Transaction properties in detail. Understand

3. Explain Degree of Concurrency Control with example. Understand

4. Explain Deadlock with example. Understand

5. Explain Deadlock Detection and Deadlock Prevention. Understand

6. Explain Time-Stamp method of Concurrency Control. Understand

LJ Polytechnic
Advanced Database Management System

7. Explain Optimistic method of Concurrency Control. Understand

8. Explain various types of Lock with example. Understand

Essential Assignments
1. Explain various states of execution of Transaction.
2. Explain ACID properties of Transaction.
3. Explain Concurrency Control with example.
4. Explain Deadlock and related situation with example.
5. List and explain various methods of Concurrency Control.

Activities

1. Consider ATM transactions and state Transition States of transaction and draw and
mention the particular state of transaction.
2. Make a transaction schedule on given deadlock scenario: Transaction T1 is waiting for
data item X which is locked by transaction T3. Transaction T3 is waiting for Y which is
locked by transaction T2 and transaction T2 is waiting for data item Z which is locked
by transaction T1. Prepare Wait-for diagram for given scenario of deadlock.

Learning Outcomes
❖ Basic terms of Transaction and Transition State Diagram will be learnt.
❖ Basic concept of Concurrency Control and problems of Concurrency Control will be
learnt.
❖ Locking methods of Concurrency Control will be learnt.
❖ Deadlock and Deadlock Detection and Prevention will be learnt.
❖ Concept of Time-stamp and Optimistic methods of Concurrency Control will be
understood.

LJ Polytechnic
 Quotes from Pioneers

“The advance of technology is based on making it fit in so that

you do not really even notice it, so it is part of everyday life.”
- Bill Gates, Co-Founder, Microsoft.

“Have the courage to follow your heart and intuition. They

somehow already know what you truly want to become.
Everything else is secondary.”
- Steve Jobs, Co-Founder, Apple Inc.

“Success breeds complacency. Complacency breeds failure.

Only the paranoid survives.”
- Andy Grove, Former Chairman & CEO, Intel.

“If you are changing the world, you are working on important
things. You’re excited to get up in the morning.”
- Larry Page, Co-Founder, Google & Alphabet Inc.

“Progress is often equal to the difference between mind and

mindset.”
- N. R. Narayana Murthy, Chairman Emeritus, Infosys.

“The only way to learn new programming language is by

writing programs in it.”
- Dennis Ritchie, Co-Creator of C Programming.

“Success is achieved twice. Once in the mind and the second

time in the real world.”
- Azim Premji, Founder Chairman, Wipro.

“The digital world has power because it has dynamic

information, but it's important that we stay human instead of
being another machine sitting in front of a machine.”
- Pranav Mistry, President & CEO of STAR Labs.
 LJ Polytechnic

Offers Diploma in
❖ Artificial Intelligence & Machine Learning
❖ Electronics & Communication Engineering
❖ Cloud Computing & Big Data
❖ Architectural Assistantship
❖ Automation & Robotics
❖ Gaming & Animation
❖ Automobile Engineering
❖ Mechanical Engineering
❖ Information Technology
❖ Computer Engineering
❖ Electrical Engineering
❖ Civil Engineering

info_poly@ljku.edu.in

www.ljku.edu.in

9687010057
9228010057

LJ Campus,
Near Sarkhej-Sanand Circle, Off. S. G. Road, Ahmedabad, Gujarat-382210