of bachelor degree science - vikram deb autonomous college · of bachelor degree science cbcs...

1

VIKRAM DEB AUTONOMOUS COLLEGE

JEYPORE, KORAPUT, ODISHA - 764001

COURSE OF STUDIES

OF

BACHELOR DEGREE SCIENCE CBCS

ADMISSION BATCH 2015 ONWARD

COMPUTER SCIENCE

Published by VIKRAM DEB AUTONOMOUS COLLEGE

JEYPORE, KORAPUT, ODISHA www.vikramdebcollege.org

3

Three Year Degree Course Bachelor of Science – Coures Structure

2015 Onwards COMPUTER SCIENCE

1st Year 1st Semester C.C. – I 100 C.C. – II 100 AECC 50 G.E – I (Paper-I) 100 Total 350

2nd Semester C.C. – III 100 C.C. – IV 100 AECC – EVS 50 G.E. – II (Paper-I) 100 Total 350 2nd Year 3rd Semester C.C. – V 100 C.C. – VI 100 C.C. – VII 100 SEC – I 50 G.E. – I (Paper II) 100 Total 450 4th Semester C.C. – VIII 100 C.C. – IX 100 C.C. – X 100 SEC – II 50 G.E. – II (Paper II) 100 Total 450 3rd Year 5th Semester C.C. – XI 100 C.C. – XII 100 DSE - I 100 DSE - II 100 Total 400 6th Semester C.C. – XIII 100 C.C. – XIV 100 DSE - III 100 DSE - II 100 Total 400

4

VIKRAM DEB AUTONOMOUS COLLEGE, JEYPORE

Three Years Degree Course Bachelor of Science C.B.C.S. Course Structure

1st Year 1St emester Credit

Total Marks Mid Sem

End Sem

Core - 1 4 75 15 60 Core - 1 Practical 2 25 - 25 Core - 2 (Except Mathematics) 4 75 15 60 Core - 2 Practical 2 25 - 25 Core - 2 Mathematics 6 100 20 80 AECC - MIL/Eng 2 50 10 40 Generic Elective - 1 Paper – 1 (Except Mathematics) 4 75 15 60 Generic Elective - 1 Paper - 1 Practical 2 25 - 25 Generic Elective – 1 Paper – 1 Mathematics 6 100 20 80

20 350

2nd emester Credit

Total Marks Mid Sem

End Sem

Core - 3 (Except Mathematics) 4 75 15 60 Core - 3 Practical 2 25 - 25 Core - 3 Mathematics 6 100 20 80 Core - 4 4 75 15 60 Core - 4 Practical 2 25 - 25 EVS 2 50 10 40 Generic Elective - 2 Paper – 1 (Except Mathematics) 4 75 15 60 Generic Elective – 2 Paper – 1 Mathematics 6 100 20 80 Generic Elective - 2 Paper - 1 Practical 2 50 10 40

20 350

2nd Year 3rd Semister Credit

Total Marks Mid Sem

End Sem

Core - 5 (Except Mathematics) 4 75 15 60 Core - 5 Practical 2 25 - 25 Core - 5 Mathematics 6 100 20 80 Core - 6 (Except Mathematics) 4 75 15 60 Core - 6 Practical 2 25 - 25 Core - 6 Mathematics 6 100 20 80 Core - 7 4 75 15 60 Core - 7 Practical 2 25 - 25 SEC - I Subject Specific Skills 2 50 10 40 Generic Elective - 1 Paper - 2 (Except Mathematics) 4 75 15 60 Generic Elective - 1 Paper - 2 Practical 2 25 - 25 Generic Elective - 1 Paper - 2 Mathematics 6 100 20 80

26 450

4th Semister Credit

Total Marks Mid Sem

End Sem

Core - 8 4 75 15 60 Core - 8 Practical 2 25 - 25 Core - 9 (Except Mathematics) 4 75 15 60 Core - 9 Practical 2 25 - 25

5

Core - 9 Mathematics 6 100 20 80 Core - 10 (Except Mathematics) 4 75 15 60 Core - 10 Practical 2 25 - 25 Core - 10 Mathematics 6 100 20 80 SEC - 2 Subject Specific Skills 2 50 10 40 Generic Elective - 2 Paper - 2 (Except Mathematics) 4 75 15 60 Generic Elective - 2 Paper - 2 Practical 2 25 - 25 Generic Elective - 2 Paper - 2 Mathematics 6 100 20 80

26 450

3RD Year 5th Semister Credit

Total Marks Mid Sem

End Sem

Core - 11 (Except Mathematics) 4 75 15 60 Core - 11 Practical 2 25 - 25 Coere - 11 Mathematics 6 100 20 80 Core – 12 (Except Mathematics) 4 75 15 60 Core - 12 Practical 2 25 - 25 Core - 12 Mathematics 6 100 20 80 DSE - 1 6 100 20 80 DSE - 2 6 100 20 80

24 400

6th Semister Credit

Total Marks Mid Sem

End Sem

Core - 13 (Except Mathematics) 4 75 15 60 Core - 13 Practical 2 25 - 25 Core - 13 Mathematics 6 100 20 80 Core – 14 (Except Mathematics) 4 75 15 60 Core - 14 Practical 2 25 - 25 Core - 14 Mathematics 6 100 20 80 DSE - 3 6 100 20 80

DSE - 4 (Project) 6 100

Viva-20 Presentation-

20 Disserteation

– 60

24 400

Total Credit = 140

Total Marks = 2400 * AECC - Ability Enhancement Compulsory Course SEC - Skill Enhancement Courses DSE - Discipline Specific Elective GE - Generic Elective

6

COMPUTER SCIENCE COURSE STRUCTURE Semester Paper Subject Marks Duration of

Exam 1st Year

1st sem. C.C. I PROGRAMMING USING C 75 3 PRACTICAL 25 3 C.C. II COMPUTER ORGANIZATION 75 3 PRACTICAL 75 3

2nd Sem. C.C. III PROGRAMMING USING C++ 75 3 PRACTICAL 25 3 C.C. IV DATE STRUCTURE 75 3 PRACTICAL 25 3

2nd Year 3rd Sem. C.C. V OPERATING SYSTEM 75 3

PRACTICAL 25 3 C.C. VI DATABASE MANAGEMENT SYSTEM 75 3 PRACTICAL 25 3 C.C. VII DISCRETE STRUCTURE 75 3 PRACTICAL 25 3

4th Sem. C.C. VIII JAVA PROGRAMMING 75 3 PRACTICAL 25 3 C.C. IX COMPUTER NETWORK 75 3 PRACTICAL 25 3 C.C. X COMPUTER GRAPHICS 75 3 PRACTICAL 25 3

3rd Year 5th Sem. C.C. XI INTERNET TECHNOLOGY 75 3

PRACTIVAL 25 3 C.C. XII SOFTWARE ENGINEERING 75 3 PRACTICAL 25 3

6th Sem. C.C. XIII ARTIFICIAL INTELLIGENCE 75 3 PRACTICAL 25 3 C.C. XIV DESIGN AND ANALYSIS OF ALGORITHM 75 3 PRACTICAL 25 3

SKILL ENHANCEMENT COURSE 2nd Year

3rd Sem. SEC I SOFTWARE TESTING 50 3 4th Sem. SEC II ORACLE (SQL/PLSQL) 50 3

DISCIPLINE SPECIFIC ELECTIVE 3rd Year

5th Sem. DSE I INFORMATION SECURITY 100 3 DSE II DIGITAL IMAGE PROCESSING 100 3

6th Sem. DSE III CLOUD COMPUTING 100 3 DSE IV PROJECT 100 3

N. B.: 1) 20 % marks in each paper is allocated to Mid Semester Examination and 80 % marks allocated to term End Examination. 2) There shall be only one Mid Semester Examination in each Semester.

7

Combination for Honours PHYSICAL SCIENCE

The Candidate has to select one of the following combination.

Core AECC Compulsory AECC Skill Based DSE GE

Physics

MIL/Alt. English EVS

Subject Specific

Physics Chemistry Mathematics

Chemistry Chemistry Physics Mathematics

Mathematics Mathematics Physics Chemistry

Computer Science *

Computer Science

Physics Chemistry Mathematics

Computer Science (Self-Financing) with a course fee of Rs. 30,000/- (Thirty Thousand) only @ Rs.

10,000/- per year. Students alloted computer science hons. shall have to pay Rs. 10,000/- every year along with admission fees. if a student discontinues in mid course, he/she shall forfeit the amount already depositied and in addition shall have to deposit the balance amout of the course fee Rs. 30,000/- before taking C.L.C.

8

Semester - I AECC – MIL (Odia)

Full Marks – 50 `ÐWÔ : jcèÐ], bþÐiÐ J jÐkÞþ[Ô

1c HLL - jcèÐ]eþ èÞþbþÐiÐ, èÞþjeþ J `õLÐeþ

