syllabuspupdepartments.ac.in/syllabi/old syllabi [for reference... · web viewordinances and...

PUNJABI UNIVERSITY PATIALA

ORDINANCESAND

OUTLINES OF TESTS,SYLLABI AND COURSES OF READING

FORBACHELOR OF COMPUTER APPLICATIONS (B.C.A.)

PART-II (ANNUAL)FOR 2011, 2012 & 2013

EXAMINATIONS

BACHELOR OF COMPUTER APPLICATIONSOUTLINE OF PAPERS AND TESTS

B.C.A. SECOND YEAR EXAMINATION2011, 2012 & 2013 EXAMINATIONS

CODE TITLE OF PAPER MAXIMUM MARKS

Hours per University Internal Marks Max. TimeWeek Examination Assessment Allowed

BCA-201 General English 4 80 20 100 3 Hrs. (Communication Skills)

BCA-202 Punjabi / 4 80 20 100 3 Hrs. Punjab History and Culture

BCA-203 Data Structures 4 80 20 100 3 Hrs.

BCA-204 Discrete Mathematics 4 80 20 100 3 Hrs.

BCA-205 Object Oriented 4 80 20 100 3 Hrs. Programming using C++

BCA-206 Computer Network, 4 80 20 100 3 Hrs. Internet & its Applications

BCA-207 Software Lab-III 4 50 -- 50 3 Hrs. (Programming Lab in C++)

BCA-208 Software Lab-IV 4 50 -- 50 3 Hrs. (Data Structures)

Total 700____________________________________________________________________________________BCA - 209 Environmental Studies (Qualifying Paper) (in case the students has already cleared the course of Environment Studies in BCA-I He/she need not take the course) Note :

1. The break up of marks for the practical will be as under i. Lab Record 10 Marksii. Viva Voce 10 Marksiii. Program Development and Execution 30 Marks

2. The break up of marks for internal assessment for theory papers will be as under :i. One or two tests out of which minimum on best will be

considered for assessment.10 Marks

ii Assignments/Quizzes 5 Marksiii Attendance, Class participation and behaviour 5 Marks

BCA-201: GENERAL ENGLISH (COMMUNICATION SKILLS)

Maximum Marks : 80 Maximum Time : 3 Hrs.Min Pass Marks: 35% Lectures to be delivered: 90 Hours

COURSE CONTENT

Two Literary Texts 40Composition 15Grammar and Vocabulary 25

A) Text Prescribed1. R.K. Narayan: The English Teacher2. Jagdish Chander (OUP) (ed.): Short plays

B) Texts Prescribed for Grammar and Vocabulary3. W. Standard Allen: Living English Structure (Orient Longman)4. Wilford D. Best: The Student’s Companion (Rupa)

Testing:

Q.1.(a) One Essay-type questions with an internal alternative on theme, incident and character from the English Teacher. The answer should not exceed 250 words.

5 marks (b) Five short note to be attempted out of the given eight from the English Teacher. Each not

to be attempted in thirty words. 5 marks(c) Meanings of 5 words/phrases out of the given, eight from the English Teacher, and use

thereof in sentences. (1/2+1/2)*5=5 marksQ.2.(a) One essay type question with an internal alternative on theme. Narrative, incident or

character from Short Plays. 5 marks(b) Five short notes to be attempted out of the given eight Short Plays. Each Note to be

attempted in 50 words. 2*5=10 marks Q.3. Comprehension of one/two passage of about 250 words from either The Short Plays or the English

Teacher.

(a)Five questions to test comprehension of the passage. 1*5=5 marks(b)Meanings of 5 words/phrases italicised in the passage and use thereof in

illustrative sentences. (1/2+1/2)*5=5 marksQ.4. An essay of about 300 words on one out of the four given topics. 8 marksQ.5. Making a précis of a given passage of about 250 words and providing a suitable title.

7 marks Q.6. The prescribed text is W. Standard Allen: Living English Structure (Orient Longman).

The Candidates shall be examined on the material included in the Exercises from 31.1. to 46.10. This will carry 12 marks. They will also be examined on the material studied in BCA Part -II. This will carry 3 marks. The whole material shall be divided into five parts each carrying three marks as follows.

