Institute of Engineering & Technology, Devi Ahilya University, Indore,

(M.P.), India.
(Scheme Effective from July 2016)

Devi Ahilya University, Indore, India III Year B.E.

Institute of Engineering & Technology Computer Engineering
(Full Time)
Subject Code & Name Instructions Hours Credits
per Week
L T P L T P Total
CER6G4
Wireless and Mobile
Networks 3 1 0 3 1 - 4

Learning Objectives: To understand the basic concepts of wireless communication

with focus on mobile networking.
 To provide knowledge of different techniques of wireless communication.
 To learn about integration of services and applications from fixed networks into
mobile networks.

Prerequisite: Basic knowledge of Computer Networks.

UNIT-I

Introduction:Wireless Networks, Wireless vs Wired Networks, mobile devices, mobile

applications, mobile environments and limitations, Wireless transmission-frequencies and
regulation, multipath propagation, channel fading, Multiplexing and Modulation techniques,
Spread spectrum-DSSS & FHSS,

UNIT-II

Medium Access Control – motivation for specialized MAC, Hidden/Exposed, Near/Far

terminal effect, MAC protocols – SDMA,FDMA,TDMA, Reservation Aloha, PRMA,
MACA, DSMA etc.

Cellular networks- overview, Cellular Concept and Frequency Reuse, Channel Allocation,
Call Setup, Cell Handoffs, Location Management, CDMA, GSM- Architecture, GSM-Air
Interface, protocols, HLR/VLR, localization & calling, security, GPRS.

UNIT-III

Wireless LAN : Infra vs Radio transmission, infrastructure vs ad hoc network,IEEE 802.11-

system and protocol architecture, MAC management, IEEE 802.11 flavours, Bluetooth –
architecture, radio and basband layer, L2CAP, IEEE 802.15, WiMax and Zigbeeoverview

UNIT-IV

Mobile Network Layer : Entities, Packet delivery, Agent Discovery, Tunneling and
encapsulation, optimization, reverse tunnelling,
 Institute of Engineering & Technology, Devi Ahilya University, Indore,
(M.P.), India.
(Scheme Effective from July 2016)

Mobile Transport Layer : Congestion control and implication of mobility, slow start,
Mobile TCP – Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/ Fast recovery.
Support for Mobility – File System – CODA, WAP –Architecture,

UNIT-V

Mobile AdhocNetworks- Protocols and Routing,

Advances in Mobile Technologies- 5G and Beyond, Interne of Things (IoT), Internet of
Every Thing (IoE), Wireless Sensor Networks, Mobile Opportunistic Networks
Wireless Network Planning and Administration- Wireless Hardware, Wireless Network
Design and Deploy, Troubleshooting hardware and connection issues.

Learning Outcomes:

Upon completing the course, students will:

 Be familiar with wireless communication methodologies
 Learn wireless communication protocols and different standards
 Be able to apply these concepts in Wireless Network planning, design and
administration to support mobility.

Suggested Books and resources:

1 Jochen Schiller, Mobile Communications, Pearson Education, 2/e, 2003.

2 W. Stalling, Wireless Communications & Networks, Pearson Education, 2/e, 2005.
3 Dharma P. Agrawal and Qing-An Zeng, Introduction to Wireless and Mobile
Systems, Cengage Publication, 2012.
4 Wale Soyinka, Wireless Network Administration-A Beginner’s Guide, Tata McGraw-
Hill Edu, 2010.
 Devi Ahilya University, Indore, India III Year B.E. (Computer
Institute of Engineering & Technology Engineering)(Full Time)
Subject Code & Name Instructions Hours per Credits
Week
SCR6S6 L T P L T P Total
Professional Development 3 1 0 2 0 0 2
Duration of Theory
Paper:3 Hours

LEARNING OBJECTIVES:
Students who successfully complete this course will:
 Become aware of local business practices world wide
 Understand and evaluate the issues that impact their learning communities
 Gain new perspectives on their aspired professional areas
 Become aware of culturally-specific business practices, perspectives on work ethic,