2 Æ HLL - jcèÐ] jÕNõkþeþ `w[Þ, õªÊÆ[Þ, èÞþÒaiZ

3 Æ HLL - jcèÐ]eþ bþÐiÐ, jcèÐ] J jÐkÞþ[Ô

jkþÐ¯ÆL Nõx :

1 - jcèÐ] J jÐcèÐ]ÞL[Ð - QtõÒhMeþ ckþÐ`Ð[ö, JXÞA `ÐWÔ`ÊªÆL õLÐh_ J `õZ¯Æ_ jÕyÐ, bËþaÒ_hèeþ¼¼Ð

2 - jÐeþjè[ jÐlÐ[LÐeþ - aÞS¯ÆÐ_t jÞÕkþ, aÞ]ÔÐ`ÊeþÑ, LVL

3 - jÕÒdÐN @_ÊaÞ Þ / aÔÐakþÐeÞþL JXÞA bþÐiÐ J õÒ¯ÆÐNÐ[ëL aÔÐLeþZ - jÒ«ÆÐi [öÞ ÐWÑ, _ÐftÐ, LVL

4 - mþM_LfÐ J õÐÒ¯ÆÐNÞL aÔÐLeþZ - @S Æ LÊcÐeþ cÞhõ, LmþÔÐZÑ àîÞhjà, LVL

Mid Sem - 10

Term End - 40

9

Semester - I Ability Enhancement Compulsory Course for Science

ENGLISH Full Marks - 50

This course aims at enhancing the English language proficiency of undergraduate students in humanity, science and commerce streams to prepare them for the academic, social and professional expectations during and after the course. The course will help develop academic and social English competencies in speaking, listening, pronunciation, reading and writing, grammar and usage, vocabulary, syntax, and rhetorical patterns. Students, at the end of the course, should be able to use English appropriately and effectively for further studies or for work where English is used as the language of communication. Unit I Reading Comprehension [15] " Locate and remember the most important points in the reading " Interpret and evaluate events, ideas, and information " Read "between the lines" to understand underlying meanings " Connect information to what they already know Unit II Writing [15] 1. Expanding an Idea 2. Writing a Memo 3. Report Writing 4. Creative Writing 5. News Story 6. Setting in Creative Writing 7. Writing a Business Letter 8. Letters to the Editor 9. Précis Writing 10. CV & Resume Writing 11. Dialog writing 12. Covering Letter 13. Writing Formal Email 14. Elements of Story Writing 15. Note Making 16. Information Transfer 17. Interviewing for news papers Unit III Language functions in listening and conversation [06] 1. Discussion on a given topic in pairs 2. Speaking on a given topic individually (Practice to be given using speaking activities from the prescribed textbooks) Grammar and Usage [14] 1. Simple and Compound Sentences 2. Complex Sentences 3. Noun Clause 4. Adjective Clause 5. Adverb Clause 6. The Conditionals in English 7. The Second Conditional 8. The Third Conditional 9. Words and their features 10. Phrasal Verbs 11. Collocation 12. Using Modals 13. Use of Passives 14. Use of Prepositions 15. Subject-verb Agreement 16. Sentence as a system 17. Common Errors in English Usage

10

Book Prescribed Vistas and Visions: An Anthology of Prose and Poetry. (Ed.)Kalyani Samantray, Himansu S. Mohapatra, Jatindra K. Nayak, Gopa Ranjan Mishra, Arun Kumar Mohanty. OBS Texts to be studied (For Science) Prose " Pleasures of Ignorance " Ecology and Society " Lifestyle English " Playing the English gentleman Poetry " Lover's Infiniteness " Last Sonnet " The Felling of the Banyan Tree All grammar and writing activities in the textbook

Mid Sem - 10

Term End - 40

11

Semester - II Ability Enhancement Compulsory Course (AECC)

ENVIRONMENTAL STUDIES Full Marks - 50

Unit - I Basic Concepts of Environment Ecological Factors; Air, Water, Soil, Light, Temperature, Biotic factors Ecosystem: Concepts, Structure and Function, Food Chain, Food Web, Ecological Pyramid, Energy Flow, Biogeochemical Cycle (Carbon Cycle, Nitrogen Cycle) Unit - II Environmental Pollution Air Pollution; Water Pollution, Industrial Pollution, Noise Pollution, Types of Pllutants, Sources and fate of Pollutants in the environment. Sewage treatment, Greenhouse Effect, Global Warming, Acid Rain. Unit - III Conservation of Natural Resourses Renewal and Non-Renewable resourcs, soil erosion and conservation, Forest Conservation, Wildlife Conservation, Pollution control Board and its function, Environmental education and awarness. Suggested Readings :

1. Fundamental of Ecology by E.P. Odum 2. Fundamental of Ecology by M.C. Dash 3. Ecology and Environment by P.D. Sharma 4. Concepts of Ecology by E.J. Kormondy 5. Fundamentals of Enviromental studies by N.K. Tripathy 6. Environmental studies by Dr. A.K. Panigrahi and Alaka Sahu 7. Parivesh Bigyana : Dr. Ranganath Mishra

Mid Sem - 10

Term End - 40

12

2nd Year Semester – III

COMPUTER SCIENCE SEC - I

SOFTWARE TESTING Full Marks : 100

UNIT – I Introduction Strategic Approach to Software Testing, Test Strategies for Conventional Software, Validation Testing, System Testing, Basic Terminologies, V Shaped Software Lifecycle Model UNIT – II Functional Testing\ Black-box Testing Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing UNIT – III Structural Testing\ White-box Testing Basis Path Testing: Program Graph, DD Path graph, Cyclomatic Complexity, Graph Matrices, Unit – IV Control Flow Testing: Statement Coverage, Branch Coverage, Condition Coverage, Path Coverage Suggested Readings : 1. Roger S. Pressman, Software Engineering: A Practitioner‘s Approach, Seventh Edition, Mc Graw Hill

Education.2009

2. Yogesh Singh, Software Testing, Cambridge University Press.2011.

3. Naresh Chauhan, Software Testing – Principles and Practices, Oxford University Press

Mid Sem. - 10 Term End - 40

13

Semester – IV COMPUTER SCIENCE

SEC - II ORACLE (SQL/PL-SQL)

Full Marks : 100 UNIT-I Introduction to Oracle as RDBMS: SQL Vs. SQL * Plus. SQL Commands and Data types, Operators and Expressions, Introduction to SQL * Plus. UNIT-II Managing Tables and Data: • Creating and Altering Tables (Including constraints) • Data Manipulation Command like Insert, update, delete • SELECT statement with WHERE, GROUP BY and HAVING, ORDER BY, DISTINCT, Special operator like IN, ANY, ALL BETWEEN, EXISTS, LIKE. • Join, Built in functions. UNIT-III

Other Database Objects: Viewand Index. Transaction Control Statements: Commit, Rollback, Savepoint. UNIT-IV Introduction to PL/SQL:SQL v/s PL/SQL, PL/SQL Block Structure. Language construct of PL/SQL:Variables, Basic and Composite Data type, Conditions looping. Suggested Readings :

1. Ivan Bayross, "SQL, PL/SQL the Programming Language of Oracle Paperback", BPB Publicatins, 2010. 2. Steven Feuerstein, Bill Pribyl , "Oracle PL/SQL Programming", 6th Edition, O'Reilly Media, 2014 3. Rajeeb C. Chatterjee, "Learning Oracle SQL and PL/SQL: A simplified Guide", PHI, 2012.

Software Lab Based on SQL/PL-SQL (SEC – II): [SQL COMMANDS] 1) SQL* formatting commands 2) To create a table, alter and drop table. 3) To perform select, update, insert and delete operation in a table. 4) To make use of different clauses viz where, group by, having, order by, union and intersection, 5) To study different constraints. [SQL FUNCTION] 6) To use oracle function viz aggregate, numeric, conversion, string function. 7) To understand use and working with joins. 8) To make use of transaction control statement viz rollback, commit and save point. 9) To make views of a table. 10) To make indexes of a table. [PL/SQL]

11) To understand working with PL/SQL 12) To implement Cursor on a table. 13) To implement trigger on a table


14

1st Year Semester – I

Core Course : COMPUTER SCIENCE Core Course (C.C.) - I

PROGRAMMING USING C Full Marks : 100

UNIT- I Introduction to Programming Language, Introduction to C Programming , Character Set, C Tokens, Keywords & Identifiers, Constants, Variables, Data Types, Variables , Storage Classes, Operators (Arithmetic, Relational, Logical , Assignment, Increment & Decrement, Conditional , Bitwise), Expressions , Input and Output Operations. UNIT- II Decision Making and Branching: Simple IF Statement, IF ….. ELSE Statement, Nesting IF …. ELSE Statement, ELSE IF Ladder, Switch Statement, ?Operator, GOTO Statement. Decision Making and Looping: The WHILE Statement, The DO Statement, The FOR Statement, Jumps in LOOPS. Arrays, Character Arrays and Strings. UNIT- III User-defined Functions: Need, Elements & Definition, Function Calls, Function Definition, Category of Functions, Recursion. Structures and Unions: Defining, Declaring, Accessing, Initialization Structure, Arrays of Structures, Arrays within Structures, Structures and Functions, Unions. UNIT- IV Pointers: Accessing the Address of a Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a Variable through its Pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays,, Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers to Structures, Troubles with Pointers. File Management in C : Defining and opening a file, closing a file, Input/Output operations on files, different operation & mode of file, command line arguments. Prescribed: Programming in ANSI C: E. Balguruswamy 4/e (TMH) Suggested Readings : 1. Ashok N. Kamthane: ANSI & Turbo C, Pearson Education 2. Yashavant P. Kanetkar: Let Us C, BPB Publication PRACTICAL PROGRAMMING USING C LAB 1. Program on Declaration 12, Definition & size of different data types. 2. Program on Selection statements. (if-else, Nested if-else, switch statement) 3. Program using Break and continue statement. 4. Program on looping. (while, for, do-while) 5. Program on function and recursion function. 6. Program on Array. (One dimensional, two dimensional) 7. Program to handle or manipulate strings. 8. Program on Function using Array and Structure. 9. Program on function using call by value and call by reference. 10. Program on Structure & Union. 11. Program on Pointer. 12. Program on File Handling.

Mid Sem. - 15 Term End - 60 Prctical - 25

15

Semester – I Core Course : COMPUTER SCIENCE

Core Course (C.C.) - II COMPUTER ORGANIZATION