(a) Exercise 1.1 to 30.3 (B.C.A. Part-II Revision)(b) Exercise 31.1 to 32.4(c) Exercise 33.1 to 38.4(d) Exercise 39.1 to 44.10(e) Exercise 45.1 to 46.10 3 *5 = 15 marks

Candidate shall be required to attempt 6 sentences each out of 10 sentences to be set in each part. Each sentence shall be of ½ mark.

VOCABULARY

The Prescribed text is Wilfred D. Best: The student’s Companion (Rupa).The candidates shall be examined on the following material:

(a) Single Words or phrases and groups of words:(1) Words pertaining to death(2) Words pertaining to Nature Study(3) Opposites(4) Negatives(5) Scientific Instruments(6) War Words(7) Literary(8) Miscellaneous 5 marks

(b) Formation of nouns. Adjectives. Verbs and Adverbs.

5 marks

The examiner shall restrict himself to the prescribed text, in Part (a) the candidate shall respond to 10 out of 15 one-word/one-line tests, each carrying half a mark.

In Part (b) the candidates shall complete 10 out of 15 sentences with appropriate part of speech of a word given in brackets at the end of each sentence. Each response will carry half a mark.

IMPORTANT

The examiner shall also give a clear instruction to the candidates to attempt these questions only at one only place and only once. Second or subsequent attempts unless earlier attempts have been crossed out, shall not be evaluated.

phH ;hH J/ 202 (J/)gzikph bkiwh

