mca evaluation scheme of 1st and 2nd sem · mahamaya technical university noida syllabus for master...
TRANSCRIPT
MAHAMAYA TECHNICAL UNIVERSITY
NOIDA
Syllabus
for MASTER OF COMPUTER APPLICATIONS
(Semesters-I,II: Year-1)
(Effective from the Session: 2012-13)
Evaluation Scheme for Session: 2012-13
MCA –I Year (FIRST SEMESTER)
S N Code Subjects
Periods
L T P
Evaluation Scheme
Sessional End Semester Total Credit
CT TA TOT P Th P 1 CA-101 Problem
Solving and Computer Programming with C
3 1 3 30 20 50 25 100 50 225 6
2 CA-102 Mathematical Foundation of Computer Science
3 1 0 30 20 50 - 100 - 150 4
3 CA-103 Principles of Management
3 1 0 30 20 50 - 100 - 150 4
4 CA-104
Computer System Design
3 1 3 30 20 50 25 100 50 225 6
5 CA-105
Energy, Environment and Ecology
3 1 0 30 20 50 - 100 - 150 4
6 CA-106
Professional Communication
0 1 2 15 10 25 - - 25 50 2
7 CA-107 Seminar 0 0 2 - - - 50 - - 50 1 Total Marks: 15 6 10 1000 27
Evaluation Scheme for Session: 2012-13
MCA –I Year (SECOND SEMESTER)
S N Code Subjects
Periods
L T P
Evaluation Scheme
Sessional End Semester Total Credit
CT TA TOT P Th P 1 CA-201 Computer
Based Numerical and Statistical Techniques
3 1 2 30 20 50 25 100 25 200 5
2 CA-202 Computer networks
3 1 0 30 20 50 - 100 - 150 4
3 CA-203 Fundamentals of E-Commerce
3 1 0 30 20 50 - 100 - 150 4
4 CA-204 Data Structures and File Handling
3 1 3 30 20 50 25 100 50 225 6
5 CA-205 Object Oriented Systems and Programming with C++
3 1 3 30 20 50 25 100 50 225 6
6 CA-206 Technical Writing
0 2 0 30 20 50 - - - 50 2
Total Marks: 15 7 8 1000 27
CA-101: Problem solving and Computer Programming with C L T P 3 1 3 Objective:
• Understand the significance of an implementation of a programming language in a compiler • Increase the ability to learn new programming languages • Increase the capacity to express programming concepts and choose among alternative ways to
express things in a programming language
UNIT 1: Introduction to Computer System: Hardware, Software-system software & application software; Introduction to Computing Environment; Introduction to Problem solving and notion of algorithm: Flow charting, Pseudo code, corresponding sample C-program, Testing the code; Number Systems and their conversion: Decimal, Binary and Hexadecimal representations, bit, byte; Character representation: ASCII, sorting order; System software re-visited: machine language, symbolic language, higher level languages, what is a compiler, what is an operating system, what is a linker, what is an editor, error handling; Introduction to program development.
UNIT 2: Structure of a C-program, comments, identifiers; Fundamental Data Types: Character types, Integer, short, long, unsigned, single and double-precision floating point, complex, boolean, constants; Basic Input/Output: printf, formatting, scanf, eof errors; Operators and Expressions: Using numeric and relational operators, mixed operands and type conversion, Logical operators, Bit operations, Operator precedence and associatively, Functions in C: standard function, defining a function, inter-function communication- passing arguments by value, scope rules and global variables; Top-down program development.
UNIT 3: Conditional Program Execution: Applying if and switch statements, nesting if and else, restrictions on switch values, use of break and default with switch; Program Loops and Iteration: Uses of while-do and for loops, multiple loop variables, assignment operators, using break and continue; Arrays: Array notation and representation, manipulating array elements, using multidimensional arrays, arrays of unknown or varying size
UNIT 4: Sequential search, Sorting arrays; Strings, Recursion; Text files, file Input/Output - fopen, fread, etc Structures: Purpose and usage of structures, declaring structures, assigning of structures, Pointers to Objects: Pointer and address arithmetic, pointer operations and declarations, using pointers as function arguments
UNIT 5: Familiarization with Linux OS environment: basic OS commands, directory creation, editing, storing and protecting access to files; Text files in Indian languages: keyboarding, editing, searching; The Standard C Preprocessor: Defining and calling macros, utilizing conditional compilation, passing values to the compiler, string handling functions.
Lecture-wise Break-UP Week Lecture 1 Chapter Lecture 2 Chapter Lecture 3 Chapter Lab Meeting Week-1
Introduction to Computer System: Hardware, Software-system software, & application software; Introduction to Computing Environment;
Ch-1 TB1
Introduction to Problem solving and notion of algorithm: Flow charting, Pseudo code,
App C TB1
corresponding sample C-programme, Testing the code;
Ch-1 TB1
Get familiar with OS and C compiler Implement and Test Small Routine in C
Week-2
Number Systems and their conversion: Decimal, Binary and Hexadecimal representations, bit, byte;
App D TB1
Number Systems and their conversion: Decimal, Binary and Hexadecimal representations, bit, byte;
App D TB1
Character representation: ASCII, sorting order
App A TB1
Implement and Test Small Routine in C
Week-3
System software re-visited: machine language, symbolic language, higher lever languages, what is a compiler, what is an operating system, what is a linker, what is an editor, error handling
Ch-1 TB1
Introduction to programme development; Structure of a C-program, comments, identifiers
Ch-2 TB1
Fundamental Data Types: Character types, Integer, short, long, unsigned,
Ch-2 TB1
Implement and Test a moderate size Routine in C
Week-4
Data Types and Variable single and double-precision floating point, complex, boolean, constants;
Ch-2 TB1
Basic Input/Output: printf, formatting, scanf, eof errors;
Ch-2 TB1
Operators and Expressions: Using numeric and relational operators, mixed operands and type conversion,
Ch-3 TB1
Evaluation of Expression Basic I/O
Week-5
Logical operators, Bit operations, Operator precedence and associatively,.
Ch-3 TB1
Functions in C: standard function, defining a function,
Ch-3 TB1
Inter-function communication- passing arguments by value, scope rules and global variables; Top-down program development
Ch-3 TB1
Evaluation of Expression Function
Week-6
if and switch statements,
Ch-5 TB1
nesting if and else, restrictions on switch values,
Ch-5 TB1
use of break and default with switch;
Ch-5 TB1
Iteration
Week- Repetition Ch-6 Repetition Ch-6 Repetition Ch-6 Iteration,
7 structure in C: while-do
TB1 structure in C: for loops
TB1 structure in C: multiple loop variables, assignment operators, using break and continue;
TB1 Function
Week-8
Arrays: Array notation and representation, manipulating array elements,
Ch-8 TB1
using multidimensional arrays, arrays of unknown or varying size
Ch-8 TB1
Sequential search, Sorting arrays;
Ch-8 TB1
Arrays
Week-9
Sorting arrays Ch-8 TB1
Strings, Ch-11 TB1
recursion Ch-8 TB1
Sorting & searching
Week-10
Recursion Ch-6 TB1
Text files, file Input/Output - fopen, fread, etc
Ch-7 TB1
Structures: Purpose and usage of structures, declaring structures, assigning of structures,
Ch-12 TB1
Strings, Recursion
Week-11
Pointers to Objects: Pointer and address arithmetic,
Ch-9 TB1
pointer operations and declarations,
Ch-9 TB1
using pointers as function arguments
Ch-9 TB1
Pointers
Week-12
Linux OS environment: basic OS commands,
Ch-1 TB4 / Ch-2 TB3
directory creation, storing and protecting access to files
Ch-2 TB4 / Ch-5 TB3
editing, Ch-3 TB4 / Ch-6 TB3
Use of Unix platform (making directory, cpy edit and store file, running a program already developed)
Week-13
Text files in Indian languages: keyboarding,
Text files in Indian languages: editing, searching
The Standard C Preprocessor: Defining and calling macros,
App G TB1
Hindi text document processing
Week-14
utilizing conditional compilation, passing values to the compiler, string handling functions,
App G TB1
Std C Library App E TB1
Std C Library App F TB1
Macros, Library
Text Books : 1. Computer Science- A Structured Programming Approach Using C, by Behrouz A.
Forouzan, Richard F. Gilberg, Thomson, Third Edition [India Edition], 2007. [TB1] For Linux: 2. UNIX Concepts and Applications, Das , TMH [TB2]
3.. LiNUX, unleashed , Techmedia [TB3] 3. LINUX : LEARNING THE ESSENTIALS by K. L. JAMES, published by PHI 4. Guide to UNIX and LINUX by Harley Hahn published by TMH A few web-links for tutorials/resources: http://www.cprogramming.com/tutorial.html http://www.pixel2life.com/publish/tutorials/760/_c_beginner_examples_tutorial/ http://www.loirak.com/prog/ctutor.php http://www.ee.surrey.ac.uk/Teaching/Unix/ http://fclose.com/b/linux/3423/tutorials-for-linux-beginners/ http://www.linux-tutorial.info/ http://www.roseindia.net/linux/tutorial/ http://www.tdil.mit.gov.in/
CA-102: MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE L T P 3 1 0 PREREQUISITES There are no prerequisites in terms of courses to attend. Students should be familiar with notions of mathematics OBJECTIVES:
The objective of this course are : • To Introduce Mathematical Logic, especially First Order Logic. • To introduce proof techniques such as Mathematical Induction and Contradiction. • Develop an understanding of counting, functions and relations. • To introduce and study abstract, mathematical models of computation (such as Turing
machines, formal grammars, recursive functions), and to use the abstract computation models to study the ability to solve computational problems.
LEARNING OUTCOME Techniques introduced in this course will come in handy for courses such as Analysis of Algorithms, Compiler design and NLP UNIT-I: 8 Hrs Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets
Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, equivalence relation, partial ordering relation.
Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions.
Mathematical Induction: Piano’s axioms, Mathematical Induction Discrete Numeric Functions and Generating functions Simple Recurrence relation with constant coefficients, Linear recurrence relation without constant coefficients.
(Text Book 1: Chapters 2, Pages 104 to 258) UNIT-II: 8 Hrs Algebraic Structures: Properties, Semi group, Monoid, Group, Abelian group, properties of group, Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism, Isomorphism and Automorphism of groups
(Text Book 1: Chapters 3 Pages: 270 ) Propositional Logic: Preposition, First order logic, Basic logical operations, Tautologies, Contradictions, Algebra of Proposition, Logical implication, Logical equivalence, Normal forms, Inference Theory, Predicates and quantifiers,
(Text Book 1: Chapters 1, Pages 1 to 102)
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, and complemented lattices. (Text Book 1: Chapters 4 , Page 278 to 390)
UNIT-III 8 Hrs Graphs: Simple graph, multi graph, representation of graphs, Bipartite, Regular, Planar and connected graphs, Euler graphs, Hamiltonian path and circuits, Graph coloring, chromatic number, isomorphism and Homomorphism of graphs.
Tree: Definition, Rooted tree, properties of trees, binary search tree, tree traversal.
(Text Book 1: Chapters 5, Pages 468 to 509)
UNIT-IV 8 Hrs Theory of computation: Introduction, Alphabets, Strings and Languages, Kleene Closure, NFA, DFA, , Conversion of NFA to DFA, Optimizing DFA FA with output: Moore machine, Mealy machine, Conversions. Regular expression (RE) , Definition, Regular expression to FA, Arden Theorem, DFA to Regular expression, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages.
(Text Book 2: Part II, All Chapters)
UNIT-V 8 Hrs Chomsky Hierarchy of language, Context-free grammar (CFG) , Pushdown Automata (PDA), equivalence of PDA’s and CFG’s, Introduction Turing Machine(TM), construction of TM for simple problems. TM as Computer of Integer functions, Universal TM, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs.
(Text Book 2: Part III and Part IV ) Text Books:
1) John C Martin “ Introduction to Languages and The Theory of Computation”, Third edition,, TMH 2) Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer
Science”, TMH
Reference Books : 3) Hopcroft, Ullman, “Introduction to Automata Theory, Languages and
Computation”, Pearson Education 4) Chowdhary, K. R. “ Fundamentals of discrete Mathematical Structures’, Second Edition,
PHI Learning 5) Liptschutz, Seymour, “Discrete Mathematics”, TMH 6) Kenneth H. Rosen, ” Discrete Mathematics and its applications”, TMH 7) Peter Linz,” An Introduction to Formal languages and Automata”,” Jones & Bartlett Learning
Web-links for tutorials/resources: to be added http://dipqa.com/view/dips/170/automata-theory-questions-turorials/ http://oqls10.typepad.com/blog/2011/12/automata_theory_tutorials-83399.html http://math.about.com/od/discretemath/Discrete_Math.htm
Lecture-wise Break-UP
Week Lecture 1 Lecture 2 Lecture 3 Assignments Week-1 Definition of sets,
countable and uncountable sets, Venn Diagrams
proofs of some general identities on sets ,
Definition, types of relation, composition of relations
Pictorial representation of relation
Week-2 equivalence relation, partial ordering relation.
Definition, type of functions, one to one, into and onto function, inverse function,
composition of functions, recursively defined functions
Piano’s axioms, Mathematical Induction Discrete Numeric Functions
Week-3 Generating functions Simple Recurrence relation with constant coefficients
Properties, Semi group, Monoid, Group, Abelian group,
properties of group, Subgroup, Cyclic group, Cosets,
Permutation groups, Homomorphism, Isomorphism and Automorphism of groups
Week-4 Preposition, First order logic, Basic logical operations
Tautologies, Contradictions,
Algebra of Proposition
Logical implication, Logical equivalence, Normal form
Week-5 Inference Theory, Predicates and quantifiers
Lattices, and complemented lattices.
ordered set, Hasse diagram of partially, ordered set,
isomorphic ordered set, well ordered set
Week-6 properties of Lattices, and complemented lattices.
Simple graph, multi graph, representation of graphs
Regular, Planar and connected graphs
Euler graphs, Hamiltonian path and circuits
Week-7 Graph coloring, chromatic number,
isomorphism and Homomorphism of graphs.
Definition, Rooted tree, properties of trees
binary search tree, tree traversal
Week-8 Introduction, Alphabets, Strings
Introduction to Langauges
Kleene Closure, NFA
Week-9 DFA Conversion of NFA to DFA
Optimizing DFA Mealy and More Machines
Week-10
Mealy to More Conversion
Moore machine to Mealy machine, Conversions
Regular expression Regular expression to FA, Arden Theorem
Week-11
DFA to Regular expression
Non Regular Languages
Pumping Lemma for regular Languages. Application of Pumping Lemma
Closure properties of Regular Languages
Week-12
Chomsky Hierarchy of language
Context-free grammar (CFG
Context-free grammar (CFG
Pushdown Automata (PDA
Week-13
Pushdown Automata (PDA
equivalence of PDA’s and CFG’s
Introduction Turing construction of TM for simple problems
Machine(TM
Week-14
TM as Computer of Integer functions, Universal TM
Recursive and recursively enumerable languages
Halting problem, Introduction to Undecidability
Undecidable problems about TMs
CA-103: PRINCIPLES OF MANAGEMENT L T P 3 1 0
OBJECTIVE: Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management. UNIT 1. HISTORICAL DEVELOPMENT 8 Hours Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organization. (Text Book 1: Chapters 1 and 2, Pages 3 to 24) UNIT 2. PLANNING 8 Hours Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Forecasting.
(Text Book 1: Chapters 3, 4 and 5, Pages 45 to 102) UNIT 3. ORGANISING 8 Hours Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness.
(Text Book 1: Chapters 7,8,9 and 11, Pages 133 to 190, 217 to 244) UNIT 4. DIRECTING 8 Hours Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.
(Text Book 1: Chapters 14, 15, 16 and 17, Pages 299 to 384) UNIT 5. CONTROLLING 8 Hours System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.
(Text Book 1: Chapters 18, 19, 20, 21 and 22, Pages 393 to 506) TEXT BOOKS
1. Harold Koontz & Heinz Weihrich “Essentials of Management”, Fifth edition, Tata McGraw-Hill, 1998
REFERENCES 1 Tripathy PC And Reddy PN, “Principles of Management”, Tata McGraw-Hill, 1999. 2. Decenzo David, Robbin Stephen A, “Personnel and Human Reasons Management”, Prentice Hall of India, 1996 3. JAF Stomer, Freeman R. E and Daniel R Gilbert, “Management”, Pearson Education, Sixth
Edition, 2004. 4. Fraidoon Mazda, “Engineering Management”, Addison Wesley, 2000.
5. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.
Web Links http://www.wiziq.com/tutorials/principles-of-management http://nova.campusguides.com/content.php?pid=132346&sid=1493625
Week wise Lecture Schedule
Week Lecture 1 Lecture 2 Lecture 3 Assignment Week-1 Definition of
Management -Science or Art
Management and Administration
Development of Management Thought –
Development of Management Thought –
Week-2 Contribution of Taylor and Fayol
Functions of Management
Functions of Management
Types of Business Organization.
Week-3 Nature and Purpose of Planning
Steps involved in Planning
Objectives – Setting Objectives
Process of Managing by Objectives
Week-4 Strategies of Planning
Policies & Planning Premises
Forecasting Forecasting
Week-5 Formal and informal organization
Organization Chart Structure and Process – Departmentation by difference strategies
Line and Staff authority
Week-6 Benefits and Limitations
De-Centralization and Delegation of Authority
– Staffing – Selection Process - Techniques
HRD – Managerial Effectiveness.
Week-7 Human Factors – Creativity and Innovation
Harmonizing Objectives
Leadership – Types of Leadership Motivation
Hierarchy of needs
Week-8 Motivation theories – Motivational Techniques
Job Enrichment – Communication
Process of Communication – Barriers and Breakdown
Effective Communication – Electronic media in Communication.
Week 9 System and process of Controlling – Requirements for effective control
The Budget as Control Technique
Information Technology in Controlling
Use of computers in handling the information – Productivity
Week-10
Problems and Management
Control of Overall Performance – Direct and Preventive Control – Reporting
The Global Environment – Globalization and Liberalization
International Management and Global theory of Management.
CA-104: COMPUTER SYSTEM DESIGN L T P 3 1 3
Learning Objective: 1. Students will learn the fundamentals of computer organization and its relevance to classical and modern problems of computer design
2. Students will be able to identify where, when and how enhancements of computer performance can be accomplished.
3. Students will learn the sufficient background necessary to read more advance texts as well as journal articles on the field.
4. Student will see how to use concepts of computer organization in real-life settings using various PC performance improvements.
5. Students will also be introduced to more recent applications of computer organization in advanced digital systems.
Learning Outcome: 1. Student will learn the concepts of computer organization for several engineering applications.
2. Student will develop the ability and confidence to use the fundamentals of computer organization as a tool in the engineering of digital systems. UNIT-1 9 Hrs Data Representation in Computer Systems Introduction, Positional Numbering Systems, Converting Between Bases, Signed Integer Representation, Floating-Point Representation
(Textbook 1, Chapter 2, Page no 54 – 120)
Arithmetic: Overview, Fixed Point Addition and Subtraction, Fixed Point Multiplication and Division, Floating Point Arithmetic, High Performance Arithmetic
(Textbook 2, Chapter 3, 61- 86)
Boolean algebra and Digital Logic: Introduction, Boolean algebra, Boolean Expressions, Boolean Identities, Logic Gates, Digital Components, Combinational Circuits, Sequential Circuits, Karnaugh Maps
(Textbook 1, Chapter 3, Page no 121 – 192)
UNIT 2 9 Hrs Register and Register transfer : Part1- Registers, Micro-operations and Implementations, Part 2 - Counters, Register Cells, Buses, & Serial Operations, Part 3 - Control of Register Transfers
(Textbook 4, Chapter 7)
Processor Organization and Performance: Introduction, Number of Addresses, Flow of Control, Instruction Set Design Issues, Micro-programmed Control, Performance
(Textbook 3, Chapter 6, Page no 197 - 247)
Computer Design Basics: Part 1 – Data-paths, Part 2 – A Simple Computer (Textbook 4, chapter 9)
UNIT-3 Memory: 7 Hrs Overview, The Memory Hierarchy, Random Access Memory, Memory Chip Organization, Case Study: Rambus Memory, Cache Memory, Virtual Memory, Advanced Topics, Case Study: The Intel Pentium 4 Memory System. (Textbook 2, Chapter 7, 249 - 302)
UNIT-4 6 Hrs Buses and Peripherals Parallel Bus Architectures, Bridge-Based Bus Architectures, Internal Communication Methodologies, Case Study: Communication on the Intel Pentium Architecture, Serial Bus Architectures, Mass Storage, RAID - Redundant Arrays of Inexpensive Disks, Input Devices, Output Devices, Case Study: Graphics Processing Unit, Case Study: How a Virus Infects a Machine. (Textbook 2, Chapter 8, 303 - 352)
UNIT- 5 9 Hrs Languages and the Machine: The Compilation Process, The Assembly Process, Linking and Loading, Macros, Quantitative Analyses of Program Execution, From CISC to RISC, Pipelining the Datapath, Overlapping Register Windows, Low Power Coding. (Textbook 2, Chapter 6, 197 - 248)
Performance Measurement and Analysis: Introduction, Computer Performance Equations, Mathematical Preliminaries, Benchmarking, CPU Performance Optimization, Disk Performance. (Textbook 1, Chapter 11, Page no 585 – 620)
Text-Books: 1. The Essentials of Computer Organization and Architecture,
Linda Null and Julia Lobur,3rd Ed, Jones & Bartlett Learning 2. Computer Architecture and Organization: An Integrated Approach
Miles J. Murdocca and Vincent P. Heuring, John Wiley & Sons, 2007
3. Fundamentals of Computer Organization and Design, S. P. Dandamudi, Springer, New York, 2003.
4. Logic and Computer Design Fundamentals Morris mano and Kimi charels 4th Edition, Prentice Hall.
Reference Books: 1. Structured Computer Organization,
Andrew S. Tanenbaum 5/E, Pearson
2. Digital Logic Design Brian Holdsworth and Clive Woods, 4th Ed, Newnes
Web-links
1. http://freevideolectures.com/Course/2315/Digital-Computer-Organization/ 2. http://freevideolectures.com/Course/2277/Computer-Organization 3. http://www.mywbut.com/syllabus.php?mode=VT&paper_id=54&dept_id=6 4. http://www.jblearning.com/catalog/9781449600068/ 5. http://writphotec.com/mano4/PowerPoint_Handouts/ 6. http://www.scs.carleton.ca/sivarama/org_book/
Lecture-wise Break-UP Ut Wk Lecture 1 Lecture 2 Lecture 3 Tutorial
1
1 Positional Numbering Systems, Converting Between Bases
Signed Integer Representation,
Floating-Point Representation,
Data Representation in Computer Systems
2 Fixed Point Addition and Subtraction, Fixed Point Multiplication and Division,
Floating Point Arithmetic,
High Performance Arithmetic Arithmetic
3 Boolean algebra, Boolean Expressions, Boolean Identities, Logic Gates, Digital Components,
Combinational Circuits, Sequential Circuits,
Karnaugh Maps Boolean algebra and Digital Logic
Ut Wk Lecture 1 Lecture 2 Lecture 3 Tutorial
2
4
Part 1 - Registers, Microoperations and Implementations, • Registers and load enable • Register transfer operations • Microoperations - arithmetic, logic, and shift • Microoperations on a single register Multiplexer-based transfers Shift registers
Part 2 - Counters, Register Cells, Buses, & Serial Operations
Part 3 – Control of Register Transfers
Register and Register transfer
5
Number of Addresses 3-Address Machines 2-Address Machines 1-Address Machines 0-Address Machines The Load/Store Architecture Processor Registers
Flow of Control Branching Procedure Calls Instruction Set Design - Issues Operand Types Addressing Modes Instruction Types Instruction Formats
Microprogrammed Control H/w Implementation S/w Implementation Performance Performance Metrics Execution Time -Calculation Means of -Performance The SPEC
Processor Organization and Performance
Benchmarks
6
Part 1 – Datapaths • Introduction • Datapath Example • Arithmetic Logic Unit (ALU) • Shifter • Datapath Representation and Control Word
Part 2 – A Simple Computer • Instruction Set Architecture (ISA) • Single-Cycle
Hardwired Control PC Function Instruction Decoder Example Instruction Execution
Computer Design Basics
Ut Wk Lecture 1 Lecture 2 Lecture 3 Tutorial
3
7 The Memory Hierarchy, Random Access Memory Memory Chip
Organization Memory 8 Case Study: Rambus
Memory, Cache Memory, Virtual Memory, Advanced Topics
9 Case Study: The Intel Pentium 4 Memory System
Ut Wk Lecture 1 Lecture 2 Lecture 3 Tutorial
4
9
Parallel Bus Architectures Bridge-Based Bus Architectures,,
Internal Communication Methodologies,
Buses and Peripherals 10
Case Study: Communication on the Intel Pentium Architecture,
Serial Bus Architectures, Mass Storage, RAID - Redundant Arrays of Inexpensive Disks,
Input Devices, Output Devices, Case Study: Graphics Processing Unit,
11 Case Study: How a Virus Infects a Machine
Ut Wk Lecture 1 Lecture 2 Lecture 3 Tutorial
5
11 The Compilation Process,
The Assembly Process,
Languages and the Machine 12 Quantitative Analyses of
Program Execution, Linking and Loading, Macros
From CISC to RISC, Pipelining the Datapath
13 Overlapping Register Windows, Low Power Coding
13 Computer Performance Equations,
Mathematical Preliminaries,
Performance Measurement and Analysis
14 Benchmarking, CPU Performance Optimization,
Disk Performance
CA-104P: COMPUTER SYSTEM DESIGN LAB
Lecture/ Session -wise Lab Plan
Week Lab Session ( Duration: 3 Hours) Week1 TTL Characteristics and TTL IC Gates Week2 Multiplexers & Decoders Week3 Flip-Flops: SR-ff, JK-ff, T-ff, D-ff Week4 Counters Week5 Shift Registers Week6 Binary Adders & Subtractors Week7 A L U Week8 (8086 Assembly Language Programming(ALP))
Write an ALP to evaluate the expressions: (i) a = b + c –d * e (ii) z = x * y + w – v +u / k a. Considering 8-bit, 16 bit and 32 bit binary numbers as b, c, d, e. b. Considering 2 digit, 4digit and 8 digit BCD numbers. Take the input in consecutive memory locations and results also. Display the results by using “int xx” of 8086. Validate program for the boundary conditions.
Week9 Write an ALP of 8086 to add two exponential numbers which are in IEEE
754 notation. Display the results by using “int xx” of 8086. Validate program for the boundary conditions.
Week10 Write an ALP of 8086 to take N numbers as input. And do the following operations on them. a) Arrange in ascending and descending order. b) Find max and minimum c) Find average Consider 8-bit, 16 bit binary numbers and 2 digit, 4digit and 8 digit BCD numbers. Display the results by using “int xx” of 8086. Validate program for the boundary conditions.
Week11 Write an ALP of 8086 to take a string of as input (in ‘C’ format) and do the following Operations on it. a) Find the length b) Find it is Palindrome or not c) Find whether given string substring or not. d) Reverse a string e) Concatenate by taking another sting Display the results by using “int xx” of 8086.
Week 12 Write an ALP of 8086 to find the factorial of a given number as a Procedure and call from the main program which display the result
Write a procedure to locate a character in a given string. When the first occurrence of the character is located, its position is returned to main. If no match is found, a negative value is returned. The main procedure requests a character string and a character to be located and displays the result.
Week13 Write an assembly language program to encrypt digits as shown below:
Input digit: 0 1 2 3 4 5 6 7 8 9
Encrypted digit: 4 6 9 5 0 3 1 8 7 2
Your program should accept a string consisting of digits. The encrypted string should be displayed using “int xx” of 8086.
Week14 Write an assembly language program to read a string of characters from the user and that prints the vowel count . Display the results by using “int xx” of 8086. For example: Input: Advanced Programming in UNIX
Out put: Vowel count a or A 3
e or E 1 i or I 3 o or O 1 u or U 1
REFERENCE BOOKS:
1. IBM PC Assembly Language and Programming, P. Abel, 5th Edition, PHI/Pearson Education.
2. Introduction To Assembly Language Programming, Sivarama P.Dandamudi, Springer Int. Edition,2003.
3. The 8088 and 8086 Microprocessors: Programming , Interfacing,Software,Hardware and Application,4th edition,W.A.Triebel,A.Singh,N.K.Srinath,Pearson Education
Web Resources :
1. http://etienne.ece.jhu.edu/etienne/teaching/ECE491/current/Lectures/chap5.pdf 2. http://www.eng.auburn.edu/~nelson/courses/elec3040_3050/ELEC3050%20HCS12%20Lab1.pdf
CA-105: ENERGY, ENVIRONMENT AND ECOLOGY 1. Work load per week
a. Lecture (L): 3 hrs/week Total Lecture Hours per Semester: 42
b. Tutorials (T): 1 Total Tutorial Hours per Semester: 14
c. Practicals (P): 0 Total Lab Hours per Semester: 0
d. Total Credits: L+T+P 04
e. One credit is defined as one lecture load per week and two hours of self-study to be connected with tutorial, practical work book and assignments.
2. Prerequisites of the course (a) Relation between human and nature (b) Effect of human activities on environment (c) Calculate the intensity of pollutants (d) Interaction between nature and human being (e) Chemistry of soil, air and water (f) Government legislation to control environmental pollution problem
3. Prerequisites of which next course: This course is prerequisite for :
• Environment Engineering-I & II. • Environmental Management for Industries. • Environmental Geo-technology. • Industrial pollution control & Environmental Audit
4. Objectives of the course
(a) Develop ability to understand interrelationship between human beings and nature. (b) Recognizing basic component of environment i.e. air, water and soil and ecology i.e. energy,
producers and decomposers. (c) Identify problem of pollution along its solution (d) Evaluate quantity and quality of natured resources and how natural resource can be available
for a long time. (e) Teach students how their activities support environment instead of degradation of environment
by anthropogenic activities. (f) Introduce students to upcoming environmental pollution control techniques.
5. Learning outcomes from this course
(a) To be able to plan and prepare suitable methods for the conservation of environmental segments.
(b) To be able to plan importance of sustainable developments i.e. appropriate use of natural resources.
(c) To be able to plan and prepare new techniques of development by reducing low rate consumption of natural resources through Environment Impact Assessment (EIA) process.
(d) To be able to understand role of individual NGO and Government for environment protection activities.
6. Details of the syllabi:
Unit Topic Text Book1 Page. No.
Lectures
I
Introduction: • Definition of environment.
• Need of public awareness.
• Segments of environment.
• Importance of Environment.
• Ecosystem- definition, classification and components.
• Function of ecosystem.
• Nitrogen and sulphur cycle.
(Text book-1 Chapter-1) (Text book-2, 1.3) (Text book-1,Chapter-2) (Text book-2, 1.4.4,1.4.5)
6
II
Sustainable Development: • Definition, principle, parameter and its challenges. • Biodiversity: classification, measurement and conservation. • Natural resources: availability & problems. • Minerals & Energy Resources • Seed suicide and sustainable agriculture.
Text book-1,chapter-5 (T.Book-2, Chapter-9) (T.Book-1,Chapter-7) (Text book-1,Chapter-8)
6
III
Energy: • Classification of energy resources. • Fossil fuels, nuclear and hydroelectric energy. • Solar, wind, biomass, biogas and hydrogen fuel energy.
Text book-1,chapter-8
4
IV
Pollution: • Environment pollution. • Water pollution, • Solid waste management & hazards waste management. • Current environmental issues • Problem with urbanization and automobile pollution and
their control. • Adverse effects of Pollution: Climate change; Green house
effect, Global warming, Acid rain and ozone layer depletion.
T.Book-1,Chapter-11 (T.Book-1,Chapter-12),T.Book-2,Ch.-7 T.book-1,Ch.-13 T.book-1,Ch.-18 T.BOOK-2,ch.-2
8
V
Environmental protection & Control Measures: • Government initiatives i.e. air, water and environmental
protection act. • Role of NGOs. • Environment Impact Assessment (EIA): definition,
methodology and process. • Environmental education: its principle and objectives. • Case Studies – Bhopal Gas Tragedy, London Smog. • Water Borne and water induce disease, arsenic problem in
drinking water
T.book-1,Ch.-20
6
Text Books
1. Environment Studies - R Rajagopalan, Oxford Publications.
2. Environmental Chemistry – A K De, New Age Publications.
Reference Books
1. Environment and Ecology – Smriti Srivastava, S K Kataria & Sons.
2. Environmental Science – G T Miller, Publisher – Thomson Asia, Singapore.
3. Environmental Change and Globalization: Double Exposures – Robin Leichenko and Karen
O’Brien, Oxford University Press.
4. Essential Environmental Studies – S P Mishra & S N Pandey, Ane Book Publications.
5. Principles of Environmental Science and Engineering by P Venugoplan Rao, Prentice Hall
of India.
6. Environmental Science and Engineering by Meenakshi, Prentice Hall of India.
7. Introduction to Environmental Science – Y Anjaneyulu, B S Publication.
8. Environmental Science – D B Botkin, E A Keller, Wiley, India.
9. Fundamentals of Ecology – E P Odum, Publisher – Thomson Asia, Singapore.
10. Basics of Environment & Ecology – Anubhava Kushik, New Age International
Publications.
11. Environmental Studies – Benny Joseph – Tata Mcgraw Hill.
12. Text book of Environment Science & Technology - M Anji Reddy, B S Publication.
13. Environmental Studies – S N Chary, Macmillan Publishers, India, Ltd.
14. Environmental Studies – B S Chauhan, University Science Press.
Internet Link:- (i) www.epa.gov (ii) www.unfcce.int (iii) www.unep.org (iv) www.cpcb.nic.in (v) www.environmental.ksc.nasa.gov
CA-106: PROFESSIONAL COMMUNICATION
1. Title of the course: PROFESSIONAL COMMUNICATION 2. Work load per week a. Tutorial(T): 1 hrs/week Total Tutorial Hours per Semester: 14
b. Practicals (P): 2 hrs/week Total Lab Hours per Semester: 28
c. Total Credits: T+P 2
Objectives of the course: To impart basic Communication skills to the first year UG students in the English language through rigorous practice and use of various category of common words and how their application in sentences; to enable them to achieve effective language proficiency for their social, professional & inter personal communication both in speaking & writing.
Desired Outcome of the Course: The student must be able to:
i) Understand and use about 1200 to 1500 General Purpose words of English language, ii) Express his /her ideas and thoughts in speech or writing, iii) Be able to comprehend, converse, interact and participate in any day-to-day events and
situation iv) Write grammatically correct sentences for various forms of written communication to
express oneself.
Key Concepts: Context of Communication, as means of sharing, Speaker- Listener and Writer – Reader relationship, medium of communication, barriers to communication, accuracy, brevity, clarity and appropriateness in communication.
Writing Skills: Words for general purpose use. Sentence formation and using given set of words. Transforming word usage for different tenses, using words for narrative in first, second & third person. Semantics of connectives, modifiers and models, sentence variety and paragraphs, Cohesion and coupling, structure of basic letters, reports & document preparation – introduction to conclusion. Referencing & listing of references.
Speaking Skills: Speech and verbal communication, articulation, paralinguistic’s, Pause and its use, formal and informal speaking, debate, extempore and discussion. Task oriented, personal and inter-personal communication.
Reading Comprehension: Kinds and types of texts, abstracting, précis writing and summarizing. Listening Comprehension: Fluency & speed, impact of pronunciation on comprehension, Intelligent listening,
Teaching methodology: 1.The Professional Communication course needs to equip the student for oral & written communication in English language and meeting the requirements of situational communication ability.
2. The teacher must teach the course through examples, practice sessions and even the lectures must be conducted in the tutorial mode.
3. The teacher must function as a mentor, guide and facilitator for the student to understand the words that have been identified for practice and their use in different situations be given as the assignment for the student to write and speak with one another.
4. The course has to be taught in small batches of 20 to 25 and in the language lab so that continuous and intense practice is recorded, and the track of the student’s progress is maintained on per lecture basis.
5. The Books suggested are as base texts and may be expanded upon for giving larger scope of practice to the students. It is important to promote self learning by asking the students to use the internet for finding language training material and content, which can then be used a classroom tasks.
Text Books & references: 1. Dorothy Adams, Michele Crawford, et et “ Everyday English- A course on Communicative
English” Level 1 & 2, Cengage India 2009. (with practice CD) 2. Bhaskar W. W. S. and Prabhu, N. S. “English Through Reading”. Vol I & II MacMillan,
1978. 3. D’Souza Eunice and Shaham, G. “Communication Skills in English”. Noble Publishing
House 1977. 4. Fiske , John “ Introduction to Communication Studies” Rotledge, London, 1990.
Performance Evaluation & Examination: The student will have to perform on per lecture basis and the peer to peer learning and evaluation method is to be used. However, since the students will be given class tests and assignments hence these will have to be corrected and marked by the teachers and the marks made public with formative feedback to the student explaining where the mistake is and what the correct ways to answer the questions are.
Assignments are to be given to reinforce the concepts and extend the practice of words and their usage by the student in different situations, tenses and accounts in first, second or third person.
The Course examination will be practical based and the student will have to be proficient to demonstrate the language capability as will be tested on the basis of question paper sent from the university.
SEMESTER-II
CA-201: COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES
L T P 3 1 2
Objectives: With the current deployment of computer technology and tools, it is very important to develop efficient algorithms for solving problems in science, engineering, technology, insurance and banking. Thus, the objective of this course is to enable students to obtain an intuitive and working understanding of numerical methods for the basic problems of numerical analysis and gain experience in the implementation of numerical methods using a computer. They would also gain an appreciation of the concept of error in these methods and the need to analyze and predict it. Knowledge of C/C++ and basic Mathematics Unit-I 8 Hours Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls of floating point representation. Errors in numerical computation. Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of convergence of iterative methods. Unit-II 8 Hours Finite differences and Interpolation: Finite Differences, Difference tables. Polynomial Interpolation: Newton’s forward and backward formula Central Difference Formulae: Gauss forward and backward formula, Sterling’s, Bessel’s, Everett’s formula. Lagrange’s Interpolation, Newton Divided difference formula, Hermit’s Interpolation for unequal intervals. Unit-III 8 Hours Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule Euler- Maclaurin Formula. Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill Conditioned system of equations, Refinement of solution. Gauss Jacobi and Gauss Seidel iterative methods, Rate of Convergence. Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge-Kutta methods, Predictor-corrector methods. Unit-IV 8 Hours Curve fitting, Approximations and Regression Analysis: Method of least squares, fitting of straight lines, polynomials, exponential curves etc. Approximation of functions by Chebyshev polynomials. Linear, Non-linear and Multiple regressions. Time series and forecasting: Moving averages, smoothening of curves, forecasting models and methods.
Unit-V 8 Hours Statistical methods: Sample distributions, Test of Significance: Chi-Square Test, t and F test. Analysis of Variance: Definition, Assumptions, One-way classification, ANOVA Table, Two-way classification. Text Books:
1. Rajaraman V., “Computer Oriented Numerical Methods”, PHI 2. Gerald & Wheatley, “Applied Numerical Analyses”, AW References:
1. Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering
Computations”, New Age Int. 2. Gupta S.P. and Kapoor, V.K., Fundamentals of Applied statistics, Sultan Chand
& Sons. 3. Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical Statistics, Sultan
Chand and Sons. CA-201P: COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES LAB
L T P 0 0 2 Write programs in C++
• To find out the roots of algebraic and transcendental equations using (1) Bisection (2) Newton Raphson (3) Iterative (4) Regula Falsie and (5) Secant methods. (Week 1 to Week 5)
• To implement Gauss elimination method for a system of linear equations. (Week 6)
• To implement Newton’s forward and backward interpolation formula. (Week 7 and Week 8)
• To implement Lagrange’s interpolation formula. (Week 9)
• To implement method of least square curve fitting. (Week 10)
• To implement linear regression. (Week 11)
• Implement numerical integration using Simpson's 1/3 and 3/8 rules, Trapezoidal rule, Boole’s and Weddle’s Rule. (Week 12 to Week 14)
CA-202: Computer Networks L T P 3 1 0
Learning Objective: • Develop practical networking knowledge and skills in a professional
environment. • Understand the organization of computer networks, factors influencing computer
network development and the reasons for having variety of different types of networks.
UNIT 1: Introduction 8 Hrs Goals and Applications of Networks, Network structure and architecture, the historical background of computer networks, type of networks and their classification on the basis of transmission technology (Broadcast, Point-to-point and Internet) and Scale (LAN, MAN, WAN), concepts of layering, an introduction of OSI layered architecture (Open System Interconnection Reference Model)., concept of service access points and information exchange between two peer layers, transmission media TB1-Ch2-3, TB2- Chapter 1 UNIT 2: Data Communication Fundamentals (Physical Layer) 8 Hrs Basic elements of communication such as data, signal and channel characteristics, Signal Representation (Time & frequency), Channel characterstics (Bandwidth, Bit interval, Bit rate etc), various sources of impairments (attenuation, distortion and noise), concept of channel capacity, , transmission of digital signals-Encoding of digital data (uni polar, polar, and bipolar and block coding techniques),, encoding of analog data (PCM, delta Modulation), Transmission of analog signal- Analog/ digital data to analog signal conversion(amplitude, pulse and frequency modulation),multiplexing techniques. TB3- Ch3-5, TB1- 4-5, TB3-Ch8 UNIT 3: Data Link control, Switched /Broadcast Communication Networks 8 Hrs Framing and synchronization, Error control technique(detection and error correction), flow control , Medium Access Control Techniques, IEEE LAN standards, HDLC, switching techniques- circuit switching( PSTN as special case), switching techniques- circuit switching( PSTN as special case)message switching, packet switching (X.25 and Frame Relay) and virtual circuit switching- ATM TB1 – Ch 9,10, TB3-Ch 6,7
Unit 4: Network Layer, Transport Layer and Internetworking 8 Hrs Internetworking devices such as repeater/hub, bridge, router and gateway, TCP/IP protocol suite, IP addressing and subletting, various protocols at the IP layer- ARP, RARP, ICMP, IGMP, Routing and congestion control, Transport Layer –Design Issues , Connection management, Unreliable Connectionless Transfer: UDP, reliable Connectionless Transfer: TCP TB1-Ch 21-22,24, TB2-Ch6 Unit 5 : Network Security and Application layer 8 Hrs Application layer protocols such as HTTP, Electronic mail, File transfer, DNS, WWWand Remote login, cryptography –introduction and basic principles, Substitution cipher, transposition cipher , symmetric- Key Algorithms – DES, AES, Public key Algorithms- RSA, digital Signature, Communication security- IPSec, Firewall, VPN TB2-Ch7 , 8
Lecture-wise Break-up
Week Lecture 1 Chapter Lecture 2 Chapter
Lecture 3 Chapter
Tutorial Week- 1
Goals and Applications of Networks
TB1-Ch2-3, TB2- Chapter 1
Network
structure and architecture
TB1-Ch2-3, TB2- Chapter 1
The historical background of
computer networks
TB1-Ch2-3, TB2- Chapter 1
Week- 2
Type of
networks and their
classification on the basis
of transmission technology (Broadcast,
Point-to-point
TB1-Ch2-3, TB2- Chapter 1
Scale (LAN, MAN, WAN)
TB1-Ch2-3, TB2- Chapter 1
Concepts of layering, an
introduction of OSI layered architecture
(Open System Interconnection Reference
Model)
TB1-Ch2-3, TB2- Chapter 1
Week- 3 Concept of
service access points and information exchange between two peer
TB1-Ch2-3, TB2- Chapter 1
Transmission
media
TB1-Ch2-3, TB2- Chapter 1
Basic elements
of communication such as data,
signal and channel
characteristics
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Week- 4
Signal
Representation (Time & frequency)
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Channel characterstics (Bandwidth, Bit interval, Bit rate etc)
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Various
sources of impairments (attenuation, distortion and
noise)
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Week- 5
Concept of
channel capacity,
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Transmission
of digital signals-
Encoding of digital data (uni polar, polar, and
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Transmission
of analog signal-
Analog/ digital data to analog
signal conversion(am
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Week- 6
Multiplexing techniques
TB3- Ch3-5, TB1- 4-5, TB3-Ch8
Framing and synchronization
TB1 – Ch 9,10, TB3-Ch 6,7
, Error Control
techniques (detection and error
correction)
TB1 – Ch 9,10, TB3-Ch 6,7
Week- 7
Flow control
TB1 – Ch 9,10, TB3-Ch 6,7
Medium Access Control Techniques
TB1 – Ch 9,10, TB3-Ch 6,7
IEEE LAN standards
TB1 – Ch 9,10, TB3-Ch 6,7
Week- 8
HDLC
TB1 – Ch 9,10, TB3-Ch 6,7
Switching
techniques- circuit
switching( PSTN as
special case)
TB1 – Ch 9,10, TB3-Ch 6,7
Message
switching, packet
switching (X.25 and
Frame Relay)
TB1 – Ch 9,10, TB3-Ch 6,7
Week- 9
Virtual circuit switching- ATM
TB1 – Ch 9,10, TB3-Ch 6,7
, Internetworking devices such as repeater/hub, bridge,
Internetworking devices such as router and gateway
Week- 10
TCP/IP protocol suite
TB1-Ch 21-22,24, TB2-Ch6
IP addressing and subletting
TB1-Ch 21-22,24, TB2-Ch6
Various protocols at the IP layer- ARP, RARP, ICMP, IGMP
TB1-Ch 21-22,24, TB2-Ch6
Week- 11
Routing and congestion
control
TB1-Ch 21-22,24, TB2-Ch6
Transport Layer –Design Issues
TB1-Ch 21-22,24, TB2-Ch6
Connection management
TB1-Ch 21-22,24, TB2-Ch6
Week- 12
Unreliable
Connectionless Transfer:
UDP
TB1-Ch 21-22,24, TB2-Ch6
Reliable Connectionless Transfer: TCP
TB1-Ch 21-22,24, TB2-Ch6
Application
layer protocols such as HTTP,
Electronic mail
TB2-Ch7 , 8
Week- 13
File transfer, DNS WWWand Remote login
TB2-Ch7 , 8
Cryptography –introduction
and basic principles
TB2-Ch7 , 8
Substitution cipher, transposition cipher
TB2-Ch7 , 8
Week- 14
Symmetric- Key Algorithms – DES, AES
TB2-Ch7 , 8
Public key Algorithms- RSA, digital Signature
TB2-Ch7 , 8
Communication security- IPSec, Firewall, VPN
TB2-Ch7 , 8
Text Books : 1. Forouzen, "Data Communication and Networking", TMH 2. A.S. Tanenbaum, Computer Networks, Pearson Education 3. W. Stallings, Data and Computer Communication, Macmillan Press Reference Books:
1. ISRD Group, , “data communication and computer networks”, TMH 2. S. Kashav, “ An Engineering Approach To Computer Networking”, Pearson
Education
Web-links for tutorials/resources: to be added http://nptel.iitm.ac.in/courses/Webcoursecontents/IIT%20Kharagpur/Computer%20networks/New_index1.html http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/osi_prot.htm http://www.wildpackets.com/compendium/IP/L1-IP.html
CA-203: FUNDAMENTALS OF E-COMMERCE L T P 3 1 0 PREREQUISITES There are no prerequisites in terms of courses to attend. Students should be familiar with notions of traditional business and usages of Internet OBJECTIVES:
• The objective of this course are: • This course aims to give students an in-depth understanding of ecommerce. • It is hoped that the knowledge would enhance the expertise of students in e-
commerce and the various concepts associated with it. • Students will be equipped with definitions of common terms, characteristics and
applications of e-commerce systems. • Students will also learn about scope of traditional business over Web using
ecommerce. • Students will aware about the security concerns in implementing E-commerce.
LEARNING OUTCOME Theories, Techniques, Case Studies introduced in this course will come in handy for courses Online Business Methodology, Information security, Web Technologies. Unit 1 Introduction: Electronic Commerce - Technology and Prospects, Definition of E- Commerce, Category of E-Commerce applications( Electronic Market, Electronic Data Interchange, (EDI), Internet Commerce), Electronic Commerce and Trade Cycle, Economic potential of electronic commerce, Incentives for engaging in electronic commerce, forces behind E-Commerce, Advantages and Disadvantages of EC, Limitations of Electronic Commerce, E-Business, Architectural framework of EC, Impact of E-commerce on business, E-Commerce Business model.
[TB1, TB2, TB5] Unit II Network Infrastructure for E- Commerce: Internet and Intranet based E-commerce-Issues, problems and prospects, Components of I-way, Network Access Equipments, Broadband telecommunication (ATM, ISDN, FRAME RELAY). Internet and World Wide Web: An overview of basic network architecture of Internet, layered architecture (Link, Network, Transport, Application layer), Next generation Internet features (IPV6). Web: Brief history of Web, Web system Architecture, URL, Overview of HTTP. Mobile Commerce: Introduction of M-Commerce, Mobile Computing Devices, Mobile Computing Software, Wireless Application Protocol, WAP technology.
[TB1, TB3, TB5] Unit III Web Security: Security Issues on web, Categories of Internet Data and Transaction (public, copyright, confidential, secret data), WWW based security schemes (Secure HTTP, SSL), Firewall, Importance of Firewall, Different Types of Firewall (Packet filtering, Application / proxy gateway, Circuit level gateway), Limitations of Firewall, Security concerns in E-
Commerce (Client-Server, Data and Transaction security), Difference security threats, attacks and security schemes.
[TB1, TB4, TB3] Unit IV Cryptography: Introduction to Cryptography and its need in EC, Simplified model of conventional Encryption, Encryption techniques: Symmetric Encryption- Data Encryption Standard, Triple DES, Asymmetric Encryption- Secret key encryption, public and private pair key encryption, Digital Signatures, Certificate Authority, Digital Certificate, Message Digest.
[TB1, TB4, TB5] Unit V Electronic Payments: Overview, The SET protocol, SET network architecture, categories of EPS, Digital token based EPS, e-cash, e-check, Smart Card, Credit / Debit Card based EPS, Online banking and impact of EC over CRM, SCM, Virtual Private Network.
[TB3, TB4] Text Books: 1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addis 2. David Whiteley, “e-commerce, Strategy, Technology and Application”, TMH 3. Henry Chan, Raymond Lee, “E-commerce fundamentals and application”, Wiley student edition 4. Bharat Bhaskar, “Electronic commerce framework, Technologies and Application”, TMH 5. Efraim Turban, JaeLee, “Electronic Commerce A Managerial Perspective”, Pearson Web-links for tutorials/resources: to be added http://www.ias.ac.in/resonance/Oct2000/pdf/Oct2000p13-23.pdf http://www.sts.tu-harburg.de/~r.f.moeller/lectures/ec-ws-05-06/ECommerce01.pdf http://www2.sta.uwi.edu/~anikov/comp6350/questions.pdf http://www.sagepub.com/upm-data/9598_019964Ch1.pdf http://www.gurukpo.com/admin/bookpdf/195.pdf http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/System%20Analysis%20and%20Design/pdf/ Lecture_Notes/LNm13.pdf http://cs.wellesley.edu/~ecom/notes.html http://www.cybermanagement.com/ http://swat.cse.lehigh.edu/pubs/yang09a.pdf http://www.robabdul.com/case-study.asp
Lecture wise Break –UP Week Lecture 1 Lecture 2 Lecture3 Tutorial Week 1 Electronic
Commerce - Technology and Prospects, Definition of E- Commerce,
Category of E-Commerce applications( Electronic Market,
Electronic Data Interchange, (EDI), Internet Commerce), Electronic Commerce and Trade Cycle.
Case Study: 1. Traditional Trade Cycle 2. Embedded System: Mother Dairy Milk Scheme Automated Teller Machine
Week 2 Economic potential of electronic commerce, Incentives for engaging in electronic commerce,
forces behind E-Commerce, Advantages and Disadvantages of EC, Limitations of Electronic Commerce
E-Business, Architectural framework of EC, Impact of E-commerce on business, E-Commerce Business model,
Case Study: 1. Current Indian Economy 2. Business model based on Amazon.com / ebay.com
Week 3 Network Infrastructure for E- Commerce: Internet and Intranet based E-commerce-Issues, problems and prospects,
Components of I-way, Network Access Equipments, Broadband telecommunication (ATM, ISDN, FRAME RELAY).
Internet and World Wide Web: An overview of basic network architecture of Internet,
Case Study: 1. Wi-Fi connectivity 2. Optical Fiber 3. Set-Top Box
Week 4 Layered architecture (Link, Network, Transport, Application layer), Next generation Internet features (IPV6).
Web: Brief history of Web, Web system Architecture, URL, Overview of HTTP.
Mobile Commerce: Introduction of M-Commerce, Mobile Computing Devices, Mobile Computing Software,
Case Study: 1. Understanding WWW consortium 2. Mobile communication architecture.
Week 5 Wireless Application Protocol, WAP technology.
Web Security: Security Issues on web, Categories of Internet Data and Transaction (public, copyright, confidential, secret data),
WWW based security schemes (Secure HTTP, SSL), Firewall, Importance of Firewall,
Case Study: 1. Understanding CISCO Firewall 2. Understanding Proxy Servers
Week 6 Different Types of Security Difference Case Study:
Firewall (Packet filtering, Application / proxy gateway, Circuit level gateway), Limitations of Firewall,
concerns in E-Commerce (Client-Server, Data and Transaction security),
security threats, attacks and security schemes.
1. Security through firewall 2. Security over hardware 3. Security over databases
Week 7 Cryptography: Introduction to Cryptography and its need in EC,
Simplified model of conventional Encryption, Introduction of Encryption techniques
Encryption techniques: Symmetric Encryption- Data Encryption Standard,
Case Study: 1. Data encryption algorithm 2. Data Security in Banking System
Week 8 Triple DES, Asymmetric Encryption- Secret key encryption,
public and private pair key encryption, Digital Signatures,
Certificate Authority, Digital Certificate, Message Digest.
Case Study: 1. Secured data transaction through Web 2. Different Certificate Authorities- Paypal / GoDaddy
Week 9 Electronic Payments: Overview,
The SET protocol, SET network architecture,
categories of EPS, Digital token based EPS
Case Study: 1. Online Transactions in banking: any banking system
Week 10 e-cash, e-check, Smart Card, Credit / Debit Card based EPS
Online banking and impact of EC over CRM
SCM, Virtual Private Network.
Case Study: 1. Functioning of Credit / Debit Card 2. Customer service in E –Commerce 3. Understanding Logistics like Blue-Dart / DTDC
CA-204: DATA STRUCTURES AND FILE HANDLING L T P 3 1 3
PREREQUISITES Students should be familiar with procedural language like C and concepts of mathematics OBJECTIVES The objectives of this course are:
• To develop expertise in the specification, representation, and implementation of Data types and Data Structures.
• To be familiar with basic techniques of algorithm analysis. • To be familiar with writing recursive methods. • To get a good understanding of applications of Data Structures. • To develop a base for advanced computer science study.
LEARNING OUTCOME Concepts introduced in this course will help students to:
• be familiar with the complexity of algorithms and understanding their performance issues.
• be aware of the importance of correctness for algorithms. • be familiar with trees and their applications. • be familiar with graphs and their applications. • be familiar with hash tables, lists and other commonly used data structures and thus
will be able to choose an appropriate data structure for a given application. • be able to write better, more correct programs through understanding rather than trial-
and-error. • be able to apply their knowledge of data structures to write more efficient programs in C.
Unit -I 8 Hrs
Introduction and overview: Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-Space trade-off.
(Text Book1:chpt1)
Arrays: Ordered List, Linear and Multidimensional Arrays, Representations of Array, Operations on Array: Traversal, Insertion, Deletion, Sorting, Searching: Linear Search, Binary Search, Sparse Matrix . (Text Book1:chpt4, Text Book 3:chpt2)
Stacks: Definition and operations, Representations of stack, Operations on Stack: Push and Pop, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Implementation of Multiple stacks.
(Text Book1:chpt6, Text Book 2:chpt3, Text Book 3:chpt3)
Recursion: Recursive definition, Divide and Conquer, The Tower of Hanoi, Principles of Recursion: Guidelines for using Recursion, How Recursion works, Tail Recursion, When not to use Recursion.
(Text Book 2:chpt8)
Unit - II 8 Hrs
Queues: Representations of queues, Operations on Queue: Create, Add, Delete, Full and Empty. Implementation of Multiple queues, Circular queue, Dequeue and Priority Queue.
(Text Book 1:chpt6, Text Book 2:chpt3,4, Text Book 3:chpt3)
Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction.
(Text Book 1:chpt5, Text Book 2:chpt4, Text Book 3:chpt4)
Unit - III 8 Hrs
Trees: Basic terminology, Binary Trees, Binary tree representation, Complete Binary Tree. Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded Binary trees, Huffman algorithm. (Text Book 1:chpt7, Text Book 2:chpt9, Text Book 3:chpt5)
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-trees.
(Text Book 1:chpt7, Text Book 2:chpt9)
Unit ‐ IV 8 Hrs
Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.
(Text Book 1:chpt9, Text Book 2:chpt5, 6, Text Book 3:chpt9)
Sorting: Insertion Sort, Selection Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for Internal Sorting.
(Text Book 3:chpt7)
Unit - V 8 Hrs Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.
(Text Book 1:chpt8, Text Book 3:chpt8)
File: File, Queries and Sequential organizations, Index Technique: Primary, secondary and hash indexing, B Tree index files, B+ Tree index files, File organization: sequential, random and linked organization.
(Text Book 3:chpt10)
References Text Books
1. S. Lipschutz, “Data Structures”, Mc-Graw Hill International Editions. 2. Robert L Kruse, Bruce P. Leung, Clovis L. Tondo, “Data Structure and Program Design in
C”, PHI. 3. Ellis Horowitz, S. Sahni, D. Mehta, “Fundamentals of Data Structures in C++”, Galgotia
Book Source, New Delhi. Reference Books
1. Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and C++”, Pearson Education Asia.
2. Jean-Paul Tremblay, Paul. G. Soresan, “An introduction to data structures with Applications”, Tata Mc-Graw Hill International Editions.
3. Elmasri, Navathe, ”Fundamental of Database systems”, Pearson Education.
A few web-links for tutorials/resources: WWW.funducode.com http://www.nptel.iitm.ac.in/video.php?subjectId=106102064 http://www.cs.auckland.ac.nz/~jmor159/PLDS210/ppt/index.html Lecture wise break-UP
Week Lecture 1 Chapter
Lecture 2 Chapter
Lecture 3 Chapter Lab Meeting (CA204P)
Week-1
Introduction and overview: Basic Terminology, Elementary Data Organization, Data Structure operations
Ch-1, TB1
Algorithm Complexity and Time-Space trade-off.
Ch-1, TB1
Arrays: Ordered List, Linear and Multidimensional Arrays, Representations of Array
Ch-4, TB1/App3
Get familiar with various terminologies Used in data structures and data organization
Week-2
Operations on Array: Traversal, Insertion, Deletion
Ch-4, TB1 /Ch-2, TB3
Sorting, Searching and Sparse Matrix.
Ch-4, TB1 /Ch-2, TB3
Stacks: Definition and operations, Representations of stack, Operations on Stack: Push and Pop
Ch-6, TB1/Ch-3,TB2/ Ch-3/TB3
Array Operations and Stack Operations using array
Week-3
Application of stack: Conversion of Infix to Prefix and Postfix Expressions
Ch-6, TB1/Ch-3,TB2/ Ch-3/TB3
Evaluation of postfix expression using stack. Implementation of Multiple stacks
Ch-6, TB1/Ch-3,TB2/ Ch-3/TB3
Recursion: Recursive definition, Divide and Conquer, The Tower of Hanoi
Ch-8, TB2
Evaluation of Expressions
Week-4
Principles of Recursion: Guidelines for using Recursion, How Recursion works, Tail Recursion, When not to use Recursion
Ch-8, TB2
Queues: Representations of queues, Operations on Queue: Create, Add, Delete, Full and Empty
Ch-6, TB1/ Ch-3,4, TB2/ Ch-3, TB3
Circular queue Ch-6, TB1/ Ch-3,4, TB2/ Ch-3, TB3
Recursion, Queue Operations
Week-5
Implementation of Multiple queues, Dequeue and Priority Queue
Ch-6, TB1/ Ch-3,4, TB2/ Ch-3, TB3
Linked list: Representation and Implementation of Singly Linked Lists, Traversing and Searching of Linked List
Ch-5, TB1/ Ch-4, TB2/ Ch-4, TB3
Overflow and Underflow, Insertion and deletion to/from single Linked Lists
Ch-5, TB1/ Ch-4, TB2/ Ch-4, TB3
Single Linked List
Week-6
Doubly linked list, Linked List in Array
Ch-5, TB1/ Ch-4, TB2/ Ch-4, TB3
Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction
Ch-5, TB1/ Ch-4, TB2/ Ch-4, TB3
Trees: Basic terminology, Binary Trees, Binary tree representation, Complete Binary Tree. Extended Binary Trees
Ch-7, TB1/ Ch-9, TB2/ Ch-5, TB3
Double Linked List and applications
Week-7
Array and Linked Representation of Binary trees, Traversing Binary trees
Ch-7, TB1/ Ch-9, TB2/ Ch-5, TB3
Threaded Binary trees. Traversing Threaded Binary trees
Ch-7, TB1/ Ch-9, TB2/ Ch-5, TB3
Huffman algorithm
Ch-7, TB1/ Ch-9, TB2/ Ch-5, TB3
Binary Tree
Week-8
Binary Search Tree (BST), Insertion in BST
Ch-7, TB1/ Ch-9, TB2
Deletion in BST, Complexity of Search Algorithm
Ch-7, TB1/ Ch-9, TB2
Path Length Ch-7, TB1/ Ch-9, TB2
Binary Search Tree
Week-9
AVL Trees Ch-7, TB1/ Ch-9, TB2
B-trees Ch-7, TB1/ Ch-9, TB2
Sequential search, binary search,
Ch-9, TB1/ Ch-5,6, TB2/ Ch-9, Tb3
Height Balance Tree and Searching
Week-10
comparison and analysis of Searching
Ch-9, TB1/ Ch-5,6, TB2/ Ch-9, Tb3
Hashing, Collision Resolution Strategies
Ch-9, TB1/ Ch-5,6, TB2/ Ch-9, Tb3
Hash Table Implementation
Ch-9, TB1/ Ch-5,6, TB2/ Ch-9, Tb3
Searching comparison and Hash table implementation
Week-11
Sorting Ch-7, TB3
Sorting Ch-7, TB3
Sorting Ch-7, TB3
Various Sorting approaches
Week-12
Graphs: Terminology
Ch-8, TB1/
Directed Graph,
Ch-8, TB1/
Graph Traversal,
Ch-8, TB1/
Graph representatio
& Representations
Ch-8, TB3
Adjacency Matrix
Ch-8, TB3
Connected Component and Spanning Trees
Ch-8, TB3
n And traversal
Week-13
Minimum Cost Spanning Trees
Ch-8, TB1/ Ch-8, TB3
File, Queries and Sequential organizations
Ch-10, TB3
Primary , secondary and hash indexing
Ch-10, TB3
MST implementation
Week-14
B Tree index files
Ch-10, TB3
B+ Tree index files
Ch-10, TB3
File organization: sequential, random and linked organization
Ch-10, TB3
B Tree
CA 205: Object Oriented Systems and Programming with C++ L T P 3 1 3
PREREQUISITES Students should be familiar with the basic discipline and the idea behind each of the main programming paradigms. OBJECTIVES The objectives of this course are:
• To understand and express the essential and interesting features of an application in the complex real world, an object-oriented model is built around.
• Familiarize with the development artifacts of object oriented systems. • Understand the principals of objects encapsulation, inheritance, and
polymorphism that form the foundation for object-oriented systems development.
• Familiarize with object oriented programming environment. The programming language specified is C++ that is one of the standard programming languages used in the industry and also forms the base of all object oriented languages.
• Introduction to the basic concepts of object oriented modeling. • To be familiar with the Unified Modeling Language (UML).It is an object-
oriented language for specifying, visualizing, constructing, and documenting the artifacts of software systems, as well as for business modeling.
LEARNING OUTCOME
• Develop an understanding of Object Oriented Systems. • Develop hands on expertise in C++.
Unit – I Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, metadata, candidate keys, constraints. (Text Book 2-chpt3, 4, 5, Text Book 1-chpt 1, 2,3) Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model. (Text Book 1-chpt 5) Unit – II Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model. OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparison of methodologies: OMT with SA/SD, JSD. (Text Book 1-chpt 6, Text Book 2-chpt 16) Unit – III Modeling with UML: UML terminology, Introduction of Things, Relationships and Diagrams of UML. (Ref. Book 1 chpt 9)
Testing Object Oriented Systems: Introduction, State Based testing. (Ref. Book 2, chpt 9) Unit – IV Introduction: History of C++, Advantage, Need, C++ Program Structure. Classes and objects: Class and Objects Creation, Constructors and Destructors, Access Specifiers, Inline Functions, Default Function Arguments, Static keyword, Function overloading Arrays as Class Member. Arrays of Object. String. The Standard C++ String Class. Operator Overloading: Overloading Unary Operators. Overloading. Binary Operators. Friend Functions, Friend Classes, Pointers and Class Objects: This Pointer, Pointers to objects, Memory Management: New and Delete, Garbage collection Inheritance: Concepts, Access Modifiers, Inheritance Types. (Text book 3, Text Book4) Unit – V Polymorphism Concepts: Virtual methods, Compile time Polymorphism, Run time Polymorphism. Streams and File I/O File streams, Streams with file handling, String streams, Built-in streams. Templates and Exceptions: Function Templates, Class Templates, Exceptions, throw () and catch (), The Standard Template Library: Introduction Algorithms, Sequence Containers, Iteators, Specialized Iteators, Associative Containers, Storing User- Defined Object, Function Objects. (Text Book 3, Text Book 4) Text Books: 1. James Rumbaugh etal, “Object Oriented Modeling and Design”, PHI 2. Ivar Jacobson etal, “Object Oriented Software Engineering: A Use Case Driven Approach”, Pearson Education 3. E. Balagurusamy, “Object Oriented Programming with C++”, TMH 4. Robert Lafore, “Object Oriented Programming in C++”, Techmedia Publication. References:
1. Atul Kahate, “Object Oriented Analysis & Design”, TMH. 2. Yogesh Singh, Ruchika Malhotra,”Object Oriented Software Engineering”, PHI. 3. Herbert Sehlidt, “The Complete Reference c++”, TMH.
4. Schaum's Outline of Programming with C++, TMH. Web References: http://www.amazon.com/Case-Driven-Object-Modeling-Addison-Wesley/dp/0201432897 http://nptel.iitm.ac.in/courses/Webcoursecontents/IIScBANG/System%20Analysis%20and%20Design/pdf/PPTs/mod9.pdf Lecture wise break-up Week Lecture 1 Chapter Lecture2 Chapter Lecture 3 Chapter
Lab Meeting (CA205P)
Week-1
Object Modeling Objects and classes
Text Book2 Ch-1,2
links and association
Text Book2 Ch-1,2
generalization and inheritance
Text Book1 CH 1,2,3
Study of Use Case Diagram
Week-2
aggregation, abstract class
Text Book1 CH 1,2,3
multiple inheritance, metadata, candidate keys, constraints
Text Book 1 CH 1,2,3 Text Book 2 CH3, 4, 5
Dynamic Modeling: Events and states, operations, nested state diagrams and
Text Book1 CH 5
Study of Class Diagram
concurrency
Week-3
advanced dynamic modeling concepts
Text Book1 CH 5
advanced dynamic modeling concepts
Text Book 1 CH 5
A sample dynamic model
Text Book1 CH 5
Study of Activity Diagram
Functional Modeling: Data flow diagram
Text Book1 CH6, Text Book2 CH16
Functional Modeling: Data flow diagram
Text Book 1 CH6, Text Book2 CH 16
Specifying operations, constraints, a sample functional model.
Text Book1 CH6, Text Book2 CH 16
Study of Sequence Diagram
Week-5
OMT (object modeling techniques) methodologies
Text Book1 CH6, Text Book 2 CH 16
OMT (object modeling techniques) methodologies
Text Book 1 CH 6 Text Book 2 CH 16
OMT (object modeling techniques) methodologies
Text Book1 CH6, Text Book2 CH 16
Study of State chart Diagram
Week-6
Examples and case studies to demonstrate methodologies, comparison of methodologies: OMT with SA/SD, JSD.
Text Book1 CH6, Text Book2 CH16 (refer to web references)
Examples and case studies to demonstrate methodologies, comparison of methodologies: OMT with SA/SD, JSD.
Text Book1 CH6, Text Book2 CH16 (refer to web references)
Modeling with UML: UML terminology,
Ref. Book1 CH 9
Case Studies
Week-7 UML terminology Ch-9
Ref: Book1
Relationships and Diagrams of UML.
Ch-9 Ref: Book1
Introduction of Things
Ch-9 Ref: Book1
Case Studies
Week-8
Testing Object Oriented Systems: Introduction, State Based testing
Ref. Book 2, CH 9
Testing Object Oriented Systems: Introduction, State Based testing
Ref. Book2, CH 9
Testing Object Oriented Systems: Introduction, State Based testing
Ref. Book 2, CH 9
Case Studies
Week-9
Introduction: History of C++, Advantage, Need, C++ Program Structure
Text Book 4 CH-1
Classes and objects: Class and Objects Creation
Text Book3 CH-5, Text Book 4 CH-6
Constructors and Destructors, Access Specifiers,
Text Book3 CH6, Text Book4 CH-6
Creating Classes, Constructors ,Destructors & Access Specifier
Week-10
Inline Functions, Default Function Arguments
Text Book3 CH-4,Text Book4 CH-13
Static keyword, Function overloading Arrays as Class Member
Text Book4 CH-11
Arrays of Object
Text Book4 CH-7
Inline functions, Static Keyword, Arrays of objects
Week-11
String. The Standard C++ String Class.
Text Book3 CH-15
Overloading Unary Operators. Overloading. Binary Operators
Text Book3 CH-7, Text Book4 CH-8.
Friend Functions, Friend Classes
Text Book 4 CH-11
Overloading and Friend Keyword
Week-12
Pointers and Class Objects: This Pointer,
Text Book3 CH-9
Pointers to objects Memory Management: New and Delete, Garbage collection
Text Book3 CH-9.
Inheritance: Concepts, Access Modifiers, Inheritance Types.
Text Book3 CH-8
Pointers and Inheritance
Week-13
Polymorphism Concepts: Virtual methods, Compile time Polymorphism, Run time Polymorphism
Text Book 3 CH-9
Streams and File I/O File streams, Streams with file handling, String streams, Built-in streams
Text Book3 CH-10,11
. Streams and File I/O File streams, Streams with file handling, String streams, Built-in streams
Text Book3 CH-10,11
Polymorphism and File Handling
Week-14
Templates and Exceptions: Function Templates, Class Templates, Exceptions, throw () and catch (),
Text Book3 CH-12,13
The Standard Template Library: Introduction Algorithms, Sequence Containers, Iteators, Specialized Iteators
Text Book3 CH-14. Text Book CH-15.
Associative Containers, Storing User- Defined Object, Function Objects.
Text Book3 CH-14. Text Book4 CH-15.
Templates and Exception Handling
(1)
U.P. TECHNICAL UNIVERSITY LUCKNOW
Syllabus
2nd year [III & IV Sem.]
[Effective from the session : 2009-10]
MASTER OF COMPUTER APPLICATION
(2)
U.P.TECHNICAL UNIVERSITY, LUCKNOW
STUDY AND EVALUATION SCHEME MCA (Master of Computer Application)
(Effective from the session: 2009-10) MCA YEAR II, SEMESTER –III
EVALUATION SCHEME PERIODS SESSIONAL EXAM S.
No. COURSE
CODE SUBJECT L T P CT TA Total ESE Subject
Total 1. MCA-311 Operating Systems 3 1 0 30 20 50 100 150
2. MCA-312 Design & Analysis of Algorithms 3 1 0 30 20 50 100 150 3. MCA-313 Data base Management System 3 1 0 30 20 50 100 150 4. MCA-314 Internet & Java Programming 3 1 0 30 20 50 100 150
5. MCA-315 Computer Based Optimization Techniques
3 1 0 30 20 50 100 150
PARCTICALS 6. MCA-351 DBMS Lab 0 0 3 30 20 50 50 100 7. MCA-352 Java Programming Lab 0 0 3 30 20 50 50 100 8. GP-301 General Proficiency 0 0 0 - - 50 - 50 Total 15 5 6 - - - - 1000
YEAR – II, SEMESTER – IV
EVALUATION SCHEME PERIODS SESSIONAL EXAM
S. No.
COURSE CODE
SUBJECT L T P CT TA Total ESE Subject
Total 1 MCA-411 Management Information Systems 3 1 0 30 20 50 100 150 2 MCA-412 Object Oriented Systems 3 1 0 30 20 50 100 150 3 Elective-I 3 1 0 30 20 50 100 150 4 MCA-413 Fundamentals of E-Commerce 3 1 0 30 20 50 100 150 5 MCA-414 Computer Networks 3 1 0 30 20 50 100 150 PRACTICALS 6 MCA-451 Object Oriented Systems Lab 0 0 3 30 20 50 50 100 7 MCA-452 Mini Project 0 0 3 30 20 50 50 100 8 GP-401 General Proficiency 0 0 0 - - 50 - 50
Total 15 5 6 1000 Code List of Elective-I MCAE11 Compiler Design MCAE12 Client Server Computing MCAE13 Data Warehousing & Mining MCAE14 Cryptography & Network Security MCAE15 Theory of Automata & Formal Languages MCAE16 Distributed system
(3)
U.P.TECHNICAL UNIVERSITY, LUCKNOW
STUDY AND EVALUATION SCHEME MCA (Master of Computer Application)
(Effective from the session: 2010-11) MCA YEAR III, SEMESTER – V
EVALUATION SCHEME PERIODS SESSIONAL EXAM S.
No. COURSE
CODE SUBJECT L T P CT TA Total ESE Subject
Total 1. MCA-511 WEB Technology 3 1 0 30 20 50 100 150
2. Elective-II
3 1 0 30 20 50 100 150
3. MCA-512 Dot Net Framework & C# 3 1 0 30 20 50 100 150 4. MCA-513 Software Engineering 3 1 0 30 20 50 100 150
5. Elective-III
3 1 0 30 20 50 100 150
PARCTICALS 6. MCA-551 WEB Technology Lab 0 0 3 30 20 50 50 100 7. MCA-552 Dot Net Lab 0 0 3 30 20 50 50 100 8. GP-501 General Proficiency 0 0 0 - - 50 - 50 Total 15 5 6 1000 List Elective-II MCAE21 Computer Graphics & Animation MCAE22 Simulation & Modelling MCAE23 Advance Database Management Systems MCAE24 Artificial Intelligence MCAE25 Information Security & Cyber Laws MCAE26 Information Storage & Management List Elective-III MCAE31 ERP Systems MCAE32 Software Project Management MCAE33 Real Time Systems MCAE34 Mobile Computing MCAE35 Neural Networks MCAE36 Pattern Recognition
YEAR –III, SEMESTER – VI EVALUATION SCHEME
PERIODS SESSIONAL EXAM S. No.
COURSE CODE
SUBJECT L T P CT TA Total ESE Subject
Total 1 MCA-611 Colloquim 0 0 3 - 200 200 - 200 2 MCA-612 Project 0 0 4 - 300 300 500 800
Total 1000
(4)
L T P 3 1 0
OPERATING SYSTEMS MCA 311
Unit-I Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. Unit-II Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation. Unit-III Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. Unit-IV Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging in MULTICS and Intel 386, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability. Unit-V Security & Case Study: Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption. Windows NT-Design principles, System components, Environmental subsystems, File system, Networking and program interface, Linux system-design principles, Kernel Modules, Process Management, Scheduling, Memory management, File Systems, Input and Output, Interprocess communication, Network structure, security References
1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts”, Fifth Edition, Addision-Wesley
2. Milan Milankovic, “Operating Systems, Concepts and Design”, McGraw-Hill. 3. Harvey M Deital, "Operating Systems", Addison Wesley 4. Richard Peterson, “Linux: The Complete Reference”, Osborne McGraw-Hill.
DESIGN AND ANALYSIS OF ALGORITHMS
MCA 312 L T P
3 1 0 Unit-I Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution methods. Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort, Medians and order statistics Unit-II Advanced Data Structure: Red Black Trees, Augmenting Data Structure, Binomial Heap, B-Tree, Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of Algorithms on these data structures, Dictionaries and priority Queues, mergeable heaps, concatenable queues Unit-III Advanced Design and Analysis Techniques: Dynamic programming, Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized Analysis Unit-IV Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem Unit-V Randomized Algorithms, String Matching, NP-Hard and NP-Completeness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomials and FFT, Number Theoretic Algorithms References 1. Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub.
(5)
2. Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia 3. Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI 4. Computer Algoritms : Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Pearson Education 5. Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education 6. Fundamental of Algorithms by Brassard Bratley, PHI 7. Algorithms Design by M T Goodrich et al, John Wiley 8. The Design and analysis of Algorithms by A V Aho et al, Pearson Education
DATABASE MANAGEMENT SYSTEMS L T P
3 1 0 MCA 313 Unit- I Introduction: An overview of database management system, Database System Vs File System, Database system concepts and architecture, data models schema and instances, data independence and data base language and interfaces, Data definitions language, DML, Overall Database Structure. Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree. Unit- II Relational data Model and Language: Relational data model concepts, integrity constraints: entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple and domain calculus. Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and clusters. Unit- III Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design. Unit- IV Transaction Processing Concepts: Transaction system, Testing of serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling. Unit- V Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency control, Time stamping protocols for concurrency control, validation based protocol, multiple granularity, Multi-version schemes, Recovery with concurrent transaction. Transaction Processing in Distributed system, data fragmentation. Replication and allocation techniques for distributed system, overview of concurrency control and recovery in distrusted database. References
1 Date C J, “An Introduction To Database System”, Addision Wesley 2 Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill 3 Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley 4 Paul Beynon Davies, “Database Systems”, Palgrave Macmillan 5 Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication 6 Majumdar & Bhattacharya, “Database Management System”, TMH 7 Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill 8 Bharti P.K, “An introduction to Database Systems”, JPNP
INTERNET & JAVA PROGRAMMING
MCA 314 Unit-1
Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an ISP, Introduction to Internet services, E-Mail concepts, Sending and Receiving secure E-Mail, Voice and Video Conferencing.
L T P 3 1 0
Unit- II Core Java: Introduction, Operator, Data type, Variable, Arrays, Control Statements, Methods & Classes, Inheritance, Package and Interface, Exception Handling, Multithread programming, I/O, Java Applet, String handling, Networking, Event handling, Introduction to AWT, AWT controls, Layout managers, Menus, Images, Graphics.
Unit-III Java Swing: Creating a Swing Applet and Application, Programming using Panes, Pluggable Look and feel, Labels, Text fields, Buttons, Toggle buttons, Checkboxes, Radio Buttons, View ports, Scroll Panes, Scroll Bars, Lists, Combo box, Progress Bar, Menus and Toolbars, Layered Panes, Tabbed Panes, Split Panes, Layouts, Windows, Dialog Boxes, Inner frame. JDBC: The connectivity Model, JDBC/ODBC Bridge, java.sql package, connectivity to remote database, navigating
(6)
through multiple rows retrieved from a database. Unit-IV
Java Beans: Application Builder tools, The bean developer kit(BDK), JAR files, Introspection, Developing a simple bean, using Bound properties, The Java Beans API, Session Beans, Entity Beans, Introduction to Enterprise Java beans (EJB), Introduction to RMI (Remote Method Invocation): A simple client-server application using RMI.
Unit-V Java Servlets: Servlet basics, Servlet API basic, Life cycle of a Servlet, Running Servlet, Debugging Servlets, Thread-safe Servlets, HTTP Redirects, Cookies, Introduction to Java Server pages (JSP).
References: 1. Margaret Levine Young, “The Complete Reference Internet”, TMH 2. Naughton, Schildt, “The Complete Reference JAVA2”, TMH 3. Balagurusamy E, “Programming in JAVA”, TMH 4. Dustin R. Callway, “Inside Servlets”, Addison Wesley 5. Mark Wutica, “Java Enterprise Edition”, QUE 6. Steven Holzner, “Java2 Black book”, dreamtech
L T P 3 1 0
COMPUTER BASED OPTIMIZATION TECHNIQUES MCA 315
Unit I Preliminaries: Inventory Models and Replacement problems: Inventory models –various costs-deterministic inventory models, Single period inventory model with shortest cost, stochastic models, Application of inventory models, Economic lot sizes-price breaks, Replacement problems-capital equipment-discounting costs-replacement in anticipation of failure- group replacement-stochastic nature underlying the failure phenomenon. Unit II Linear Programming Problems (LPP): Definition of LPP, Graphical Solutions of Linear Programming Problems, Simplex Method, and Artificial Variable Method, Two Phase Method, Charnes’ Big-M Method, Sensitivity Analysis, Revised Simplex Method, Duality, Dual Simplex Method Unit III Integer Linear Programming Problems: Integer Linear Programming Problems, Mixed Integer Linear Programming Problems, Cutting Plane Method, Branch and Bound Method, 0-1 integer linear programming problem. Transportation Problems: Introduction to Transportation Model, Matrix Form of TP, Applications of TP Models, Basic Feasible Solution of a TP, Degeneracy in TP, Formation of Loops in TP, Solution Techniques of TP, Different Methods for Obtaining Initial Basic Feasible Solutions viz. Matrix Minima Method, Row Minima Method, Column Minima Methods, Vogel’s Approximation Method, Techniques for Obtaining Optimal Basic Feasible Solution. Assignment Problems: Definition, Hungarian Method for AP. Unit IV Introduction to NLP: Definition of NLP, Convex Programming Problems, Quadratic Programming Problems, Wolfe’s Method for Quadratic Programming, Kuhn-Tucker Conditions, Geometrical Interpretation of KT-Conditions, KT-Points etc. Dynamic Programming: Bellman’s Principle of optimality of Dynamic Programming, Multistage decision problem and its solution by Dynamic Programming with finite number of stages, Solution of linear programming problems as a Dynamic Programming problem Unit V Queuing Theory Introduction to Queues, Basic Elements of Queuing Models, Queue Disciplines, Memoryless Distribution, Role of Exponential and Poisson Distributions, Markovian Process, Erlang Distribution, Symbols and Notations, Distribution Of Arrivals, Distribution of Service Times, Definition of Steady and Transient State, Poisson Queues. References: 1. Hadley, G.,”Linear Programming, and Massachusetts”, Addison-Wesley 2. Taha, H.A, ”Operations Research – An Introduction”, Macmillian 3. Hiller, F.S., G.J. Lieberman, ” Introduction to Operations Research”, Holden-Day 4. Harvey M. Wagner, “Principles of Operations R search with Applications to Managerial Decisions”, Prentice Hall of India Pvt. Ltd. e5. Swarup K etal, “Operation Research”, S. Chand
DBMS LAB MCA - 351
L T P 0 0 3
The programme to be implemented using SQL 1. Create Table, SQL for Insertion, Deletion, Update and Retrival using aggregating functions.
(7)
2. Write Programs in PL/SQL, Understanding the concept of Cursors. 3. Write Program for Join, Union & intersection etc. 4. Creating Views, Writing Assertions, Triggers. 5. Creating Forms, Reports etc. 6. Writing codes for generating read and update operator in a transaction using different situations. 7. Implement of 2PL concerning central algorithm. 8. Developing code for understanding of distributed transaction processing.
Students are advised to use Developer 2000 Oracle 8+ version for above experiments. However, depending on the availability of Software’s students may use power builder/SQL Server/DB2 etc. for implementation.
L T P 0 0 3L T P 0 0 3
Java Programming Lab
MCA-352
1. Write a program in Java for illustrating, overloading, over riding and various forms of inheritance.
2. Write programs to create packages and multiple threads in Java. 3. Write programs in Java for event handling Mouse and Keyboard events. 4. Using Layout Manager create different applications. 5. Write programs in Java to create and manipulate Text Area, Canvas, Scroll Bars, Frames and
Menus using swing/AWT. 6. Using Java create Applets. 7. Use Java Language for Client Server Interaction with stream socket connections. 8. Write a program in java to read data from disk file.
L T P 3 1 0
MANAGEMENT INFORMATION SYSTEMS MCA 411
Unit 1: Foundation of Information Systems: Introduction to information system in business, fundamentals of information systems, Solving business problems with information systems, Types of information systems, Effectiveness and efficiency criteria in information system. Unit 2: An overview of Management Information Systems: Definition of a management information system, MIS versus Data processing, MIS & Decision Support Systems, MIS & Information Resources Management, End user computing, Concept of an MIS, Structure of a Management information system. Unit 3: Concepts of planning & control: Concept of organizational planning, The Planning Process, Computational support for planning, Characteristics of control process, The nature of control in an organization. Unit 4: Business applications of information technology: Internet & electronic commerce, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations, Information System for Managerial Decision Support, Information System for Strategic Advantage. Unit 5: Managing Information Technology: Enterprise & global management, Security & Ethical challenges, Planning & Implementing changes. Advanced Concepts in Information Systems: Enterprise Resource Planning, Supply Chain Management, Customer Relationship Management, and Procurement Management. Text Books 1. O Brian, “Management Information System”, TMH 2. Gordon B. Davis & Margrethe H. Olson, “Management Information System”, TMH. References 1. O Brian, “Introduction to Information System”, MCGRAW HILL. 2. Murdick, “Information System for Modern Management”, PHI. 3. Jawadekar, “ Management Information System”, TMH. 4. Jain Sarika, “Information System”, PPM 5. Davis, “Information System”, Palgrave Macmillan
(8)
MCA-412 : OBJECT ORIENTED SYSTEMS L T P 3 1 0
Unit – I Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, meta data, candidate keys, constraints. Unit – II Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model. Unit – III Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model.OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparisons of methodologies, SA/SD, JSD. Unit – IV Java Programming: Introduction, Operator, Data types, Variables, Methods & Classes, Multithread Programming, I/O, Java Applet. Java Library: String Handling, Input/Output exploring Java.io, Networking, Applets classes, Event Handling, Introduction to AWT, Working with window, Graphics, AWT Controls, Layout Manager and Menus, Images, Additional packages. Unit – V Software Development using Java: Java Beans, Java Swing, Java Servlets, Migrating from C++ to java, Application of java, Dynamic Billboard Applet, Image Menu: An image based menu, Lavatron Applets, Scrabblets, JDBC, Brief functioning of upper layer E-mail and their applications.
Text Books: 1. James Rumbaugh etal, “Object Oriented Modeling and Design”, PHI 2. Herbert Schieldt, “The Complete Reference: Java”, TMH. 3. E. Balagurusamy, “Programming in JAVA”, TMH. References:
1. Booch Grady, “Object Oriented Analysis & Design with application 3/e”, Pearson Education, New Delhi. 2. Bjarne Stroustrup, “C++ Programming Language”, Addison Wesley
3. E. Balagurusamy, “Object Oriented Programming with C++”, TMH
L T P 3 1 0
FOUNDAMENTALS OF E-COMMERCE MCA 413
Unit 1 Introduction: Electronic Commerce - Technology and Prospects, Definition of E- Commerce, Economic potential of electronic commerce, Incentives for engaging in electronic commerce, forces behind E-Commerce, Advantages and Disadvantages, Architectural framework, Impact of E-commerce on business. Network Infrastructure for E- Commerce: Internet and Intranet based E-commerce- Issues, problems and prospects, Network Infrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN, FRAME RELAY). Unit II Mobile Commerce: Introduction, Wireless Application Protocol, WAP technology, Mobile Information device, Mobile Computing Applications. Unit III Web Security: Security Issues on web, Importance of Firewall, components of Firewall, Transaction security, Emerging client server, Security Threats, Network Security, Factors to consider in Firewall design, Limitation of Firewalls. Unit IV Encryption: Encryption techniques, Symmetric Encryption- Keys and data encryption standard, Triple encryption, Asymmetric encryption- Secret key encryption, public and private pair key encryption, Digital Signatures, Virtual Private Network. Unit V Electronic Payments: Overview, The SET protocol, Payment Gateway, certificate, digital Tokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS, online Banking. EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies and Agenda.
(9)
References 1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison Wesley. 2. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH 3. P. Loshin, John Vacca, “Electronic commerce”, Firewall Media, New Delhi
MCA-414 : COMPUTER NETWORKS
L T P Unit-I 3 1 0 Introductory Concepts: Goals and Applications of Networks, Network structure and architecture, the OSI reference model, services, networks topology, Physical Layer- transmission, switch ing methods, Integrated services digital networks, terminal handling. Unit-II Medium access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free Protocols, IEEE standards, Ethernet, FDDI, Data Link Layer- basic design issues, error correction & detection algorithms, elementary data link layer protocols, sliding window protocols, error handling, High Level Data Link Control Unit-III Network Layer: Point-to Point networks, concept of virtual circuit and LAN, routing algorithms, congestion control algorithms, internetworking, TCP/IP protocol, IP addresses, IPv6. Unit-IV Transport Layer: Design issues, connection management, Internet Transport Protocol (UDP), Ethernet transport Protocol, Transmission Control Protocol. (TCP) Unit-V Application Layer: Domain Name System, Simple Network Management Protocol, Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol, Introduction to Cryptography and Network Security (DES, RSA algorithms), Communication Security (IPSec, Firewalls), Authentication protocols such as authentication based on shared key (Diffie Helleman Key exchanger), Introduction to multimedia and compression Techniques. References
1. Computer Networks by A. S Tanenbaum, 4th, Edition”, Pearson education 2. Data and Computer Communication by W. Stallings, Macmillan Press 3. Computer Networks & Internet with Internet Applications by Comer Pearson Education 4. Internetworking with TCP/IP by PHI 5. Data Communication and Networking by Forouzan TMH 6. Computer Networks with Internet Protocols by W Stallings, Pearson Education 7. Local and Metropolitan Area Networks by W Stallings, VIth edition, Pearson Education
MCA-451 : OBJECT ORIENTED SYSTEMS LAB
L T P
0 0 3
Experiments based on the course Object Oriented Systems to be done on C++/JAVA/UML/VISIO etc.
MCA - E11 : COMPILER DESIGN L T P
3 1 0 Unit-1 Compiler Structure: Compilers and Translators, Various Phases of Compiler, Pass Structure of Compiler, Bootstrapping of Compiler Programming Languages: High level languages, The lexical and syntactic structure of a language, Data elements, Data Structure, Operations, Assignments, Program unit, Data Environments, Parameter Transmission. Lexical Analysis: The role of Lexical Analyzer, A simple approach to the design of Lexical Analyzer, Regular Expressions , Transition Diagrams, Finite state Machines, Implementation of Lexical Analyzer, Lexical
(10)
Analyzer Generator: LEX, Capabilities of Lexical Analyzer Unit-II The Syntactic Specification of Programming Languages: CFG, Derivation and Parse tree, Ambiguity, Capabilities of CFG. Basic Parsing Techniques: Top-Down parsers with backtracking, Recursive Descent Parsers, Predictive Parsers, Bottom–up Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR parsers (SLR, Canonical LR, LALR) Syntax Analyzer Generator: YACC Unit-III Intermediate Code Generation: Different Intermediate forms: three address code, Quadruples & Triples. Syntax Directed translation mechanism and attributed definition. Translation of Declaration, Assignment, Control flow, Boolean expression, Array References in arithmetic expressions, procedure calls, case statements, postfix translation. Unit-IV Run Time Memory Management: Static and Dynamic storage allocation, stack based memory allocation schemes, Symbol Table management Error Detection and Recovery: Lexical phase errors, Syntactic phase errors, Semantic errors. Unit-V Code Optimization and Code Generation: Local optimization, Loop optimization, Peephole optimization, Basic blocks and flow graphs, DAG, Data flow analyzer, Machine Model, Order of evaluation, Register allocation and code selection References:
1. Alfred V Aho , Jeffrey D. Ullman, “Principles of Compiler Design”, Narosa 2. A.V. Aho, R. Sethi and J.D Ullman, “Compiler: principle, Techniques and Tools”, AW 3. H.C. Holub “Compiler Design in C”, Prentice Hall Inc. 4. Apple, “Modern Computer Implementation in C: Basic Design”, Cambridge press
MCA-E12 : CLIENT SERVER COMPUTING L T P
3 1 0 Unit I Client/Server Computing: DBMS concept and architecture, Single system image, Client Server architecture, mainframe-centric client server computing, downsizing and client server computing, preserving mainframe applications investment through porting, client server development tools, advantages of client server computing. Unit II Components of Client/Server application: The client: services, request for services, RPC, windows services, fax, print services, remote boot services, other remote services, Utility Services & Other Services, Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), Common Object Request Broker Architecture (CORBA). The server: Detailed server functionality, the network operating system, available platforms, the network operating system, available platform, the server operating system. Unit III Client/Server Network: connectivity, communication interface technology, Interposes communication, wide area network technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI) network management, Client-server system development: Software, Client–Server System Hardware: Network Acquisition, PC-level processing unit, Macintosh, notebooks, pen, UNIX workstation, x-terminals, server hardware. Unit IV Data Storage: magnetic disk, magnetic tape, CD-ROM, WORM, Optical disk, mirrored disk, fault tolerance, RAID, RAID-Disk network interface cards. Network protection devices, Power Protection Devices, UPS, Surge protectors. Client Server Systems Development: Services and Support, system administration, Availability, Reliability, Serviceability, Software Distribution, Performance, Network management, Help Disk, Remote Systems Management Security, LAN and Network Management issues. Unit V Client/Server System Development: Training, Training advantages of GUI Application, System Administrator training, Database Administrator training, End-user training. The future of client server Computing Enabling Technologies, The transformational system. References:
1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI 2. Dawna Travis Dewire, “Client/Server Computing”, TMH 3. Majumdar & Bhattacharya, “Database management System”, TMH 4. Korth, Silberchatz, Sudarshan, “Database Concepts”, McGraw Hill 5. Elmasri, Navathe, S.B, “Fundamentals of Data Base System”, Addison Wesley
(11)
MCA-E13 : DATA WAREHOUSING & MINING
L T P 3 1 0 Unit – I Dss-Uses, definition, Operational Database. Introduction to DATA Warehousing. Data-Mart, Concept of Data-Warehousing, Multi Dimensional Database Structures. Client/Server Computing Model & Data Warehousing. Parallel Processors & Cluster Systems. Distributed DBMS implementations. Unit – II DATA Warehousing. Data Warehousing Components. Building a Data Warehouse. Warehouse Database. Mapping the Data Warehouse to a Multiprocessor Architecture. DBMS Schemas for Decision Support. Data Extraction, Cleanup & Transformation Tools. Metadata. Unit – III Business Analysis. Reporting & Query Tools & Applications. On line Analytical Processing(OLAP). Patterns & Models. Statistics. Artificial Intelligence. Unit – IV Knowledge Discovery, Data Mining. Introduction to Data-Mining. Techniques of Data-Mining. Decision Trees. Neural Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule Introduction. Selecting & Using the Right Technique. Unit – V Multimedia Data-Mining, Multimedia-Databases, Mining Multimedia Data, Data-Mining and the World Wide Web, Web Data-Mining, Mining and Meta-Data. Data Visualization & Overall Perspective. Data Visualization. Applications of Data-Mining. References:
1. Berson, “Data Warehousing, Data-Mining & OLAP”, TMH 2. Mallach, “Decision Support and Data Warehousing System”, TMH 3. Bhavani Thura-is-ingham, “Data-Mining Technologies, Techniques Tools & Trends”, CRC Press 4. Navathe, “Fundamental of Database System”, Pearson Education 5. Margaret H. Dunham, “Data-Mining. Introductory & Advanced Topics”, Pearson Education 6. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education
MCA-E14 : CRYPTOGRAPHY AND NETWORK SECURITY L T P
3 1 0 Unit-I Introduction to Cryptography: Introduction To Security: Attacks, Services & Mechanisms, Security, Attacks, Security Services. Conventional Encryption: Classical Techniques, Conventional Encryption Model, And Steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes Of Operation. Unit-II Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, RC2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement Of Encryption Function. Unit-III Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems, RSA Algorithm, Key Management, Fermat’s & Euler’s Theorm, Primality, The Chinese Remainder Theorem. Unit-IV Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Birthday Attacks, Security Of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signatures, Authentication Protocol, Digital Signature Standard (DSS), Proof Of Digital Signature Algorithm. Unit-V Network & System Security: Authentication Applications: Kerberos X.509, Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management, Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders, Viruses, Firewall Design Principles, Trusted Systems. Text Book: 1. William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall, New Jersey.
Reference Books: 1. Johannes A. Buchmann, “Introduction to cryptography”, Springer- Verlag. 2. Atul Kahate, “Cryptography and Network Security”, TMH
(12)
MCA-E15 : THEORY OF AUTOMATA AND FORMAL LANGUAGES
L T P 3 1 0
Unit – I Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem Unit – II Regular expression (RE) , Definition, Operators of regular expression and therr precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. Unit – III Context free grammar (CFG) and Context Freee Languages (CFL): Definition, Examples, Derivation , Derivation trees, Ambiguity in Grammer, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Memership, Pumping lemma for CFLs, Unit – IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA Unit – V Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs. Post correspondence problem (PCP), Modified PCP, Introduction to recursive function theory Text Books and References:
1. Hopcroft, Ullman, “Introduction to Automata Theory, Languages and Computation”, Pearson Education
2. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science : Automata, Languages and Computation”, PHI
3. Martin J. C., “Introduction to Languages and Theory of Computations”, TMH 4. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI
MCA-E16 : DISTRIBUTED SYSTEM
Unit-1 Introduction to Distributed Data system, Distributed Database Architecture, Distributed Data base Design, Transaction processing Concurrency Control techniques, Security. Unit-2 Types of Data Fragmentations, Fragmentation and allocation of fragments, Distribution transparency, access primitives, integrity constraints.
(13)
Unit-3 Grouping and aggregate function, Query processing , Equivalence transformation of queries. Unit-4 Evaluation, parametric queries, Query optimization, Join and general queries. Unit-5 Management of Distributed transaction and concurrency control: Distributed Date base Administration, Catalouge Management Authorisation, Security and protection. Examples of distributed database systems. Cost Analysis References: 1. Ceri & Palgathi, “Distributed Database System”, McGraw Hill. 2. Raghu Rama Krishnan and Johannes Gechrib, “Database Management Systems”, Mc Graw Hill. 3. Date C. J, “An Introduction to Database System, Vol1 & II”, Addition Wesley. 4. Korth, Silbertz, Sudarshan , “Database Concepts”, McGraw Hill. 5. Elmasari , Navathe, “Fundamentals of Data Base Systems”, Addition Wesley. 6. Data C. J , “An Introduction to Database System” , Addition Wesley 7. RamaKrishnan , Gehke, “Database Management System”, McGraw Hill
Syllabus Applicable
in
Gautam Buddh Technical UniversityLucknow
is adopted by the Executive Council of
Mahamaya Technical UniversityNoida
vide resolution no.13, dated 24 Feb, 2011
for batches admitted in session: 2010-11
MASTER OF COMPUTER APPLICATION[MCA]
3rd Year
î
ÓÝß
ͬ«¼§ ¿²¼ Ûª¿´«¿¬·±² ͽ¸»³»
Ûºº»½¬·ª» º®±³ »·±² îðï2óï3
Ç»¿®ó×××ô Í»³»¬»® Ê Ûª¿´«¿¬·±² ͽ¸»³»
Í»·±²¿´
ÍÒ± Í«¾¶»½¬
ݱ¼»
Í«¾¶»½¬ л®·±¼
ÝÌ Ìß Ì±¬¿´
Û¨¿³
̱¬¿´
ï ÓÝßóëïï É»¾ Ì»½¸²±´±¹§ íóïóð íð îð ëð ïðð ïëð
î ÓÝßóÛ´»½¬·ª»ó×× íóïóð íð îð ëð ïðð ïëð
í ÓÝßóëïî ܱ¬ Ò»¬ Ú®¿³»©±®µ ú
Ýý
íóïóð íð îð ëð ïðð ïëð
ì ÓÝßóëïí ͱº¬©¿®» Û²¹·²»»®·²¹ íóïóð íð îð ëð ïðð ïëð
ë ÓÝßóÛ´»½¬·ª»ó××× íóïóð íð îð ëð ïðð ïëð
Ю¿½¬·½¿´ ñ Ì®¿·²·²¹ ñЮ±¶»½¬
ê ÓÝßóëëï É»¾ Ì»½¸²±´±¹§ Ô¿¾ö ðóðóí íð îð ëð ëð ïðð
é ÓÝßóëëî ܱ¬ ÒÛÌ Ô¿¾ö ðóðóí íð îð ëð ëð ïðð
è ÙÐóëðï Ù»²»®¿´ Ю±º·½·»²½§ ó ó ó ó ó ëð
Ç»¿®ó×××ô Í»³»¬»® Ê× Ûª¿´«¿¬·±² ͽ¸»³»
Í»·±²¿´
ÍÒ± Í«¾¶»½¬
ݱ¼»
Í«¾¶»½¬ л®·±¼
Ý
Ì
Ìß Ì±¬¿´
Û¨¿³
̱¬¿´
ï ÓÝßóêïï ݱ´´±¯«·«³
ðóðóî ó îðð îðð ó îðð
î ÓÝßóêïî Ю±¶»½¬
ðóðóîì ó íðð íðð ëðð èðð
ö ߬ ´»¿¬ ïð °®±¾´»³ ¿®» ¬± ¾» ½±²·¼»®»¼ ¾¿»¼ ±² ½±®®»°±²¼·²¹ ¬¸»±®§ ½±«®»ò
í
Ô·¬ ±º Û´»½¬·ª» º±® ÓÝß
ÓÝßóÛ´»½¬·ª»ó××
ÓÝß-Ûîï ݱ³°«¬»® Ù®¿°¸·½ ¿²¼ ß²·³¿¬·±²
ÓÝß-Ûîî Í·³«´¿¬·±² ¿²¼ Ó±¼»´·²¹
ÓÝß-Ûîí ß¼ª¿²½»¼ Ü¿¬¿¾¿» Ó¿²¿¹»³»²¬ ͧ¬»³
ÓÝß-Ûîì ß®¬·º·½·¿´ ײ¬»´´·¹»²½»
ÓÝß-Ûîë ײº±®³¿¬·±² Í»½«®·¬§ ¿²¼ ݧ¾»® Ô¿©
ÓÝß-Ûîê ײº±®³¿¬·±² ͬ±®¿¹» ú Ó¿²¿¹»³»²¬
ÓÝßóÛ´»½¬·ª»ó×××
ÓÝß Ûíï ÛÎРͧ¬»³
ÓÝß Ûíî ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬
ÓÝß Ûíí λ¿´ Ì·³» ͧ¬»³
ÓÝß Ûíì Ó±¾·´» ݱ³°«¬·²¹
ÓÝß Ûíë Ò»«®¿´ Ò»¬©±®µ
ÓÝß Ûíê שּׁ»®² λ½±¹²·¬·±²
ì
ÍÇÔÔßÞËÍ ø Ó¿¬»® ±º ݱ³°«¬»® ß°°´·½¿¬·±²÷
ÓÝß ëïïæ É»¾ Ì»½¸²±´±¹§
˲·¬ ×æ ײ¬®±¼«½¬·±²æ
ײ¬®±¼«½¬·±² ¬± ©»¾ô °®±¬±½±´ ¹±ª»®²·²¹ ¬¸» ©»¾ô ©»¾ ¼»ª»´±°³»²¬ ¬®¿¬»¹·»ô
É»¾ ¿°°´·½¿¬·±²ô ©»¾ °®±¶»½¬ô ©»¾ ¬»¿³ò
˲·¬ ××æ É»¾ п¹» Ü»·¹²·²¹æ ØÌÓÔæ ´·¬ô ¬¿¾´»ô ·³¿¹»ô º®¿³»ô º±®³ô ÝÍÍå
ÈÓÔæ ÜÌÜô ÈÓÔ ½¸»³»ô °®»»²¬·²¹ ¿²¼ «·²¹ ÈÓÔ
˲·¬ ×××æ ͽ®·°¬·²¹æ
Ö¿ª¿ ½®·°¬æ ײ¬®±¼«½¬·±²ô ¼±½«³»²¬ô º±®³ô ¬¿¬»³»²¬ô º«²½¬·±²ô ±¾¶»½¬å
»ª»²¬ ¿²¼ »ª»²¬ ¸¿²¼´·²¹å ·²¬®±¼«½¬·±² ¬± ßÖßÈô ÊÞ Í½®·°¬
˲·¬ ×Êæ Í»®ª»® Í·¬» Ю±¹®¿³³·²¹æ ײ¬®±¼«½¬·±² ¬± ¿½¬·ª» »®ª»® °¿¹» øßÍÐ÷ôßÍÐòÒÛÌô ¶¿ª¿ »®ª»® °¿¹» øÖÍÐ÷ô ÖÍÐ ¿°°´·½¿¬·±²
¼»·¹²ô ¬±³½¿¬ »®ª»®ô ÖÍÐ ±¾¶»½¬ô ¼»½´¿®·²¹ ª¿®·¿¾´»ô ¿²¼ ³»¬¸±¼ô ¼»¾«¹¹·²¹ô ¸¿®·²¹ ¼¿¬¿
¾»¬©»»² ÖÍÐ °¿¹»ô Í»·±²ô ß°°´·½¿¬·±²æ ¼¿¬¿ ¾¿» ¿½¬·±² ô ¼»ª»´±°³»²¬ ±º ¶¿ª¿ ¾»¿² ·² ÖÍÐô
·²¬®±¼«½¬·±² ¬± ÝÑÓñÜÝÑÓò
˲·¬ Êæ ÐØÐ øا°»®¬»¨¬ Ю»°®±½»±®÷æ
ײ¬®±¼«½¬·±²ô §²¬¿¨ô ª¿®·¿¾´»ô ¬®·²¹ô ±°»®¿¬±®ô ·ºó»´»ô ´±±°ô ©·¬½¸ô ¿®®¿§ô º«²½¬·±²ô º±®³
ô³¿·´ô º·´» «°´±¿¼ô »·±²ô »®®±®ô »¨½»°¬·±²ô º·´¬»®ô ÐØÐóÑÜÞÝò
λº»®»²½» ïò È¿ª·»®ô Ýô � É»¾ Ì»½¸²±´±¹§ ¿²¼ Ü»·¹²� ô Ò»© ß¹» ײ¬»®²¿¬·±²¿´
îò ת¿² Þ¿§®±ô� ØÌÓÔô ÜØÌÓÔô Ö¿ª¿ ͽ®·°¬ô л®´ ú ÝÙ×�ô ÞÐÞ Ð«¾´·½¿¬·±²ò
íò ο³»¸ Þ¿²¹·¿ô �ײ¬»®²»¬ ¿²¼ É»¾ Ü»·¹²� ô Ò»© ß¹» ײ¬»®²¿¬·±²¿´
ìò Þ¸¿ª»ô �Ю±¹®¿³³·²¹ ©·¬¸ Ö¿ª¿�ô л¿®±² Û¼«½¿¬·±²
ëò Ë´´³¿²ô �ÐØÐ º±® ¬¸» É»¾æ Ê·«¿´ Ï«·½µÍ¬¿®¬ Ù«·¼»�ô л¿®±² Û¼«½¿¬·±²
êò Ü»·¬»´ô �Ö¿ª¿ º±® °®±¹®¿³³»®�ô л¿®±² Û¼«½¿¬·±²
ÓÝß ëïîæ ܱ¬ Ò»¬ Ú®¿³»©±®µ ¿²¼ Ýý
˲·¬óï ̸» òÒ»¬ º®¿³»©±®µæ ײ¬®±¼«½¬·±²ô ̸» Ñ®·¹·² ±º òÒ»¬ Ì»½¸²±´±¹§ô ݱ³³±² Ô¿²¹«¿¹»
Ϋ²¬·³» øÝÔÎ÷ô ݱ³³±² ̧°» ͧ¬»³ øÝÌÍ÷ô ݱ³³±² Ô¿²¹«¿¹» Í°»½·º·½¿¬·±² øÝÔÍ÷ô
Ó·½®±±º¬ ײ¬»®³»¼·¿¬» Ô¿²¹«¿¹» øÓÍ×Ô÷ô Ö«¬óײ �Ì·³» ݱ³°·´¿¬·±²ô Ú®¿³»©±®µ Þ¿» Ý´¿»ò
ë
˲·¬ó××
Ý ó͸¿®° Ô¿²¹«¿¹» øÝý÷æ ײ¬®±¼«½¬·±²ô Ü¿¬¿ ̧°»ô ×¼»²¬·º·»®ô Ê¿®·¿¾´»ô ݱ²¬¿²¬ô Ô·¬»®¿´ô
ß®®¿§ ¿²¼ ͬ®·²¹ô Ѿ¶»½¬ ¿²¼ Ý´¿»ô ײ¸»®·¬¿²½» ¿²¼ б´§³±®°¸·³ô Ñ°»®¿¬±® Ѫ»®´±¿¼·²¹ô
ײ¬»®º¿½»ô Ü»´»¹¿¬» ¿²¼ Ûª»²¬ò ̧°» ½±²ª»®·±²ò
˲·¬ó××× Ýý Ë·²¹ Ô·¾®¿®·»æ Ò¿³»°¿½»ó ͧ¬»³ô ײ°«¬óÑ«¬°«¬ô Ó«´¬·ó̸®»¿¼·²¹ô Ò»¬©±®µ·²¹ ¿²¼
±½µ»¬ô Ó¿²¿¹·²¹ ݱ²±´» ×ñÑ Ñ°»®¿¬·±²ô É·²¼±© Ú±®³ô Û®®±® Ø¿²¼´·²¹ò
˲·¬ó×Ê
ß¼ª¿²½»¼ Ú»¿¬«®» Ë·²¹ Ýýæ É»¾ Í»®ª·½»ô É·²¼±© Í»®ª·½»ô ß°ò²»¬ É»¾ Ú±®³ ݱ²¬®±´ô
ßÜÑòÒ»¬ò Ü·¬®·¾«¬»¼ ß°°´·½¿¬·±² ·² Ýýô ˲¿º» Ó±¼»ô Ù®¿°¸·½¿´ Ü»ª·½» ·²¬»®º¿½» ©·¬¸ Ýýò
˲·¬óÊ òÒ»¬ ß»³¾´·» ¿²¼ ߬¬®·¾«¬»æ òÒ»¬ ß»³¾´·» º»¿¬«®» ¿²¼ ¬®«½¬«®»ô °®·ª¿¬» ¿²¼ ¸¿®»
¿»³¾´·»ô Þ«·´¬óײ ¿¬¬®·¾«¬» ¿²¼ ½«¬±³ ¿¬¬®·¾«¬»ò ײ¬®±¼«½¬·±² ¿¾±«¬ ¹»²»®·½ò
λº»®»²½»
ïò É·´»§ô� Þ»¹·²²·²¹ Ê·«¿´ Ýý îððè�ôÉ®±¨
îò Ú»®¹¿´ Ù®·³»ô� Ó·½®±±º¬ òÒ»¬ º±® Ю±¹®¿³³»®�ò øÍÐ×÷
íò Þ¿´¿¹«®«¿³§ô� Ю±¹®¿³³·²¹ ©·¬¸ Ýý�ô øÌÓØ÷
ìò Ó¿®µ Ó·½¸¿»´·ô �Û»²¬·¿´ Ýý íòðæ Ú±® òÒÛÌ Ú®¿³»©±®µ íòëô îñ»ô л¿®±² Û¼«½¿¬·±²
ëò ͸·¾· п®·µµ¿®ô � Ýý ©·¬¸ òÒ»¬ Ú®¿³» ɱ®µ� ô Ú·®»©¿´´ Ó»¼·¿ò
ÓÝß ëïíæ ͱº¬©¿®» Û²¹·²»»®·²¹
˲·¬ó×æ ײ¬®±¼«½¬·±²
ײ¬®±¼«½¬·±² ¬± ͱº¬©¿®» Û²¹·²»»®·²¹ô ͱº¬©¿®» ݱ³°±²»²¬ô ͱº¬©¿®» ݸ¿®¿½¬»®·¬·½ô ͱº¬©¿®»
Ý®··ô ͱº¬©¿®» Û²¹·²»»®·²¹ Ю±½»»ô Í·³·´¿®·¬§ ¿²¼ Ü·ºº»®»²½» º®±³ ݱ²ª»²¬·±²¿´
Û²¹·²»»®·²¹ Ю±½»»ô ͱº¬©¿®» Ï«¿´·¬§ ߬¬®·¾«¬»ò ͱº¬©¿®» Ü»ª»´±°³»²¬ Ô·º» ݧ½´» øÍÜÔÝ÷
Ó±¼»´æ É¿¬»® Ú¿´´ Ó±¼»´ô Ю±¬±¬§°» Ó±¼»´ô Í°·®¿´ Ó±¼»´ô Ûª±´«¬·±²¿®§ Ü»ª»´±°³»²¬ Ó±¼»´ô
׬»®¿¬·ª» Û²¸¿²½»³»²¬ Ó±¼»´ò
˲·¬ó××æ ͱº¬©¿®» λ¯«·®»³»²¬ Í°»½·º·½¿¬·±² øÍÎÍ÷ λ¯«·®»³»²¬ Û²¹·²»»®·²¹ Ю±½»æ Û´·½·¬¿¬·±²ô ß²¿´§·ô ܱ½«³»²¬¿¬·±²ô λª·»© ¿²¼
Ó¿²¿¹»³»²¬ ±º Ë»® Ò»»¼ô Ú»¿·¾·´·¬§ ͬ«¼§ô ײº±®³¿¬·±² Ó±¼»´·²¹ô Ü¿¬¿ Ú´±© Ü·¿¹®¿³ô
Û²¬·¬§ λ´¿¬·±²¸·° Ü·¿¹®¿³ô Ü»½··±² Ì¿¾´»ô ÍÎÍ Ü±½«³»²¬ô ×ÛÛÛ Í¬¿²¼¿®¼ º±® ÍÎÍò
ͱº¬©¿®» Ï«¿´·¬§ ß«®¿²½» øÍÏß÷æ Ê»®·º·½¿¬·±² ¿²¼ Ê¿´·¼¿¬·±²ô ÍÏß Ð´¿²ô ͱº¬©¿®» Ï«¿´·¬§
Ú®¿³»©±®µô ×ÍÑ çððð Ó±¼»´ô ÍÛ×óÝÓÓ Ó±¼»´ò
˲·¬ó×××æ ͱº¬©¿®» Ü»·¹² Þ¿·½ ݱ²½»°¬ ±º ͱº¬©¿®» Ü»·¹²ô ß®½¸·¬»½¬«®¿´ Ü»·¹²ô Ô±© Ô»ª»´ Ü»·¹²æ Ó±¼«´¿®·¦¿¬·±²ô
Ü»·¹² ͬ®«½¬«®» ݸ¿®¬ô л«¼± ݱ¼»ô Ú´±© ݸ¿®¬ô ݱ«°´·²¹ ¿²¼ ݱ¸»·±² Ó»¿«®»ô Ü»·¹²
ͬ®¿¬»¹·»æ Ú«²½¬·±² Ñ®·»²¬»¼ Ü»·¹²ô Ѿ¶»½¬ Ñ®·»²¬»¼ Ü»·¹²ô ̱°óܱ©² ¿²¼ Þ±¬¬±³óË°
Ü»·¹²ò ͱº¬©¿®» Ó»¿«®»³»²¬ ¿²¼ Ó»¬®·½æ Ê¿®·±« Í·¦» Ñ®·»²¬»¼ Ó»¿«®»æ Ø¿´»¬»¿¼�
ͱº¬©¿®» ͽ·»²½»ô Ú«²½¬·±² б·²¬ øÚÐ÷ Þ¿»¼ Ó»¿«®»ô ݧ½´±³¿¬·½ ݱ³°´»¨·¬§ Ó»¿«®»æ
ݱ²¬®±´ Ú´±© Ù®¿°¸ò
ê
˲·¬ó×Êæ ͱº¬©¿®» Ì»¬·²¹ Ì»¬·²¹ Ѿ¶»½¬·ª»ô ˲·¬ Ì»¬·²¹ô ײ¬»¹®¿¬·±² Ì»¬·²¹ô ß½½»°¬¿²½» Ì»¬·²¹ô λ¹®»·±² Ì»¬·²¹ô
Ì»¬·²¹ º±® Ú«²½¬·±²¿´·¬§ ¿²¼ Ì»¬·²¹ º±® л®º±®³¿²½»ô ̱°óܱ©² ¿²¼ Þ±¬¬±³óË° Ì»¬·²¹
ͬ®¿¬»¹·»æ Ì»¬ Ü®·ª»® ¿²¼ Ì»¬ ͬ«¾ô ͬ®«½¬«®¿´ Ì»¬·²¹ øɸ·¬» Þ±¨ Ì»¬·²¹÷ô Ú«²½¬·±²¿´
Ì»¬·²¹ øÞ´¿½µ Þ±¨ Ì»¬·²¹÷ô Ì»¬ Ü¿¬¿ Í«·¬ Ю»°¿®¿¬·±²ô ß´°¸¿ ¿²¼ Þ»¬¿ Ì»¬·²¹ ±º Ю±¼«½¬ò
ͬ¿¬·½ Ì»¬·²¹ ͬ®¿¬»¹·»æ Ú±®³¿´ Ì»½¸²·½¿´ λª·»© øл»® λª·»©÷ô É¿´µ ̸®±«¹¸ô ݱ¼»
ײ°»½¬·±²ô ݱ³°´·¿²½» ©·¬¸ Ü»·¹² ¿²¼ ݱ¼·²¹ ͬ¿²¼¿®¼ò
˲·¬óÊæ ͱº¬©¿®» Ó¿·²¬»²¿²½» ¿²¼ ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬
ͱº¬©¿®» ¿ ¿² Ûª±´«¬·±²¿®§ Û²¬·¬§ô Ò»»¼ º±® Ó¿·²¬»²¿²½»ô Ý¿¬»¹±®·» ±º Ó¿·²¬»²¿²½»æ
Ю»ª»²¬·ª»ô ݱ®®»½¬·ª» ¿²¼ л®º»½¬·ª» Ó¿·²¬»²¿²½»ô ݱ¬ ±º Ó¿·²¬»²¿²½»ô ͱº¬©¿®» λó
Û²¹·²»»®·²¹ô 못®» Û²¹·²»»®·²¹ò ͱº¬©¿®» ݱ²º·¹«®¿¬·±² Ó¿²¿¹»³»²¬ ß½¬·ª·¬·»ô ݸ¿²¹»
ݱ²¬®±´ Ю±½»ô ͱº¬©¿®» Ê»®·±² ݱ²¬®±´ô ß² Ѫ»®ª·»© ±º ÝßÍÛ Ì±±´ò Û¬·³¿¬·±² ±º Ê¿®·±«
п®¿³»¬»® «½¸ ¿ ݱ¬ô Ûºº±®¬ô ͽ¸»¼«´»ñÜ«®¿¬·±²ô ݱ²¬®«½¬·ª» ݱ¬ Ó±¼»´ øÝÑÝÑÓÑ÷ô
뱫®½» ß´´±½¿¬·±² Ó±¼»´ô ͱº¬©¿®» ηµ ß²¿´§· ¿²¼ Ó¿²¿¹»³»²¬ò
λº»®»²½»æ
ïò Îò Íò Ю»³¿²ô ͱº¬©¿®» Û²¹·²»»®·²¹æ ß Ð®¿½¬·¬·±²»® ß°°®±¿½¸ô Ó½Ù®¿© Ø·´´ò
îò ο¶·¾ Ó¿´´ô Ú«²¼¿³»²¬¿´ ±º ͱº¬©¿®» Û²¹·²»»®·²¹ô ÐØ× Ð«¾´·½¿¬·±²ò
íò Õò Õò ß¹¹¿®©¿´ ¿²¼ DZ¹»¸ Í·²¹¸ô ͱº¬©¿®» Û²¹·²»»®·²¹ô Ò»© ß¹» ײ¬»®²¿¬·±²¿´
Ы¾´·¸»®ò
ìò п²µ¿¶ Ö¿´±¬»ô ͱº¬©¿®» Û²¹·²»»®·²¹ô É·´»§
ëò Ý¿®´± Ù¸»¦¦·ô Óò Ö¿®¿§»®·ô Üò Ó¿²±¼®·±´·ô Ú«²¼¿³»²¬¿´ ±º ͱº¬©¿®» Û²¹·²»»®·²¹ô ÐØ×
Ы¾´·½¿¬·±²ò
êò ׿² ͱ³³»®ª·´´»ô ͱº¬©¿®» Û²¹·²»»®·²¹ô ß¼¼·±² É»´»§ò
éò Õ¿»³ Í¿´»¸ô�ͱº¬©¿®» Û²¹·²»»®·²¹�ô Ý»²¹¿¹» Ô»¿®²·²¹ò
èò к´»»¹»®ô ͱº¬©¿®» Û²¹·²»»®·²¹ô Ó¿½³·´´¿² Ы¾´·½¿¬·±²ò
é
ͧ´´¿¾« ±º Û´»½¬·ª» Í«¾¶»½¬ ø Ó¿¬»® ±º ݱ³°«¬»® ß°°´·½¿¬·±²÷
ÓÝß Ûîï ݱ³°«¬»® Ù®¿°¸·½ ¿²¼ ß²·³¿¬·±²
˲·¬ � ×
ײ¬®±¼«½¬·±² ¿²¼ Ô·²» Ù»²»®¿¬·±²æ ̧°» ±º ½±³°«¬»® ¹®¿°¸·½ô Ù®¿°¸·½ Ü·°´¿§ó ο²¼±³
½¿² ¼·°´¿§ô כּ® ½¿² ¼·°´¿§ô Ú®¿³» ¾«ºº»® ¿²¼ ª·¼»± ½±²¬®±´´»®ô б·²¬ ¿²¼ ´·²»ô Ô·²»
¼®¿©·²¹ ¿´¹±®·¬¸³ô Ý·®½´» ¹»²»®¿¬·²¹ ¿´¹±®·¬¸³ô Ó·¼ °±·²¬ ½·®½´» ¹»²»®¿¬·²¹ ¿´¹±®·¬¸³ô ¿²¼
°¿®¿´´»´ ª»®·±² ±º ¬¸»» ¿´¹±®·¬¸³ò
˲·¬ � ×× Ì®¿²º±®³¿¬·±²æ Þ¿·½ ¬®¿²º±®³¿¬·±²ô Ó¿¬®·¨ ®»°®»»²¬¿¬·±² ¿²¼ ¸±³±¹»²±« ½±±®¼·²¿¬»ô
ݱ³°±·¬» ¬®¿²º±®³¿¬·±²ô λº´»½¬·±² ¿²¼ ¸»¿®·²¹ò
É·²¼±©·²¹ ¿²¼ Ý´·°°·²¹æ Ê·»©·²¹ °·°»´·²»ô Ê·»©·²¹ ¬®¿²º±®³¿¬·±²ô îóÜ Ý´·°°·²¹
¿´¹±®·¬¸³ó Ô·²» ½´·°°·²¹ ¿´¹±®·¬¸³ «½¸ ¿ ݱ¸»² Í«¬¸»®´¿²¼ ´·²» ½´·°°·²¹ ¿´¹±®·¬¸³ô Ô·¿²¹
Þ¿®µ§ ¿´¹±®·¬¸³ô Ô·²» ½´·°°·²¹ ¿¹¿·²¬ ²±² ®»½¬¿²¹«´¿® ½´·° ©·²¼±©å б´§¹±² ½´·°°·²¹ �
Í«¬¸»®´¿²¼ ر¼¹»³¿² °±´§¹±² ½´·°°·²¹ô É»·´»® ¿²¼ ߬¸»®¬±² °±´§¹±² ½´·°°·²¹ô Ý«®ª» ½´·°°·²¹ô
Ì»¨¬ ½´·°°·²¹ò
˲·¬ � ××× Ì¸®»» Ü·³»²·±²¿´æ íóÜ ¹»±³»¬®·½ °®·³·¬·ª»ô íóÜ Ñ¾¶»½¬ ®»°®»»²¬¿¬·±²ô íóÜ Ì®¿²º±®³¿¬·±²ô
íóÜ ª·»©·²¹ô °®±¶»½¬·±²ô íóÜ Ý´·°°·²¹ò
˲·¬ � ×Ê
Ý«®ª» ¿²¼ Í«®º¿½»æ Ï«¿¼®·½ «®º¿½»ô Í°¸»®»ô Û´´·°±·¼ô Þ´±¾¾§ ±¾¶»½¬ô ײ¬®±¼«½¬±®§
½±²½»°¬ ±º Í°´·²»ô Þ°´·²» ¿²¼ Þ»¦·»® ½«®ª» ¿²¼ «®º¿½»ò
Ø·¼¼»² Ô·²» ¿²¼ Í«®º¿½»æ Þ¿½µ Ú¿½» Ü»¬»½¬·±² ¿´¹±®·¬¸³ô Ü»°¬¸ ¾«ºº»® ³»¬¸±¼ô ßó ¾«ºº»®
³»¬¸±¼ô ͽ¿² ´·²» ³»¬¸±¼ô ¾¿·½ ·´´«³·²¿¬·±² ³±¼»´ � ß³¾·»²¬ ´·¹¸¬ô Ü·ºº«» ®»º´»½¬·±²ô
Í°»½«´¿® ®»º´»½¬·±² ¿²¼ и±²¹ ³±¼»´ô ݱ³¾·²»¼ ¿°°®±¿½¸ô É¿®² ³±¼»´ô ײ¬»²·¬§ ߬¬»²«¿¬·±²ô
ݱ´±® ½±²·¼»®¿¬·±²ô Ì®¿²°¿®»²½§ ¿²¼ ͸¿¼±©ò
˲·¬ � Ê Ý±³°«¬»® ß²·³¿¬·±² æ ݱ²ª»²¬·±²¿´ ¿²¼ ½±³°«¬»® ¿·¬»¼ ¿²·³¿¬·±²ô ¼»·¹² ±º ¿²·³¿¬·±²
»¯«»²½»ô ·²¬»®°±´¿¬·±²ô ·³°´» ¿²·³¿¬·±² »ºº»½¬ô ¿²·³¿¬·±² ´¿²¹«¿¹» ø Õ»§ Ú®¿³» ͧ¬»³ô
п®¿³»¬»®·¦»¼ §¬»³÷ô ³±¬·±² °»½·º·½¿¬·±²ô ³»¬¸±¼ ±º ½±²¬®±´´·²¹ ¿²·³¿¬·±²ò
λº»®»²½»æ
ïò ܱ²¿´¼ Ø»¿®² ¿²¼ Ó Ð¿«´·²» Þ¿µ»®ô �ݱ³°«¬»® Ù®¿°¸·½ Ý Ê»®·±²�ô л¿®±²
Û¼«½¿¬·±²
îò ß³®»²¼®¿ Ò Í·²¸¿ ¿²¼ ß®«² Ü Ë¼¿·ô� ݱ³°«¬»® Ù®¿°¸·½�ô ÌÓØ
íò ܱ²¿´¼ Ø»¿®² ¿²¼ Ó Ð¿«´·²» Þ¿µ»®ô � ݱ³°«¬»® Ù®¿°¸·½ ©·¬¸ Ñ°»²ÙÔ�ô л¿®±²
»¼«½¿¬·±²
ìò ͬ»ª»² Ø¿®®·²¹¬±²ô �ݱ³°«¬»® Ù®¿°¸·½æ ß Ð®±¹®¿³³·²¹ ß°°®±¿½¸�ô ÐØ× ±® ÌÓØ
ëò Ö¿³» Ü Ú±´»§ô ß Ê Ü¿³ô Í Õ Ú»·²»® ¿²¼ Ö±¸² º Ø«¹¸»ô �ݱ³°«¬»® Ù®¿°¸·½ Ю·²½·°´»
¿²¼ Ю¿½¬·½»� Í»½±²¼ Û¼·¬·±² ·² Ýò
è
ÓÝß Ûîî Í·³«´¿¬·±² ¿²¼ Ó±¼»´·²¹
˲·¬óï ͧ¬»³ ¼»º·²·¬·±² ¿²¼ ½±³°±²»²¬ô ¬±½¸¿¬·½ ¿½¬·ª·¬·»ô ½±²¬·²«±« ¿²¼ ¼·½®»¬» §¬»³ô §¬»³
³±¼»´·²¹ô ¬§°» ±º ³±¼»´ô ¬¿¬·½ ¿²¼ ¼§²¿³·½ °¸§·½¿´ ³±¼»´ô ¬¿¬·½ ¿²¼ ¼§²¿³·½ ³¿¬¸»³¿¬·½¿´
³±¼»´ô º«´´ ½±®°±®¿¬» ³±¼»´ô ¬§°» ±º §¬»³ ¬«¼§ò
˲·¬ó×× Í§¬»³ ·³«´¿¬·±²ô ©¸§ ú ©¸»² ¬± ·³«´¿¬»ô ²¿¬«®» ¿²¼ ¬»½¸²·¯«» ±º ·³«´¿¬·±²ô ½±³°¿®·±² ±º
·³«´¿¬·±² ¿²¼ ¿²¿´§¬·½¿´ ³»¬¸±¼ô ¬§°» ±º §¬»³ ·³«´¿¬·±²ô ®»¿´ ¬·³» ·³«´¿¬·±²ô ¸§¾®·¼
·³«´¿¬·±²ô ·³«´¿¬·±² ±º °«®»ó°«®«·¬ °®±¾´»³ô ·²¹´»ó»®ª»® ¯«»«·²¹ §¬»³ ¿²¼ ¿² ·²ª»²¬±®§
°®±¾´»³ô Ó±²¬»óÝ¿®´± ·³«´¿¬·±²ô Ü·¬®·¾«¬»¼ Ô¿¹ ³±¼»´ô ݱ¾©»¾ ³±¼»´ò
˲·¬ó×××
Í·³«´¿¬·±² ±º ½±²¬·²«±« §¬»³ô ¿²¿´±¹ ªò ¼·¹·¬¿´ Í·³«´¿¬·±²ô Í·³«´¿¬·±² ±º ©¿¬»® ®»»®ª±·®
§¬»³ô Í·³«´¿¬·±² ±º ¿ »®ª± §¬»³ô ·³«´¿¬·±² ±º ¿² ¿«¬±°·´±¬ô
Ü·½®»¬» §¬»³ ·³«´¿¬·±²ô º·¨»¼ ¬·³»ó¬»° ªò »ª»² ¬± »ª»² ³±¼»´ô ¹»²»®¿¬·±² ±º ®¿²¼±³
²«³¾»®ô ¬»¬ º±® ®¿²¼±³²»ô Ó±²¬»óÝ¿®´± ½±³°«¬¿¬·±² ªò ¬±½¸¿¬·½ ·³«´¿¬·±²ò
˲·¬ó×Ê Í§¬»³ ¼§²¿³·½ô »¨°±²»²¬·¿´ ¹®±©¬¸ ³±¼»´ô »¨°±²»²¬·¿´ ¼»½¿§ ³±¼»´ô ³±¼·º·»¼ »¨°±²»²¬·¿´
¹®±©¬¸ ³±¼»´ô ´±¹·¬·½ ½«®ª»ô ¹»²»®¿´·¦¿¬·±² ±º ¹®±©¬¸ ³±¼»´ô §¬»³ ¼§²¿³·½ ¼·¿¹®¿³
ײ¬®±¼«½¬·±² ¬± Í×ÓÍÝÎ×ÐÌæ Ю±¹®¿³ô §¬»³ ½±²½»°¬ô ±®·¹·²¿¬·±²ô ¿²¼ ¬¿¬»³»²¬ô ¼»º·²·²¹
¬¸» ¬»´»°¸±²» §¬»³ ³±¼»´ò
˲·¬óÊ Í·³«´¿¬·±² ±º ÐÛÎÌ Ò»¬©±®µô ½®·¬·½¿´ °¿¬¸ ½±³°«¬¿¬·±²ô «²½»®¬¿·²¬·» ·² ¿½¬·ª·¬§ ¼«®¿¬·±² ô
®»±«®½» ¿´´±½¿¬·±² ¿²¼ ½±²·¼»®¿¬·±²ò
Í·³«´¿¬·±² ´¿²¹«¿¹» ¿²¼ ±º¬©¿®»ô ½±²¬·²«±« ¿²¼ ¼·½®»¬» ·³«´¿¬·±² ´¿²¹«¿¹»ô »¨°®»·±²
¾¿»¼ ´¿²¹«¿¹»ô ±¾¶»½¬ ±®·»²¬»¼ ·³«´¿¬·±²ô ¹»²»®¿´ °«®°±» ªò ¿°°´·½¿¬·±² ó ±®·»²¬»¼ ·³«´¿¬·±²
°¿½µ¿¹»ô ÝÍÓÐó×××ô ÓÑÜÍ×Óó×××ò
λº»®»²½»
ïò Ù»±º¬®»§ Ù±®¼±²ô � ͧ¬»³ Í·³«´¿¬·±²�ô ÐØ×
îò Ö»®®§ Þ¿²µô Ö±¸² Íò Ý Þ¿®®§ Ôò Ò»´±² Ü¿ª·¼ Óò Ò·½±´ô �Ü·½®»¬» Ûª»²¬ ͧ¬»³
Í·³«´¿¬·±²�ô л¿®±² Û¼«½¿¬·±²
íò Ê Ð Í·²¹¸ô �ͧ¬»³ Ó±¼»´·²¹ ¿²¼ ·³«´¿¬·±²�ô Ò»© ß¹» ײ¬»®²¿¬·±²¿´ò
ìò ߪ»®·´´ Óò Ô¿©ô Éò Ü¿ª·¼ Õ»´¬±²ô �ͧ¬»³ Ó±¼»´·²¹ ¿²¼ ·³«´¿¬·±² ¿²¼ ß²¿´§·�ô
ÌÓØ
ç
ÓÝß Ûîí ß¼ª¿²½»¼ Ü¿¬¿¾¿» Ó¿²¿¹»³»²¬ ͧ¬»³
ËÒ×Ìó×
Ì®¿²¿½¬·±² ¿²¼ ½¸»¼«´»ô ݱ²½«®®»²¬ Û¨»½«¬·±² ±º ¬®¿²¿½¬·±²ô ݱ²º´·½¬ ¿²¼ Ê·»©
Í»®·¿´·¦¿¾·´·¬§ô Ì»¬·²¹ º±® Í»®·¿´·¦¿¾·´·¬§ô ݱ²½»°¬ ·² λ½±ª»®¿¾´» ¿²¼ Ý¿½¿¼»´» ½¸»¼«´»ò
ËÒ×Ì �×× Ô±½µ ¾¿»¼ °®±¬±½±´ô ¬·³» ¬¿³° ¾¿»¼ °®±¬±½±´ô Ó«´¬·°´» Ù®¿²«´¿®·¬§ ¿²¼ Ó«´¬·ª»®·±²
Ì»½¸²·¯«»ô Û²º±®½·²¹ »®·¿´·¦¿¾´·¬§ ¾§ Ô±½µô Ô±½µ·²¹ §¬»³ ©·¬¸ ³«´¬·°´» ´±½µ ³±¼»ô
¿®½¸·¬»½¬«®» º±® Ô±½µ·²¹ ½¸»¼«´»®
ËÒ×Ì ×××
Ü·¬®·¾«¬»¼ Ì®¿²¿½¬·±² Ó¿²¿¹»³»²¬ô Ü¿¬¿ Ü·¬®·¾«¬·±²ô Ú®¿¹³»²¬¿¬·±² ¿²¼ λ°´·½¿¬·±²
Ì»½¸²·¯«»ô Ü·¬®·¾«¬»¼ ݱ³³·¬ô Ü·¬®·¾«¬»¼ Ô±½µ·²¹ ½¸»³»ô Ô±²¹ ¼«®¿¬·±² ¬®¿²¿½¬·±²ô
Ó± ݱ²½«®®»²½§ °®±¬±½±´ò
ËÒ×Ì �×Ê ×«» ±º λ½±ª»®§ ¿²¼ ¿¬±³·½·¬§ ·² Ü·¬®·¾«¬»¼ Ü¿¬¿¾¿»ô Ì®¿¼·¬·±²¿´ ®»½±ª»®§ ¬»½¸²·¯«»ô Ô±¹
¾¿»¼ ®»½±ª»®§ô λ½±ª»®§ ©·¬¸ ݱ²½«®®»²¬ Ì®¿²¿½¬·±²ô λ½±ª»®§ ·² Ó»¿¹» °¿·²¹ §¬»³ô
ݸ»½µ°±·²¬ô ß´¹±®·¬¸³ º±® ®»½±ª»®§ ´·²»ô ݱ²½»°¬ ·² Ñ®°¸¿² ¿²¼ ײ½±²·¬»²¬ Ó»¿¹»ò
ËÒ×Ì Ê
Ü·¬®·¾«¬»¼ Ï«»®§ Ю±½»·²¹ô Ó«´¬·©¿§ Ö±·²ô Í»³· ¶±·²ô ݱ¬ ¾¿»¼ ¯«»®§ ±°¬·³·¦¿¬·±² º±®
¼·¬®·¾«¬»¼ ¼¿¬¿¾¿»ô Ë°¼¿¬·²¹ ®»°´·½¿¬»¼ ¼¿¬¿ô °®±¬±½±´ º±® Ü·¬®·¾«¬»¼ Ü»¿¼´±½µ Ü»¬»½¬·±²ô
Û¿¹»® ¿²¼ Ô¿¦§ λ°´·½¿¬·±² Ì»½¸²·¯«»
λº»®»²½»
ïò Í·´¾»®½¸¿¬¦ô Õ±®¬¸ ¿²¼ Í«¼»®¸¿²ô Ü¿¬¿¾¿» ͧ¬»³ ݱ²½»°¬�ô Ó½ Ù®¿© Ø·´´
îò ο³¿µ®·¸²¿ ¿²¼ Ù»¸®µ»ô� Ü¿¬¿¾¿» Ó¿²¿¹»³»²¬ ͧ¬»³ô Ó½ Ù®¿© Ø·´´
íò Ù¿®½·¿óÓ±´·²¿ô Ë´´³¿²ôÉ·¼±³ô� Ü¿¬¿¾¿» ͧ¬»³ ׳°´»³»²¬¿¬·±²� л¿®±² Û¼«½¿¬·±²
ìò Ý»»· ¿²¼ л´¿¹¿¬¬·ô�Ü·¬®·¾«¬»¼ Ü¿¬¿¾¿»�ô ÌÓØ
ëò Í·²¹¸¿´ ¿²¼ ͸·ª®¿¬®·ô �ß¼ª¿²½» ݱ²½»°¬ ·² Ñ°»®¿¬·²¹ ͧ¬»³� ÓÝ Ù®¿© Ø·´´
ÓÝß Ûîì ß®¬·º·½·¿´ ײ¬»´´·¹»²½»
˲·¬ó× ×²¬®±¼«½¬·±² æ ײ¬®±¼«½¬·±² ¬± ß®¬·º·½·¿´ ײ¬»´´·¹»²½»ô Ú±«²¼¿¬·±² ¿²¼ Ø·¬±®§ ±º ß®¬·º·½·¿´
ײ¬»´´·¹»²½»ô ß°°´·½¿¬·±² ±º ß®¬·º·½·¿´ ײ¬»´´·¹»²½»ô ײ¬»´´·¹»²¬ ß¹»²¬ô ͬ®«½¬«®» ±º ײ¬»´´·¹»²¬
ß¹»²¬ò ݱ³°«¬»® ª··±²ô Ò¿¬«®¿´ Ô¿²¹«¿¹» б»·²¹ò
˲·¬ó×× ×²¬®±¼«½¬·±² ¬± Í»¿®½¸ æ Í»¿®½¸·²¹ º±® ±´«¬·±²ô ˲·º±®³»¼ »¿®½¸ ¬®¿¬»¹·»ô ײº±®³»¼ »¿®½¸
¬®¿¬»¹·»ô Ô±½¿´ »¿®½¸ ¿´¹±®·¬¸³ ¿²¼ ±°¬·³·¬·½ °®±¾´»³ô ß¼ª»®¿®·¿´ Í»¿®½¸ô Í»¿®½¸ º±®
¹¿³»ô ß´°¸¿ ó Þ»¬¿ °®«²·²¹ò
ïð
˲·¬ó×××
Õ²±©´»¼¹» λ°®»»²¬¿¬·±² ú λ¿±²·²¹æ Ю±°±·¬·±²¿´ ´±¹·½ô ̸»±®§ ±º º·®¬ ±®¼»® ´±¹·½ô
ײº»®»²½» ·² Ú·®¬ ±®¼»® ´±¹·½ô Ú±®©¿®¼ ú Þ¿½µ©¿®¼ ½¸¿·²·²¹ô λ±´«¬·±²ô Ю±¾¿¾·´·¬·½
®»¿±²·²¹ô ˬ·´·¬§ ¬¸»±®§ô Ø·¼¼»² Ó¿®µ±ª Ó±¼»´ øØÓÓ÷ô Þ¿§»·¿² Ò»¬©±®µò ˲·¬ó×Ê Ó¿½¸·²» Ô»¿®²·²¹ æ Í«°»®ª·»¼ ¿²¼ «²«°»®ª·»¼ ´»¿®²·²¹ô Ü»½··±² ¬®»»ô ͬ¿¬·¬·½¿´ ´»¿®²·²¹
³±¼»´ô Ô»¿®²·²¹ ©·¬¸ ½±³°´»¬» ¼¿¬¿ ó Ò¿·ª» Þ¿§» ³±¼»´ô Ô»¿®²·²¹ ©·¬¸ ¸·¼¼»² ¼¿¬¿ ó ÛÓ
¿´¹±®·¬¸³ô λ·²º±®½»³»²¬ ´»¿®²·²¹ô ˲·¬óÊ Ð¿¬¬»®² λ½±¹²·¬·±² æ ײ¬®±¼«½¬·±²ô Ü»·¹² °®·²½·°´» ±º °¿¬¬»®² ®»½±¹²·¬·±² §¬»³ô ͬ¿¬·¬·½¿´
שּׁ»®² ®»½±¹²·¬·±²ô п®¿³»¬»® »¬·³¿¬·±² ³»¬¸±¼ ó Ю·²½·°´» ݱ³°±²»²¬ ß²¿´§· øÐÝß÷ ¿²¼
Ô·²»¿® Ü·½®·³·²¿²¬ ß²¿´§· øÔÜß÷ô Ý´¿·º·½¿¬·±² Ì»½¸²·¯«» � Ò»¿®»¬ Ò»·¹¸¾±® øÒÒ÷ Ϋ´»ô
Þ¿§» Ý´¿·º·»®ô Í«°°±®¬ Ê»½¬±® Ó¿½¸·²» øÍÊÓ÷ô Õ � ³»¿² ½´«¬»®·²¹ò
λº»®»²½»æ
ïò ͬ«¿®¬ Ϋ»´´ô 묻® Ò±®ª·¹ô �ß®¬·º·½·¿´ ײ¬»´´·¹»²½» � ß Ó±¼»®² ß°°®±¿½¸�ô л¿®±² Û¼«½¿¬·±²
îò Û´¿·²» η½¸ ¿²¼ Õ»ª·² Õ²·¹¸¬ô �ß®¬·º·½·¿´ ײ¬»´´·¹»²½»�ô Ó½Ù®¿©óØ·´´ íò Û Ý¸¿®²·¿µ ¿²¼ Ü Ó½Ü»®³±¬¬ô �ײ¬®±¼«½¬·±² ¬± ß®¬·º·½·¿´ ײ¬»´´·¹»²½»�ô л¿®±²
Û¼«½¿¬·±² ìò Ü¿² Éò שּׁ»®±²ô �ß®¬·º·½·¿´ ײ¬»´´·¹»²½» ¿²¼ Û¨°»®¬ ͧ¬»³�ô Ю»²¬·½» Ø¿´´ ±º ײ¼·¿
ÓÝß Ûîë ײº±®³¿¬·±² Í»½«®·¬§ ¿²¼ ݧ¾»® Ô¿©
ËÒ×Ìó× Ø·¬±®§ ±º ײº±®³¿¬·±² ͧ¬»³ ¿²¼ ·¬ ׳°±®¬¿²½»ô ¾¿·½ô ݸ¿²¹·²¹ Ò¿¬«®» ±º ײº±®³¿¬·±²
ͧ¬»³ô Ò»»¼ ±º Ü·¬®·¾«¬»¼ ײº±®³¿¬·±² ͧ¬»³ô α´» ±º ײ¬»®²»¬ ¿²¼ É»¾ Í»®ª·½»ô
ײº±®³¿¬·±² ͧ¬»³ ̸®»¿¬ ¿²¼ ¿¬¬¿½µô Ý´¿·º·½¿¬·±² ±º ̸®»¿¬ ¿²¼ ß»·²¹ Ü¿³¿¹»
Í»½«®·¬§ ·² Ó±¾·´» ¿²¼ É·®»´» ݱ³°«¬·²¹ó Í»½«®·¬§ ݸ¿´´»²¹» ·² Ó±¾·´» Ü»ª·½»ô
¿«¬¸»²¬·½¿¬·±² Í»®ª·½» Í»½«®·¬§ô Í»½«®·¬§ ׳°´·½¿¬·±² º±® ±®¹¿²·¦¿¬·±²ô Ô¿°¬±° Í»½«®·¬§
ݱ²½»°¬ ·² ײ¬»®²»¬ ¿²¼ ɱ®´¼ É·¼» É»¾æ Þ®·»º ®»ª·»© ±º ײ¬»®²»¬ Ю±¬±½±´óÌÝÐñ×Ðô ×ÐÊìô ×ÐÊêò
Ú«²½¬·±² ±º ª¿®·±« ²»¬©±®µ·²¹ ½±³°±²»²¬ó®±«¬»®ô ¾®·¼¹»ô ©·¬½¸»ô ¸«¾ô ¹¿¬»©¿§ ¿²¼ Ó±¼«´¿¬·±²
Ì»½¸²·¯«»
ËÒ×Ìó×× Þ¿·½ Ю·²½·°´» ±º ײº±®³¿¬·±² Í»½«®·¬§ô ݱ²º·¼»²¬·¿´·¬§ô ײ¬»¹®·¬§ ߪ¿·´¿¾·´·¬§ ¿²¼ ±¬¸»® ¬»®³
·² ײº±®³¿¬·±² Í»½«®·¬§ô ײº±®³¿¬·±² Ý´¿·º·½¿¬·±² ¿²¼ ¬¸»·® α´»ò
ïï
Í»½«®·¬§ ̸®»¿¬ ¬± Û Ý±³³»®½»ô Ê·®¬«¿´ Ñ®¹¿²·¦¿¬·±²ô Þ«·²» Ì®¿²¿½¬·±² ±² É»¾ô Û
Ù±ª»®²¿²½» ¿²¼ ÛÜ×ô ݱ²½»°¬ ·² Û´»½¬®±²·½ °¿§³»²¬ §¬»³ô Û Ý¿¸ô Ý®»¼·¬ñÜ»¾·¬ Ý¿®¼ò
ËÒ×Ìó××× Ð¸§·½¿´ Í»½«®·¬§ó Ò»»¼ô Ü·¿¬»® ¿²¼ ݱ²¬®±´ô Þ¿·½ Ì»²»¬ ±º и§·½¿´ Í»½«®·¬§ ¿²¼ и§·½¿´
Û²¬®§ ݱ²¬®±´ô
ß½½» ݱ²¬®±´ó Þ·±³»¬®·½ô Ú¿½¬±® ·² Þ·±³»¬®·½ ͧ¬»³ô Þ»²»º·¬ô Ý®·¬»®·¿ º±® »´»½¬·±² ±º
¾·±³»¬®·½ô Ü»·¹² ׫» ·² Þ·±³»¬®·½ ͧ¬»³ô ײ¬»®±°»®¿¾·´·¬§ ׫»ô Û½±²±³·½ ¿²¼ ͱ½·¿´
ß°»½¬ô Ô»¹¿´ ݸ¿´´»²¹»
Ú®¿³»©±®µ º±® ײº±®³¿¬·±² Í»½«®·¬§ô ×ÍÑ îéððïô ÍÛÛóÝÓÓô Í»½«®·¬§ Ó»¬®·½ô ײº±®³¿¬·±² Í»½«®·¬§ Ê
Ю·ª¿½§
ËÒ×Ìó×Ê
Ó±¼»´ ±º Ý®§°¬±¹®¿°¸·½ ͧ¬»³ô ׫» ·² ܱ½«³»²¬ Í»½«®·¬§ô ͧ¬»³ ±º Õ»§ô Ы¾´·½ Õ»§
Ý®§°¬±¹®¿°¸§ô Ü·¹·¬¿´ Í·¹²¿¬«®»ô λ¯«·®»³»²¬ ±º Ü·¹·¬¿´ Í·¹²¿¬«®» ͧ¬»³ô Ú·²¹»® Ю·²¬ô
Ú·®»©¿´´ô Ü»·¹² ¿²¼ ׳°´»³»²¬¿¬·±² ׫»ô б´·½·»
Ò»¬©±®µ Í»½«®·¬§ó Þ¿·½ ݱ²½»°¬ô Ü·³»²·±²ô л®·³»¬»® º±® Ò»¬©±®µ Ю±¬»½¬·±²ô Ò»¬©±®µ
߬¬¿½µô Ò»»¼ ±º ײ¬®«·±² Ó±²·¬±®·²¹ ¿²¼ Ü»¬»½¬·±²ô ײ¬®«·±² Ü»¬»½¬·±²
Ê·®¬«¿´ Ю·ª¿¬» Ò»¬©±®µó Ò»»¼ô Ë» ±º Ì«²²»´·²¹ ©·¬¸ ÊÐÒô ß«¬¸»²¬·½¿¬·±² Ó»½¸¿²·³ô
̧°» ±º ÊÐÒ ¿²¼ ¬¸»·® Ë¿¹»ô Í»½«®·¬§ ݱ²½»®² ·² ÊÐÒ
ËÒ×ÌóÊ
Ô¿©ô ײª»¬·¹¿¬·±² ¿²¼ Û¬¸·½æ ݧ¾»® Ý®·³»ô ײº±®³¿¬·±² Í»½«®·¬§ ¿²¼ Ô¿©ô ̧°» ú ±ª»®ª·»© ±º ݧ¾»®
Ý®·³»ô ݧ¾»® Ô¿© ׫» ·² ÛóÞ«·²» Ó¿²¿¹»³»²¬
Ѫ»®ª·»© ±º ײ¼·¿² ×Ì ß½¬ô Û¬¸·½¿´ ׫» ·² ײ¬»´´»½¬«¿´ °®±°»®¬§ ®·¹¸¬ô ݱ°§ η¹¸¬ô כּ²¬ô Ü¿¬¿ °®·ª¿½§ ¿²¼ °®±¬»½¬·±²ô ܱ³¿·² Ò¿³»ô ͱº¬©¿®» °·®¿½§ô д¿¹·¿®·³ô ׫» ·² »¬¸·½¿´ ¸¿½µ·²¹ò
λº»®»²½» æ
ïò Ù±¼¾±´»ô� ײº±®³¿¬·±² ͧ¬»³ Í»½«®·¬§�ô É·´´»§
îò Ó»®µ±ªô Þ®»·¬¸¿«°¬ô� ײº±®³¿¬·±² Í»½«®·¬§�ô л¿®±² Û¼«½¿¬·±²
íò Ç¿¼¿ªô �Ú±«²¼¿¬·±² ±º ײº±®³¿¬·±² Ì»½¸²±´±¹§�ô Ò»© ß¹»ô Ü»´¸·
ìò ͽ¸±«ô ͸±»³¿µ»®ô � ײº±®³¿¬·±² ß«®¿²½» º±® ¬¸» Û²¬»®°®·»�ô Ì¿¬¿ Ó½Ù®¿© Ø·´´
ëò ͱ±¼ô�ݧ¾»® Ô¿© Í·³°´·º·»¼�ô Ó½ Ù®¿© Ø·´´
êò Ú«®²»´´ô �ݱ³°«¬»® ײ»½«®·¬§�ô Í°®·²¹»®
éò ×Ì ß½¬ îððð
ÓÝß Ûîê ײº±®³¿¬·±² ͬ±®¿¹» ú Ó¿²¿¹»³»²¬
˲·¬ó×æ ײ¬®±¼«½¬·±² ¬± ͬ±®¿¹» Ì»½¸²±´±¹§ Ü¿¬¿ °®±´·º»®¿¬·±² ¿²¼ ¬¸» ª¿®§·²¹ ª¿´«» ±º ¼¿¬¿ ©·¬¸ ¬·³» ú «¿¹»ô ͱ«®½» ±º ¼¿¬¿ ¿²¼ ¬¿¬» ±º
¼¿¬¿ ½®»¿¬·±²ô Ü¿¬¿ ½»²¬»® ®»¯«·®»³»²¬ ¿²¼ »ª±´«¬·±² ¬± ¿½½±³³±¼¿¬» ¬±®¿¹» ²»»¼ô Ѫ»®ª·»©
±º ¾¿·½ ¬±®¿¹» ³¿²¿¹»³»²¬ µ·´´ ¿²¼ ¿½¬·ª·¬·»ô ̸» º·ª» °·´´¿® ±º ¬»½¸²±´±¹§ô Ѫ»®ª·»© ±º
ïî
¬±®¿¹» ·²º®¿¬®«½¬«®» ½±³°±²»²¬ô Ûª±´«¬·±² ±º ¬±®¿¹»ô ײº±®³¿¬·±² Ô·º»½§½´» Ó¿²¿¹»³»²¬
½±²½»°¬ô Ü¿¬¿ ½¿¬»¹±®·¦¿¬·±² ©·¬¸·² ¿² »²¬»®°®·»ô ͬ±®¿¹» ¿²¼ λ¹«´¿¬·±²ò
˲·¬ó××æ ͬ±®¿¹» ͧ¬»³ ß®½¸·¬»½¬«®» ײ¬»´´·¹»²¬ ¼·µ «¾§¬»³ ±ª»®ª·»©ô ݱ²¬®¿¬ ±º ·²¬»¹®¿¬»¼ ªò ³±¼«´¿® ¿®®¿§ô ݱ³°±²»²¬
¿®½¸·¬»½¬«®» ±º ·²¬»´´·¹»²¬ ¼·µ «¾§¬»³ô Ü·µ °¸§·½¿´ ¬®«½¬«®» ½±³°±²»²¬ô °®±°»®¬·»ô
°»®º±®³¿²½»ô ¿²¼ °»½·º·½¿¬·±²ô Ô±¹·½¿´ °¿®¬·¬·±²·²¹ ±º ¼·µô Îß×Ü ú °¿®·¬§ ¿´¹±®·¬¸³ô ¸±¬
°¿®·²¹ô и§·½¿´ ªò ´±¹·½¿´ ¼·µ ±®¹¿²·¦¿¬·±²ô °®±¬»½¬·±²ô ¿²¼ ¾¿½µ »²¼ ³¿²¿¹»³»²¬ô ß®®¿§
½¿½¸·²¹ °®±°»®¬·» ¿²¼ ¿´¹±®·¬¸³ô Ú®±²¬ »²¼ ½±²²»½¬·ª·¬§ ¿²¼ ¯«»«·²¹ °®±°»®¬·»ô Ú®±²¬ »²¼ ¬±
¸±¬ ¬±®¿¹» °®±ª··±²·²¹ô ³¿°°·²¹ô ¿²¼ ±°»®¿¬·±²ô ײ¬»®¿½¬·±² ±º º·´» §¬»³ ©·¬¸ ¬±®¿¹»ô
ͬ±®¿¹» §¬»³ ½±²²»½¬·ª·¬§ °®±¬±½±´ò
˲·¬ó×××æ ײ¬®±¼«½¬·±² ¬± Ò»¬©±®µ»¼ ͬ±®¿¹» ÖÞÑÜô ÜßÍô ÍßÒô ÒßÍô ú ÝßÍ »ª±´«¬·±²ô Ü·®»½¬ ߬¬¿½¸»¼ ͬ±®¿¹» øÜßÍ÷ »²ª·®±²³»²¬æ
»´»³»²¬ô ½±²²»½¬·ª·¬§ô ú ³¿²¿¹»³»²¬ô ͬ±®¿¹» ß®»¿ Ò»¬©±®µ øÍßÒ÷æ »´»³»²¬ ú ½±²²»½¬·ª·¬§ô
Ú·¾®» ݸ¿²²»´ °®·²½·°´»ô ¬¿²¼¿®¼ô ú ²»¬©±®µ ³¿²¿¹»³»²¬ °®·²½·°´»ô ÍßÒ ³¿²¿¹»³»²¬
°®·²½·°´»ô Ò»¬©±®µ ߬¬¿½¸»¼ ͬ±®¿¹» øÒßÍ÷æ »´»³»²¬ô ½±²²»½¬·ª·¬§ ±°¬·±²ô ½±²²»½¬·ª·¬§
°®±¬±½±´ øÒÚÍô Ý×ÚÍô º¬°÷ô ú ³¿²¿¹»³»²¬ °®·²½·°´»ô ×Ð ÍßÒ »´»³»²¬ô ¬¿²¼¿®¼ øÍÝÍ×ô ÚÝ×Ðô
ÚÝÐ÷ô ½±²²»½¬·ª·¬§ °®·²½·°´»ô »½«®·¬§ô ¿²¼ ³¿²¿¹»³»²¬ °®·²½·°´»ô ݱ²¬»²¬ ß¼¼®»¿¾´»
ͬ±®¿¹» øÝßÍ÷æ »´»³»²¬ô ½±²²»½¬·ª·¬§ ±°¬·±²ô ¬¿²¼¿®¼ô ¿²¼ ³¿²¿¹»³»²¬ °®·²½·°´»ô ا¾®·¼
ͬ±®¿¹» ±´«¬·±² ±ª»®ª·»© ·²½´«¼·²¹ ¬»½¸²±´±¹·» ´·µ» ª·®¬«¿´·¦¿¬·±² ú ¿°°´·¿²½»ò ˲·¬ó×Êæ ײ¬®±¼«½¬·±² ¬± ײº±®³¿¬·±² ߪ¿·´¿¾·´·¬§ Þ«·²» ݱ²¬·²«·¬§ ¿²¼ Ü·¿¬»® λ½±ª»®§ Þ¿·½ô Ô±½¿´ ¾«·²» ½±²¬·²«·¬§ ¬»½¸²·¯«»ô
λ³±¬» ¾«·²» ½±²¬·²«·¬§ ¬»½¸²·¯«»ô Ü·¿¬»® λ½±ª»®§ °®·²½·°´» ú ¬»½¸²·¯«»ò ˲·¬óÊæ Ó¿²¿¹·²¹ ú Ó±²·¬±®·²¹ Ó¿²¿¹»³»²¬ °¸·´±±°¸·» ø¸±´·¬·½ ªò §¬»³ ú ½±³°±²»²¬÷ô ײ¼«¬®§ ³¿²¿¹»³»²¬ ¬¿²¼¿®¼
øÍÒÓÐô ÍÓ×óÍô Ý×Ó÷ô ͬ¿²¼¿®¼ º®¿³»©±®µ ¿°°´·½¿¬·±²ô Õ»§ ³¿²¿¹»³»²¬ ³»¬®·½ ø¬¸®»¸±´¼ô
¿ª¿·´¿¾·´·¬§ô ½¿°¿½·¬§ô »½«®·¬§ô °»®º±®³¿²½»÷ô Ó»¬®·½ ¿²¿´§· ³»¬¸±¼±´±¹·» ú ¬®»²¼ ¿²¿´§·ô
λ¿½¬·ª» ¿²¼ °®±ó¿½¬·ª» ³¿²¿¹»³»²¬ ¾»¬ °®¿½¬·½»ô Ю±ª··±²·²¹ ú ½±²º·¹«®¿¬·±² ½¸¿²¹»
°´¿²²·²¹ô Ю±¾´»³ ®»°±®¬·²¹ô °®·±®·¬·¦¿¬·±²ô ¿²¼ ¸¿²¼´·²¹ ¬»½¸²·¯«»ô Ó¿²¿¹»³»²¬ ¬±±´
±ª»®ª·»©ò
λº»®»²½»
ïò ײº±®³¿¬·±² ͬ±®¿¹» ¿²¼ Ó¿²¿¹»³»²¬ ͬ±®·²¹ô Ó¿²¿¹·²¹ô ¿²¼ Ю±¬»½¬·²¹ Ü·¹·¬¿´
ײº±®³¿¬·±² ô ¾§ ÛÓÝô ر°µ·²¬±² ¿²¼ Ó¿¿½¸«»¬¬ô É·´»§ô ×ÍÞÒæ çéèèïîêëîïìéð
ÓÝß Ûíï ÛÎРͧ¬»³
ËÒ×Ì ó × ÛÎРײ¬®±¼«½¬·±²ô Þ»²»º·¬ô Ñ®·¹·²ô Ûª±´«¬·±² ¿²¼ ͬ®«½¬«®»æ ݱ²½»°¬«¿´ Ó±¼»´ ±º ÛÎÐô ̸»
Ûª±´«¬·±² ±º ÛÎÐô ̸» ͬ®«½¬«®» ±º ÛÎÐò
ïí
ËÒ×Ì ó ××
Þ«·²» Ю±½» λ»²¹·²»»®·²¹ô Ü¿¬¿ ©¿®» ر«·²¹ô Ü¿¬¿ Ó·²·²¹ô Ѳ´·²» ß²¿´§¬·½
Ю±½»·²¹øÑÔßÐ÷ô Ю±¼«½¬ Ô·º» ݧ½´» Ó¿²¿¹»³»²¬øÐÔÓ÷ôÔßÐô Í«°°´§ ½¸¿·² Ó¿²¿¹»³»²¬ò
ËÒ×Ì ó ××× ÛÎÐ Ó¿®µ»¬°´¿½» ¿²¼ Ó¿®µ»¬°´¿½» ܧ²¿³·½æ Ó¿®µ»¬ Ѫ»®ª·»©ô Ó¿®µ»¬°´¿½» ܧ²¿³·½ô ̸»
ݸ¿²¹·²¹ ÛÎÐ Ó¿®µ»¬ò
ÛÎÐó Ú«²½¬·±²¿´ Ó±¼«´»æ ײ¬®±¼«½¬·±²ô Ú«²½¬·±²¿´ Ó±¼«´» ±º ÛÎРͱº¬©¿®»ô ײ¬»¹®¿¬·±² ±º
ÛÎÐô Í«°°´§ ½¸¿·² ¿²¼ Ý«¬±³»® λ´¿¬·±²¸·° ß°°´·½¿¬·±²ò
ËÒ×Ì ó ×Ê ÛÎР׳°´»³»²¬¿¬·±² Þ¿·½ô ÛÎР׳°´»³»²¬¿¬·±² Ô·º» ݧ½´»ô α´» ±º ÍÜÔÝñÍÍßÜô Ѿ¶»½¬
Ñ®·»²¬»¼ ß®½¸·¬»½¬«®»ô ݱ²«´¬¿²¬ô Ê»²¼±® ¿²¼ Û³°´±§»»ô
ËÒ×Ì ó Ê ÛÎÐ ú Ûóݱ³³»®½»ô Ú«¬«®» Ü·®»½¬·ª»ó ·² ÛÎÐô ÛÎÐ ¿²¼ ײ¬»®²»¬ô Ý®·¬·½¿´ «½½» ¿²¼ º¿·´«®»
º¿½¬±®ô ײ¬»¹®¿¬·²¹ ÛÎÐ ·²¬± ±®¹¿²·¦¿¬·±²¿´ ½«´¬«®»ò
Ë·²¹ ÛÎÐ ¬±±´æ »·¬¸»® ÍßÐ ±® ÑÎßÝÔÛ º±®³¿¬ ¬± ½¿» ¬«¼§
λº»®»²½»æ
ïò ß´»¨· Ô»±²ô �ÛÎÐ Ü»³§¬·º·»¼�ô Ì¿¬¿ Ó½Ù®¿© Ø·´´
îò ο¸«´ Êò ß´¬»µ¿® �Û²¬»®°®·»©·¼» 뱫®½» д¿²²·²¹�ô Ì¿¬¿ Ó½Ù®¿© Ø·´´ô
íò Ê·²±¼ Õ«³¿® Ù¿®¹ ¿²¼ Ê»²µ·¬¿µ®·¸²¿² Ò Õô �Û²¬»®°®·» 뱫®½» д¿²²·²¹ �
ݱ²½»°¬ ¿²¼ Ю¿½¬·½»�ô ÐØ×
ìò Ö±»°¸ ß Þ®¿¼§ô Û´´»² Ú Ó±²µô Þ®»¬ É¿¹²»®ô �ݱ²½»°¬ ·² Û²¬»®°®·» 뱫®½»
д¿²²·²¹�ô ̸±³°±² ݱ«®» Ì»½¸²±´±¹§
ëò Ó¿®§ Í«³³»®ô �Û²¬»®°®·» 뱫®½» д¿²²·²¹�ó л¿®±² Û¼«½¿¬·±²
ÓÝß Ûíî ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬
ËÒ×Ìó×æ ײ¬®±¼«½¬·±² ¿²¼ ͱº¬©¿®» Ю±¶»½¬ д¿²²·²¹
Ú«²¼¿³»²¬¿´ ±º ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ øÍÐÓ÷ô Ò»»¼ ×¼»²¬·º·½¿¬·±²ô Ê··±² ¿²¼ ͽ±°»
¼±½«³»²¬ô Ю±¶»½¬ Ó¿²¿¹»³»²¬ ݧ½´»ô ÍÐÓ Ñ¾¶»½¬·ª»ô Ó¿²¿¹»³»²¬ Í°»½¬®«³ô ÍÐÓ
Ú®¿³»©±®µô ͱº¬©¿®» Ю±¶»½¬ д¿²²·²¹ô д¿²²·²¹ Ѿ¶»½¬·ª»ô Ю±¶»½¬ д¿²ô ̧°» ±º °®±¶»½¬ °´¿²ô
ͬ®«½¬«®» ±º ¿ ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ д¿²ô ͱº¬©¿®» °®±¶»½¬ »¬·³¿¬·±²ô Û¬·³¿¬·±²
³»¬¸±¼ô Û¬·³¿¬·±² ³±¼»´ô Ü»½··±² °®±½»ò
ËÒ×Ìó××æ Ю±¶»½¬ Ñ®¹¿²·¦¿¬·±² ¿²¼ ͽ¸»¼«´·²¹ Ю±¶»½¬ Û´»³»²¬ô ɱ®µ Þ®»¿µ¼±©² ͬ®«½¬«®» øÉÞÍ÷ô ̧°» ±º ÉÞÍô Ú«²½¬·±²ô ß½¬·ª·¬·» ¿²¼
Ì¿µô Ю±¶»½¬ Ô·º» ݧ½´» ¿²¼ Ю±¼«½¬ Ô·º» ݧ½´»ô É¿§ ¬± Ñ®¹¿²·¦» л®±²²»´ô Ю±¶»½¬ ½¸»¼«´»ô
ͽ¸»¼«´·²¹ Ѿ¶»½¬·ª»ô Þ«·´¼·²¹ ¬¸» °®±¶»½¬ ½¸»¼«´»ô ͽ¸»¼«´·²¹ ¬»®³·²±´±¹§ ¿²¼ ¬»½¸²·¯«»ô
Ò»¬©±®µ Ü·¿¹®¿³æ ÐÛÎÌô ÝÐÓô Þ¿® ݸ¿®¬æ Ó·´»¬±²» ݸ¿®¬ô Ù¿²¬¬ ݸ¿®¬ò
ïì
ËÒ×Ìó×××æ Ю±¶»½¬ Ó±²·¬±®·²¹ ¿²¼ ݱ²¬®±´
Ü·³»²·±² ±º Ю±¶»½¬ Ó±²·¬±®·²¹ ú ݱ²¬®±´ô Û¿®²»¼ Ê¿´«» ß²¿´§·ô Û¿®²»¼ Ê¿´«» ײ¼·½¿¬±®æ
Þ«¼¹»¬»¼ ݱ¬ º±® ɱ®µ ͽ¸»¼«´»¼ øÞÝÉÍ÷ô ݱ¬ Ê¿®·¿²½» øÝÊ÷ô ͽ¸»¼«´» Ê¿®·¿²½» øÍÊ÷ô
ݱ¬ л®º±®³¿²½» ײ¼»¨ øÝÐ×÷ô ͽ¸»¼«´» л®º±®³¿²½» ײ¼»¨ øÍÐ×÷ô ײ¬»®°®»¬¿¬·±² ±º Û¿®²»¼
Ê¿´«» ײ¼·½¿¬±®ô Û®®±® Ì®¿½µ·²¹ô ͱº¬©¿®» λª·»©ô ̧°» ±º λª·»©æ ײ°»½¬·±²ô Ü»µ½¸»½µô
É¿´µ¬¸®±«¹¸ô ݱ¼» λª·»©ô п·® Ю±¹®¿³³·²¹ò
ËÒ×Ìó×Êæ ͱº¬©¿®» Ï«¿´·¬§ ß«®¿²½» ¿²¼ Ì»¬·²¹ Ì»¬·²¹ Ѿ¶»½¬·ª»ô Ì»¬·²¹ Ю·²½·°´»ô Ì»¬ д¿²ô Ì»¬ Ý¿»ô ̧°» ±º Ì»¬·²¹ô Ô»ª»´ ±º
Ì»¬·²¹ô Ì»¬ ͬ®¿¬»¹·»ô Ю±¹®¿³ ݱ®®»½¬²»ô Ю±¹®¿³ Ê»®·º·½¿¬·±² ú ª¿´·¼¿¬·±²ô Ì»¬·²¹
ß«¬±³¿¬·±² ú Ì»¬·²¹ ̱±´ô ݱ²½»°¬ ±º ͱº¬©¿®» Ï«¿´·¬§ô ͱº¬©¿®» Ï«¿´·¬§ ߬¬®·¾«¬»ô
ͱº¬©¿®» Ï«¿´·¬§ Ó»¬®·½ ¿²¼ ײ¼·½¿¬±®ô ̸» ÍÛ× Ý¿°¿¾·´·¬§ Ó¿¬«®·¬§ Ó±¼»´ ÝÓÓ÷ô ÍÏß
ß½¬·ª·¬·»ô Ú±®³¿´ ÍÏß ß°°®±¿½¸»æ Ю±±º ±º ½±®®»½¬²»ô ͬ¿¬·¬·½¿´ ¯«¿´·¬§ ¿«®¿²½»ô
Ý´»¿²®±±³ °®±½»ò
ËÒ×ÌóÊæ Ю±¶»½¬ Ó¿²¿¹»³»²¬ ¿²¼ Ю±¶»½¬ Ó¿²¿¹»³»²¬ ̱±´ ͱº¬©¿®» ݱ²º·¹«®¿¬·±² Ó¿²¿¹»³»²¬æ ͱº¬©¿®» ݱ²º·¹«®¿¬·±² ׬»³ ¿²¼ ¬¿µô Þ¿»´·²»ô д¿²
º±® ݸ¿²¹»ô ݸ¿²¹» ݱ²¬®±´ô ݸ¿²¹» λ¯«»¬ Ó¿²¿¹»³»²¬ô Ê»®·±² ݱ²¬®±´ô ηµ
Ó¿²¿¹»³»²¬æ ηµ ¿²¼ ®·µ ¬§°»ô ηµ Þ®»¿µ¼±©² ͬ®«½¬«®» øÎÞÍ÷ô ηµ Ó¿²¿¹»³»²¬
Ю±½»æ ηµ ·¼»²¬·º·½¿¬·±²ô ηµ ¿²¿´§·ô ηµ °´¿²²·²¹ô ηµ ³±²·¬±®·²¹ô ݱ¬ Þ»²»º·¬
ß²¿´§·ô ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ ̱±´æ ÝßÍÛ Ì±±´ô д¿²²·²¹ ¿²¼ ͽ¸»¼«´·²¹ ̱±´ô
ÓÍóЮ±¶»½¬ò
λº»®»²½»æ
ïò Óò ݱ¬¬»®»´´ô ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ô Ì¿¬¿ Ó½Ù®¿©óØ·´´ Ы¾´·½¿¬·±²ò
îò ᧽»ô ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ô л¿®±² Û¼«½¿¬·±²
íò Õ·»®±² ݱ²©¿§ô ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ô Ü®»¿³¬»½¸ Ю»
ìò Íò ßò Õ»´µ¿®ô ͱº¬©¿®» Ю±¶»½¬ Ó¿²¿¹»³»²¬ô ÐØ× Ð«¾´·½¿¬·±²ò
ÓÝß Ûíí λ¿´ Ì·³» ͧ¬»³
ËÒ×Ìó×æ ײ¬®±¼«½¬·±² Ü»º·²·¬·±²ô ̧°·½¿´ λ¿´ Ì·³» ß°°´·½¿¬·±²æ Ü·¹·¬¿´ ݱ²¬®±´ô Ø·¹¸ Ô»ª»´ ݱ²¬®±´ô Í·¹²¿´
Ю±½»·²¹ »¬½òô λ´»¿» Ì·³»ô Ü»¿¼´·²»ô ¿²¼ Ì·³·²¹ ݱ²¬®¿·²¬ô Ø¿®¼ λ¿´ Ì·³» ͧ¬»³
¿²¼ ͱº¬ λ¿´ Ì·³» ͧ¬»³ô λº»®»²½» Ó±¼»´ º±® λ¿´ Ì·³» ͧ¬»³æ Ю±½»±® ¿²¼
뱫®½»ô Ì»³°±®¿´ п®¿³»¬»® ±º λ¿´ Ì·³» ɱ®µ´±¿¼ô л®·±¼·½ Ì¿µ Ó±¼»´ô Ю»½»¼»²½»
ݱ²¬®¿·²¬ ¿²¼ Ü¿¬¿ Ü»°»²¼»²½§ò ËÒ×Ìó××æ λ¿´ Ì·³» ͽ¸»¼«´·²¹
ݱ³³±² ß°°®±¿½¸» ¬± λ¿´ Ì·³» ͽ¸»¼«´·²¹æ Ý´±½µ Ü®·ª»² ß°°®±¿½¸ô É»·¹¸¬»¼
α«²¼ α¾·² ß°°®±¿½¸ô Ю·±®·¬§ Ü®·ª»² ß°°®±¿½¸ô ܧ²¿³·½ Ê»®« ͬ¿¬·½ ͧ¬»³ô Ñ°¬·³¿´·¬§
±º Ûºº»½¬·ª»óÜ»¿¼´·²»óÚ·®¬ øÛÜÚ÷ ¿²¼ Ô»¿¬óÍ´¿½µóÌ·³»óÚ·®¬ øÔÍÌ÷ ß´¹±®·¬¸³ô כּ
Ó±²±¬±²·½ ß´¹±®·¬¸³ô Ѻº´·²» Ê»®« Ѳ´·²» ͽ¸»¼«´·²¹ô ͽ¸»¼«´·²¹ ß°»®·±¼·½ ¿²¼ Í°±®¿¼·½
¶±¾ ·² Ю·±®·¬§ Ü®·ª»² ¿²¼ Ý´±½µ Ü®·ª»² ͧ¬»³ò
ïë
ËÒ×Ìó×××æ 뱫®½» ͸¿®·²¹ Ûºº»½¬ ±º 뱫®½» ݱ²¬»²¬·±² ¿²¼ 뱫®½» ß½½» ݱ²¬®±´ øÎßÝ÷ô Ò±²ó°®»»³°¬·ª»
Ý®·¬·½¿´ Í»½¬·±²ô Þ¿·½ Ю·±®·¬§óײ¸»®·¬¿²½» ¿²¼ Ю·±®·¬§óÝ»·´·²¹ Ю±¬±½±´ô ͬ¿½µ Þ¿»¼ Ю·±®·¬§ó
Ý»·´·²¹ Ю±¬±½±´ô Ë» ±º Ю·±®·¬§óÝ»·´·²¹ Ю±¬±½±´ ·² ܧ²¿³·½ Ю·±®·¬§ ͧ¬»³ô Ю»»³°¬·±²
Ý»·´·²¹ Ю±¬±½±´ô ß½½» ݱ²¬®±´ ·² Ó«´¬·°´»ó˲·¬ 뱫®½»ô ݱ²¬®±´´·²¹ ݱ²½«®®»²¬ ß½½»»
¬± Ü¿¬¿ Ѿ¶»½¬ò ËÒ×Ìó×Êæ λ¿´ Ì·³» ݱ³³«²·½¿¬·±² Þ¿·½ ݱ²½»°¬ ·² λ¿´ ¬·³» ݱ³³«²·½¿¬·±²ô ͱº¬ ¿²¼ Ø¿®¼ ÎÌ Ý±³³«²·½¿¬·±² §¬»³ô
Ó±¼»´ ±º λ¿´ Ì·³» ݱ³³«²·½¿¬·±²ô Ю·±®·¬§óÞ¿»¼ Í»®ª·½» ¿²¼ É»·¹¸¬»¼ α«²¼óα¾·²
Í»®ª·½» Ü·½·°´·²» º±® Í©·¬½¸»¼ Ò»¬©±®µô Ó»¼·«³ ß½½» ݱ²¬®±´ Ю±¬±½±´ º±® Þ®±¿¼½¿¬
Ò»¬©±®µô ײ¬»®²»¬ ¿²¼ 뱫®½» λ»®ª¿¬·±² Ю±¬±½±´
ËÒ×ÌóÊæ λ¿´ Ì·³» Ñ°»®¿¬·²¹ ͧ¬»³ ¿²¼ Ü¿¬¿¾¿»
Ú»¿¬«®» ±º ÎÌÑÍô Ì·³» Í»®ª·½»ô ËÒ×È ¿ ÎÌÑÍô ÐÑÍ×È
׫»ô ݸ¿®»½¬»®·¬·½ ±º Ì»³°±®¿´ ¼¿¬¿ô Ì»³°±®¿´ ݱ²·¬»²½»§ô ݱ²½«®®»²½§ ݱ²¬®±´ô
Ѫ»®ª·»© ±º ݱ³³»®½·¿´ λ¿´ Ì·³» ¼¿¬¿¾¿»
λº»®»²½»æ
ïò λ¿´ Ì·³» ͧ¬»³ ¾§ Ö¿²» Éò Íò Ô·«ô л¿®±² Û¼«½¿¬·±² Ы¾´·½¿¬·±²ò
îò Ó¿´´ ο¶·¾ô �λ¿´ Ì·³» ͧ¬»³�ô л¿®±² Û¼«½¿¬·±²
íò ß´¾»®¬ Óò Õò ݸ»²¹ ô �λ¿´óÌ·³» ͧ¬»³æ ͽ¸»¼«´·²¹ô ß²¿´§·ô ¿²¼ Ê»®·º·½¿¬·±²�ô
É·´»§ò
ÓÝß Ûíì Ó±¾·´» ݱ³°«¬·²¹
˲·¬ � × ×²¬®±¼«½¬·±²ô ·«» ·² ³±¾·´» ½±³°«¬·²¹ô ±ª»®ª·»© ±º ©·®»´» ¬»´»°¸±²§æ ½»´´«´¿® ½±²½»°¬ô
ÙÍÓæ ¿·®ó·²¬»®º¿½»ô ½¸¿²²»´ ¬®«½¬«®»ô ´±½¿¬·±² ³¿²¿¹»³»²¬æ ØÔÎóÊÔÎô ¸·»®¿®½¸·½¿´ô ¸¿²¼±ººô
½¸¿²²»´ ¿´´±½¿¬·±² ·² ½»´´«´¿® §¬»³ô ÝÜÓßô ÙÐÎÍò ˲·¬ ó ××
É·®»´» Ò»¬©±®µ·²¹ô É·®»´» ÔßÒ Ñª»®ª·»©æ ÓßÝ ·«»ô ×ÛÛÛ èðîòïïô Þ´«» ̱±¬¸ô
É·®»´» ³«´¬·°´» ¿½½» °®±¬±½±´ô ÌÝÐ ±ª»® ©·®»´»ô É·®»´» ¿°°´·½¿¬·±²ô ¼¿¬¿ ¾®±¿¼½¿¬·²¹ô
Ó±¾·´» ×Ðô ÉßÐæ ß®½¸·¬»½¬«®»ô °®±¬±½±´ ¬¿½µô ¿°°´·½¿¬·±² »²ª·®±²³»²¬ô ¿°°´·½¿¬·±²ò ˲·¬ � ××× Ü¿¬¿ ³¿²¿¹»³»²¬ ·«»ô ¼¿¬¿ ®»°´·½¿¬·±² º±® ³±¾·´» ½±³°«¬»®ô ¿¼¿°¬·ª» ½´«¬»®·²¹ º±® ³±¾·´»
©·®»´» ²»¬©±®µô Ú·´» §¬»³ô Ü·½±²²»½¬»¼ ±°»®¿¬·±²ò ˲·¬ ó ×Ê Ó±¾·´» ß¹»²¬ ½±³°«¬·²¹ô »½«®·¬§ ¿²¼ º¿«´¬ ¬±´»®¿²½»ô ¬®¿²¿½¬·±² °®±½»·²¹ ·² ³±¾·´»
½±³°«¬·²¹ »²ª·®±²³»²¬ò
ïê
˲·¬ � Ê
ß¼¸±½ ²»¬©±®µô ´±½¿´·¦¿¬·±²ô ÓßÝ ·«»ô ᫬·²¹ °®±¬±½±´ô ¹´±¾¿´ ¬¿¬» ®±«¬·²¹ øÙÍÎ÷ô
Ü»¬·²¿¬·±² »¯«»²½»¼ ¼·¬¿²½» ª»½¬±® ®±«¬·²¹ øÜÍÜÊ÷ô ܧ²¿³·½ ±«®½» ®±«¬·²¹ øÜÍÎ÷ô ß¼ ر½
±² ¼»³¿²¼ ¼·¬¿²½» ª»½¬±® ®±«¬·²¹ øßÑÜÊ÷ô Ì»³°±®¿®§ ±®¼»®»¼ ®±«¬·²¹ ¿´¹±®·¬¸³ øÌÑÎß÷ô
Ï±Í ·² ß¼ ر½ Ò»¬©±®µô ¿°°´·½¿¬·±²ò
λº»®»²½»æ
ïò Öò ͽ¸·´´»®ô Ó±¾·´» ݱ³³«²·½¿¬·±²ô ß¼¼·±² É»´»§ò
îò ݸ¿®´» л®µ·²ô Ó±¾·´» ×Ðô ß¼¼·±² É»´»§ò íò ݸ¿®´» л®µ·²ô ß¼ ¸±½ Ò»¬©±®µô ß¼¼·±² É»´»§ò ìò Ë°¿¼¸§¿§¿ô �Ó±¾·´» ݱ³°«¬·²¹�ô Í°®·²¹»®
ÓÝß Ûíë Ò»«®¿´ Ò»¬©±®µ
˲·¬ó×æ
Ò»«®±½±³°«¬·²¹ ¿²¼ Ò»«®±½·»²½»
Ø·¬±®·½¿´ ²±¬»ô ¸«³¿² Þ®¿·²ô ²»«®±² Ó±¼» ´ô Õ²±©´»¼¹» ®»°®»»²¬¿¬·±²ô ß´ ¿²¼ ÒÒò Ô»¿®²·²¹
°®±½»æ Í«°»®ª·»¼ ¿²¼ «²«°»®ª ·»¼ ´»¿®²·²¹ô Û®®±® ½±®®»½¬·±² ´»¿®²·²¹ô½±³°»¬·¬·ª» ´»¿®²·²¹ô
¿¼¿°¬¿¬·±²ô ¬¿¬·¬·½¿´ ²¿¬«®» ±º ¬¸» ´»¿®²·²¹ °®±½»ò
˲·¬ó××æ
Ü¿¬¿ °®±½»·²¹
ͽ¿´·²¹ô ²±®³¿´·¦¿¬·±²ô Ì®¿²º±®³¿¬·±² øÚÌñÚÚÌ÷ô °®·²½·°¿´ ½±³°±²»²¬ ¿²¿´§·ô ®»¹®»·±²ô ½±ó
ª¿®·¿²½» ³¿¬®·¨ô »·¹»² ª¿´«» ú »·¹»² ª»½¬±®ò Þ¿·½ Ó±¼»´ ±º ß®¬·º·½·¿´ ²»«®±²ô ¿½¬·ª¿¬·±²
Ú«²½¬·±²ô ¿¹¹®»¹¿¬·±² º«²½¬·±²ô ·²¹´» ²»«®±² ½±³°«¬¿¬·±²ô ³«´¬·´¿§»® °»®½»°¬®±²ô ´»¿¬ ³»¿²
¯«¿®» ¿´¹±®·¬¸³ô ¹®¿¼·»²¬ ¼»½»²¬ ®«´»ô ²±²´·²»¿®´§ »°¿®¿¾´» °®±¾´»³ ¿²¼ ¾»²½¸ ³¿®µ
°®±¾´»³ ·² ÒÒò
˲·¬ó××× Ó«´¬·´¿§»®»¼ ²»¬©±®µ ¿®½¸·¬»½¬«®»ô ¾¿½µ °®±°¿¹¿¬·±² ¿´¹±®·¬¸³ô ¸»«®·¬·½ º±® ³¿µ·²¹ ÞÐó
¿´¹±®·¬¸³ °»®º±®³ ¾»¬¬»®ò ß½½»´»®¿¬»¼ ´»¿®²·²¹ ÞÐ ø´·µ» ®»½«®·ª» ´»¿¬ ¯«¿®»ô ¯«·½µ °®±°ô
ÎÐÎÑÐ ¿´¹±®·¬¸³÷ô ¿°°®±¨·³¿¬·±² °®±°»®¬·» ±º ÎÞÚ ²»¬©±®µ ¿²¼ ½±³°¿®·±² ©·¬¸ ³«´¬·´¿§»®
°»®½»°¬®¿²ò
˲·¬ó×Ê
뽫®®»²¬ ²»¬©±®µ ¿²¼ ¬»³°±®¿´ º»»¼óº±®©¿®¼ ²»¬©±®µô ·³°´»³»²¬¿¬·±² ©·¬¸ ÞÐô »´º ±®¹¿²·¦·²¹
³¿° ¿²¼ ÍÑÓ ¿´¹±®·¬¸³ô °®±°»®¬·» ±º º»¿¬«®» ³¿° ¿²¼ ½±³°«¬»® ·³«´¿¬·±²ò Ю·²½·°¿´
½±³°±²»²¬ ¿²¼ ײ¼»°»²¼»²¬ ½±³°±²»²¬ ¿²¿´§·ô ¿°°´·½¿¬·±² ¬± ·³¿¹» ¿²¼ ·¹²¿´ °®±½»·²¹ò
˲·¬óÊ Ý±³°´»¨ ª¿´«»¼ ÒÒ ¿²¼ ½±³°´»¨ ª¿´«»¼ ÞÐô ¿²¿´§¬·½·¬§ ±º ¿½¬·ª¿¬·±² º«²½¬·±²ô ¿°°´·½¿¬·±² ·²
îÜ ·²º±®³¿¬·±² °®±½»·²¹ò ݱ³°´»¨·¬§ ¿²¿´§· ±º ²»¬©±®µ ³±¼»´ò ͱº¬
½±³°«¬·²¹ò Ò»«®±óÚ«¦¦§ó¹»²»¬·½ ¿´¹±®·¬¸³ ײ¬»¹®¿¬·±²ò
ïé
λº»®»²½»æ
ïò Öòßò ß²¼»®±²ô ß² ײ¬±¼«½¬·±² ¬± Ò»«®¿´ Ò»¬©±®µô Ó×Ì
îò Ø¿¹»² Ü»³«¬¸ Þ»¿´»ô Ò»«®¿´ Ò»¬©±®µ Ü»·¹²ô Ý»²¹¿¹» Ô»¿®²·²¹
íò ÎòÔò Ø¿®ª»§ô Ò»«®¿´ Ò»¬©±®µ Ю·²½·°´»ô ÐØ×
ìò Õ±µ±ô Ò»«®¿´ Ò»¬©±®µ ¿²¼ Ú«¦¦§ Í»¬ô ÐØ×
ÓÝß Ûíê שּׁ»®² λ½±¹²·¬·±²
˲·¬ó× ×²¬®±¼«½¬·±²æ Þ¿·½ ±º °¿¬¬»®² ®»½±¹²·¬·±²ô Ü»·¹² °®·²½·°´» ±º °¿¬¬»®² ®»½±¹²·¬·±² §¬»³ô
Ô»¿®²·²¹ ¿²¼ ¿¼¿°¬¿¬·±²ô שּׁ»®² ®»½±¹²·¬·±² ¿°°®±¿½¸»ô Ó¿¬¸»³¿¬·½¿´ º±«²¼¿¬·±² � Ô·²»¿®
¿´¹»¾®¿ô Ю±¾¿¾·´·¬§ ̸»±®§ô Û¨°»½¬¿¬·±²ô ³»¿² ¿²¼ ½±ª¿®·¿²½»ô Ò±®³¿´ ¼·¬®·¾«¬·±²ô ³«´¬·ª¿®·¿¬»
²±®³¿´ ¼»²·¬·»ô ݸ· ¯«¿®»¼ ¬»¬ò ˲·¬ó×× Í¬¿¬·¬·½¿´ שּׁ»² λ½±¹²·¬·±²æ Þ¿§»·¿² Ü»½··±² ̸»±®§ô Ý´¿·º·»®ô Ò±®³¿´ ¼»²·¬§ ¿²¼
¼·½®·³·²¿²¬ º«²½¬·±²ô
˲·¬ � ××× Ð¿®¿³»¬»® »¬·³¿¬·±² ³»¬¸±¼æ Ó¿¨·³«³óÔ·µ»´·¸±±¼ »¬·³¿¬·±²ô Þ¿§»·¿² п®¿³»¬»®
»¬·³¿¬·±²ô Ü·³»²·±² ®»¼«½¬·±² ³»¬¸±¼ ó Ю·²½·°¿´ ݱ³°±²»²¬ ß²¿´§· øÐÝß÷ô Ú·¸»® Ô·²»¿®
¼·½®·³·²¿²¬ ¿²¿´§·ô Û¨°»½¬¿¬·±²ó³¿¨·³·¦¿¬·±² øÛÓ÷ô Ø·¼¼»² Ó¿®µ±ª Ó±¼»´ øØÓÓ÷ô
Ù¿«·¿² ³·¨¬«®» ³±¼»´ò
˲·¬ ó ×Ê Ò±²°¿®¿³»¬®·½ Ì»½¸²·¯«»æ Ü»²·¬§ Û¬·³¿¬·±²ô ﮦ»² É·²¼±©ô ÕóÒ»¿®»¬ Ò»·¹¸¾±®
Û¬·³¿¬·±²ô Ò»¿®»¬ Ò»·¹¸¾±® Ϋ´»ô Ú«¦¦§ ½´¿·º·½¿¬·±²ò ˲·¬ ó Ê Ë²«°»®ª·»¼ Ô»¿®²·²¹ ú Ý´«¬»®·²¹æ Ý®·¬»®·±² º«²½¬·±² º±® ½´«¬»®·²¹ô Ý´«¬»®·²¹ Ì»½¸²·¯«»æ
׬»®¿¬·ª» ¯«¿®» ó »®®±® °¿®¬·¬·±²¿´ ½´«¬»®·²¹ � Õ ³»¿²ô ¿¹¹´±³»®¿¬·ª» ¸·»®¿®½¸·½¿´ ½´«¬»®·²¹ô
Ý´«¬»® ª¿´·¼¿¬·±²ò
λº»®»²½»æ
ïò η½¸¿®¼ Ñò Ü«¼¿ô 묻® Ûò Ø¿®¬ ¿²¼ Ü¿ª·¼ Ùò ͬ±®µô �שּׁ»®² Ý´¿·º·½¿¬·±²�ô î²¼
Û¼·¬·±²ô Ö±¸² É·´»§ô îððêò
îò Ýò Óò Þ·¸±°ô �שּׁ»®² λ½±¹²·¬·±² ¿²¼ Ó¿½¸·²» Ô»¿®²·²¹�ô Í°®·²¹»®ô îððçò
íò Íò ̸»±¼±®·¼· ¿²¼ Õò Õ±«¬®±«³¾¿ô �שּׁ»®² λ½±¹²·¬·±²�ô 쬸
Û¼·¬·±²ô ß½¿¼»³·½ Ю»ô
îððçò
ïè
ÓÝß êïï ݱ´´±¯«·«³
Ù«·¼»´·²» ú Ù»²»®¿´ ײ¬®«½¬·±²æ
̸» ¿·³ ±º ¬¸» «¾¶»½¬ · ¬± ¼»ª»´±° ¿¾·´·¬§ ±º ¿ ¬«¼»²¬ ¬± ½¿®®§±«¬ ´·¬»®¿¬«®» «®ª»§ ú
·²¼»°»²¼»²¬ ¬«¼§ ±º ¿² ¿¼ª¿²½»¼ «¾¶»½¬ñ¬±°·½ñ³¿¬¬»® ·² ¬¸» º·»´¼ ±º ݱ³°«¬»® ͽ·»²½» ¿²¼
ײº±®³¿¬·±² ¬»½¸²±´±¹§ò
߬ ¬¸» ¾»¹·²²·²¹ ±º »³»¬»® ¿ ´·¬ ±º ½±´´±¯«·«³ ¬±°·½ ¸±«´¼ ¾» ¼·°´¿§»¼ ±² ¬¸» ²±¬·½»
¾±¿®¼ ¾§ ¬¸» ¼»°¿®¬³»²¬ ¿²¼ñ±® ±² ¬¸» ·²¬·¬«¬·±² ©»¾ ·¬»ò Ûª»®§ ͬ«¼»²¬ ³«¬ »´»½¬ ¿ ¬±°·½ ±º
¸· ½¸±·½»ò ̸» ¬«¼»²¬ · ®»¯«·®»¼ ¬± ½±²¼«½¬ ®·¹±®±« ¬«¼§ñ«®ª»§ ±² ¬¸» «¾¶»½¬ «²¼»® ¬¸»
«°»®ª··±² ±º ¬¸» º¿½«´¬§ ³»³¾»® ±º ¬¸» ¼»°¿®¬³»²¬ô °®»°¿®» ¿ ®»°±®¬ ¿²¼ °®»»²¬ ¬¸· ·²
°®»»²½» ±º ¿´´ ¬¸» ¬«¼»²¬ ±º ¸· ½´¿ ¿¬ ¬¸» »²¼ ±º »³»¬»®ò ̸» ½±³³»²¬ ú ½®·¬·½·³ ±º ¬¸»
¬±°·½ñ«¾¶»½¬ ©·´´ ¾» ¼·½«»¼ º±® ¬¸» ¾»²»º·¬ ±º ¿´´ ¬¸» ¬«¼»²¬ò ̸» »ª¿´«¿¬·±² ©·´´ ¾» ½¿®®·»¼
±«¬ ¾§ ¬¸» ¼»°¿®¬³»²¬ ¾¿»¼ ±² ¬¸» °®»»²¬¿¬·±²ò
ÓÝß êïî Ю±¶»½¬
Ù«·¼»´·²» ú Ù»²»®¿´ ײ¬®«½¬·±²æ
Ûª»®§ ¬«¼»²¬ · ®»¯«·®»¼ ¬± ½¿®®§ ±«¬ °®±¶»½¬ ©±®µ «²¼»® ¬¸» «°»®ª··±² ±º ¿ º¿½«´¬§
³»³¾»® ±º ¬¸» ¼»°¿®¬³»²¬ò ر©»ª»®ô ¿ ¬«¼»²¬ ³¿§ ¿´± ±°¬ ¬± °«®«» ¸· °®±¶»½¬ ©±®µ ·² ¿
®»°«¬»¼ ·²¼«¬®§ñ·²¬·¬«¬·±² ©·¬¸ ¬¸» ½±²»²¬ ±º Ü»°¿®¬³»²¬ñײ¬·¬«¬»ò ײ «½¸ ½¿»ô ¬¸»
¼»°¿®¬³»²¬ ³«¬ ´±±µ ·²¬± ¬¸» «·¬¿¾·´·¬§ ±º ¬¸» °®±¶»½¬ ¿²¼ ¿·¹² ±²» ·²¬»®²¿´ ¹«·¼»ñ«°»®ª·±®ò
̸» ·²¬»®²¿´ «°»®ª·±® ¸¿´´ ³±²·¬±® °®±¹®» ±º ¬¸» ¬«¼»²¬ ½±²¬·²«±«´§ò
ß ½¿²¼·¼¿¬» · ®»¯«·®»¼ ¬± °®»»²¬ ¬¸» °®±¹®» ±º ¬¸» °®±¶»½¬ ©±®µ ø ¿¬ ´»¿¬ ¬©·½»÷ ¼«®·²¹
¬¸» »³»¬»® ¿¬ ¿² ¿°°®±°®·¿¬» ¬·³» ¼»½·¼»¼ ¾§ ¬¸» Ü»°¿®¬³»²¬ ò ̸»®» ©·´´ ¿ º·²¿´ °®»»²¬¿¬·±² ±º
¬¸» °®±¶»½¬ ©±®µ ¿¬ ¬¸» »²¼ ±º ¬¸» »³»¬»®ò