Full Marks : 100 UNIT-I Basic Structure of Computers: Computer Types, Functional Units, Input Unit, Memory Unit, Arithmetic and Logic Unit, Output Unit, Control Unit, Basic Operational Concepts, Bus Structures, Software. Machine Instructions and Programs: Numbers, Arithmetic Operations, and Characters: Number Representation, Addition of Positive Numbers, Addition and Subtraction of Signed Numbers UNIT-II Character Cocles, Decimal System, Binary System, Decimal to Binary Conversion, Hexadecimal Notatlon, Boolean Algebra, Basic Logic Functions: Electronic Logic' Gates, Synthesis of Logic Functions, Minimization of Logic Expressions, Minimization using Karnaugh Maps, Synthesis with NAND and NOR Gates. UNIT-III Flip-Flops, Master-Slave Flip-Flops, Edge-Triggering, T Flip-Flops, JK Flip-Flops. Registers and Shift Registers, Counters, Decoders, Multiplexers, Programmable Array Logic (PAL), Sequential Circuits, Timing Diagrams, Instructions and Instruction Sequencing, Basic Instruction Types, Instruction Execution, Generating Memory Addresses, Addressing Modes, UNIT-IV Registers, Memory Access, and Data Transfer, Register Structure, Memory Access Instructions and Addressing Modes, Logic Instructions, Branch Instructions, Subroutines, Stacks and Queues, Subroutines. Load and Store Instructions, Arithmetic and Loqic Instructions, Flow Control Instructions, Compare Instructions, Logic Instructions, Subroutines. Memory System: Asynchronous DRAMS, Synchronous DRAMS, Read-Only Memories: ROM, PROM, EPROM, EEPROM, Flash Memory, Speed, Size, Secondary Storage: Magnetic Hard Disks, Optical Disks, Magnetic Tape Systems. Text Book: 1. M. Morris Mane: Computer System Architecture, Pearson Edcuation 2. Carl Hamacher, Z. Vranesic, S. Zaky: Computer Organization, 5/e (TMH) Reference Book: 1. Sinha and Sinha: Computer Fundamental 2. .Jaggi and Jain: Computers for Beginners 3. Amit Kumar Mishra: Advanced Computer Architecture

PRACTICAL COMPUTER ORGANIZATION LAB

1. Create a Fetch routine of the Instruction Cycle. 2. Simulate the machine to determine the contents of AC, E, PC, AR and IR registers in hexadecimal after the execution of each of following register reference instructions: a. CLA b. CMA c. INC d. SPA e. HLT Initialize the contents of AC to (A937)16, that of PC to (022) 16and E to l. 3. Simulate the machine for the following memory-reference instructions with I = 0 and address part = 082. The instruction to be stored at address 022 in RAM. Initialize the memory word at address 082 with the operand B8F2 and AC with A937. Determine the contents of AC, DR, PC, AR and IR in hexadecimal after the execution. a. ADD b. AND c. LDA d. STA 4. Simulate the machine for the memory -reference instructions referred in above question with I =1 and address part = 082. The instruction be stored at address 026 in RAM. Initialize the memory word at address 082 with the value 298. Initialize the memory word at address 298 with operand B8F2 and AC with A937. Determine the contents of AC, DR, PC, AR and IR in hexadecimal after the execution.


16

Semester – II Core Course : COMPUTER SCIENCE

Core Course (C.C.) - III PROGRAMMING USING C++

Full Marks : 100 UNIT-I Principles of Object-Oriented Programming: Object-Oriented Programming (OOP) Paradigm, Basic Concepts of OOP, Benefits of OOP, Object Oriented Languages, Applications of OOP. Beginning with C++: Applications of C++, C++ statements, Structure of C++ Program, Creating the Source File, Compiling and Linking. Tokens, Expressions and Control Structures: Tokens, Keywords, Identifiers & Constants, Basic Data Types, User-Defined Data Types, Derived Data Types, Symbolic Constants, Type Compatibility, Declaration of Variables, Dynamic Initialization of Variables, Reference Variables, Operators in C++: Scope Resolution Operator, Member Dereferencing Operators, Memory Management Operators, Manipulators, Type Cast Operators, Expressions and their Types, Special Assignment Expressions, Implicit Conversions, Operator Precedence, Control Structures. UNIT-II Functions in C++: Function Prototyping, Call By Reference, Return by Reference, Inline Functions, Default Arguments, Const. Arguments, Function Overloading,.Classes and Objects: Specifying a Class, Defining Member Functions, Private and Public Members, Making an outside Function Inline, Nested Member Functions, Private Member Functions, Arrays within a Class, Memory Allocation for Objects, Static Data Members, Static Member Functions, Arrays of Objects, Objects as Function Arguments, Friendly Functions, Returning Objects, Cons. Member Functions, Pointer to Members, Local Classes. UNIT- III Constructors & Destructors: Constructors Parameterized Constructors, Multiple Constructors in a Class, Constructors with Default Arguments, Dynamic Initialization of Objects, Copy Constructor, Dynamic Constructors, Constructing Two-Dimensional Arrays, Destructors. Operator overloading andType Conversions: Defining Operator Overloading, Overloading Unary Operators, Overloading Binary Operators, Overloading Binary Operators using Friends, Manipulation of Strings using Operators, Rules for Overloading Operators, Type Conversions. UNIT-IV Inheritance: Defining Derived Classes, Single Inheritance, Making a Private Member Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid Inheritance, Virtual Base Classes, Abstract Classes, Constructors in Derived Classes, Member Classes, Nesting of Classes. Pointers, Virtual Functions and Polymorphism: Pointers, Pointers to Objects, this Pointer, Pointers to Derived Classes, Virtual Functions, Pure Virtual Functions. Suggested Readings : Object Oriented Programming with C++: E Balgurusamy, 4/e (TMH). For References: 1. Ashok N. Kamthane: ANSI & Turbo C++, Pearson Education 2. Jesse Liberty and Jim Keogh: Introduction to Programming with c++, Prentice Hall of India Pub. 3. Herbtz Schildt, "C++: The Complete Reference", Fourth Edition, McGraw Hill.2003 PRACTICAL PROGRAMMING USING C++ LAB 1. Program on C++ using functions. 2. Program on Function Overloading. 3. Program on C++ using Class Concept.(Private, Public) 4. Program in creating objects. 5. Program on Creating Constructor & Destructor. 6. Program on Constructor Overloading. 7. Program on Constructor (Default, Parameterized, Copy) 8. Program on Operator overloading. 9. Program on Inheritance. (Private, Public and Protected) 10. Program on Virtual Function and Virtual Class.


17

Semester – II Core Course : COMPUTER SCIENCE

Core Course (C.C.) - IV DATA STRUCTURE

Full Marks : 100 UNIT-I Introduction and Overview: Definitions, Concept of Data Structures, Overview of Data Structures, Implementation of Data Structures. Arrays: Terminology, One- Dimensional Array, Multi-Dimensional Arrays, Pointer Arrays. Linked Lists: Single Linked List, Circular Linked List, Double Linked List, Circular Double Linked List, Application of Linked Lists, Memory Representation. UNIT-II Stacks: Definition, Representation of Stack (Array, Linked List), Operations on Stacks, Applications of Stack (Evaluation of Arithmetic Expressions, Implementation of Recursion, Factorial Calculation, Quick Sort, Tower of Hanoi). UNIT -III Queues: Definition, Representation of Queues (Array, Linked List), Circular Queue, Deque, Priority Queue, Application of Queues (Simulation, CPU Scheduling in Multiprogramming Environment, Round Robin Algorithm). UNIT -IV Tree: .Binary Trees, Properties of Binary Tree, Linear Representation of a Binary Tree, Linked Representation of a Binary Tree, Operations on Binary Tree (Pre-order, In-order and Post-order Traversal), Types of Binary Trees (Expression Tree, Binary Search Tree, Heap Tree, Threaded Binary Trees, Height Balanced Binary Tree). Suggested Readings : 1. Classic Data Structures: D. SAMANTA (PHI). 2. S. Lipschutz: Introduction to Data Structures, McGraw Hill Pub. For References: 1. D.S Malik, Data Structures using C++, Second Edition, Cengage Learning, 2010 2. Robert L. Kruse, "Data Structures and Program Design in C++", Pearson, 1999. 3. Dr. Amiya Rath, "Data Structure using C". PRACTICAL DATA STRUCTURE LAB 1. Program on Array type of Data Structure. 2. Program on Data Structure (Stack). 3. Program on Data Structure (Queue). 4. Program on Data Structure (Linked-list). 5. Program on Binary Search. 6. Program on Sorting (Selection, Bubble). 7. Program on Binary Search Tree and include the operation like Insertion, deletion by copying, Searching, display preorder, postorder and inorder.


18

2nd Year Semester – III

Core Course : COMPUTER SCIENCE Core Course (C.C.) - V

OPERATING SYSTEMS Full Marks : 100

UNIT- I Operating System, Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage Management,Protection and Security. Service provided by OS. File System: Access method, File operation & Protection. File attributes. Types of File System – FAT, FAT32, NTFS, ext2, ext3. Dual mode operation of OS. UNIT- II Process: Process Concept, Process Scheduling, Operations on Processes, Inter-Process Communication, Examples of IPC Systems, Communication in Client-Server Systems. Multithreaded Programming: Multithreading Models, Thread Libraries, Threading Issues, Operating-System Examples. UNIT- III Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms (FCFS, SJF, RR, Priority), Thread Scheduling. Multiple-Process Scheduling. Virtual-Memory Management: Demand Paging, Copy-on-Write, Page Replacement, Memory Management Strategies: Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, File System: File Concept, Access Methods, Directory and Disk Structure, Disk Scheduling Algorithm (FCFS, SSTF, SCAN and C-SCAN). UNIT- IV Deadlocks: System Model, Deadlock Characterization, Methods of Handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, Recovery from Deadlock. Suggested Readings :

1. Operating System Concepts: Silberschatz, Galvin, Gagne, 8/e (Wiley-India) COMPUTER SCIENCE LAB (CC-V): Operating Systems

Using C/ C++ programs 1. WRITE A PROGRAM (using fork() and/or exec() commands) where parent and child execute:

a) same program, same code. b) same program, different code. c) before terminating, the parent waits for the child to finish its task.

2. WRITE A PROGRAM to report behaviour of Linux kernel including kernel version, CPU type and model. (CPU information)

3. WRITE A PROGRAM to report behaviour of Linux kernel including information on configured memory, amount of free and used memory. (memory information)

4. WRITE A PROGRAM to print file details including owner access permissions, file access time, where file name is given as argument.

5. WRITE A PROGRAM to copy files using system calls. 6. Write program to implement FCFS scheduling algorithm. 7. Write program to implement Round Robin scheduling algorithm. 8. Write program to implement SJF scheduling algorithm. 9. Write program to implement non-preemptive priority based scheduling algorithm. 10. Write program to implement preemptive priority based scheduling algorithm. 11. Write program to implement SRJF scheduling algorithm. 12. Write program to calculate sum of n numbers using thread library. 13. Write a program to implement first-fit, best-fit and worst-fit allocation strategies.


