Page History

HGHER SECONDARY EXAMINATION CERTIFICATE for Mohallick Itishree

TOTAL CUMULATIVE CREDITS 204

CLASS DESCRIPTIONS

BECS22O7 Object Oriented Programming,

Module I (08 hrs): lntroduction to object oriented programming, uset defined types, structures, unions, polymorphism, encapsulation. Getting started with C++ syntax, data-type, variables, strings, functions, default values in functions, recursion, namespaces, operators, flow control, arrays and pointers.
Module ll (l6hrs): Abstraction mechanism: Classes, private, public, constructors, destructors, member data, member functions, inline function, friend functions, static members, and references. lnheritance: Ciass hierarchy, derived classes, single inheritance, multiple, multilevel, hybrid inheritance, role of virtual base ciass, constructor and destructor execution, base initialization using derived ciass constructors. Polymorphism: Binding, Static binding, Dynamic binding, Static polymorphism: Function Overloading, Ambiguity in function overloading, Dynamic polymorphism: Base ciass pointer, object slicing, late binding, method overriding with virtual functions, pure virtual functions, abstract ciasses. Operator Overloading: This pointer, applications of this pointer, Operator function, member and non member operator function, operator overloading, 1/0 operators. Exception handling: Try, throw, and catch, exceptions and derived ciasses, function exception deciaration, unexpected exceptions, exception when handling exceptions, resource capture and release.
Module III (16 hrs): Dynamic memory management, new and delete operators, object copying, copy constructor, assignment operator, virtual destructor. Template: template ciasses, template functions. Standard Template Library: Fundamental idea about string, iterators, hashes, iostreams and other types. Namespaces: user defined namespaces, namespaces provided by library. Object Oriented Design, design and programming, role of ciasses.
Text Books: 1. Object Oriented Programming with C++ by E. Balagurusamy, McGraw-HiII Education (India) 2. ANSI and Turbo C÷+ by Ashoke N. Kamthane, Pearson Education

PCES42O1 Analog Electronics Circuit

MODULE - 1(12 Hours) 1. MOS Ficld-Effcct Transistor: Principlc and Physical Operation of FETs and MOSFETs. P-Channel and N-Channel MOSFET, Complimentary MOS, V-I Characteristics of E- MOSFETS and D-MOSFETS, MOSFETS as an Amplifier and a Switch (4 Hours)
2. Biasing of BJTs: Load lines (AC and DC), Operating Points, Fixcd Bias and Seif Bias, DC Bias with Voltage Feedback, Bias Stabilization, Design Operaticrn. (4 Hours) 
3. Biasing of FETs and MOSFETs: Fixed Bias Configuration and Seif Bias Coniguration, Voltage Divider Bias and Design (4 Hours)
MODULE — II (17 Hours). 4. Small Signal Analysis of BJTs: Small-Signal Equivalent-Circuit Model, Graphical Determination of h-parameters Smal! Signal Analysis of CE, CC, C13 Amplifier wilh and without Ri:. Effect of R5 and RL on CE Amplifier, Emifter Fol!ower, Analysis of

PCCS43O4 OPERATING SYSTEM (3-0-0)

MODULE-I 12 Hours
INTRODUCTION TO OPERATING SYSTEM: What is an Operating System? Simple Batch Systems, Multiprogramming and Time Sharing systems. Personal Computer Systems, Parallel Systems, Distributed Systems and Real time Systems. Operating System Structures: Operating System Services, System components, Protection system, Operating System Services, system calls PROCESS MANAGEMENT: Process Concept, Process Scheduling, Operation on Processes, lnterprocess communication, Examples of IPC Systems, Multithreading Models, Threading Issues, Process Scheduling Basic concepts, scheduling criteria, scheduling algorithms, Thread Scheduling.

MODULE-Il 12 Hours
PROCESS COORDINATION: Synchronization: The Critical section problem, Peterson’s solution, Synchronization hardware, Semaphores, Classical problems of synchronization, Monitors. Deadlocks: System model, Deadlock Characterization Methods for Handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, recovery from Deadlock. MEMORY MANAGEMENT: Memory Management strategies, Logical versus Physical Address space, swapping, contiguous Allocation, Paging, Segmentation. Virtual Memory: Background, Demand paging, performance of Demand paging, Page Replacement, Page Replacement Algorithms. Allocation of frames, Thrashing, Demand Segmentation.

MODULE-Ill 11 Hours
STORAGE MANAGEMENT: File System Concept, Access Methods, File System Structure, File System Structure, File System Implementation, Directory implementation, Efficiency and Performance, Recovery, Overview of Mass Storage Structure, Disk Structure, Disk Scheduling, Disk Management, Swap-Space Management, 1/0 System Overview, 1/0 Hardware, Application 1/0 Interface, Kernel 110 Subsystem, Transforming 1/0 Request to Hardware Operation.
CASE STUDIES: Ihe LINUX System, Windows XP, Windows Vista 

