Download 464.5 Kb.

MUSIC1 History of Ancient Indian Music 2 Indian Scale of Shruti Swar Sthana( Shudh Swaras only) 3 Classification of Ragas (Raga Ragini Paddhati and That Raga Paddhati) 4 Time Theory of Indian Music 5 Definition of Nine Jatis Shudh Raga, Chayalag Rag and Sankeerna Raga. 6 Writing of Notation of the Ragas of your course of Study. 7 Notation of Talas of your course of study ( with its single and Layakaris) 8 Definition of Ragas. 9 Definition of Talas 10 Description of the instruments you have opted for ( with diagram) Sitar/ Tanpura. 11 Life history and contribution of following musicians 1 Bhimsen Joshi II Ravi Shankar III Amjad Ali Khan Books Suggested
PRACTICALS
Shudh Kalyan, Malkauns 2. Bada Khayal/ Maseet Khani Ghat in any one of the Ragas of the course with elaborations 3. Any devotional or Patriotic song and Tarana in any the Ragas
iv) Jhap taal 5 Ability to recognize the Ragas of your course 6 Knowledge of Aalankaars Note: Maintenance of the File for practical work to be included in Internal assessment. Suggestions Recommended
MATHEMATICS^ I. RELATIONS AND FUNCTIONS Marks 10 II. ALGEBRA Marks 13 III. CALCULUS Marks 44 IV. VECTORS AND THREE  DIMENSIONAL GEOMETRY Marks 17 V. LINEAR PROGRAMMING Marks 06 VI. PROBABILITY Marks 10 ^ 1. Relations and Functions Types of relations: reflexive, symmetric, transitive and equivalence relations. One to one and onto functions, composite functions, inverse of a function. Binary operations. 2. Inverse Trigonometric Functions Definition, range, domain, principal value branches. Graphs of inverse trigonometric functions. Elementary properties of inverse trigonometric functions. ^ 1. Matrices Concept, notation, order, equality, types of matrices, zero matrix, transpose of a matrix, symmetric and skew symmetric matrices. Addition, multiplication and scalar multiplication of matrices, simple properties of addition, multiplication and scalar multiplication. Noncommutativity of multiplication of matrices and existence of nonzero matrices whose product is the zero matrix (restrict to square matrices of order 2). Concept of elementary row and column operations. Invertible matrices and proof of the uniqueness of inverse, if it exists; (Here all matrices will have real entries). 2. Determinants Determinant of a square matrix (up to 3 x 3 matrices), properties of determinants, minors, cofactors and applications of determinants in finding the area of a triangle. Adjoint and inverse of a square matrix. Consistency, inconsistency and number of solutions of system of linear equations by examples, solving system of linear equations in two or three variables (having unique solution) using inverse of a matrix. Cramer’s rule and its applications. ^ 1. Continuity and Differentiability Continuity and differentiability, derivative of composite functions, chain rule, derivatives of inverse trigonometric functions, derivate of implicit functions. Concept of exponential and logarithmic functions to the base e. Logarithmic functions as inverse of exponential functions. 1/x, 1/x, , (1+ 1/x)^{x} , (1+ x)^{1/x }, lim , lim x>0 x>∞ x>∞ x>0 x>0 x>0 Derivative of logarithmic and exponential functions. Logarithmic differentiation, derivative of functions expressed in parametric forms. Second order derivatives. Rolle's and Lagrange's Mean Value Theorems (without proof) and their geometric interpretations and simple applications. ^ Applications of derivatives: rate of change, increasing/decreasing functions, tangents & normals, approximation, maxima and minima (first derivative test motivated geometrically and second derivative test given as a provable tool). Simple problems (that illustrate basic principles and understanding of the subject as well as reallife situations). 3. Integrals Integration as inverse process of differentiation. Integration of a variety of functions by substitution, by partial fractions and by parts, only simple integrals of the type to be evaluated. ,,, , . , Definite integrals as a limit of a sum, Fundamental Theorem of Calculus (without proof). Basic properties of definite integrals and evaluation of definite integrals. ^ Applications in finding the area under simple curves, especially lines, areas of circles/ parabolas/ellipses (in standard form only), area under the curve y = sin x, y = cos x, area between the two above said curves (the region should be clearly identifiable). ^ Definition, order and degree, general and particular solutions of a differential equation. Formation of differential equation whose general solution is given. Solution of differential equations by method of separation of variables, homogeneous differential equations of first order and first degree. Solutions of linear differential equation of the type: + py = q, where p and q are functions of x and + px = q, where p and q are functions of y. ^ 1. Vectors Vectors and scalars, magnitude and direction of a vector. Direction cosines/ratios of vectors. Types of vectors (equal, unit, zero, parallel and collinear vectors), position vector of a point, negative of a vector, components of a vector, addition of vectors, multiplication of a vector by a scalar, position vector of a point dividing a line segment in a given ratio. Scalar (dot) product of vectors, projection of a vector on a line. Vector (cross) product of vectors. Scalar triple product. ^ Direction cosines/ratios of a line joining two points. Cartesian and vector equation of a line, coplanar and skew lines, shortest distance between two lines. Cartesian and vector equation of a plane. Angle between (i) two lines, (ii) two planes. (iii) a line and a plane. Distance of a point from a plane. ^ 1. Linear Programming Introduction, definition of related terminology such as constraints, objective function, optimization, different types of linear programming (L.P.) problems, mathematical formulation of L.P. problems, graphical method of solution for problems in two variables, feasible and infeasible regions, feasible and infeasible solutions, optimal feasible solutions (up to three nontrivial constraints). ^ 1. Probability Multiplication theorem on probability. Conditional probability, independent events, total probability, Baye's theorem, Random variable and its probability distribution, mean and variance of random variable. Repeated independent (Bernoulli) trials and Binomial distribution. Suggested Textbook 1) Mathematics Textbook for Class XII, NCERT Publication. STATISTICS Max. Marks: 100 Time allowed: 3 hrs Theory: 70 marks Practical: 30 marks Unit Wise Weightage Unit – I Probability II 08 marks Unit – II Basic Designs of Experiments. 06 marks Unit – III Index Number. 06 marks Unit – IV Vital Statistics 08marks Unit – V Regression Analysis 06 marks Unit – VI Basic Statistical Inference 06 marks Unit – VII Time Series 06 marks Unit – VIII Quality Control 06 marks Unit – IX Curve Fitting & Least Square 06 marks Unit – X Interpolation & Extrapolation 06 marks Unit – XI Computer Programming 06 marks Practical: Max. Marks : 30 marks Internal Assessment : 10 marks External Assessment : 20 marks . UnitI : ProbabilityII 08 marks Random variable; Discrete random variable and continuous random variable, Distribution function, Probability mass function, probability density function. Definition of Bernaulli distribution, Binomial distribution and Poission distribution and their mean and variance; Examples of different random experiments giving rise to random variables with these distributions. ^ Definition of a designs, experimental unit, treatment Principles of design of experiments, randomization, replication and local Control. Determination of number of replications, size and shape experimental Unit, Layouts of completely Randomized Block Design, Randomized Block Design, and Lalin square Design. Practical situations where these designs can be used. Merits and demerits of CDR, RDB & LSD. ^ Introduction, Characteristics of Index numbers, uses of Index numbers, Problems in the construction of Index numbers, Notations, Price relatives, quantity relatives and value relatives. Methods of constructing Index numbers, Simple or unweighted Index numbers and its limitations. Simple average of Price relatives : method, its merits and demerits, Weighted Index numbers, Laspeyers index numbers, Paschey’s Index numbers and Fishers ideal index numbers. ^ Meaning and nature, uses of vital statistics, methods of obtaining vital statistics, vital events, Rates of vital events, Measurements of population, mean population, measures of fertility and mortality. Crude birth rate, Crude death rate, Specific birth rate, Specific death rate. Standardized birth and death rate. General fertility rate, Specific fertility rate, Age specific fertility rate; total fertility rate. ^ Regression analysis as the method of predicting the value of one quantitative variable from those of other quantitative variables, viz. Regression Coefficients and their properties, two regression equations, Graphing of regression lines, Angle between two lines of Regression. ^ Introductory definitions, Statistic, Estimator, Estimates, Parameter, Parameter Space, Unbiasedness, Consistency, Efficient Estimator, Most efficient estimator, Efficiency, Sufficiency, Statistical hypothesis, Null hypothesis, Alternative hypothesis, Acceptance and Rejection regions, Types of error, Level of significance, Power of the test. ^ Introduction, importance of time series, Components of time series, secular trend, seasonal variation, Cyclic variation & irregular movements. Time series models, Additive model and multiplication model, limitations of the models of time series, measurements of trend; free hand graph method: merits and demerits, Semiaverage method, Moving average method: merits and demerits, methods of Least Squares, Filling of straight line: Merits and demerits. ^ Introduction, Process control, control charts, control limits, tools for statistical quality control, Control chart for variables, X and Rcharts; Critierion for detecting lack of control in X and R charts. Interpretation of X and R charts. Control charts for attributes; Pchart or control chart for fraction defective, control chart for number of defects per unit (Cchart). Application of CChart. ^ Curve fitting, straight line, Parabola, Freehand method of curve fitting. Method of least squares, normal equations, fitting of a straight line and fitting of second degree parabola. Fitting of Exponential land Geometric curves. ^ Finite differences, Difference formula, Difference table, The operators E and their properties. Interpolation and extrapolation with equal intervals. Graphical Method, Method of Curve fitting – Drawbacks of the method. Newton’s Gregory formula for forward interpolation and back ward interpolation. Divided difference; properties, Newton’s formula for unequal intervals, Relation between divided difference and ordinarily differences, LaGrange’s interpolation formula for unequal intervals. ^ Introduction to Computers and its applications in statistics, various parts of a computer, Hard disk, Monitor, Keyboard, Printer, Floppy Disks, Flow charts for mean and variance. Overview of DOS and BASIC Commands (DIR, COPY, DELETE, RENAME, LIST, RUN, SAVE, LOAD, INPUT/OUTPUT Commands, Arithmetic expressions, Control Statements (GO TO, IFTHEN) Programme for mean and variance. Practicals Marks : 30 (a) Internal Assessment : 10 marks (b) External Examination : 20 marks 1. Contraction of Index Numbers using unweighted index Numbers 2. Construction of Index Numbers by Laspeyers method 3. Construction of Index Numbers by Paschey’s method 4. Construction of Index Numbers by Fishers method 5. Find measures of fertility and mortality 6. Calculate Age Specific Fertility rate and total Fertility rate 7. Estimation of trend values by Free hand and Moving average method 8. Estimation of trend by Fitting of a straight line 9. Construction of X and R charts 10. Draw PChart and CChart 11. Fitting of a Straight line, parabola and Exponential Curve 12. Interpolation by using Newtons and Lagranges method. Books Suggested: 1. Fundamentals of Statistics S.P. Gupta 2. Statistical Methods S.P. Gupta 3. Fundamental of Applied Statistics S.C. Gupta & V.K. Kapoor 4. Numerical Methods Jain & lyenger 5. Programming in Basic Balguruswamy . ^ Max. Marks:  100 Time:  3 hrs Unit I: Introduction to Computers Computing (I) What are computers? What they can perform and what they can not perform, role and use of computers in modern society, etc. Meaning of a problemalgorithm, a detailed and precise step by step method of solution of the problem illustrated by means of simple day to day problems (like buying and article, multiplication of numbers, etc) Simple flow charting (decision boxes included but not loops), Easy exercises. ^ Flow charts involving loopsalgorithms for mathematical problems already studied from topics such as profit and loss, ratio and proportion, simple and compound interests, discount; HCF and LCM, etc. Easy exercise 10 marks Unit II Statistics
10 marks ^ Investment of capital for unequal period, sharing of profit, partners salaries, interest on capital, profit sharing on the admission of a new partners/retirement of an existing partner. 10 marks Unit IV Bill of Exchange Introduction of Bill of Exchange, Bankers discount, true discount and Bankers gain, Types of Bill of Exchange, Feature of a Bill of Exchange, Advantages of bill exchange. 10 marks ^ Matrix as rectangular arrangements of numbers. Type of matrices, equality of matrices; Addition, Scalar multiplication and multiplication of matrices, linear combinations of matrices, noncommutativity and associativity of matrix, multiplication, singular and nonsingular matrices; Linear equation in matrix notation, Determinants; minors cofactors of determinants, expansion of a determinant, properties and elementary transformation of determinants, application of determinants in solution of equations and area of a triangle; Cramer’s rule, adjoint and inverse of a matrix and its properties; Application of matrices in solving simultaneous equations in three variable. 10 mark ^ Annuities and its types: present value and amount in case of (i) Ordinary annuity (ii) Annuity due, differed annuity, sinking fund. 10 marks. Unit VII Integrals Integration as inverse process of differentiation. Integration of a variety of functions by substitution, by partial fraction and by parts, only simple integrals of the type to be evaluated. Definite integrals as a limit of a sum. Fundamental Theorem of Calculus (without proof). Basic properties of definite integrals and evaluation of definite integrals. 10 marks ^ Application in finding the area under simple curves, especially lines, arcs of circles/ parabolas/ellipse (in standard form only), area between the two above said curves (the region should be clearly identifiable). 10 marks ^ Definition, order and degree, general and particular solutions of a differential equation. Formation of differential equation whose general solution is given. Solution of differential equations by method of separation of variables, homogeneous differential equations of first order and first degree. Solutions of linear differential equation of the type: 10 marks Unit X Application of Calculus Commerce and Economics Average cost and marginal costs, total revenue, average revenue and marginal revenue, Break even analysis, maximization of total revenue and total profits, maximization of average cost. 10 marks ^ Maximum Marks: 100 Theory: Marks 70 Time: 3 hours Practicals: Marks 30
^ REVIEW: C++ covered In Class XI, Object Oriented Programming: Concept of Object Oriented Programming – Data hiding, Data encapsulation, Class and Object, Abstract class and Concrete class, Polymorphism (Implementation of polymorphism using Function overloading as an example in C++); Inheritance, Advantages of Object Oriented Programming over earlier programming methodologies, ^ Definition of a class, Members of a class  Data Members and Member Functions (methods), Using Private and Public visibility modes, default visibility mode (private); Member function definition: inside class definition and outside class definition using scope resolution operator (::); Declaration of objects as instances of a class; accessing members from object(s), Array of type class, Objects as function arguments  pass by value and pass by reference; ^ Constructor: Special Characteristics, Declaration and Definition of a constructor, Default Constructor, Overloaded Constructors, Copy Constructor, Constructor with default arguments; Destructor: Special Characteristics, Declaration and definition of destructor; ^ Concept of Inheritance, Base Class, Derived Class, Defining derived classes, protected visibility mode; Single level inheritance, Multilevel inheritance and Multiple inheritance, Privately derived, Publicly derived and Protectedly derived class, accessibility of members from objects and within derived class(es); ^ Need for a data file, Types of data files – Text file and Binary file; Text File: Basic file operations on text file: Creating/Writing text into file, Reading and manipulation of text from an already existing text File (accessing sequentially); Binary File: Creation of file, Writing data into file, Searching for required data from file, Appending data to a file, Insertion of data in sorted file, Deletion of data from file, Modification of data in a file; Implementation of above mentioned data file handling in C++; Components of C++ to be used with file handling: Header file: fstream.h; ifstream, ofstream, fstream classes; Opening a text file in in, out, and app modes; Using cascading operators for writing text to the file and reading text from the file; open(), get(), put(), getline() and close() functions; Detecting endoffile (with or without using eof() function); Opening a binary file using in, out, and app modes; open(), read(), write() and close() functions; Detecting endoffile (with or without using eof() function); tellg(), tellp(), seekg(), seekp() functions Pointers: Declaration and Initialization of Pointers; Dynamic memory allocation/deallocation operators: new, delete; Pointers and Arrays: Array of Pointers, Pointer to an array (1 dimensional array), Function returning a pointer, Reference variables and use of alias; Function call by reference. Pointer to structures: Deference operator: *, >; self referencial structures; ^ Arrays: One and two Dimensional arrays: Sequential allocation and address calculation; One dimensional array: Traversal, Searching (Linear, Binary Search), Insertion of an element in an array, deletion of an element from an array, Sorting (Insertion, Selection, Bubble sort), concatenation of two linear arrays, merging of two sorted arrays; Twodimensional arrays: Traversal, Finding sum/difference of two NxM arrays containing numeric values, Interchanging Row and Column elements in a two dimensional array; ^ Operations on Stack (PUSH and POP) and its Implementation in C++, Converting expressions from INFIX to POSTFIX notation and evaluation of Postfix expression; Queue: (Circular Array and Linked Implementation): Operations on Queue (Insert and Delete) and its Implementation in C++. ^ Database Concepts: Relational data model: Concept of domain, tuple, relation, key, primary key, alternate key, candidate key; Relational algebra: Selection, Projection, Union and Cartesian product; Structured Query Language: General Concepts: Advantages of using SQL, Data Definition Language and Data Manipulation Language; Data types: NUMBER, CHARACTER, DATE; SQL Commands: ^ SQL functions: SUM, AVG, COUNT, MAX and MIN; obtaining results (SELECT query) from 2 tables using equijoin, cartesian product and union Note: Implementation of the above mentioned commands could be done on any SQL supported software on one or two tables. ^ Binaryvalued Quantities, Boolean Variable, Boolean Constant and Boolean Operators: AND, OR, NOT; Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, Inverse law, Principle of Duality, Idempotent Law, Distributive Law, Absorption Law, Involution law, DeMorgan’s Law and their applications; Obtaining Sum of Product (SOP) and Product of Sum (POS) form from the Truth Table, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh Map for obtaining minimal form of Boolean expressions (up to 4 variables); Applications of Boolean Logic:
^ Evolution of Networking: ARPANET, Internet, Interspace; Different ways of sending data across the network with reference to switching techniques; Data Communication terminologies: Concept of Channel, Baud, Bandwidth (Hz, KHz, MHz, GHz) and Data transfer rate (bps, kbps, Mbps, Gbps, Tbps); ^ Twisted pair cable, coaxial cable, optical fiber, infrared, radio link, microwave link and satellite link. Networking devices: Modem, RJ45 connector, Ethernet Card, Hub, Switch, Gateway; Network Topologies and types: Bus, Star, Tree; Concepts of PAN, LAN, WAN, MAN ^ TCP/IP, File Transfer Protocol (FTP), PPP, LevelRemote Login (Telnet); Wireless/Mobile Communication protocols such as GSM, CDMA, GPRs, WLL; Electronic Mail protocol such as SMTP, POP3, iMAP, Chat, Video Conferencing; VoIP protocols such as WiFi and WiMax ^ Threats and prevention from Viruses, Worms, Trojan horse, Spams Use of Cookies, Protection using Firewall; India IT Act, Cyber Law, Cyber Crimes, IPR issues, Hacking. Web Services : Hyper Text Markup Lanuage (HTML), eXtensible Markup Language (XML); Hyper Text Transfer Protocol (HTTP); Domain Names; URL; IP Address; Website, Web browser, Web Servers; Web Hosting, Web Scripting – Client side (VB script, Java Script, PHP) and Server side (ASP, JSP, PHP), Web 2.0 (for social Networking) Open Source Terminologies: Open Source Software, Freeware, Shareware, Proprietary software, FLOSS, GNU, FSF, OSI; Practicals Duration: 3 hours Marks: 30 ^ One programming problem in C++ to be developed and tested in Computer during the examination. Marks are allotted on the basis of following: Logic : 5 Marks Documentation/Indentation : 2 Marks Output presentation : 3 Marks Notes: The types of problems to be given will be of application type from the following topics
^ Five Query questions based on a particular Table/Reaction to be tested practically on Computer during the examination. The command along with the result must be written in the answer sheet. 3. Project Work Marks 05 The project has to be developed in C++ language with Object Oriented Technology and also should have use of Data files. (The project is required to be developed in a group of 24 students)
^ Must have minimum 20 programs from the following topics
insertion of elements)
^ Viva will be asked from syllabus covered in class XII and the project developed by student. GUIDELINES FOR PROJECTS (Class XII) 1. Preamble 1.1 The academic course in Computer Science includes one Project. The Purpose behind this is to consolidate the concepts and practices imparted during the course and to serve as a record of competence. 1.2 A group of 24 students as team may be allowed to work on one project. ^ 2.1 Project for class XII should ensure the coverage of following areas of curriculum: a. Problem Solving b. Data Structure c. Object Oriented Programming in C++ d. Data File Handling Theme of the project can be
School Management, Banking, Library information system, Hotel or Hospital
2.2 The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized code preparation, systematic documentation and other associated aspects of Software Development. 2.4 The assessment would be through the project demonstration and the Project Report, which should portray Programming Style, Structured Design, Minimum Coupling, High Cohesion, Good documentation of the code to ensure readability and ease of maintenance. ^ Maximum Marks: 100 Theory: Marks 70 Time: 3 hours Practicals: Marks 30 1. NETWORKING AND OPEN STANDARDS Marks 10 2. PROGRAMMING Marks 25 3. RELATIONAL DATABASE MANAGEMENT SYSTEM Marks 30 4. IT APPLICATIONS Marks 05 ^ Computer Networking: Networking  a brief overview, Identifying computers and users over a network (Domain Name, MAC 'Media Access Control' and IP address), domain name resolution, Network Topologies, Types of network  LAN, MAN, WAN, PAN; Wired Technologies  Co Axial, Ethernet Cable, Optical Fiber; Wireless Technologies  Blue Tooth, Infrared, Microwave, Radio Link, Satellite Link; Network Devices  Hub, Switch, Repeater, Gateway  and their functions; Network security  denial of service, intrusion problems, snooping; ^ Open Source Software (OSI norms), common FOSS examples (Gnu/Linux, Firefox, OpenOffice), common open standards (open document format, Ogg Vorbis) Indian Language Computing: character encoding, UNICODE and Indian Language, different types of fonts (open type vs true type, static vs dynamic), Entering Indian Language Text  phonetic and keymap based. ^ Review of Class XI; Programming Fundamentals Access specifier for classes, Members and methods, Concept of package Inheritance: need and implementation, Method Overloading and Overriding, Abstract Class and Interfaces, use of interfaces Commonly used libraries: String class and methods: to String(), concat(), length(), toLowerCase(), toUpperCase(), trim(), substring() Math object: pow(), round() Simple GUI Objects: Dialog Accessing MySQL database using ODBC to connect with database. Web application development: URL, Web Server, Communicating with the web server, concept of Client and Server Side. HTML based web pages covering basic tags  HTML, TITLE, BODY, H1…H6, Paragraph < P>, Line Break , Section Separator , FONT, TABLE, LIST
Creating and accessing static pages using HTML and introduction to XML ^ Review of RDBMS from Class XI Database Fundamentals Concept of Database Transaction, Committing and revoking a Transaction using COMMIT and REVOKE, Grouping Records: GROUP BY, Group functions  MAX(), MIN(), AVG(), SUM(), COUNT(); using COUNT(*), DISTINCT clause with COUNT, Group Functions and Null Values, Displaying Data From Multiple Tables: EquiJoin and Cartesian Products; concept of Foreign Key; Creating a Table with PRIMARY KEY and NOT NULL constraints, adding a Constraint, enabling Constraints, Viewing Constraints, Viewing the Columns Associated with Constraints; ALTER TABLE for deleting a column, ALTER TABLE for modifying data types of a column DROP Table for deleting a table; ^ Revisiting the features of eGovernance, eBusiness and eLearning Frontend Interface  Introduction; content and features; identifying and using appropriate component (Text Box, Radio Button, CheckBox, List) for data entry, validation and display; Backend Database  Introduction and its purpose; exploring the requirement of tables and its essential attributes; FrontEnd and Database Connectivity  Introduction, requirement and benefits PRACTICALS Marks 30 Problem Solving using Java 10 marks Student will be given a problem to be solved using Java during practical Examination to be conducted at the end of the course. ^ Student will be asked to write 5 queries based on one or two tables during practical Examination to be conducted at the end of the course Practical Record File A practical record file is required to be created during the entire academic session. It should be duly signed by the concerned teacher on regular basis and is to be produced at the time of Final Practical Examination for evaluation. It should include the following: • Solution of at least 15 problems using Java based IDE 2 marks • At least 25 SQL queries based on one and/or two tables 2 marks • Solution of at least 2 simple problems incorporating Java Application & Database connectivity ^ Project File (3+2) marks Students in group of 23 are required to work collaboratively to develop a project using Programming and Database skills learnt during the course. The project should be an application with GUI frontend based on any one of the following domains  eGovernance, eBusiness and eLearning Viva Voce (1+2+2) marks Students will be asked oral questions during practical Examination to be conducted at the end of the course. The questions will be from the entire course covered in the academic session ^ Romeo and Juliet by Shakespeare – 40 marks An Anthology of Poems – 60 marks Max. Marks 100 Time 3 hrs BlossomsII UNITI 01 Say This City Has Ten Million Souls W.H.Auden 02 A Far Cry From Africa Derek Walcott 03 Galib’s Gazal Translated by Aga Shahid Ali 04 When I Have Fears That I May Cease To Be John Keats 05 Selections From Under Siege Mahmud Darwish 15 Marks UNIT II 06 The Queen's Rival Sarojini Naidu 07 The Lotus Toru Dutt 08 A Memory Lost From Delhi Aga Shahid Ali 09 The Tiger And The Deer Sri Aurobindu 10 Ask Me Not For That Old Fervour Faiz Ahmad Faiz Translated by Shiv K.Kumar 15 Marks UNITIII 11 Vaakhs of Lal Ded Translated by Prof. Neer ja Mattoo 12 Rubayat of Omar Khayyam Translated by Edward FitzGerald 13 Leave This Rabindra Nath Tagore 14 The Tale of Melon City Vikram Seth 15 Autumn Kalidasa Translated by Arthur W. Ryder 15 Marks UNITIV 16 Shrukhs of Sheikh Ul Alam Translated by Prof. G.R.Malik 17 A Will In The Name Of A New Man Kehari Singh Madhukar Translated by Shiv Nath 18 Seven Ages William Shakespeare 19 The Raven Edgar Allan Poe 15 Marks ^ 10 Minutes shall be exclusively provided to the students for understanding the question paper apart from the allotted time. The paper shall be divided into four sections, Section “A” shall be exclusively based on the play tilted Romeo and Juliet by Shakespare carrying 40 Marks while as Section “B” shall be based on BlossomsII Anthology of poems carrying 60 Marks. ^ Play (40 Marks) Q 1. One question based on reference to context. This question shall carry two parts, A & B with internal choice. Each part shall carry 7½ Marks. [7½ X2=15] Marks. Q 2. One long answer type question on theme, plot, style, background, character etc. of the play . The candidate shall have to attempt one question out of two. [10X1=10 Marks] Q 3. This question shall be based on two parts i,e a & b . Part a (short answer type question) shall be based on specific scene, incident, situation etc. which has special importance in the play. Part b shall be based on the opinion, critical appreciation of the play. This shall be an open type question based on the student’s understanding of the play with internal choice. Each part shall carry (05) marks. [05X02=10 Marks] Q 4. Objective type questions based on the play concerning profile of the playwright dates, theme, style, dramatic technique, plot, incident, dialogue, character etc. Each question shall carry one mark. [01X05=05 Marks] ^ (Poetry 60 Marks) Q. 5 One questions based on reference to context. This question shall carry two parts i,e a & b with internal choice . Each question shall carry 7½ Marks. [7½ X2=15] Marks. Q.6 This question shall be based on the poems emphasizing on poetic techniques / literary devices. The examiner may ask poetic techniques such as metaphor. Simile, personification, imagery paradox, irony, satire, supernaturalism etc. from the prescribed poems. Students shall have to attempt five questions out of eight each question shall carry four marks. [04X05=20 Marks] Q. 7. This question shall be based on two parts i,e a & b, each carrying 05 marks and shall be based on genre specificity of poems such as sonnet,. ode, ghazal, free verse etc. The candidate’s comprehensive and critical understanding of poems shall also be tested. The candidate shall have to attempt two questions out of four. There shall be internal choice in questions. [05 X2=10] Marks. Q. 8. Two short answer type question based on textual understanding of the poems with internal choice. [05 X2=10] Marks. Q. 9. Objective type questions based on nineteen poems concerning profile of the poets, dates, poetic techniques, themes style etc. shall be asked. Each question shall carry 01 Mark [05 X1=05] Marks. 