19

Semester – III Core Course : COMPUTER SCIENCE

Core Course (C.C.) - VI DATABASE MANAGEMENT SYSTEM

Full Marks : 100 UNIT-I Introduction of Database Management System (DBMS), Pros and Cons of DBMS. Databases and Database Users, Database System Concepts and Architecture, Data Modelling using the Entity-Relationship(ER) Model, The Enhanced Entity-Relationship (EER) Model. UNIT-II Relational Model: The Relational Data Model and Relational Database Constraints, The Relational Algebra and Relational Calculus. Fundamental Operations – Select, Project, Composition, Union, Set Difference, Cartesian –Product, Rename, Natural Join, Generalized Projection, Outer join and Aggregate functions.Functional Dependencies and Normalization for Relational Databases UNIT-III Disk Storage, Basic File Structures, and Hashing, Indexing Structures for Files, Algorithms for Query Processing and Optimization, Physical Database Design and Tuning. UNIT-IV RDBMS Package (Oracle 9i/10g) – SQL and PL/SQL. Introduction to ORACLE RDBMS. Introduction to SQL. Advantages of SQL. Classification of SQL Statements. SQL Data types. Different commands: DDL (Create, Alter, Drop), DML( Insert, Select, Update, Delete), DCL(Commit, grant and revoke) SQL Aggregate Functions: Sum, Avg, Count, Max and Min Suggested Readings :

1. Fundamentals of Database Systems, Ramez Elmasri & Shamkant B. Navathe, Pearson (Fifth Edition) 2.

COMPUTER SCIENCE LAB (CC-VI): Database Management Create and use the following database schema to answer the given queries.

EMPLOYEE Schema DEFAUL Field Type NULL KEY T

Eno Char(3) NO PRI NIL Ename Varchar(50) NO NIL Job_type Varchar(50) NO NIL Manager Char(3) Yes FK NIL Hire_date Date NO NIL Dno Integer YES FK NIL Commission Decimal(10,2) YES NIL Salary Decimal(7,2) NO NIL DEPARTMENT Schema DEFAUL Field Type NULL KEY T

Dno Integer No PRI NULL Dname Varchar(50) Yes NULL Location Varchar(50) Yes New Delhi Query List

20

1. Query to display Employee Name, Job, Hire Date, Employee Number; for each employee with the Employee Number appearing first.

2. Query to display unique Jobs from the Employee Table. 3. Query to display the Employee Name concatenated by a Job separated by a comma. 4. Query to display all the data from the Employee Table. Separate each Column by a comma and name the said

column as THE_OUTPUT. 5. Query to display the Employee Name and Salary of all the employees earning more than $2850. 6. Query to display Employee Name and Department Number for the Employee No= 7900. 7. Query to display Employee Name and Salary for all employees whose salary is not in the range of $1500 and

$2850. 8. Query to display Employee Name and Department No. of all the employees in Dept 10 and Dept 30 in the

alphabetical order by name. 9. Query to display Name and Hire Date of every Employee who was hired in 1981. 10. Query to display Name and Job of all employees who don‘t have a current Manager. 11. Query to display the Name, Salary and Commission for all the employees who earn commission. 12. Sort the data in descending order of Salary and Commission. 13. Query to display Name of all the employees where the third letter of their name is ‗A‘. 14. Query to display Name of all employees either have two ‗R‘s or have two ‗A‘s in their name and are

either in Dept No = 30 or their Manger‘s Employee No = 7788. 15. Query to display Name, Salary and Commission for all employees whose Commission Amount is 14 greater

than their Salary increased by 5%. 16. Query to display the Current Date. 17. Query to display Name, Hire Date and Salary Review Date which is the 1st Monday after six months of

employment. 18. Query to display Name and calculate the number of months between today and the date each employee was

hired. 19. Query to display the following for each employee <E-Name> earns < Salary> monthly but wants < 3 *

Current Salary >. Label the Column as Dream Salary. 20. Query to display Name with the 1st letter capitalized and all other letter lower case and length of their name

of all the employees whose name starts with ‗J‘, ‘A‘ and‗M‘. 21. Query to display Name, Hire Date and Day of the week on which the employee started. 22. Query to display Name, Department Name and Department No for all the employees. 23. Query to display Unique Listing of all Jobs that are in Department # 30. 24. Query to display Name, Dept Name of all employees who have an ‗A‘ in their name. 25. Query to display Name, Job, Department No. And Department Name for all the employees working at the

Dallas location. 26. Query to display Name and Employee no. Along with their Manger‘s Name and the Manager‘s employee no;

along with the Employees‘ Name who do not have a Manager. 27. Query to display Name, Dept No. And Salary of any employee whose department No. and salary

matches both the department no. And the salary of any employee who earns a commission. 28. Query to display Name and Salaries represented by asterisks, where each asterisk (*) signifies $100. 29. Query to display the Highest, Lowest, Sum and Average Salaries of all the employees 30. Query to display the number of employees performing the same Job type functions. 31. Query to display the no. of managers without listing their names. 32. Query to display the Department Name, Location Name, No. of Employees and the average salary for all

employees in that department. 33. Query to display Name and Hire Date for all employees in the same dept. as Blake. 34. Query to display the Employee No. And Name for all employees who earn more than the average

salary. 35. Query to display Employee Number and Name for all employees who work in a department with any

employee whose name contains a ‗T‘.

21

36. Query to display the names and salaries of all employees who report to King. 37. Query to display the department no, name and job for all employees in the Sales department.


22

Semester – III Core Course : COMPUTER SCIENCE

Core Course (C.C.) - VII DISCRETE STRUCTURES

Full Marks : 100 UNIT-I Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers. UNIT-II Basic Structures: Sets, Set Operations, Functions, Recursive Functions,Relations: Relations and their Properties, Representing Relations, Closures of Relations, Equivalence Relations, Partial Ordering. Algebra: Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits. Algebraic Structures & Coding Theory:Semi-groups, Monoids and Groups, Homomorphism. UNIT-IIICounting: Basics of Counting, The Pigeonhole Principle, Permutations and Combinations,Bayes’ Theorem. UNIT-IV Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs,Planar Graphs. Connectivity,Euler and Hamiltonian Paths, Shortest-Path Problem. Suggested Readings : 1. Kenneth H Rosen, Discrete Mathematics & Its Applications, McGraw-Hill. 7/e COMPUTER SCIENCE LAB (CC-VII): Discrete Structures Lab COMPUTER SCIENCE LAB (CC-VII) - Discrete Structures Lab

1. Write a program in C to show logical and bit-wise operators –OR, AND, XOR, NOT and left/right shift.

2. Write a C Program to Find Prime Numbers in a given Range. 3. Write a C Program to Find Sum of the Series 1/1! + 2/2! + 3/3! + ……1/N! 4. Write a C++ Program to find factorial of an integer number using recursion. 5. Write a C Program to Find GCD of given Numbers using Recursion. 6. WAP in C to calculate Binomial coefficient or Recurrence relation for combinatory i.e. C(n,r)= n!/(r!*(n-r)!) using factorial

function recursively. 7. WAP in C for shortest path problem by implementingDijkstra's algorithm. 8. WAP in C++ to Generate All Permutations using BackTracking. 9. WAP in C to Represent Graph Using Linked List. 10. WAP in C to Encrypt and Decrypt a password.


23

Semester – IV Core Course : COMPUTER SCIENCE

Core Course (C.C.) - VIII JAVA PROGRAMMING

Full Marks : 100 UNIT-I Introduction to Java:Java Architecture and Features, Understanding the semantic and syntax differences between C++ and Java, Compiling and Executing a Java Program, Variables, Constants, Keywords Data Types, Operators (Arithmetic, Logical and Bitwise) and Expressions, Comments, Doing Basic Program Output. Decision Making Constructs (conditional statements and loops) and Nesting, Java Methods (Defining, Scope, Passing and Returning Arguments, Type Conversion and Type and Checking, Built-in Java Class Methods), UNIT-II Arrays, Strings and I/O:Creating & Using Arrays (One Dimension and Multi-dimensional), Referencing Arrays Dynamically, Java Strings: The Java String class, Creating & Using String Objects, Manipulating Strings and String Buffer Classes. Simple I/O using System.out and the Scanner class, Byte and Character streams, Reading/Writing from console and files. Object-Oriented Programming Overview:Principles of Object-Oriented Programming, Defining & Using Classes, Controlling Access to Class Members, Class Constructors, Method Overloading, Class Variables & Methods, Objects as parameters, final classes, Object class, Garbage Collection. UNIT-III Inheritance, Interfaces, Packages, EnumerationsInheritance:(Single Level and Multilevel, Method Overriding, Dynamic Method Dispatch, Abstract Classes), Interfaces and Packages, Extending interfaces and packages, Package and Class Visibility, Using Standard Java Packages (util, lang, awt), Wrapper Classes. Exception Handling: Exception types, uncaught exceptions, throw, built-in exceptions, Creating your own exceptions. Multi-threading and Database Connectivity: The Thread class and Runnable interface, creating single and multiple threads, Thread prioritization, synchronization and communication, suspending/resuming threads. Accessing and manipulating databases using JDBC. UNIT-IV Applets and Event Handling:Java Applets:Introduction to Applets, Writing Java Applets, Working with Graphics, Incorporating Images & Sounds. Event Handling Mechanisms,Listener Interfaces, Adapter and Inner Classes. The design and Implementation of GUIs using the AWT controls, Swing components of Java Foundation Classes such as labels, buttons, textfields, layout managers, menus, events and listeners; Graphic objects for drawing figures such as lines, rectangles, ovals, using different fonts. Overview of servlets. Suggested Readings : 1.Balagurusamy. E, “Programming with JAVA, A Primer 2e”, Tata McGraw Hill, 2. Arora Lalit, “ Object Oriented with JAVA”, KATSON Books COMPUTER SCIENCE LAB (CC-VIII): Programming in Java 1. To find the sum of any number of integers entered as command line arguments 2. To find the factorial of a given number 3. To learn use of single dimensional array by defining the array dynamically. 4. To learn use of .lenth in case of a two dimensional array 5. To convert a decimal to binary number 6. To check if a number is prime or not, by taking the number as input from the keyboard 7. To find the sum of any number of integers interactively, i.e., entering every number from the keyboard,