constructive interactions, and related issues
 Become aware about the job Market and their growth

PRE REQUISITES: Basic Knowledge about organization, business environment & computer,
Internet or smart phone (for social networking sites).

COURSE CONTENTS

Unit 1 Time Management

 Time Management perception

 Time Management & your life
 Set Priorities
 Magic of 168
 S.M.A.R.T.
 Time Management Tools
 Time Management Behavior

Unit 2 Strengthen different Skills - I

 critical thinking skills

 creative problem-solving skills
 critical reflection skills
 Make cognitive connections between learning & other learning experiences
 Strengthen collaborative learning and teamwork skills

Unit 3 Strengthen different Skills- II

  Strengthen academic writing skills
 Strengthen oral presentation skills
 Strengthen critical reflection skills
 Become familiar with resources available for further research on business practices and
issues, as well as culturally-specific business behavior

Unit 4 Personality

 Defining Personality,
 Personality Determinants,
 Personality Development,
 Personality Change
 Various types of Personality.
 Motivation and its Process,
 Increase intercultural skills through guided consideration of varied perspectives

Unit 5 Communication Skills

 Strengthen academic writing skills Resume Writing

 Strengthen oral presentation skills Interview , Discuss speech and short memo
assignments
 Strengthen critical reflection skills GD
 Listening skills

Unit 6 Leadership

 Types of Leaders and Styles of Leadership,

 Characteristics and Functions of Leadership,
 Values and Ethics of Leadership.
 Theories Of Leadership
 Leader Member Exchange Theory,
 Contingency Theory,
 Path- Goal Leadership Theory
 Transformational Leadership Theory,
 Charismatic Theory.


CASE STUDIES

Industry Visit and Training after completion of the course by students with the help of
placement cell.

Using social networking sites students have to develop their professional network.
LEARNING OUTCOMES:
The Professional Development course is comprised of two essential elements: a methodological
and contextual seminar and a practical industry survey. The methodological and contextual
seminar is delivered by faculty that includes readings, lectures, and discussion of local business
practices, key issues for organizations associated with the learning communities.

It also includes discussion of the students’ areas of professional interests, and culturally-specific
training for students’ constructive interaction with local industry. Students will visit local
organizations as a group and will gain first-hand knowledge of operations and issues. Discussion
with industry leaders will complement these visits. Preparatory group discussions prior to field
visits and reflective group exercises following visits will enable students to compare and contrast
their observations, challenge and confirm their prior thinking, and sharpen their understanding of
the issues that impact their learning communities. Other professional events, such as networking
events, will augment the course.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Devi Ahilya University, Indore, India III Year B.E. (Computer

Institute of Engineering & Technology Engineering)(Full Time)
Subject Code & Name Instructions Hours per Credits
Week
CER6E1 L T P L T P Total
Data Warehousing & 3 1 2 3 1 1 5
Mining
Duration of Theory
Paper:3 Hours

Learning Objectives:
1. Ability to understand the role of data mining in knowledge discovery process.
2. To familiarize with various data mining functionalities and how it can be applied to
various real-world problems.
3. To learn about finding data characteristics and evaluating the outcome of data mining
process.
4. To familiarize with various machine learning algorithms used in data mining.

Prerequisite(s):
The students are required to have some basic knowledge about Data structures and Databases.

COURSE CONTENTS

UNIT-I: Introduction

Data Mining: Overview, Type of data mined, Functionalities, Technology used, Target
applications and challenges; Data Features: Attribute types, basic statistical description,
measuring data similarity and dissimilarity.

UNIT-II: Data Preprocessing and Data Warehouse

Data Preprocessing: Overview, Data cleaning, Data integration, Data reduction, Data
transformation and discretization; Data Warehouse: Basic concepts, Design and Usage,
Implementation.

UNIT-III: Frequent Pattern and Association rule Mining

Basic concepts, Pattern Mining: Apriori algorithm, FP-growth Algorithm; Generating association
rules, Pattern evaluation methods, Multi-level and multi-dimensional pattern mining.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

UNIT-IV: Classification