e[Zb nze L 80 ft;/ ftu'A gk; j'D bJh nze L 35;wK L 3 xzN/ e[b nfXnkgB ghohnv L 150 (6 ghohnv gqsh jcsk)

f;b/p; ns/ gkm^g[;seK1H niw/o f;zx n"by L fJ;ae pkM'A Bwkia dk jZi BkjhA (bx{ BkN ;zrqfj)2H r[biko f;zx ;zX{ L fszB SZe/ (ejkDh ;zrqfj^;zgkde L vkH oxpho f;zx

f;oiDk)3H (T) g?ok ouBk L tksktoDh w;b/ ns/ ;wkXkB* (g[;se s/ nXkfos gq;aB 11 s'A 15 nfXnkfJ sZe)

(n) g?ok gVQ e/ gq;aBK d/ T[so d/DK4H ftnkeoB L

(T) ftnkeoB d/ p[fBnkdh sZs(n) Gk;ak tzBrhnK L Gk;ak dk Ne;kbh o{g, Gk;ak s/ T[g^Gk;ak

dk nzso ns/ nzso ;pzX, gzikph T[g^Gk;aktK d/ gSkD fuzBQ

(J) ;apd ;q/DhnK ns/ o{gKsoB(;) r[ow[yh fbZgh ns/ ;apd i'V

5H eqwKe 1, 2 ns/ 4 d/ nkXko *s/ S'N/ gq;aB nze^tzv ns/ g/go ;?No bJh jdkfJsK

1H fe;/ fJeKrh dk ;ko iK ft;ak t;s{ (d' ftu'A fJe) 10 nze2H fe;/ ejkDh dk ft;ak t;s{ iK ;ko (d' ftu'A fJe) 10 nze3H (T) g?ok ouBk (g[;se BzL 3 Bkb ;pzfXs fszB ftf;anK ftu'A fe;/ fJe T[s/ g?oQk fbyD bJh fejk ikt/) 05 nze

(n) g[;se Bz L 3 ftu'A g?ok d/ e/ T[; pko/ gzi gq;aaBK d/ T[so ^ 05 nze4H Bzpo 4 T[Zs/ fdZs/ ftnkeoB d/ f;b/p; d/ nkXko T[Zs/ toDksfwe uko

gq;aB g[ZS/ ikDr/ d' dk T[so d/D bJh fejk ikt/rk. 20 nze

5H(T) eqwKe 1 ns/ 2 *s/ doi gkm^g[;seK ftu'A gzi tkeK dh Gk;ak dk fttjkfoe ftnkeofBe ft;ab/;aD.fJj gq;aB BzH 4 ftu fBoXkfos ftnkeoB tkb/ gZyK T[s/ jh nXkfos j't/rk.

5 % 4 ^ 20 nze

(n) eqwKe 1, 2 ns/ 4 d/ nkXko *s/ 5 S'N/ gq;aB g[ZS/ ikD

5 % 2 ^ 10 nze

BCA-202 (B)PUNJAB HISTORY AND CULTURE

(1000-1849 A.D.)(Special paper in lieu of Punjabi Compulsory)

Maximum Marks: 80 Maximum Time: 3 Hrs. Minimum Pass Marks: 35% in the subject Lectures to be delivered: 75 Hours

(A) Instructions for the Paper setter:The question paper will consist of five sections: A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will consist of 5-10 short answer type questions, which will cover the entire syllabus uniformly and will carry 20% marks in all.

(B) Instructions for the Candidates:Candidates are required to attempt one question each from the section A, B, C and D of the question paper and the entire section E.

SECTION A

1. The Punjab under Turke-Afghan Sultans. 2. The Punjab under the Great Mughals.3. Salient features of the Bhakti Movement and Sufism in The Punjab.

SECTION B

4. Guru Nanak Dev's teachings and impact on society. 5. Development of Sikhism (1539-1606) with special reference to Sangat, Masand System,

Compilation of Adi Granth and Martydom of Guru Arjan Dev.6. Martydom of Guru Teg Bahadur, Foundation of Khalsa by Guru Gobind Singh

SECTION C

7. Banda Bahadur and his achievement 8. Sikh Struggle for Sovereignty in Punjab 1716 to 1767.9. Ranjit Singh's rise to power : his civil and military administration and relations with the British. 10. The Anglo-Sikh Wars and Annexation of the Punjab.

SECTION D

11. Development of Punjabi Language and Literature classical writings and famous legends of the Punjab.

12. Social life with special reference to position of women, fairs, festivals, folk music, dances and games in the Punjab.

SUGGESTED READINGS1. Kirpal Singh (ed.), : History and Culture of the Punjab, Part-II, Patiala, 1990, (3rd edition). 2. Fauja Singh (ed) : History of Punjab, Vol 1, Patiala, 19723. G.S. Chhabra : The Advanced History of the Punjab, Vol. 14. J.S. Grewal : The Sikhs of Punjab, The New Cambridge History of India, Hyderabad,

1990. 5. Khuswant Singh, A History of Sikhs, Vol. I, 1469-1837, Delhi 1991. 6. G.C. Narang : Transformation of Sikhism, New Delhi, 1960 (5th edition). 7. B. S. Nijjar : Punjab Under the Great Mughals, Bombay, 19618. Sukhwinder Kaur Dhillon : Religious History of Early Medieval Punjab, Delhi 1991.

BCA-203 : DATA STRUCTURES

Maximum Marks: 80 Maximum Time: 3 Hrs. Minimum Pass Marks: 35% Lectures to be delivered: 90 Hours


(B) Instructions for the Candidates:Candidates are required to attempt one question each from the section A, B, C and D of the question paper and the entire section E. Use of non-programmable scientific calculator is allowed.

SECTION A Basic concept and notations, data structures and data structure operations, mathematical notation and functions, algorithmic complexity, Big ‘O’ notation and time space trade off. Arrays : Linear array, Representation of Linear array in memory, Traversing Linear array, Insertion and deletion in an array, Multi-dimensional array : Row-Major Order, Column Major order, sparse matrix.SECTION B

Stacks : Representation of stack in memory (Linked and sequential), Operations on stacks, Applications of Stacks : Conversion from infix notation to post fix notations, Evaluation of Postfix Notation, Matching of Parenthesis, Recursion, Tower of Hanoi.Queues: Representation of Queues in memory (Linked and sequential), Operations on queqes, Application of QueuesLinked list, representation of linked list using static and dynamic data structures. Insertion and deletion of a node from a Linear linked list, Doubly linked list, Circular linked list. Application of linked lists.

SECTION CTrees: Definitions and Basic concepts, Linked Tree Representation and representation in contiguous storage, Binary Trees, Binary Tree Traversal, Searching, Insertion and Deletion in Binary Tree. Binary Search Tree, Heap and Heap Sort Algorithm.Graphs: Definitions and Basic concepts, Sequential and linked Representation- Adjacency Matrix and Adjacency List. Operations on Graphs: Traversing a Graph using DFS and BFS.

SECTION DSearching and sorting : Linear and binary search, Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Radix Sort and Quick Sort,Comparison of various searching and sorting algorithms.

REFERENCES :

1. Seymour Lipschutz “Theory & Practice of Data Structures”, McGraw Hill, 1988.

2. Thomas Naps and Bhagat Singh", Introduction to Data Structures with Pascal", West Publishing.

3. Tenenbaum, Y. Lanhghsam and A. J. Augenstein, “Data Structures Using C and C++”, Prentice

Hall of India, 1990.

4. E. Horowitz and S. Sahni, “Data Structures with Pascal”, Galgotia, 3rd Edition, 1991.

5. Ah. A.V. Hopcraft J.E. and Ullman, J.D. “The Design and Analysis of Computer Algorithms”,

Addison Wesley.

BCA-204: DISCRETE MATHEMATICS




SECTION A Set Theory: Sets, Type of sets, Set operations, Principle of Inclusion-Exclusion, Cartesian prodouct of sets, Partitions, Minsets, Maxsets.Logic : Propositions, Implications, Precedence of logical operators, Translating English sentences into logical expressions, Propositional equivalence, Predicates and Quantifiers, Nested Quantifiers, Order of Quantifiers.Principle of Mathematical induction. Counting : The Basics of counting, Pigeonhole principle, Permutations and combinations,..

SECTION BRelations: Relations and diagraph, n-ary relations and their applications, properties of relations, representing relations, closure of relation, equivalence relation, operation on relations, partial ordering. Functions: Functions, One-to-one Functions, Onto Functions, Inverse and Composition of Functions, Floor Function, Ceiling Function.Growth of functions: Big-O Notation, Big-Omega and Big-Theta Notation.

SECTION CRecurrence Relations: Introduction, Order and Degree of Recurrence relation, Solution of linear recurrence relations, Homogeneous solution, particular solution, total solution, Generating functions. Lattice: Partially ordered sets (POSET), Lattices, Sublattices, Isomorphic lattices, Properties of Lattices, Special types of Lattices, Atom, Duality Boolean Algebra: Introduction, Boolean Expression and Boolean Functions, Identities of Boolean Algebra, Duality, Disjunctive Normal Form, Conjunctive Normal Form, Design of Circuits.

SECTION DGraphs: Introduction to Graph, Graph terminology, Representing graphs and Graph Isomorphism, Connectivity, Euler Paths and Circuits, Hamillonian paths and circuits, Shortest Path Problems, Planar Graphs. Trees : Trees, labelled trees, Tree Traversal, Undirected trees, Spanning Trees, Minimum spanning trees.

REFERENCES :

1. Discrete Mathematical Structures-Bernard Kolman, Robert C. Busby, Sharon C. Ross, 4th

Edition, Pearson Education Asia.

2. Discrete Mathematics-Richard Johnsonbaugh, 5th Edition, Pearson Education, Asia.

3. Elements of Discrete Mathematics, Second Edition, Tata McGraw Hill.

4. Discrete Mathematics, Seymon Lipschutz & Max Lans Lipson, Tata McGraw Hill.

BCA-205: OBJECT ORIENTED PROGRAMMING USING C++




SECTION A

Evolution of OOP: Procedure Oriented Programming, OOP Paradigm, Advantages and disadvantages of OOP over its predecessor paradigms.Characteristics of Object Oriented Programming: Abstraction, Encapsulation, Data hiding, Inheritance, Polymorphism, Code Extensibility and Reusability, User defined Data Types.Introduction to C++: Identifier, Keywords, Constants, Operators: Arithmetic, relational, logical, conditional and assignment. Sizeof operator, Operator precedence and associativity.Type conversion, Variable declaration, expressions, statements, manipulatorsInput and output statements, stream I/O, Conditional and Iterative statements, breaking control statements.

SECTION B

Storage Classes: Automatic, Static, Extern, Register.Arrays, Arrays as Character Strings, Structures, Unions, Bit fields, Enumerations and User defined types.Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Multiple indirections, Pointer to functions. Functions: Prototyping, Definition and Call, Scope Rules. Parameter Passing: by value, by address and by reference, Functions returning references, Const functions, recursion, function overloading, Default Arguments, Const arguments.

SECTION C

Pre-processor : #define, #error, #include, #if, #else, #endif, #ifdef, #ifindef, #undef Type casting : static-cast, const-cast, dynamic-cast, reinterpret-cast.

Classes and Objects: Class Declaration and Class Definition, Defining member functions, making functions inline, Nesting of member functions, Members access control. this pointer. Union as space saving classes.Objects: Object as function arguments, array of objects, functions returning objects, Const member functions.Static data members and Static member functions.

SECTION D

Friend functions and Friend classesConstructors: properties, types of constructors (Default, parameterized and copy), Dynamic constructors, multiple constructors in classes.Destructors: Properties, Virtual destructors. Destroying objects. Rules for constructors and destructors.Array of objects. Dynamic memory allocation using new and delete operators, Nested and container classesScopes: Local, Global, Namespace and ClassInheritance: Defining derived classes, inheriting private members, single inheritance, types of derivation, function redefining, constructors in derived class.

REFERENCES:

1. Herbert Schildt, “The Complete Reference C++”, Tata McGraw-Hill, 2001.

2. Deitel and Deitel, “C++ How to Program”, Pearson Education, 2001

3. Robert Lafore, “Object Oriented Programming in C++”, Galgotia Publications, 1994.

4. Bjarne Strautrup, “The C++ Programming Language”, Addition- Wesley Publication Co.,

2001.

5. Stanley B. Lippman, Josee Lajoie, “C++ Primer”, Pearson Education, 2002

6. E. Balagurusamy, “ Object Oriented Programming with C++”, Tata McGraw-Hill, 2001

BCA-206: COMPUTER NETWORKS, INTERNET AND ITS APPLICATIONS

Maximum Marks : 80 Maximum Time: 3 Hrs.Min Pass Marks: 35% Lectures to be delivered: 90 Hours



SECTION - A

Computer Networks: Uses of Computer Network, Network Hardware, Network Software, Goals and Applications of Computer networks, Structure of Computer Network: Point-to-point structure, Broadcasting structure.

Reference Models: OSI Reference Model; TCP/IP Model, Comparative Overview of Two. SECTION - B

Data Communication: Transmission media, Wireless communication, and the Telephone system, Introduction to cellular radio and communication satellite, Data Rate of Channel, Electromagnetic spectrum. Switching : Circuit switching, packet switching, message switching. Multiplexing : FDM, TDM.

SECTION - C

Introduction to Internetworking – Concepts, Repeaters, Routers, Bridges, and Gateways.MAC Protocols : Pure and slotted, Aloha, CSMA Protocols.

Internet Protocol: IP protocol, IP Addresses,

SECTION - D

Internet Applications: Domain Name System, Electronic mail, The World Wide Web, Multimedia - Audio, Video, Data compression, File Transfer and Remote File Access – Introduction, data transfer and distributed communication, generalised file transfer, interactive and batch transfer, FTP, FTP model, FTP interface, client-server interaction in FTP.

REFERENCES :

1. Andrew S. Tanenbaum, “Computer Networks”, Third Edition, PHI Publications, 1997.

2. Stallings William, “Data & Computer Communication”, 6th Edition, PHI Publications.

3. D.E. Corner, “Computer Networks and Internets’, Second Edition, Addison-Wesley Publication, 2000.

4. D. Bertsellas and R. Gallager, “Data Networks”, 2nd Edition, Prentice Hall, 1992.

BCA-207 SOFTWARE LAB-III (OBJECT ORIENTED PROGRAMMING USING C++ )


Implement programs in C++ for the following:

1. Program flow control (for, while, do while, if, if else, switch).

2. Inbuilt Data Structures (arrays, structures, unions, pointers, enumerations)

3. Functions (inline, parameter passing, overloaded)

4. Classes, Objects and Members (Constructors, Destructors)

5. Inheritance (types of derivation, types of inheritance)

6. Polymorphism (operator overloading, static binding, dynamic binding, pure virtual functions)

7. Files and streams

Data Structures covered under the paper BCA-202 are to be implemented in C++.

BCA-208 SOFTWARE LAB-IV (DATA STRUCTURES)

Maximum Marks: 50 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 90 Hours

Data Structures covered under the paper BCA-203 are to be implemented in C++.

BCA 209 Environmental Studies

Time alloted: 3 hours Total Lectures : 50Total Marks : 100

Pass Marks : 35Written Paper : 75 Marks

Field Work : 25 MarksInstructionsThe written paper will have two parts. First part will be of 25 marks it will contain 10 questions, the students will attempt 5 questions of five marks out of this part. The answer to these questions should non-exceed 50 words each.Part second will be of 50 marks and will contain 10 essay type questions. The candidates will attempt 5 questions out of this part and the answer to each question should not exceed 500 words. Each question will carry ten marks.

Unit 1: The Multidisciplinary nature of environmental studiesDefinition, scope and importance

(2 Lectures)Need for public awareness.Unit 2 Natural Resources :Renewable and non renewable resources:Natural resources and associated problems.

a) Forest resources: Use and over - exploitation, deforestation, case studies. Timber extraction, mining, dams and their effects on forests and tribal people.

b) Water resources: Use and over utilization of surface and ground water, floods, drought, conflicts over water, dams benefits and problems. c) Mineral resources: Use and exploitation, environmental effects of

extracting and using mineral resources, ease studies.d) Food Resources : World Food problems, changes caused by agriculture and

overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging; salinity, case studies.

e) Energy resources: Growing energy needs, renewable and non- renewable energy sources, use of alternate energy sources, Case studies.

F) Land resources: Land as a resource, land degradation, man included landslides, soil erosion and desertification.

Role of an individual in conservation of natural resources Equitable use of resources for sustainable lifestyles.

Unit 3: Ecosystems Concept of an ecosystem Structure and function of an ecosystem Producers, consumers and decomposers. Energy flow in the ecosystem Ecological succession Food chains, food webs and ecological pyramids Introduction, types, characteristic features, structure and functions of the following ecosystem:-a Forest ecosystemb Grassland ecosystemc Desert ecosystemd Aquatic ecosystems ( ponds, streams, lakes, rivers, oceans, estuaries)

( 6 lectures)Unit 4: Biodiversity and its conservation

introduction - - Definition: species and ecosystem diversity Biogeographically classification of India Value of biodiversity: consumptives use, productive, social, ethical, aesthetic and option values. Biodiversity at global, National and local levels. India as a mega-diversity nation Hot spots of biodiversity Threats to biodiversity: Habitat loss, poaching of wildlife, man-wildlife conflicts. Endangered and endemic species of India Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.

(8 Lectures)

Unit 5: Environmental PollutionDefinition Causes, effects and control measures of:-

a) Air Pollutionb) Water Pollutionc) Soil Pollutiond) Marine Pollution e) Noise Pollutionf) Thermal Pollutiong) Nuclear Hazards

Solid waste Management Causes, effects and control meausers of urban and industrial wastes. Role of and individual in prevention of pollution

Pollution case studies Disaster management : floods, earthquake, cyclone and landslides.

(8 Lectures)

Unit 6: Social Issues and the Environment From Unsustainable to Sustainable development Urban problems related to energy Water conservation, rain water harvesting, watershed management Resettlement and rehabilitation of people; its problems and concerns

Case studies. Environmental ethics: Issues and possible solutions Climate change, global warning, acid rain, ozone layer depletion, nuclear accidents and holocaust,

Case studies Wasteland reclamation Consumerism and waste products. Consumerism and waste products Environment Protection Act. Air (Prevention and Control of Pollution) Act. Water (Prevention and control of pollution) Act Wildlife Protection Act. Forest Conservation Act Issues involved in enforcement of environmental legislation Public awareness.

(7 Lectures)

Unit 7: Human Population and the Environment Population growth, variation among nations. Population explosion - Family Welfare Programme. Environment and human health Human Rights Value Education HIV/ AIDS Women and Child Welfare Role of Information Technology in Environment and human health Case Studies

(6 Lectures)

Unit 8: Field Work Visit to a local area to document environmental areas, river/ forest/ grassland/ hill/ mountain Visit to a local polluted site - Urban/ Rural/ Industrial/ Agriculture Study of common plants, insects, birds Study of simple ecosystems-pond, river, hill slopes, etc. (Field work Equal to 5 Lecture hours)

syllabuspupdepartments.ac.in/syllabi/old syllabi [for reference... · web viewordinances and...

Documents