whereas the total number of integers is given as a command line argument 8. Write a program that show working of different functions of String and StringBufferclasss like setCharAt(,

setLength(), append(), insert(), concat()and equals().

24

9. Write a program to create a ―distance� class with methods where distance is computed interms of feet and inches, how to create objects of a class and to see the use of this pointer

10. Modify the ―distance� class by creating constructor for assigning values (feet and inches)to the distance object. Create another object and assign second object as reference variable to another object reference variable. Further create a third object which is a clone of the first object.

11. Write a program to show that during function overloading, if no matching argument is found, then java will apply automatic type conversions(from lower to higher data type)

12. Write a program to show the difference between public and private access specifiers. The program should also show that primitive data types are passed by value and objects are passed by reference and to learn use of final keyword

13. Write a program to show the use of static functions and to pass variable length arguments in a function. 14. Write a program to demonstrate the concept of boxing and unboxing. 15. Create a multi-file program where in one file a string message is taken as input from the user

and the function to display the message on the screen is given in another file (make use of Scanner package in this program).

16. Write a program to create a multilevel package and also creates a reusable class to generate Fibonacci series, where the function to generate fibonacii series is given in a different file belonging to the same package.

17. Write a program that creates illustrates different levels of protection in classes/subclasses belonging to same package or different packages

18. Write a program ―DivideByZero� that takes two numbers a and b as input, computes a/b,and invokes Arithmetic Exception to generate a message when the denominator is zero.

19. Write a program to show the use of nested try statements that emphasizes the sequence of checking for catch handler statements.

20. Write a program to create your own exception types to handle situation specific to your application (Hint: Define a subclass of Exception which itself is a subclass of Throwable).

21. Write a program to demonstrate priorities among multiple threads. 22. Write a program to demonstrate multithread communication by implementing synchronization among

threads (Hint: you can implement a simple producer and consumer problem). 23. Write a program to create URL object, create a URLConnection using the openConnection() method and then

use it examine the different components of the URLand content. 24. Write a program to implement a simple datagram client and server in which a message that is typed into the

server window is sent to the client side where it is displayed. 25. Write a program that creates a Banner and then creates a thread to scrolls the message in the banner from left

to right across the applet‘s window. 26. Write a program to get the URL/location of code (i.e. java code) and document (i.e. html file). 27. Write a program to demonstrate different mouse handling events like mouseClicked(),

mouseEntered(), mouseExited(), mousePressed, mouseReleased() and mouseDragged(). 28. Write a program to demonstrate different keyboard handling events. 29. Write a program to generate a window without an applet window using main() function. 30. Write a program to demonstrate the use of push buttons.


25


Core Course (C.C.) - IX COMPUTER NETWORK

Full Marks : 100 UNIT-I Introduction: Data Communications, Networks, Line Configuration: Mesh, Star, Bus, Ring, Tree, The Internet, Protocols and Standards. Categories of Network: LAN, MAN, WAN and Inter-Network. Transmission mode. Basic terminologies: amplitude, frequency, phase, bandwidth. Nyquist theorem and Shannon’s capacity Network Models: Design issues for layered approach to networking. The OSI Model, Layers in the OSI Model, TCP/ IP Protocol Suite, Addressing. Inter-networking devices. UNIT-II Data and Signals: Analog and Digital, Periodic Analog Signals, Digital Signals, Transmission Impairment, Data Rate Limits, Performance. Digital Transmission: Digital-To-Digital Conversion, Analog-To-Digital Conversion, Transmission Modes. Analog Transmission: Digital-To-Analog Conversion, Analog-To-Analog Conversion. Multiplexing and Spreading: Multiplexing, Spread Spectrum. Transmission Media: Guided Media, Unguided Media (Wireless). Switching: Circuit Switched, Datagrams, Virtual Circuit Networks, Structure of a Switch. Telephone Network, Dial-Up MODEMS, Digital Subscriber Line (DSL), Cable TV Networks, Cable TV for Data Transfer. UNIT-III Error Detection and Correction: Introduction, parity, CRC and Checksum. Data Link Control: Framing, Flow and Error Control, Protocols, Noiseless Channels, Noisy Channels, HDLC, Point-To-Point Protocol. Multiple Accesses: Random Access, Controlled Access, Channelization. Wired LANs: IEEE Standards, Standard Ethernet, Changes in the Standard, Fast Ethernet, Gigabit Ethernet: Wireless LANs: IEEE 802.11, Bluetooth. UNIT-IV Connecting LANs: Connecting Devices, Backbone Networks and Virtual LANs. Wireless LANs: Cellular Telephony, Satellite Networks. Virtual-Circuit Networks. Frame Relay, ATM. Suggested Readings : 1. Data Communications and Networking, 4/e, Forouzan, B. (TMH) COMPUTER SCIENCE LAB (CC-IX): Computer Networks

1. Simulate Cyclic Redundancy Check (CRC) error detection algorithm for noisy channel. 2. Simulate and implement stop and wait protocol for noisy channel. 3. Simulate and implement go back n sliding window protocol. 4. Simulate and implement selective repeat sliding window protocol. 5. File Sharing between computers and printer sharing. 6. Implementing the Ethernet cable connection and climping tools.


26


Core Course (C.C.) - X COMPUTER GRAPHICS

Full Marks : 100 UNIT-I Introduction to Computer Graphics: Introduction, terminologies, Component and Classification of Computer Graphics (CG). Application areas of CG. Graphics Primitives: Display, input and output devices, Image processing. UNIT-II Scan Conversion: Vector generation, Point scan conversion, Line and Circle scan conversion (DDA and Bresenham’s Algorithm). Clipping Algorithms: Point clipping, Line clipping (Cohen-sutherland Algorithm) UNIT-III 2D Transformations: Introduction, point/objects representation (metrices). Geometric, Coordinate and Composite transformation: translation, rotation, scaling. 3D Transformations: Introduction, 3D-geometry primitives. Geometric transformations: translation, scaling, rotation. UNIT-IV Illumination and Rendering: Basic Illumination Models, Displaying light Intensities, Halftone Patterns. Polygon-Rendering Methods (Gouroud Shading, Phong Shading). Animation: Introduction, types of animation, principles and types of animation system. Computer animated languages. Animation tools. GIF animator. Applications of animation. Suggested Readings :

1. Er. Rajiv Chopra, “ Computer Graphics: A practical approach”, S.Chand Technical 2. Donald Hearn& M. Pauline Baker, “Computer Graphics with OpenGL”, Pearson Education, Inc. New

Delhi. COMPUTER SCIENCE LAB (CC-X): Computer Graphics Lab

1. Write a program to implement Brenham’s line drawing algorithm. 2. Write a program to implement mid-point circle drawing algorithm. 3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm. 4. Write a program to clip a polygon using Sutherland Hodgeman algorithm. 5. Write a program to apply various 2D transformations on a 2D object (use homogenous coordinates). 6. Write a program to apply various 3D transformations on a 3D object and then apply parallel and

perspective projection on it. 7. Write a program to draw Hermite/Bezier curve.


27

3rd Year Semester – V

Core Course : COMPUTER SCIENCE Core Course (C.C.) - XI

INTERNET TECHNOLOGY Full Marks : 100

UNIT-I Java: Use of Objects, Array and ArrayList class. UNIT-II JavaScript: Data types, operators, functions, control structures, events and event handling. UNIT-III JDBC: JDBC Fundamentals, Establishing Connectivity and working with connection interface, Working with statements, Creating and Executing SQL Statements, UNIT-IV JSP: Introduction to JavaServer Pages, HTTP and Servlet Basics, The Problem with Servlets, The Anatomy of a JSP Page, JSP Processing, JSP Application Design with MVC, Setting Up the JSP Environment, Implicit JSP Objects Suggested Readings : 1.Ivan Bayross, Web Enabled Commercial Application Development Using Html, DHTML, Javascript, Perl CGI , BPB Publications, 2009. 2. Cay Horstmann, BIG Java, Wiley Publication , 3rd Edition., 2009 3. Herbert Schildt , Java 7, The Complete Reference, , 8th Edition, 2009. 4. Jim Keogh ,The Complete Reference J2EE, TMH, , 2002. 5. O'Reilly , Java Server Pages, Hans Bergsten, Third Edition, 2003.

COMPUTER SCIENCE LAB (CC-XI): Internet Technologies Create event driven program for following: 1. Print a table of numbers from 5 to 15 and their squares and cubes using alert. 2. Print the largest of three numbers. 3. Find the factorial of a number n. 4. Enter a list of positive numbers terminated by Zero. Find the sum and average of these numbers. 4. A person deposits Rs 1000 in a fixed account yielding 5% interest. Compute the amount in the account at

the end of each year for n years. 5. Read n numbers. Count the number of negative numbers, positive numbers and zeros in the list.


28

Semester – V Core Course : COMPUTER SCIENCE

Core Course (C.C.) - XII SOFTWARE ENGINEERING

Full Marks : 100 UNIT-I Professional Software Development, Software Engineering EthiCSA, Software Processes, Software Process Models, Process Activities, Coping with Change, The Rational Unified Process, Agile Software Development, Agile Methods, Plan-Driven and Agile Development, Extreme Programming, UNIT-II Requirements Engineering, Functional and Non-Functional Requirements, The Software Requirements Document, Requirements Specification, Requirements Engineering Processes, Requirements Elicitation and Analysis, Requirements Validation, Requirements Management. System Modelling, Context Models, Interaction Models, Structural Models, Behavioural Models, Model-Driven, Engineering, Architectural Design, Architectural Design Decisions, Architectural Views, Architectural Patterns, Application Architectures. UNIT-III Design and Implementation: Object-Oriented Design using the UML, Design Patterns, Implementation Issues, Open Source Development, Software Testing: Development Testing.Software Maintenance. UNIT-IV Dependability and Security Specification: Risk-Driven Requirements, Specification, Safety Specification, Reliability Specification, Security, Specification, Formal Specification. Dependability Engineering: Redundancy and Diversity, Reliability Testing, Security Testing, Process Assurance, Safety and Dependability Cases. Suggested Readings : Software Engineering, Ian Sommerville, 9/e (Pearson Education)

Software Engineering, K.K.Aggarwal and Y.Singh, New Age International Pub. COMPUTER SCIENCE LAB (CC-XII): Software Engineering S. No Practical Title 1. • Problem Statement,

• Process Model 2. Requirement Analysis:

• Creating a Data Flow • Data Dictionary, Use Cases

3. Project Management: • Computing FP • Effort • Schedule, Risk Table, Timeline chart 4. Design Engineering: • Architectural Design • Data Design, Component Level Design 5. Testing: • Basis Path Testing

Sample Projects: 1. Criminal Record Management: Implement a criminal record management system forjailers, police officers and CBI officers 2. DTC Route Information: Online information about the bus routes and their frequency andfares 3. Car Pooling: To maintain a web based intranet application that enables the corporateemployees within an organization to avail the facility of carpooling effectively. 4. Patient Appointment and Prescription Management System 5. Organized Retail Shopping Management Software 6. Online Hotel Reservation Service System 7. Examination and Result computation system 8. Automatic Internal Assessment System

29

9. Parking Allocation System 10. Wholesale Management System


30

Semester – VI Core Course : COMPUTER SCIENCE

Core Course (C.C.) - XIII ARTIFICIAL INTELLIGENCE (AI)

Full Marks : 100 UNIT-I AI Introduction: Introduction, scope. AI techniques. Characteristics of AI problems.Intelligent Agents. AI Approaches: Searching techniques: BFS, DFS, A* algorithm, Adversarial search(Alpha-beta pruning). UNIT-II Knowledge Representation:Propositional and predicate logic, its resolutions. First order logic, Inference in first order logic (Forward chaining, backward chaining). Structured Knowledge Representation: Semantic Nets, Slots, Frames, CD and Conceptual graphs, Scripts. UNIT-III Reasoning: Probabilistic (Bayesian Belief Network), Fuzzy logic reasoning. UNIT-IV Learning:Learning from Observations, Decision trees, Neural network (Multilayer), Reinforcement Learning. Suggested Readings :

1. Er. Rajiv Chopra, “Artificial Intelligence: A practical approach”, S.Chand Pub. 2. Stuart Russell and Peter Norvig, “ARTIFICIAL INTELLIGENCE A MODERN APPROACH” 2/e

COMPUTER SCIENCE LAB (CC-XIII): Artificial Intelligence Lab 1. Write a prolog program to calculate the sum of two numbers. 2. Write a prolog program to find the maximum of two numbers. 3. Write a prolog program to calculate the factorial of a given number. 4. Write a prolog program to calculate the nth Fibonacci number. 5. Write a prolog program, insert_nth(item, n, into_list, result) that asserts that result is the list into_list with

item inserted as the n‘th element into every list at all levels. 6. Write a Prolog program to remove the Nth item from a list. 7. Write a Prolog program, remove-nth(Before, After) that asserts the After list is the Before list with the

removal of every n‘th item from every list at all levels. 8. Write a Prolog program to implement append for two lists. 9. Write a Prolog program to implement palindrome(List). 10. Write a Prolog program to implement max(X,Y,Max) so that Max is the greater of two numbers X and Y. 11. Write a Prolog program to implement maxlist(List,Max) so that Max is the greatest number in the list of

numbers List. 12. Write a Prolog program to implement sumlist(List,Sum) so that Sum is the sum of a given list of numbers List. 13. Write a Prolog program to implement two predicates evenlength(List) and oddlength(List) so that they are

true if their argument is a list of even or odd length respectively. 14. Write a Prolog program to implement reverse(List,ReversedList) that reverses lists. 15. Write a Prolog program to implement maxlist(List,Max) so that Max is the greatest number in the list of

numbers List using cut predicate. 16. Write a Prolog program to implement GCD of two numbers. 17. Write a prolog program that implements Semantic Networks/Frame Structures.


31

Semester – VI Core Course : COMPUTER SCIENCE

Core Course (C.C.) - XIV DESIGN AND ANALYSIS OF ALGORITHMS

Full Marks : 100

UNIT-I Analysis and Design of Algorithm: Complexity Analysis of Algorithm, Amortized analysis and Recurrences. Analysis of Algorithm (Case study on insertion sort), Design of Algorithm: incremental approach (Case study on selection sort), divide and conquer approach (Case study on merge sort). UNIT-II Sorting: Quick sort, heap sort, Randomized quicksort, Order Statistics.Red black tree, hashing, 2-3-4 tree. Divide and Conquer: merge sort. Dynamic programming: Knapsack problem (simple and using dynamic programming approach). UNIT-III Greedy Algorithm:Fractional knapsack and Travelling Salesperson problem. Backtracking: Subset-Sum problem.Branch and Bound: The Assignment problem. UNIT-IV Graphs: Directed, undirected, regular, complete, bipartite sub graphs and graph Isomorphism. Kruskal’s minimum spanning tree and Dijkstra’s shortest path problem. Complexity Class: P, PSPACE, NP, NP-Hard, NP Complete. Suggested Readings :

1. Fundamentals of Computer Algorithms: E. Horowitz and S.Sahni 2. Introduction To Algorithm: Corman Leisenm, Rives &Stein 3. The Design and Analysis of Algorithms: Nitin Upadhyay

COMPUTER SCIENCE LAB (CC-XIV): Design and Analysis of Algorithms 1. i. Implement Insertion Sort (The program should report the number of comparisons)

ii. Implement Merge Sort(The program should report the number of comparisons) 2. Implement Heap Sort(The program should report the number of comparisons) 3. Implement Randomized Quick sort (The program should report the number of comparisons) 4. Implement Radix Sort 5. Create a Red-Black Tree and perform following operations on it:

i. Insert a node ii. Delete a node iii. Search for a number & also report the color of the node containing this number.

6. Write a program to determine the LCS of two given sequences 7. Implement Breadth-First Search in a graph 8. Implement Depth-First Search in a graph 9. Write a program to determine the minimum spanning tree of a graph 10. For the algorithms at S.No 1 to 3 test run the algorithm on 100 different inputs of sizes varying from 30 to

1000. Count the number of comparisons and draw the graph. Compare it with a graph of nlogn.


32

3rd Year Semester – V

COMPUTER SCIENCE DSE- I

INFORMATION SECURITY (Paper-I)

Full Marks : 100 UNIT-I Introduction:Network and Information Security, Security, Attacks, Computer Criminals, Security Services. Ethical Hacking. Cyber-crime and terrorism. Cryptography:Substitution ciphers, Symmetric, Asymmetric Encryption. DES Modes of DES, Uses of Encryption, Hash function, key exchange, Digital Signatures, Digital Certificates. UNIT-II Program Security: Secure programs, Non malicious Program errors, Malicious codes virus UNIT-III Threats: Protection in OS: Memory and Address Protection, Access control, File Protection, User Authentication. UNIT-IV Administrating Security: Security Planning, Risk Analysis, Organisational Security Policy, Ethical issues in Security: Protecting Programs and data. Information and law. Suggested Readings : 1. C. P. Pfleeger, S. L. Pfleeger; Security in Computing, PHI, 2006 2. W. Stallings; Network Security Essentials: Applications and Standards, 4/E, 2010


33

Semester – V COMPUTER SCIENCE

DSE- II DIGITAL IMAGE PROCESSING

(Paper-II) Full Marks : 100

UNIT-I Introduction Light, Brightness adaption and discrimination, Pixels, coordinate conventions, Imaging Geometry, Perspective Projection, Spatial Domain Filtering, sampling and quantization. UNIT-II Spatial Domain Filtering Intensity transformations, contrast stretching, histogram equalization, Correlation and convolution, Smoothing filters, sharpening filters, gradient and Laplacian. UNIT-III Filtering in the Frequency domain Fourier Transforms and properties, FFT (Decimation in Frequency and Decimation in Time Techniques), Convolution, Correlation, 2-D sampling, Discrete Cosine Transform, Frequency domain filtering. Image Restoration Basic Framework, Interactive Restoration, Image deformation and geometric transformations, Restoration techniques, Noise characterization, Noise restoration filters, Adaptive filters. UNIT-IV Image Compression Encoder-Decoder model, Types of redundancies, Lossy and Lossless compression, Entropy of an information source, Shannon's 1st Theorem, Huffman Coding, Arithmetic Coding, LZW coding. Image Segmentation Boundary detection based techniques, Point, line detection, Edge detection.Region-based segmentation, Watershed algorithm. Suggested Readings :

1. R C Gonzalez, R E Woods, Digital Image Processing, 3rd Edition, Pearson Education.2008. 2. A K Jain, Fundamentals of Digital image Processing, Prentice Hall of India.1989. 3. K R Castleman, Digital Image Processing, Pearson Education.1996 4. Schalkoff, Digital Image Processing and Computer Vision, John Wiley and Sons.1989. 5. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,' Digital Image Processing using MATLAB',

Pearson Education, Inc., 2004.


34

3rd Year Semester – VI

COMPUTER SCIENCE DSE- III

CLOUD COMPUTING Paper – III

Full Marks : 100

UNIT-I Overview of Computing Paradigm: Recent trends in Computing: Grid Computing, Cluster computing, and Distributed Computing. Introduction to Cloud Computing:Introduction to Cloud Computing, History of Cloud Computing, Cloud service providers, Benefits and limitations of Cloud Computing. UNIT-II Cloud Computing Architecture:Comparison with traditional computing architecture (client/server), Services provided at various levels, Service Models- Infrastructure as a Service (IaaS), Platform as a Service (PaaS), Software as a Service (SaaS), and How Cloud Computing Works. UNIT-III Case Studies: Case Study of Service, Model using Amazon EC2. UNIT-IV Service Management in Cloud Computing: Traditional vs. Cloud, Data security and Storage- Data privacy and security Issues. Suggested Readings :

1. Cloud Computing: Dr. U.S.Pandey and Dr. K.Choudhary; S.Chand Pub. 2. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010.


35

Semester – VI COMPUTER SCIENCE

DSE- IV

PROJECT Full Marks : 100

Dissertation 60 Marks Presentation 20 Marks Viva 20 Marks

36

GENERIC ELECTIVE A Student has to choose two Generic Elective (G.E.) Subjects

other than the Core Course

37

CHEMISTRY

PAPER – I CHEMISTRY – I Theory : 60 Lecturers

Full Marks : 100

Unit - I (A) Atomic Structure: Bohr's Theory, Sommerfelds Model of atom, de-broglie's concept of matter wave. Helsenbergs uncertainity principle. Concept of orbital. Shape of S,P,D & F orbital. Quantam number and its significance. Rules for filling electron in different orbitals electronic configuration of atoms. Stability of half filled and fully filled subshell. Concept of exchange energy. Relative energy of atomic. Unit - I (B) Modern perodic table: Classification of elements into S,P,D & F blocks. Atomic Size (Covalent radii, ionic radii and vander waals radii) lonisation enthalpy, elecron affinity and electronegativity as periodic properties.

(15 Lecturers) Unit - II (A) Ionic bonding, energy consideration, lattice energy and solvation energy. Born Haber cycle and estimation of lattice energy. Valence bond approach, Hybridisation of atomic orbitals SP, SP2 & SP3 hybridisation. VSEPR theory to predict shape of cavalent molecules. Molecular orbital theory, Bonding and antibonding MO's application to simple diatomic molecules of H,O,N & F. Unit - II (B) Co-ordination chemistry : Isomerism, EAN Rule, Werner's theory, Valence bond approach and crystal field theory for octahedral and tetrahedral complex. (15 Lecturers) Unit - III (A) Kinetic theory of gases, expression for pressure, Derivation of gas laws (Boy)'s law. Charl's law, Avogadro's law, Dalton's law of partial pressure and grahm's of diffusion). Maxwell Boltzman distribution of molecular speed root mean square speed and most probable speed semple calculations. Unit - III (B) First law of thermodynamics enthalpy and enthalpy change, laws of thermochemistry, semple calculations second law of thermodynamics and entropy. Concept of free energy, Gibbs Helmholtz equation and its significance.

(15 Lecturers) Unit - IV (A) Reversible reaction, chemical equilibrium. Equilibrium constant, Le-chatliers principle & its applications in haber's method of synthesis of ammonia. Ionic equilibrium. Theories of acid and base, pH scale, common ion effect. solubility product. Buffer solution, Hydrolysis of salt. Unit - IV (B) Phase equilibra : Phase, degrees of freedom and components. Phase rule. Phase diagram of water and sulphur system. Distribution law, Nernst's distribution law and application to solvent extraction. Dilute solution and colligative properties. Lawering of vapaur pressure, Elevation of boiling point, Depression of freezing point and osmotic pressure as colligative properties. Abnormal Colligative properties and vant Hoff factor.

(15 Lecturers) PRACTICAL Generic Elective - I 1. Estimation of sodium corbonate and sodium hydrogen carbonate present in a mixture. 2. Estimation of oxalic acid by titrating with KmnO4

3. Estimation of fe(II) ions by titrating with K2Cr2O7

4. Estimation of Cu(II)ion iodometrically using Na2S2O3


38

CHEMISTRY

PAPER – II CHEMISTRY-II

Theory : 60 Lecturers Full Marks : 100

Unit-I Structure and Bonding in Organic molecules: Concept of hybridization and application to explain structure and bonding in organic molecules. Distribution of electrons in organic molecules, Inductive Effect, Resonance and Hyper conjugation. Organic Reaction Mechanism. Homolysis and heterolysis. Generation ,Structure, Stability and Reactions of Carbocation, Carbanion, and Carbon free radicals. Attacking agents: Electrophile, Nucleophile and Free radicals. SN

1, SN2,E1,E2AdE and, Ad N reactions with suitable examples. (15 Lecturers)

Unit-II Aliphatic hydrocarbons: Preperation of alkanes, alkenes and alkynes.Saytzeff and Hoffman elimination. Maronokoffs addition. Cis- trans isomerism in alkenes, Acidic properties of acetylene. Cycloalkanes. Preperation and Properties. Relative stability of cycloalkanes and Bayers strain theory. Preperation of Cycloalkenes. Aromaticity. Structure and bonding in benzene. Electrophilic substitution reaction in benzene.

(15 Lecturers) Unit-III Alkylhalides ,preparation and properties .Chlorination of Benzene.lnertness of halogen atom of Chlorobenzene towards SNreaction. Preperation and properties of alcohol. Distinction between primery secondary and tertiary alcohol. Preperation of Phenol and acidic character. Reimer Tiemann Reaction. Preperation and properties of aliphatic and aromatic carbonyl compounds. Benzoin condensation, Aldol condensation, and Cannizzaro reaction.

(15 Lecturers) Unit-IV Carboxylic acid: Preparation and properties(Aliphatic and Aromatic) .Benzoic acid . Effect of substitution on acid strength. Active methylene compounds. Preperation and synthetic applications of Aceto acetic ester. Amines. Preperation and properties (Aliphatic and aromatic ). Basic properties of different types of amines. Seperation of Primery , secondary and tertiary amines. Diazonium salt . Preparation and synthetic applications.

(15 Lecturers) GENERICELECTIVECHEMISTRY-II(LAB) Qualitative analysis of organic compounds: Test for Unsaturation, Aromatic character, Element Detection and functional group and determination of melting point / boiling point. Suggested Readings : • Garland, C. W.; Nibler, J. W. & Shoemaker, D. P. Experiments in Physical Chemistry 8th Ed.; McGraw-Hill: New York (2003). • Halpern, A. M. & McBane, G. C. Experimental Physical Chemistry 3rd Ed.; W.H. Freeman & Co.: New York (2003).


39

MATHEMATICS

PAPER – I CALCULUS AND ORDINARY DIFFERENTIAL EQUATIONS

Full Marks : 100 Unit-I Curvature, Asymptotes, Tracing of Curves (Cartenary, Cycloid, Folium of Descartes, Astroid, Limacon, Cissoid & loops), Rectification, Quardrature, Volume and Surface area of solids of revolution. Unit-II Explicit and Implicit functions, Limit and Continuity of functions of several variables, Partial derivatives, Partial derivatives of higher orders, Homogeneous functions, Change of variables, Mean value theorem, Taylors theorem and Maclaurins theorem for functions of two variables. Maxima and Minima of functions of two and three variables, Implicit functions, Lagranges multipliers. Multiple integrals. Unit-III Ordinary Differential Equations of Ist order and Ist degree (Variables separable, homogenous, exact and linear). Equations of 1st order but higher degree. Unit-IV Second order linear equations with constant coefficients, homogeneous forms, Second order equations with ariable coefficients, Variation of parameters. Laplace transforms and its applications to solutions of differential equations. Suggested Readings : 1. Shantinarayan-Text Book of Calculus, Part-II, S. Chand and Co., Chapter-8 (Art. 24,25,26) 2. Shantinarayan-Text Book of Calculus, Part-III, S. Chand and Co., Chapter-l (Art 1,2),3, 4(Art. 10 to 12 ommitting Simpsons Rule), 5(Art-13) and 6(Art-15). 3. Santosh K. Sengar-Advanced Calculus, Chapters: 2,4,5,6, 7, II,12,13. 4. J. Sinharoy and S. Padhy-A Course of Ordinary and Partial Differential Equations, Kalyani Publishers. Chapters: 2(2.1 to 2.7).3,4(4.1 to 4.7),5,9 (9.1, 9.2, 9.3, 9.4, 9.5, 9.10, 9.11, 9.13). Books for References: 1. Shanti Narayan and P.K. Mittal-Analytical Solid Geometry, S. Chand & Company Pvt Ltd., New Delhi. 2. David V. Weider-Advanced Calculus, Dover Publications. 3. Martin Braun-Differential Equations and their Applications-Martin Braun, Springer International. 4. M.D. Raisinghania-Advanced Differential Equations, S. Chand & Company ltd., New Delhi G. Dennis Zill-A First Course In Differential Equations with Modelling Applications, Cengage Learning India Pvt. Ltd.


40

MATHEMATICS

PAPER – II LINEAR ALGEBRA AND ADVANCED ALGEBRA

Full Marks : 100 Unit-I Vector space, Subspace, Span of a set, Linear dependence and Independence, Dimensions and Basis. Near transformations, Range, Kernel, Rank, Nullity, Inverse of a linear map, Rank-Nullity theorem. Unit-II Matrices and linear maps, Rank and Nullity of a matrix, Transpose of a matrix, Types of matrices. Elementary row operations, System of linear equations, Matrix inversion using row operations, Determinant .d Rank of matrices, Eigen values, Eigen vectors, Quadratic forms. Unit-III Group Theory: Definition and examples, Subgroups, Normal subgroups, Cyclic groups, Cosets, Quotient groups, Permutation groups, Homomorphism. Unit-IV Ring Theory: Definition and examples, Some special classes of Rings, Ideals, Quotient rings, Ring homomorphism. Isomorphism theorems. Zero divisions integral domain. Suggested Readings : 1. V Krishnarnurty, V I) Maima, J L Arora-An introduction to Linear Algebra, Affiliated East-West Pless Pvt. Ltd, New Delhi, Chapters: 3, 4(41 to 47), 5(except 53).6(61,62,6.5,66,68), 7(74 only) 2. I.N. Henstrain-Topics in Algebra. Prentice Hall of India Pvt. Ltd, New Delhi. Chapters 13, 14, 15, 16, 17, 18, 19,20 Books for Rofercnces: 1 S Kumaresan-Linear Algebra: A Geometric Approach, Prentice Hall of India. 2 Rao and Bhimasankaran-Linear Algebra, Hindustan Publishing House. 3. S Singh-Linear Algebra, Vikas Publishing House Pvt. Ltd, New Delhi 4. Gilbert Strang-Linear Algebra & its Applications, Cengage Learning lndia Pvt. Ltd 5 I.N. Herstein-Topics in Algebra. Wiley Eastern Pvt Ltd 6 Gallian-Conteruporary Abstract Algebra, Narosa publishing House 7. Artill-Algebra. Prentice Hall of India. 8 V.K. Khanna and 5 K. Bhambri-A Course in Abstract Algebra, Vikas Publishing House Pvt. Ltd, New Delhi