TEXT BOOK: 1. Operating System Concepts — Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 8t[edition, Wiley-India, 2009. 2. Mordern Operating Systems — Andrew S. Tanenbaum, 3td Edition, PHI. 3. Operating Systems: A Spiral Approach — Elmasri, Carrick, Levine, TMH Edition

COMPUTER GRAPHICS

Module — I (10 hours)
Overview of Graphics System: Video Display Units, Raster-Scan and Random Scan Systems, Graphics lnput and Output Devices. Output Primitives: Line drawing Algorithms: DDA and Bresenham’s Line Algorithm,  Circle drawing Algorithms: Midpoint Circle Algorithm and Bresenham’s Circle drawing Algorithm. Two Dimensional Geometric Transformation: Basic Transformation (Translation, rotation, Scaling) Matrix Representation, Composite Transformations, Reflection, Shear, Transformation between coordinate systems. Two Dimensional Viewing: Window-to- View port Coordinate Transformation.

Module — II (12 hours)
Line Clipping (Cohen-Sutherland Algorithm) and Polygon Clipping (Sutherland Hodgeman Algorithm). Aliasing and Antialiasing, Half toning, Thresholding and Dithering, Scan conversion of Character. Polygon Filling: Seed Fill Algorithm, Scan line Algorithm. Two Dimensional Object Representation: Spline Representation, Beziet Curves and B Spline Curves. Fractal Geometry: Fractal Classification and Fractal Dimensjon. Three Dimensional Geometric and Modeling Transformations: Translation Rotation, Scaling, Reflections, shear, Composite Transformation. Projections: Parallel Projection and Perspective Projection.

Module — III (8 hours)
Visible Surface Detection Methods: Back-face Detection, Depth Buffer, A- Buffer, Scan line Algorithm and Painters Algorithm. Illumination Models: Basic Models, Displaying Light Intensities. Surface Rendering Methods: Polygon Rendering Methods: Gouraud Shading and Phong Shading. Computer Animation: Types of Animation, Key frame Vs. Procedural Animation, methods of controlling Animation, Morphing. Virtual Reality: Types of Virtual reality systems, Input and Output Virtual Reality devices.

Textbook 1. Computer Graphics with Virtual Reality System, Rajesh K.Maurya, Wiley Dreamtech. 2. Computer Graphics, D. Hearn and M.P. Baker (C Versjon), Pearson Education

PCCS43O2 DATA COMMUNICATION & COMPUTER NETWORKS (3-0-0)

ModuIe—I l2Hrs Overview of Data Communications and Networking. Physical Layer : Analog and Digital, Analog Signals, Digital Signals, Analog versus Digital, Data Rate Limits, Transmission Impairment, Mote about signals. Digital Transmission: Line coding, Block coding, Sampling, Transmission mode. Analog Transmission: Modulation of Digital Data; Telephone modems, modulation of Analog signals. Multiplexing : FDM , WDM , TDM, Transmission Media: Guided Media, Unguided media (wireless) Citcuit switching and Telephone Network: Citcuit switching, Telephone network. 

Module—Il (2 Hours) Data Link Layer Ettot Detection and correction: Types of Errors, Detection, Ertot Correction Data Link Control and Protocols: Flow and Error Control, Stop-and-wait ARQ. Go-Back-N ARQ, Selective Repeat ARQ, HDLC. Point-to — Point Access: PPP Point — to- Point Protocol, PPP Stack, Multiple Access Random Access, Controlled Access, Channelization. Local atea Network: Ethernet. Traditional Ethernet, Fast Ethernet, Gigabit Ethetnet. Token bus, token ring Wireless LANs: IEEE 802.11, Bluetooth virtual circuits: Frame Relay and ATM. 

Module — III 12 Hrs Network Layer: Host to Host Delivery: Internetworking, addressing and Routing Network Layer Protocols: ARP, IPV4, ICMP, IPV6 ad ICMPV6 Transport Layer: Process to Process Delivery: UDP; TCP congestion control and Quality of service. Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS): Electronic Mail (SMTP) and file transfer (FTP) HTTP and WWW.
Text Books: 1. Data Communications and Networking: Behrouz A. Forouzan, Tata McGraw-Hill, 4111 Ed. 2. Computer Networks: A. S. Tannenbum, D. Wetherall, Prentice Hall, Imprint of Pearson h1 Ed

PCCS42O3 Design and Analysis of Algorithm

Module- I (12 Hours) lntroduction to design and analysis of algorithms, Growth of Functions (Asymptotic notations, standard notations and common functions), Recurrences, solution of recurrences by substitution, recursion tree and Master methods, worst case analysis of Merge sort, Quick sort and Binary search, Design & Analysis of Divide and conquer algorithms. Heapsort : Heaps, Building a heap, The heapsort algorithm, Priority Queue, Lower bounds for sorting.

Module — II (16 Hours) Dynamic programming algorithms (Matrix-chain multiplication, Elements of dynamic programming, Longest common subsequence) Greedy Algorithms - (Assembly-line scheduling, Achivity- selection Problem, Elements of Greedy strategy, Fractional knapsac problem, Huffman codes). Data structure for disjoint sets:- Disjoint set operations, Linked list representation, Disjoint set forests.

Module — III (12 Hours) Graph Algorithms: Breadth first and depth-first search, Minimum Spanning Trees, Kruskal and Prim’s algorithms, single- source shortest paths (Bellman-ford and Dijkstra’s algorithms), All pairs shortest paths (Floyd — Warshall Algorithm). Back tracking, Branch and Bound. Fast Fourier Transform, string matching (Rabin-Karp algorithm), NP - Completeness (Polynomial time, Polynomial time verification, NP - Completeness and reducibility, NP Complete problems (without Proofs), Approximation algorithms (Vertex-Cover Problem, Traveling Salesman Problem).

TOTAL CUMULATIVE CREDITS 204************