Introduction, Decision tree induction, Bayes classification, Rule based classification, Advance
classification methods: Bayesian belief networks, backpropogation etc.

UNIT-V: Cluster analysis and Advance Topics

Clustering: Introduction, Types of clustering; Partition-based clustering: K-Means, K-Medoids;

Density based clustering: DBSCAN, Clustering evaluation.
Web Data Mining: Introduction, Types of Web mining, and Overview of web usage mining, web
content mining and web structure mining.

Learning Outcomes:
Students who have completed this course should be able to:
1. Apply data mining functionalities on real world problems and datasets.
2. Have some knowledge about the couple of data mining tools and how they can be used
for large data.
3. They would be able to find the characteristics of given data and may identify presence of
outliers, if any.
4. The course would help them to pursue some advance course on data science and may
help in subjects like Big Data, AI etc.
Assessment methods of all of the above: quizzes, exams, assignments, practicals

Books Recommended:
[1] Han, Kamber and Pi, Data Mining Concepts & Techniques, Morgan Kaufmann, 3 rd
Edition, India, 2012.
[2] Mohammed Zaki and Wagner Meira Jr., Data Mining and Analysis: Fundamental
Concepts and Algorithms, Cambridge University Press, 2014.
[3] Z. Markov, Daniel T. Larose Data Mining the Web, Jhon wiley & son, USA, 2007.
[4] Bing Liu, Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, Springer,
2nd Edition, 2011.
[5] Sam Anahory and Dennis Murray, Data Warehousing in the Real World, Pearson
Education Asia, 2000.
[6] W. H. Inmon, Building the Data Warehouse, 4th Ed Wiley India, 2005.

List of Experiments :
R-programming and WEKA tools need to be learn in order to complete the lab assignments.
 To know your data, an experiment to visualize summarized data using box-plot, scatter
plot and quantile-quantile plot using R-Programming.
 To clean your data, an experiment to find outliers, remove noise and identify correlated
data using R-Programming.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

 To implement A-priori algorithm to find the frequent patterns in the given dataset.
Students can use programming language of their choice to code.
 Use of WEKA tool to use various association mining algorithms on datasets and evaluate
them based on pattern evaluation measures.
 Use of WEKA tool to use various classification algorithms on datasets and evaluate them
on the basis of accuracy and other parameters.
 Use of WEKA tool to use various clustering algorithms on datasets and evaluate them
based on cluster quality and other parameters.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Devi Ahilya University, Indore, India III Year B.E. (Computer

Institute of Engineering & Technology Engineering)(Full Time)
Subject Code & Name Instructions Hours per Credits
Week
CER6C3 L T P L T P Total
Compiler Techniques 3 1 2 3 1 1 5
Duration of Theory
Paper:3 Hours

Learning Objectives:

 Provide a framework for understanding the fundamentals of Compiler.

 To familiarize students with new Compilation Problems.
 Develop skills to understand how to Design a Compiler.
 Develop ability to understand how to enhance performance of a Compiler for newly evolved
Programming Languages.

Prerequisites: Knowledge of Computer Programming, Data Structures, Discrete Mathematics.

Knowledge of several different Programming Languages will be useful.

Course Contents
Unit I : Introduction to Compiling

Compilers: The Analysis-Synthesis Model of Compilation, The Context of a Compiler; Analysis

of the Source Program: Lexical Analysis, Syntax Analysis, Semantic Analysis; The Phases of a
Compiler: Symbol-Table Management, Error Detection and Reporting, The Analysis Phases,
Intermediate Code Generation, Code Optimization, Code Generation; Cousins of the Compiler:
System Software, Interpreters, Kinds of Language Processors, Preprocessors, Assemblers, Linkers
and Loaders, Macros; The Grouping of Phases: Front and Back Ends, Passes, Reducing the Number
of Passes; Compiler Construction Tools.

Unit II: Lexical Analysis

The Role of the Lexical Analyzer: Lexical Analysis Versus Parsing, Tokens, Patterns and Lexemes,
Attributes for Tokens, Lexical Errors; Specification of Tokens: Strings and Languages, Operations
on Languages, Regular Expressions, Regular Definitions; Recognition of Tokens: Transition
Diagrams.