41

PHYSICS PAPER – I

MECHANICS AND ELECTROMAGNETISM Full Marks : 100

UNIT-I: Gravitation, Rotational motion and Oscillation Rotational Motion: Angular velocity and angular momentum. Torque.Conservationof angular momentum. Gravitation: Newton's Law of Gravitation. Motion of a particle in a central forcefield (motion is in a plane, angular momentum is conserved, areal velocity isconstant). Kepler's Laws (statement only).Satellite in circular orbit and applications. Geosynchronous orbits. Basic idea of global positioning system (GPS).Weightlessness.Oscillations: Simple harmonic motion. Differential equation of SHM and itssolutions. Kinetic and Potential Energy, Total Energy and their time averages. UNIT-II: Elasticity and Special Theory of Relativity Elasticity: Hooke's law - Stress-strain diagram, Elastic moduli, Relation between elastic constants - Poisson's Ratio-Expression for Poisson's ratio in terms of elastic constants - Work done in stretching and work done in twisting a wire, Twisting couple on a cylinder ,Determination of Rigidity modulus by static torsion, Torsional pendulum ,Determination of Rigidity modulus and moment of inertia by Searle's method. Special Theory of Relativity: Constancy of speed of light. Postulates of Special Theory of Relativity. Lorentz Transformation, Length contraction .Time dilation. UNIT-III: Vector analysis and Electrostatics Vector Analysis: Review of vector algebra (Scalar and Vector product), gradient,divergence, Curl and their significance, ector Integration, Line, surface and volumeintegrals of Vector fields, Gauss-divergence theorem and Stoke's theorem of vectors(statement only).Electrostatics: Electrostatic Field, electric flux, Gauss's theorem of electrostatics.Applications of Gauss theorem- Electric field due to point charge, infinite line ofcharge, plane charged sheet,charged conductor. Electric potential as line integral of electric field, potential due t~a point charge, electric dipole, uniformly charged spherical shell and solid sphere. Calculation of electric field from potential.Capacitance of an isolateds sphericalconductor. Parallel plate, spherical and cylindrical condenser with and without dielectric. Energy per unit volumejn electrostatic field. Dielectric medium, Polarisation, Displacement vector.Gauss'stheorem in dielectrics. UNIT-IV: Magnetism and Electromagnetic Induction: Biot-Savart's law and its applications- straight conductor, circularcoil, solenoid carrying current. Divergence and curl of magnetic field.Magneticvector potential.Ampere's circuital law. Application to straight wire and solenoids, Magnetic properties of materials: Magnetic intensity, magnetic induction; Permeability, magnetic susceptibility and relation between them. Electromagnetic Induction: Faraday's laws of electromagnetic induction, Lenz'slaw, self and mutual inductance, L of single coil, M of two coils. Energy stored il!.ffiagnetic field. Suggested Readings : 1. University Physics. F.W. Sears, M.W. Zemansky and H.D. Young, 13/e, 1986.Addison-esley 2. Mechanics Berkeley Physics, v.1: Charles Kittel, et. al. 2007, Tata McGraw-Hill. 3. Physics - Resnick, Halliday& Walker 9/e, 2010, Wiley 4. Engineering Mechanics, Basudeb Bhattacharya, 2 ndedn., 2015, OxfordUniversity Press. 5. Electricity and Magnetism, Edward M. Purcell, 1986, McGraw-Hill Education 6.Electricity & Magnetism, J.H. Fewkes&J.Yarwood.Vol. 1,1991, Oxford Univ. Press 7.Electricity and Magnetism, D C Tayal, 1988, Himalaya Publishing House. University Physics, Ronald Lane Reese, 2003, Thomson Brooks/Cole. 9.DJ .Griffiths, Introduction to Electrodynamics, 3rd Edn, 1998, Benjamin Cummings. PRACTICAL MECHANICS and ELECTROMAGNETISM 1. Measurements oflength (or diameter) using vernier caliper, screw gauge andtravelling microscope. 2. To determine the Height of a Building using a Sextant. 3. To determine the Elastic Constants of a Wire by Searle's method. 4. To determine g by Bar Pendulum. 5. To determine g by Kater's Pendulum 6.To use a Multimeter for measuring (a) Resistances, (b) AC and DC Voltages,(c) DC Current, and (d) checking electrical fuses.7.To determine a Low Resistance by Carey Foster's Bridge. Reference Books:

42

1. Advanced Practical Physics for students, B.L. Flint and H.T. Worsnop, 1971,Asia Publishing House. 2. Advanced level Physics Practicals, Michael Nelson and Jon M. Ogborn, 4 thEdition, reprinted 1985, Heinemann Educational Publishers. 3.Engineering Practical Physics, S.Panigrahi& B.Mallick,201S, CengageLearning India Pvt. Ltd. 4. A Text Book of Practical Physics, InduPrakash and Ramakrishna, 11 thEdition, 2011, KitabMahal, ew Delhi.


43

PHYSICS PAPER – II

MODERN PHYSICS AND OPTICS Full Marks : 100

(Credits: Theory-04, Practicals-02) UNIT-I: Thermodynamics and thermodynamic potentials Laws of Thermodynamics: Thermodynamic Description of system: Zeroth Law of thermodynamics and temperature. First law and internal energy, conversion of heat into work, Various Thermo dynamical Processes, Applications of First Law: General Relation between C, and Cv, Work Done during Isothermal and Adiabatic Processes Compressibility and Expansion Coefficient, Reversible and irreversible processes, Second law and Entropy, Carnot's cycle & theorem, Entropy changes in reversible & irreversible processes, Entropy-temperature diagrams, Third law of thermodynamics, Thermodynamical Potentials: Enthalpy, Gibbs, Helmholtz and Internal Energy functions, Maxwell's relations and applications - Joule-Thompson Effect, Clausius- Clapeyron Equation, Expression for (C, - C v), C p ICv , TdS equations. UNIT-II: Wave optics, interference, diffraction and polarization Wave Optics: Electromagnetic nature of light. Definition and Properties of wave front. Huygens Principle. Interference: Division of amplitude and division of wavefront. Young's Double Slit experiment. Lloyd's Mirror and Fresnel's Biprism.: Stokes' treatment Phase change on reflection. Interference in Thin Films: parallel and wedge-shaped films. Fringes of equal inclination (Haidinger Fringes); Fringes of equal thickness (Fizeau Fringes). Newton's Rings: measurement of wavelength and refractive index Diffraction: Fraunhofer diffraction- Single slit; Double Slit. Multiple slits and Diffraction grating. Fresnel Diffraction: Half-period zones. Zone plate. Fresnel Diffraction pattern of a straight edge, a single slit and a wire using half-period zone analysis. Polarization: Transverse nature oflight waves. Plane polarized light - production and analysis. Circular and elliptical polarization. UNIT-III: Modern physics Planck's quantum theory, Planck's constant and light as a collection of photons; Photo- electric effect and Compton scattering. De Broglie wavelength and matter waves; Davisson-Germer experiment. Problems with Rutherford model- instability of atoms and observation of discrete atomic spectra; Bohr's quantization rule and atomic stability; calculation of energy levels for hydrogen like atoms and their spectra. Wave-particle duality, Heisenberg uncertainty principlegamma ray microscope; Estimating minimum energy of a confined particle using uncertainty principle; Energy-time uncertainty principle. Two slit interference experiment with photons, atoms & particles; linear superposition principle as a consequence; Matter waves and wave amplitude. UNIT-IV: Solid state physics Crystal Structure of Solids: Amorphous and Crystalline Materials. Lattice Translation Vectors. Lattice with a Basis - Central and Non-Central Elements. Unit Cell. Miller Indices. Reciprocal Lattice. Types of Lattices. Brillouin Zones. Diffraction of X-rays by Crystals. Bragg's Law. Elementary band theory:Band Gaps. Conductors, Semiconductors and insulators. P and N type Semiconductors. Conductivity of Semiconductors, mobility, Hall Effect, Hall coefficient. LAB -II: MODERN PHYSICS and OPTICS (Credits: Practicals-02) 1. To determine the Frequency of an Electrically Maintained Tuning Fork byMelde's Experiment 2. To determine the Refractive Index of the Material ofa Prism using Sodium Light. 3. To determine Dispersive Power of the Material of a Prism using Mercury Light. 4. To determine the value of Cauchy Constants. 5. To determine the Resolving Power of a Prism. 6. To determine wavelength of sodium light using Fresnel Biprism. 7. To determine wavelength of sodium light using Newton's Rings. 8. To determine Mechanical Equivalent of Heat. Suggested Readings : 1. Thermal Physics, S. Garg, R. Bansal and C. Ghosh, 1993, Tata McGraw-Hill. 2. Heat and Thermodynamics, M.W.Zemasky and R. Dittman, 1981, McGraw Hill. 3. Thermodynamics, Kinetic theory & Statistical thermodynamics, F.W.Sears and G.L. Salinger. 1988, Narosa. 4. Thermal Physics, A. Kumar and S.P. Taneja, 2014, R. chand Publications.

44

5.Fundamentals of Optics, F.A Jenkins and H.E White, 1976, McGraw-Hill 6. Principles of Optics, B.K. Mathur, 1995, Gopal Printing 7. Fundamentals of Optics, H.R. Gulati and D.R. Khanna, 1991, R. Chand Publications 8. University Physics. F.W. Sears, M.W. Zemansky and H.D. Young. 13/e, 1986.Addison-Wesley 9. Concepts of Modem Physics, Arthur Beiser, 2009, McGraw-Hill 10. Introduction to Solid State Physics, Charles Kittel, 8 th Ed., 2004, Wiley India Pvt. Ltd. 11. Elements of Solid State Physics, J.P. Srivastava, 2 nd Ed., 2006, Prentice-Hall oflndia 12.0ptics, B.S.Agarwal, Kedamath-Ramnath publications


of bachelor degree science - vikram deb autonomous college · of bachelor degree science cbcs...

Documents