10.07.2015 Views

B.Tech. Degree Programme Computer Science & Engineering

B.Tech. Degree Programme Computer Science & Engineering

B.Tech. Degree Programme Computer Science & Engineering

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

B.<strong>Tech</strong>. <strong>Computer</strong> <strong>Science</strong> & <strong>Engineering</strong> (Regular)11. Efraim Turbon, Jee Lee, David King, H. MichaelChang, “E-Commerce” Wiley VCH, 2004WEB REFERENCES1. www.exforsys.com/tutorials/erp/erp-and-ecommerce.html2. www.bizautomation.com3. itmanagement.earthweb.com/erp4. www.e2-llc.com/e2_ecommerce_erp.aspx5. e-comm.webopedia.com/TERM/e/ERP.htmlIT-443INFORMATION STORAGE & L T P CrMANAGEMENT 5 0 0 3OBJECTIVEUsing a “building block” approach, the ISM curriculumprovides a core understanding of storage technologiesand progresses into system architectures, introductionto networked storage, and introduction to informationavailability. The course provides a comprehensiveintroduction to data storage technology fundamentals.Students will gain knowledge of the core logical andphysical components that make up a storage systemsinfrastructure.PRE-REQUISITESKnowledge of <strong>Computer</strong> Networks at B <strong>Tech</strong> level1. INTRODUCTION: Meeting today's data storageneeds - data creation; data creation: individuals,business; categories of data; data storage models;common data storage media and solutions - tapestorage systems, optical data storage, disk basedstorage2. DATA CENTER INFRASTRUCTURE: Example;key requirements of storage systems managementactivities3. STORAGE SYSTEMS ARCHITECTURE: Storagesystem environment; components of a host;connectivity; physical disks; RAID array; diskstorage systems; data flow exercise4. NETWORKED STORAGE: Direct AttachedStorage (DAS), Network Attached Storage (NAS),Fiber Channel Storage Area Network (FC SAN), IPStorage Area Network (IP SAN), ContentAddressed Storage (CAS)5. BUSINESS CONTINUITY: Introduction, overview,backup and recovery, local replication, remotereplication.6. MONITORING AND MANAGING THE DATACENTER: Areas of the data center to monitor;considerations for monitoring the data center;techniques for managing the data center.7. SECURING STORAGE AND STORAGEVIRTUALIZATION: Securing the storageinfrastructure; virtualization technologies.TEXT BOOKOsborne Marc Farley, “Building Storage Networks”,Tata McGraw HillREFERENCE BOOKS1. Spalding Robert, “Storage Networks: TheComplete Reference“, Tata McGraw Hill2. Gupta Meeta, “Storage Area NetworkFundamentals”, Pearson Education Limited3. Kowalski Gerald J. and Maybury Mark T.,“Information Storage & Retrieval Systems Theory& Implementation”, BS Publications4. Thejendra B. S., “Disaster Recovery & BusinessContinuity”, Shroff Publishers & Distributors, EMC– Students KitWEB REFERENCES1. http://www.cs.cmu.edu/~fp/courses/03-312/handouts/18-storage.pdf2. http://www.freedownloadscenter.com/Information_Management/MA-471DISCRETE MATHEMATICSL T P Cr5 0 0 3OBJECTIVETo acquaint the students with the various concepts andtools of applied mathematics which will be very basicand the very soul and guide of computer field.1. SET THEORY: Different types of sets; Setoperations; Classes of sets; Relation; Types ofrelation; Functions; Types of functions andcomposition of functions and relation; Cardinalityand inverse relations; Fuzzy sets; Basic operationsof fuzzy sets.2. BOOLEAN ALGEBRA & LATTICES: Definition ofBoolean algebra; Basic operations of Booleanalgebra; Partially ordered sets; Lattices; SubLattices; Different types of Lattices; Operations onLattices.3. NUMBER THEORY: Basic properties; Divisibilitytheory; Congruences; Chinese remainder theorem;Fermatt's little theorem; τ & μ functions.4. COMBLNATORICES: Fundamental principal ofcounting; Pigeonhole principal; Multinomialcoefficients; Recurrence relation; Generatingfunctions.5. ALGEBRAIC STRUCTURES: Binary operations;Group; Subgroup; Normal subgroup and theirelementary properties; Order of element andgroup; Lagrange's theorem; Rings; Sub ring; Ideal;Integral domain; Field only definition andexamples.6. GRAPH THEORY: Introduction to graphs; Type ofgraphs; Sub graphs and isomorphic graphs;Representation of graphs; Properties of graphs;Euler's formula for planar graph; Eulerian andHamiltonian graph; Ore's theorem.7. TREES: Trees and their properties; Spanning trees;Kruskal's algorithm; Prim's algorithm; Binary tree.TEXT BOOKSarkar S. K., "A Textbook of Discrete Mathematics" 5thEdition, S. Chand PublicationsREFERENCE BOOK1. Liu C. L., "Element of Discrete Mathematics"McGraw Hill.2. Sengadir, "Discrete Mathematics andCombinatorics", Pearson Education.3. Deo, "Graph Theory", Prentice Hall of India.4. Bough R. Johnson, "Discrete Mathematics",Pearson Education.92

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!