Unit III: Syntax Analysis

Introduction: The Role of the Parser, Classification of Grammars, Syntax Error Handling; Context-
Free Grammars: Parse Tree and Derivations, Ambiguity, CFG Versus Regular Expressions;
Writing a Grammar: Lexical Versus Syntactic Analysis, Eliminating Ambiguity, Elimination
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

of Left Recursion, Left Factoring; Top- Down Parsing: Recursive Descent Parsing, LL(1)
Grammars, Nonrecursive Predictive Parsing; Bottom-Up Parsing: Reductions, Shift Reduce Parsing,
Conflicts During Shift Reduce Parsing; LR Parsing: Simple LR, Constructing SLR-Parsing Tables,
Constructing LALR Parsing Tables; Using Ambiguous Grammars: Precedence and Associativity to
Resolve Conflicts, The “Dangling-Else” Ambiguity.

Unit IV: Intermediate-Code Generation and Run-Time Environment

Variants of Syntax Trees: Directed Acyclic Graphs for Expressions, The Value-Number Method for
Constructing DAG’s; Three Address Code: Addresses and Instructions, Quadruples, Triples; Type
Checking: Rules for Type Checking, Type Conversions; Storage Organization: Static Versus
Dynamic Storage Allocation; Stack Allocation of Space: Activation Trees, Activation Records;
Introduction to Garbage Collection: Design Goals for Garbage Collectors, Reachability.

Unit V: Code Optimization and Planning a Compiler

Basic Blocks and Flow Graphs: Basic Blocks, Flow Graphs, Representation of Flow Graphs;
Optimization of Basic Blocks: The DAG Representation of Basic Blocks, Local Common
Subexpressions Elimination, Semantic Preserving Transformations, Global Common
Subexpressions Eliminations, Dead Code Elimination; Loop Optimization: Loop Invariant Code
Motion, Reduction in Strength, Induction Variable Elimination, Loop Unrolling; Planning a
Compiler: Source Language Issues, Target Language Issues, Performance Criteria.

Learning Outcomes:

Upon completing the course, students will be able to:

 Acquire advance knowledge and understanding of Compiler.

 Use skills in Compiler Design.

 Apply acquired knowledge to improve performance of a Compiler.

In addition to development in technology computer architectures offers a variety of resources of

which students will be able to innovate in the Compiler Design.

Books Recommended:

[1] Compilers: Principles, Techniques, and Tools; Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman;
Pearson Education.

[2] Compilers: Principles, Techniques, and Tools; Alfred V. Aho, Monica S. Lam, Ravi Sethi,
Jeffrey D. Ullman; Pearson Education.

[3] System Programming: D M Dhamdhere; McGraw Hill Education.

[4] System Programming and Operating Systems: D M Dhamdhere; McGraw Hill Education.

Suggested Exercises (For a Defined Language)

 Design a symbol table mechanism.

 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

 Write an interpreter for quadruples.

 Write the lexical analyser.

 Write the semantic actions.

 Write the parser.

 Write the error-handling routines.

 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Devi Ahilya University, Indore, India III Year B.E. (Computer

Institute of Engineering & Technology Engineering)(Full Time)
Subject Code & Name Instructions Hours per Credits
Week
CER6C2 L T P L T P Total
Design and Analysis of 3 1 1 3 1 1 5
Algorithms
Duration of Theory
Paper:3 Hours

Learning Objectives:
1. Reinforce basic design concepts (e.g., pseudocode, specifications, top-down design)
2. Knowledge of algorithm design strategies
3. Familiarity with an assortment of important algorithms
4. Ability to analyze time and space complexity

Prerequisite:
The students are required to have familiarity with the following data structures: Arrays and
linked lists, Stacks and queues, Graphs and trees, binary search trees, height balancing, Heaps
and priority queues

COURSE CONTENTS

UNIT-I:Introduction to Algorithms
Notion of algorithms, properties, important areas of research in connection with the study of
algorithms, Types of algorithms; Analysis-best case, worst case, and average case. Performance
issues - Time and spacecomplexity; Asymptotic analysis. Mathematical preliminaries; functions
& their growth rates; Recurrence relations,Methods for solving recurrences.

UNIT-II: Selected Algorithms for Sorting, Searching and matrix multiplication

Elementary sorting techniques: Selection, Bubble, and Insertionsorts; Advanced sorting
techniques: Heap, Merge and Quick sorts; Radix & Bucket sorts. Searching techniques:
Linearand binary search; Searching minimum and maximum elements.Divide–and-Conquer
strategy, Strassen’s matrix multiplication.

UNIT-III:Greedy Method and Dynamic Programming

Algorithms design techniques based on Greedy Method and Dynamic programming. Illustration
of these strategies using appropriate examples including Knapsack problem, optimalstorage on
tapes, finding shortest path, all pairs shortest path, finding minimum cost spanning trees, and
Matrix chain multiplication problem.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

UNIT-IV: Backtracking, Branch-and- Bound, and String Matching

Backtracking and Branch-and- Bound algorithm design techniques, Illustration of these
techniques using appropriate examples like Queens Problem,subset sum problem,traveling
salesperson problem, etc.
Introduction to string matching problem, Applications, String matching algorithms: Naive
algorithm, Rabin-Karp, Knuth-Morris-Pratt, Boyer-Moore, etc.

UNIT-V: The Theory of NP-Completeness

Non-deterministic Algorithms:Introduction. Nondeterministic Complexity, Decision and
optimization problems, Tractable and Intractable Problems,ComputationalClasses: – P, NP, NP-
Complete, and NP-Hard; reducibility, Selected NP-Complete and NP-Hard
problems:Hamiltonian cycle, Traveling Salesperson (TSP). Satisfiability, Clique problems, etc.

Learning Outcomes:
Students who have completed this course should be able to:
1. Apply design principles and concepts to algorithm design
2. Have the mathematical foundation in analysis of algorithms
3. Understand different algorithmic design strategies
4. Analyze the efficiency of algorithms using time and space complexity theory
Assessment methods of all of the above: quizzes, exams, assignments, practicals

BOOKS RECOMMENDED:
[1] Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein,
Introduction to Algorithms, Second Edition, MIT Press/McGraw-Hill, 2001.
[2] Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis,
and Internet Examples, Second Edition, Wiley, 2006.
[3] Jon Kleinberg and ÉvaTardos, Algorithm Design, Pearson, 2005.
[4] E. Horowitz, S. Sahni, S Rajasekaran, Computer Algorithms, Galgotia Publications.
[5] Saara Base, Computer Algorithms: Introduction to Design and Analysis, Addision
Wesley, 2/e, 1988.
[6] Knuth, D, The art of computer programming, Vols. 1-2-3, Addision Wesley 1968-73.
[7] A V Aho, J E Hopcroft & J D Ullman, The Design and Analysis of Computer Algorithms,
Addison Wesley, 1974.
[8] Vijay V Vazirani, Approximation Algorithms, Springer-Verlag, 2001
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Devi Ahilya University, Indore, India BE III Year (Computer

Institute of Engineering & Technology Engineering) (Full Time)
Subject Code & Name Instructions Hours per Credits
Week
CER6C1 L T P L T P Total
Computer Graphics
Duration of Theory 3 1 - 3 1 - 4
Paper: 3 Hours

Course Objectives: The goal of this course is to provide an introduction to the theory and practice
of computer Graphics.

Prerequisite(s): Programming language: C++/JAVA

COURSE OF CONTENTS

Unit I
Introduction: Application of Computer Graphics, Raster Graphics Fundamentals: Scan conversion,
Pixel, Frame Buffer. Graphics Primitives; Line algorithms Circle algorithms, Ellipse, Character
generation, Polygon Representation, inside test, Polygon filling algorithms, Antialiasing.

Unit II
Display devices: Random scan and Raster scan monitors, Colors CRT monitor, Plasma Panel;
Hard Copy devices: Printers and Plotters; Input devices: Joysticks, Mouse, Digitizer, Scanner,
and Camera; Input Techniques;

Unit III
Windowing and clipping:2D Transformation, Raster method of Transformation, Window, View
port, Viewing, Window to View port Transformation, Line clipping algorithms, Polygon clipping
algorithms.

Unit IV
Three Dimensions:3D Modeling techniques, 3D Display Techniques, 3D Transformation, Viewing
Parameters, Hidden Surface and back face removal algorithms. 3D Curves & Surfaces: Bezier,
Bspline.

Unit V
Shading and Color Models: Diffuse illumination, Point source illumination, Reflection,
Refraction, Transparency, Shadows, Polygon rendering algorithms, Dithering, Half toning, Color
Models and applications.

BOOKS RECOMMENDED
[1] Hearn Donald and Baker M.Pauling, Computer Graphics, 2/e, Prentice Hall of India.
[2] Hearn Donald and Baker M.Pauling, Computer Graphics with OpenGL, 3/e, Prentice Hall,
2004.
[3] David F. Rogers, Procedural Element of computer Graphics, McGraw Hill International.
[4] William M. Newman Robert F. Sproull, Principles of Interactive Computer Graphics, McGraw
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Hill.
[5] J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes, and R.L. Philips, Introduction to
ComputerGraphics, Addison-Wesley, 1994.
[6] Zhigang Xiang and Roy Plastock, Computer Graphics, Tata McGraw Hill Publications.
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

Devi Ahilya University, Indore, India III Year B.E. (Computer

Institute of Engineering & Technology Engineering)(Full Time)
Subject Code & Name Instructions Hours per Credits
Week
CER6L4 L T P L T P Total
Computer Graphics 0 0 2 0 0 1 1
Lab
Duration of Theory
Paper:

List of Practical Assignments :

1. Implement following line drawing algorithm & compare it on the basis

(mentioned in table given below) and prepare the table.
Bresenham DDA
No. of addition or subtraction
No. of multiplication
Execution time

2. Implement following Circle drawing algorithm & compare it on the basis

(mentioned in table given below) and prepare the table.
Bresenham Mid point algorithm
No. of addition or subtraction
No. of multiplication
Execution time

3. Implement following Character generation algorithm & compare it on the

basis (mentioned in table given below) and prepare the table.
Stroke Bit Map
Execution time
Implementation complexity
( advantages/disadvantages)

4. Implement following Polygon filling algorithm & compare it on the basis

( Seed fill Scan line

m Execution time
e Implementation complexity
n ( advantages/disadvantages)
ti
oned in table given below) and prepare the table.

Implement Cohen Sutherland and Cyrus Back line clipping algorithms and
display the clipped portion of line as demonstration.

5. Implement Cohen Hoghman polygon clipping algorithm to clip a polygon

against a rectangular boundary and combine Cohen Hoghman polygon

1
 Institute of Engineering & Technology, Devi Ahilya University, Indore, (M.P.), India.
(Scheme Effective from December 2017)

clipping algorithm with Cyrus Back line clipping algorithms to clip a polygon
against another polygon and display the clipped portion of polygon.

6. Implement the following 2D transformation using matrix multiplication.

Translation
Rotation
Scaling
Shearing
Reflection
7. Implement parallel (oblique and axonometric) and perspective projection and
display following objects using projections.
Pyramid
Rectangles

8. Implement the following 3D transformation using matrix multiplication. And

display using perspective projection.
Translation
Rotation
Scaling
Shearing
Reflection

9. Implement rotation of an object about any arbitrary axis.

10. Implement reflection of an object about any arbitrary plane.

11. Implement the L-system for generation of symmetric objects(Fractals)

12. Generate 2D curve and surfaces using implementation of Bezier curve.

13. Implement the following visible surface detection algorithm and compare
them on the basis of complexities and execution time.
Z-buffer
Scan-line
Depth sorting
Octree
RayCasting

14. Implement the following rendering algorithm and compare them on the basis
of complexities and execution time.
Flat Shading
Gouraud shading
Phong shading
Ray tracing