How many houses can be powered by one hydro dam?

Are dams helpful or harmful?

Although most dams are built with the intention of creating hydro-electric power, which is a cheap and effective way of generating power without burning fossil fuels, or using nuclear power, they do often entail a major change in the local habitat, including moving complete villages or settlements. In one instance, when a large dam was built in Egypt, they had to move a series of statues that had stood on place since the times of Rameses. Dams may also kill fish or stop them from migrating to where they were born.

What are alternative ways of getting energy?

1. POO POWERYes, we're serious. Poop produces methane, which is not only a greenhouse gas, but can be harnessed and used for viable renewable energy. While the technology and processes are still being refined, it's not unlikely that cow manure will be the new solar panel in the coming years. Dogs and even human waste might eventually join the poo parade as well.2. SOUND ENERGYWhile there isn't a residential prototype for this technology built yet, the idea that soundwaves could be transformed into usable energy is not only promising, but mind-blowing. University of Utah Physicist Orest Symko and his students have developed a way to turn excess heat into sound and finally into electricity, and we can't wait to see this technology applied to home energy.3. HUMAN MOTIONWe've seen this technology used in the Sustainable Dance Club as well as in Hong Kong's human-powered gyms, and the principle could easily be applied to residences as well. When we humans walk, dance, work out, run, move, we create energy. Through new technology, this energy can be harnessed into usable energy to cycle back into our buildings, dance clubs, gyms, and homes. Its only a matter of time before the Sustainable Dance Club concept comes makes inroads into the home.4. WIND-KINETICSGoing way beyond a simple wind turbine, Michael Jantzen's Wind Shaped Pavilion turns architecture into renewable energy source. The kinetic wind house is a large fabric structure that rotates in segments around a central support frame, generating enough electricity as it moves to light the pavilion at night. This concept takes wind power to a whole new level.5. SPINACH (i.e photosynthesis)Not just full of nutrients for your body, spinach also has the potential to nourish your house. The winning entry from the Cradle to Cradle House competition proposed an amazing solar energy harvesting system based on photosynthesis, using a solar cell system whose main component for generating electricity is a protein called Photosystem I, which is derived from spinach. If things go according to plan, construction on a giant solar tower could begin in Australia in 2006. The 3,280-foot tall tower will be surrounded by a vast greenhouse that will heat air to drive turbines around the base of the tower. It is estimated that the power station will be able to generate 200 megawatts of electricity, enough to power 200,000 households. Solar energy requires no additional fuel to run and is pollution free. Sunlight can be captured as usable heat or converted into electricity using solar, or photoelectric, cells or through synchronized mirrors known as heliostats that track the sun's movement across the sky. Scientists have also developed methods for using solar power to replace a gas-powered engine by heating hydrogen gas in a tank, which expands to drive pistons and power a generator. Drawbacks of solar energy include high initial cost, and the need for large spaces. Also, for most solar energy alternatives, productivity is subject to the whims of air pollution and weather, which can block sunlight. Taking the concept of windmills one step further, or higher, scientists want to create power stations in the sky by floating windmills 15,000-feet in the air. The strange crafts will be kept afloat by four propellers that double as turbines, and feed electricity back to earth through a cable. Wind energy currently accounts for only 0.1 percent of the world's electricity demands, but that number is expected to increase as wind is one of the cleanest forms of energy and can generate power as long as the wind blows. The problem, of course, is that winds don't always blow, and wind power cannot be relied upon to produce constant electricity. There is also concern that wind farms could impact local weather in ways that are yet to be fully understood. Scientists hope that taking windmills to the skies will solve these problems, since winds blow much stronger and more consistently at high altitudes. Biomass energy, or biofuel, involves releasing the chemical energy stored in organic matter such as wood, crops, and animal waste. These materials are burned directly to produce heat or refined to create alcoholic fuels like ethanol. But unlike some other renewable energy sources, biomass energy is not clean, since burning organic matter produces large amounts of carbon dioxide. It may be possible, however, to offset or eliminate this difference by planting fast growing trees and grasses as fuel supplies. Scientists are also experimenting with using bacteria to break down biomass and produce hydrogen for use as fuel. One exciting but controversial biofuel alternative involves a process known as thermal conversion, or TCP. Unlike conventional biofuels, TCP can convert practically any type of organic matter into high quality petroleum with water as the only byproduct, proponents claim. It remains to be seen, however, whether Changing World Technologies, the company that patented the process, can produce enough oil for it to become a viable fuel alternative. Whether falling, flowing, or otherwise moving in tides or under-ocean currents, water can be harnessed to produce electric power. Hydropower supplies approximately 20 percent of the world's electricity. Until recently, it was generally believed that water energy is an abundant natural resource that requires no additional fuel and produces no pollution. Recent studies, however, challenge some of these claims and suggest that hydroelectric dams can produce significant amounts of carbon dioxide and methane through the decay of submerged plant material. In some cases, these emissions rival that of power plants running on fossil fuel. Another drawback of dams is that people often need to be relocated. In the case of the Three Gorges Dams Project in China -- which will be the largest dam in the world when completed in 2009 -- 1.9 million people were moved and countless historical sites were flooded and lost. Oceans cover 70 percent of the Earth, and water is a natural solar energy collector. OTEC, or ocean thermal energy conversion, aims to exploit this fact and use the temperature differences between surface water heated by the sun and water in the ocean's chilly depths to generate electricity. OTEC plants generally fall into three categories: Closed Cycle: A liquid with a low boiling point like ammonia is boiled using warm seawater. The resulting steam is used to operate an electricity-generating turbine; the vapor is then cooled using cold seawater.Open Cycle: Similar to the closed cycle OTEC, except there is no intermediate liquid. The warm seawater is converted into low-pressure vapor that is used to generate electricity. The vapor is then cooled and turned into usable fresh water with cold seawater.Hybrid Cycle: A closed cycle OTEC is used to generate electricity, which is then used to create the low-pressure environment necessary for the open cycle. OTEC plants can double as fresh water sources and the nutrient rich seawater drawn from ocean depths can be used to culture marine organisms and plants. The major drawback of OTEC is that since they operate on such small temperature differences, generally about 36 degrees Fahrenheit (20 Celsius), they are only 1 to 3 percent efficient. At first glance, hydrogen fuel cells might seem like the perfect alternative to fossil fuels. They can generate electricity using only hydrogen and oxygen and are pollution free. An automobile running on hydrogen fuel cells would not only be more efficient than one powered by an internal combustion engine, its only emission would be water. Unfortunately, while hydrogen is the most abundant element in the universe, most of it is bound up in molecules such as water. That means pure unbound hydrogen must be produced with the help of other energy sources -- which in many cases involve fossil fuels. If that's the case, then many of the environmental benefits of hydrogen as a fuel are negated. Another problem with hydrogen is that it cannot be compressed easily or safely, and requires large tanks to store. Also, for reasons that are not fully understood, hydrogen atoms have a tendency to bleed through the materials encasing them, thus weakening their containers. Honda introduced last year a scooter that uses fuel cell technology. Antimatter is the Bizarro twin of matter, made up of antiparticles that have the same mass as ordinary matter but with opposite atomic properties known as spin and charge. When the opposed particles meet, they annihilate each other and release tremendous amounts of energy as dictated by Einstein's famous equation, E=mc2. Antimatter is already in use in a medical imaging technique known as positron emission tomography (PET), but its use as a potential fuel source remains in the realm of science fiction. The problem with antimatter is that there is very little of it in the universe. It can be produced in laboratories, but currently only in very tiny amounts, and at prohibitively high costs. And even if the problem of production could be solved, there is still the knotty question of how to store something that has a tendency to annihilate itself on contact with ordinary matter, and also how to harness that energy once created. NASA funds research into creating antimatter drives that could one day take humanity to the stars, but dreams of antimatter-powered starships as seen on Star Trek are still a long way off, all experts agree.

How does networking improve the usefulness of computers?

Supporters of technology say that it solves problems and makes life better. Opponents argue that technology creates new problems that may threaten or damage the quality of life. There are several viewpoints on the implications of technological change and advancement and such schools of thought which considerably vary have their respective validity. Technological change has its advantages and disadvantages. For one, it is true that it partly solves problems and makes life better. At the same time, technological changes may likely create new problems thereby threatening or damaging quality of life. In the developing economies, for instance, technological advantages have both its merits and demerits. The introduction and seeming acceptability and usefulness of computers have somehow helped increase the efficiency of several firms. It is not only in the industrial sector that technological change proven to be very effective. In the agricultural sector, for example, the introduction of new technologies in increasing production has been very effective in expanding agricultural produce. These are just a few examples to illustrate the advantages of technological advancement. On the other hand, countries should be more careful on their choice of technology since it must be noted that while certain types of technology are adaptable to developed economies the same type of technology may not fit the environment of developing countries due to differing economic, social, cultural, and political factors. For example, infrastructure improvements such as a construction of irrigation dam in the mountain of the Philippines where several natives reside may likely be resisted by the population due to cultural factors. They may prefer not to have such improvements in view of traditional values. Another example is the pollution impact of some technological improvements particularly in the industrial sectors. The choice and adaptability of new technology should therefore be carefully studied. The short, medium, and long term impact of such technology is very important particularly for developing economies. The benefits should always be greater than the costs. I am inclined to support both positions because both views have their own validity. However, I am more convinced that technological advancement is really beneficial to countries so long as they are aware of the disadvantages of such technology. In my own points of view, I support technology can solve problems and makes life better. Computer helps human solves thousands of problems, especially, science. A lot of calculation was so complex. It is impossible count them from normal method. It should use a very fast computer in order to compute it. Super conductor, one of the hot technology topic. A lot of scientists study this kind of stuff. It is a very important stuff. That is wonderful. We can easily solve the big problem, "energy". It can pass through the energy without losing. Finally, I support technology. Because it is more benefit.

What is the syllabus of 8th sem computer eng in rtmnu?

SYLLABUS OF III SEMISTER B.E. COMPUTER SCIENCE (SEMISRER PATTERN)33CSI: Applied Mathematics Unit 1 : Integral TransformsFourier integral theorem, Fourier and Laplace transforms and their simple properties, Simple properties of Laplace transforms to-solve ordinary differential equation including Application to one dimensional partial differential equations. The z-transform definition and properties, inversion, with Laplace transform, Application of z-transform to solve difference with constant coefficient.Unit 2: Complex VariableAnalytic function, Cauchy-Riemen condition, conjugate, function, singularities, Cauchy's integral theorem and integral formula (statement only) Taylor's and Laurent theorem (statement only) Residue theorem, contour integration. Unit 3 : Calculus of VariationsMaxima and Minima of functional, variation and its properties Euler's-equation, functional dependent on first and second order derivatives, simple applications.Unit 4 : Fourier SeriesPeriodic function and their Fourier expansion. Even and odd function, change of interval half range expansion. Partial Differential Equation: Partial-Differential Equation of first order first degree,i.e, Langrange's form, Linear Homogeneous P.D.E. of North order with constant coeffient method of separation of variables.Unit 5 : MatricesInverse of matrix by partitioning method, Inverse of a matrix by adjoint method and its use solving- simultaneous equation, Rank of matrix, Consistency of a system of Equation, Linear dependence, linear and orthogonal transformation.Unit 6 : MatricesCharacteristic equation, Eigenvalues, eigenvectors, Reduction of a diagonal form, Statement and verification of Cayley-Hamilton theorem; Sylvester's theorem, Association of matrices with linear differential equation of second order with a constant coefficient, Determination of largest eigenvalue by iteration method.Test Books:Â· Advanced Engineering Mathematics, kreyzigÂ· Higher Engineering Mathematics, B.S. GrewalReference Book :Â· Mathematics of Engineer, Chandrika PrasadÂ· Advanced Mathematics for Engineer, Chandrika PrasadÂ· Applied Mathematics for Engineer, L.A. Pipes & HarvilleÂ· A Text Book of Applied Mathematics, P.N. Wartikar & J.N. Wartikar 33CS2 : Programming Fundamentals In "C"Unit - I:Introduction to programming , programming languages, algorithms, flowchart. C: Data types, Identifiers, Storage class, Constant, Operators, expression, Statement, console I/O statement, Selection statement: if-else, switch, Iteration Statement: for, while, do-while, jump statement: return, go, back, continue, comment.Unit IIFunction, Call by value, Call by reference, calling function with arrays, argument to main(), return statement, recursion, function prototypes, inline keyword, preprocessor directives. Pointers: pointer variables, pointer operator, pointer expression, array of pointers, multiple indirection, pointers to function, dynamic allocation function, Unit IIIArrays - single dimensional arrays, two dimensional arrays, variables length array. Strings, array of strings. Unit IVStructures : array of structures, passing structure to function, structure pointer, structure within structure. Union, bit-fields, enumerations, size, type def. Unit VFile I/O : Streams and files, file system basics, fread, fwrite, fseek, random access I/O, fprint(), fscan(), standard streams. Unit VIAdvanced Concept in C: Different types of pointers, ROM-BOIS function, Elementary TSRs.Text Book :Â· The Complete Reference C (4 th Edition): Herbert Scheldt [TMH]Â· C how to program, 4th Edition by H.M.Deitel & P.J. Deitel, Pearson Education.Â· Writing TSRs through C: Yashwant Kanetkar [BPB]Reference Book:Â· The C programming Language: Dennis Ritchie & Dietel, Pearson Kernighan [Pearson]Â· Programming with C: K.R. Venugopal & S.R. Prasad [TMH]Â· Let us C: Yashwant Kanetkar [BPB]33 CS3 : DIGITAL CIRCUITS & FUNDAMENTALS OF MICROPROCESSORUnit - I:Motivation for digital system - Logic and Boolean algebra, Number system: Binary, Hexadecimal, Octal, Gray. Gates & truth tables, propositions, Demogran's law minimization of combinational circuits using Karnaugh maps.Unit II :Multiplexers, Demultiplexer, Enconds, Decoders, Code, Converters, Address, Subtract(Half, full), BCD Adder/ Subtractor, ripple and carry look-ahead addition. Unit IIIStorage elements, flip-flops and latches: D,T,J/K, s/R flop-flops. Master Slave Conversion of one of type of F/F to another. Unit -IVCounters, asynchronous and synchronous-design using state and excitation tables. Unit -VIntroduction of 8085, Addressing modes, Instruction Set of up 8085 Unit -VIInterrupts of 8085, Programming of up 8085.Text Book :Digital Design 3rd Edition by M. Morris Mano, Pearson Education.Digital logic and Computer Design by M. Morris Mano, Pearson Education.Digital Circuits & Design - R.P. JainDigital Circuits & design - A.P. GodseFundamentals of Digital Electronic - A.Anand Kumar8 bit microprocessor & controller - V.J. Vibhute8 bit microprocessor - Gaonkar 33CS4 : Combinatorial TheoriesUnit I :Combinatory : Basic counting techniques, pigeon-hole principle, recurrence relations, generating function. Examples using ordinary power series and exponential generating functions, general properties of such functions. Dirichleet Series as generating function.A general family of problems described in terms of 'cards, deck and hand' with solution methods using generating function. Unit IIGenerating function proofs of the sieve formula and of various combinatorial indenties. Certifying combinatorial indenties.Some analytical methods and asymptotic result.Polya's counting theorem.Basics of graphs theory.Introduction to probabilistic method in combinatory. Unit IIINumber TheoryExamples of continued fractions.The study of the continued fraction.Alpha has infinite continued fraction if alpha is irrational.Formal logic: Prepositional logic: proof system, semantics, completeness, compactness.Length of proofs, polynomial size proofs, efficiency of proof system. Unit IVAlpha has periodic continued fraction if alpha is quadratic irrational.Application to approximation of irrational by rational. Hurwitz's Theorem.First order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory. Some advanced topics.Unit V:Application to solution of Pell's equation. Proof that means cos{(p x pi)/q}, for natural number p and q are irrational (apart from obvious exceptions).Example : CS application of logic, introduction to modal and temporal logics, Or formal theory including incompleteness theorem.Unit VI :Lowville's Theorem on algebraic numbers. Construction of transcendental numbers.Elements of proof theory including cut elimination, Or zero-one law for first order logic.Text Book :Niven, Zuckerman and Montgomery, An Introduction to the theory of Numbers, (5th edition), 1991, Wiley. 33CS5 : Principle Of Management Unit I:Nature and function of Management, Management yesterday and today, Planning and Decision making. Unit II:Management Information System: Introduction, Conceptual Foundation, Information System Requirement Unit III:Marketing Management : Marketing concept, Indian Marketing Environment, Market segmentation, Market Planning, International Marketing.Unit IV:Financial ManagementUnit V:Human Resource Management : Human Resource Planning, Recruitment, Selection, Training and development, Security , safety and Health.Unit VI:Organization Behavior : Organization Structure and design. Designing Effective Organization, Managing Job Stress, Organization DevelopmentText Book:Principle of management, PC Tripathi and PN ReddyManagement Information System, Gordon Davis and H. Olison McGraw Hill.Human Recourses and Personal Management, William Werther and Keith Davis.Marketing Management V S Ramaswamy and S NamakumariOrganization Behavior, High Arnold and Daniel Feldman McGraw HillFinancial Management, Khanna33CS6 : Computer WorkshopPractical to be based on following topics:Study of PC HardwareBasic computer OrganizationPC constructionStudy of BOIS and CMOSWorking under DOS and Windows operating systemInternal and External DOS commandsBasics required for working under windows operating systemStudy of control panel3. Working under UNIX / LINUX Operating System:Structure : Unix ArchitectureFeatures of UNIX operating systemLayered model of UNIX operating system (study of kernel and shell)File structure and Directory structureIntroduction to Networking Accessories:Study of user connectionStudy of communication channelStudy network architecture (topologies)Study of network TypesBooks:Computer Fundamentals - Pradeep K. SinhaIntroduction to Computer Science by ITL ESL, Pearson EducationIntroduction to UNIX and shell programming by M.G. Venkateshmurthy, Pearson EducationUnix shell programming - Yeshwant Kanetkar.SYLLABUS OF IV SEMISTER B.E. COMPUTER SCIENCE (SEMISRER PATTERN)44CSI: Discrete Mathematics and Graph Theory Unit 1: Set TheoryOperation of sets - relation and functions, partial order, equivalence relation peano and inductionsUnit 2: Mathematical LogicProposition, predicate logic, formal mathematical system, algebra, Homomorphism, AutomorphismUnit 3: GroupsElement of theory of some Algebras, semi group, monoid group.Unit 4: RingsRings, fields, lattices, Boolean Algebra.Unit 5: Graph TheoryGraphs, Hyper Graph, Transitive Closure, Spanning Tress.Unit 6: CombinatorsGenerating Function, recurrences, counting theorem and applicationText Books:discrete Mathematical Structure for computer science, Kolman / Rahman Pearson education.Combinational Mathematics, C.L. Liu (McGraw Hill)(common to CS/CT/CE/IT)44 CS2 : Data Structure and Programme Design in 'C' 44 CS2 Data and program design in "C"Unit 1General concept and linear data structure : Abstract data structure as an organization of data with specified properties and operations, Time and space analysis of algorithms, Big oh and theta notations and omega notations. Average, best and worst case analysis, Representation of Arrays - single and Multi dimensional - Address calculation using column and row major ordering. Representation of stacks and queues using arrays- Circular queues, Dequeue, Application of stacks, Conversion from infix to post fix and pre-fix expression, Evaluation of postfix expression using stacks, Multiple stacks.Unit IILinked list : Linked lists, Simply linked list Implementation of linked list using and dynamic memory allocation-dynamic memory allocation, operation on list linked stacks and queues, polynomial representation and manipulation are using linked list, circular linked list, doubly linked list, Generalized list.Unit IIITrees: General and binary trees, Representations and traversals, General tress as binary trees, Binary search trees, Application, the concept of balancing and its advantages, B-trees, B+ Trees, AVL Trees, Threaded Binary Trees.Unit IVHashing : Hash functions, Collision resolution, Expected behavior, ApplicationUnit VGraphs and digraphs : Representations, Breadth and depth first searches, Connectivity algorithms, shortest path, Minimal spanning tree, the union find problem, Hamilton pathUnit VISorting : Elementary sorts : selection , insertion, bubble sort, Radix sort, Quick sort, merge sort, heap sort, Bucket sorting, External sorting, Worst case and average behavior, Lower bound for sorting using comparisonsText Books:Data structure using C and C++ by Y. Langsam, Pearson EducationData structure using C by Tenebaum, Pearson EducationData structure using C by S.K. Bandyopadhaya, Pearson EducationS. Sahani, Data Structure in CD. Samantha, Classic Data Structure, PHI PublicationData structure - Robert Kruse44CS3: Business Data ProcessingUnit I:Structural Organization of COLBOL: Character set, Words, Sentences, Identification Division, Environment Division, Data Division, Data types- numerical, Alphabetic & alphanumeric, Input-output sections, Working storage sections, PROCEDURE division features : ACCPET, DISPLAY, MOVE, Arithmetic & COMPUTE verbs, levels, Errors Handling, Sample programs, PERFORM & GOTO verbs, sample programs using PERFORM, Miscellaneous COBOL statement.Unit II:Conditional statements & Handling Relation condition, Nested condition, Class conditions, Condition name condition Justified clause, Structured programming forms of program structure, Structural floe charts, subscripting, OCCOURS CLAUSE, multidimensional tables, Tables handling with PERFORM verb.Unit III:Business Files : Structured flow charts, Operation on files, Master files, Transaction file, Report file, Batch processing, on-line processing, case studies.Sequential Access Files: Principle of magnetic storage and accessing, Blocking, Inter record gap, label records, COBOL language instruction for sequential files.Unit IV:Direct Access File : Characteristic of disk storage and timing index sequential files, COBOL instruction for indexed sequential files, relative file organization, Division - Remainder method, digital analysis method, COBOL instruction for handling relative files.Unit V:Sorting, Searching and merging : Linear search sort, Merge sort, Chained record sort, Linear search, Binary search, File sorting and Merging using sequential files.Report Generation : Output layout design, Heading, Date & Detailed summaries.Control break, Language specification for COBOL report writing.Unit VI:Advanced Tool manipulators like STRING, UNSTIRNG, INSPECT & COPY verb, COBOL subprogram and main program.Text Books:Â· COBOL Programming with business application - N.L. SardaÂ· Information System through COBOL -Philippakis & KazmierÂ· Structured COBOL Programming - Stern & SternÂ· COBOL Programming by M.K. Roy, D. Ghosh Dastidar.44CS4: Theoretical Foundations Of Computer ScienceUnit 1Mathematical preliminaries - Sets, operation, relation strings, transitive closure, accountability and diagonaalisation, induction and proof methods- pigeon-hole principle and simple application - concept of language - grammar and production rules- Chomsky hierarchy.Unit IIFinite state machine, regular language, deterministic finite automata, conversion deterministic automata , E- closures- regular expression finite automata, minimization of automata, Moore and Mealy machine and their equivalence.Unit IIIPumping lemma for regular sets-closure properties of regular sets-decision properties for regular sets, equivalence between regular language and regular grammar. Context - free language -parse trees and ambiguity, reduction of CFGS, chomsky and Griebach normal formsUnit IVPush -down Automata (PDA)-non Determinism-acceptance by two methods and their equivalence, conversion of PDA to CFG CFLs and PDAs-closure and decision properties of CFLs.Unit VTuring machines-various-recursively enumerable (r.e.)set-recursive setsTM as computer of function- decidability and solvability- reductions- post correspondence problem (PCP) and unsolvability of ambiguity problem of CFGs, Church's hypothesis.Unit VIIntroduction to recursive function theory- primitive recursive and partial recursive functions, Parsing top down and bottom up approach, derivation and reductionText BooksIntroduction to formal languages and automata - Peter Linz Norasa, 200Theory of Computer - Mishra and Chandrashekharan, PHIReference BooksIntroduction Of Automata Theory, Languages and computation J.E Hopcroft, J. D Ulman, Pearson education.44CS5: Computer Architecture & OrganizationUNIT 1BASIC STRUCTURE OF COMPUTERS :Functional units , Basic operational concepts, Bus structure Addressing modes , subroutine : parameter passing , instruction formats, expanding opcodes method.BASIC PROCESSING UNITS: bus architecture, execution of a complete instruction, sequencing of a control signals, hardwires control, micro programmed control, microinstruction format, bit slice concepts.UNIT II:ARITHAMETIC : Numbers representation and their operations , design of fast Adders, Singed multiplications, Booth's Algorithm's bit pair recording, Integer Division, Floating point numbers and operations , guard bit and rounding.UNIT III:THE MEMORY SYSTEM : various technologies used in memory design , higher order memory design, multimode memories and interleaving , Associative Memory , Cache Memory, Virtual Memory.UNIT IV:INPUT / OUTPUT ORGANISATION: I/O mapped I/O and memory mapped I/O , interrupts and interrupts handling mechanism , vectored interrupts , synchronous vs.Asynchronous data transfer , Direct memory Access COMPUTERS PERIPHERALS : I/O devices such as magnetic disc, magnetic tape. CDROM system.UNIT V:RISC philosophy , pipelining , basic, delayed branch, branch prediction, data dependency, influence of pipe lining on instruction set design ,, multiple execution units, performance considerations,UNIT VI:Basic Concepts in parallel processing & classifications of parallel architecture. Vector processing , Array processors.BOOKS:Â· V.C Hamachare , Z.G.Vranesis and S.G Zaky, Computer organizations.McGraw Hills 5th Edition, 2002.Â· Computer Architecture & Organizations III rd Edition J.P Hayes.Â· A.S. Tanenbaum, Structured Computer Organizations" 4th Edition , PersonEducations.REFERENCE BOOKS:Â· M. Mano, " Computer System & Architecture" Pearson Education.Â· W. Stalling " Computer System & Architecture" , Pearson Educations.44CS6: Internet TechnologiesPractical to be conducted based on following topics:1) HTML: standard use for www documents on internet , GML, SGML, HTML tags, special characters, Fonts, Lists, Images, Tables, Forms and Frames.2) DHTML:Introduction to CSS, Fonts in CSS, Text in CSS, Boxes in CSS, CSS positioning, Tables in CSS, Generated content and lists in CSS.3) XML: XML basics, understanding markup languages, structures and syntax, valid Vr well formed XML, DTD (document type definition) classes, Scripting XML, XML processor, parent child relationship, XML as a data, data type in XML, XML namespaces, linking with XML simple link, the HTML way, XSL with style: style sheet basics, XSL basics, XSL style sheets.4) FRONTPAGE:5) SECURITY:6) Scripting Language: Perl Scripts, Java Scripts:7) PHPTEXT BOOKS:Â· XML in action web technology by William J. Pardi (PHI) Pub.Â· Web Technology by Ramesh Bangia (Firewall Media).. Â· Programming the web using XML by Ellen Pearlman (Tata McGraw - Hill).SYLLABUSS OF V SEMESTER B.E. COMPUTER SCIENCE (SEMESTER PATTERN)55CS1: Data CommunicationUNIT 1:SIGNALS:ANALOG AND DIGITAL : Analog and digital data, Analog and digital signals; PERIODIC AND APERIODIC SINGNSLES, ANALOG SINGALE: simple analog signals; TIME AND FREQUENCY DOMAINS; COMPOSITE SINGLES: Frequency spectrum and Bandwidth; DIGITAL SIGNALS : Decomposition of digital signal; TRANSMISSION MODES: Serial and Parallel transmission, Asynchronous and Synchronous Transmission, simplex, Half- Duplex communication.UNIT 2:ENCODING AND MODULATING:DIGITAL -TO - DIGITAL CONVERSION : Unipolar , Polar, Bipolar;ANALOG- TO DIGITAL COVERSION:Pluse Amplitude Modulation(PAM),Pules Code7 Modulation(PCM),Sampaling Rate,How many Bits per Sample? Bit rate;DIGITAL -TO- ANALOG CONVERSION: Aspects of Digital -to -Analog conversion, Amplitude Shift Keying(ASK),Frequency Shift Keying(FSK) ,Phase shift keying( PSK), Quadrature Amplitude modulation (QAM), Bit / Baud comparison ; ANALOG-TO- ANALOG CONVERSION: amplitude modulation (AM), Frequency Modulation (FM) , Phase modulation(pm);UNIT 3:INTERFACES AND MODEMS: DIGITAL DATA TRANSMISSION: Parallel transmission , Serial Transmission ; DTE- DCE INTERFACE: Data terminal Equipment (DTE), Data Circuit - Terminating Equipment (DEC), Standards, EIA-232 Interface; OTHER INTERFACE STANDARDS: EIA-530, X21; MOODEMS; Transmission rate, Modem standards; 56k MODAMS:Traditional Modams,56Modems;UNIT 4:COMMUNICATION MIDIA: GUIDED MEDIA: Twisted pair cable, Coaxial cable, Optical Fiber cable; UNGUIDED MEDIA: Radio frequency allocation, Propagation of Radio waves, Terrestrial microwave, Satellite communication, Cellular Telephony; TRANSMISSION IMPAIRMENTS : Attenuation , Distortion, Noise ;PERFORMANCE: Throughput, Propagation Speed, Propagation time;UNIT 5:MULTIPLEXING: FREQUENCY DIVISION MULTIPLEXING (FDM). TIME DIVISION MULTIPLEXING (TDM); Inverse Multiplexing, WAVE- DIVISION MULTIPLEXING, MULTIPLEXING APPICATION : THE TELEPHONE SYSTEM: Common carrier services and hierarchies, Analog services, Digital Services; DIGITAL SUBCRIBER LINE(DSL):ADSL, RADSL, HSDL, SDSL, VDSL; FTTC:FTTC in the Telephone Network, FTTC in the Cable TV Network.UNIT 6:DATA COMPRESSION: Huffman code, Run -Length Encoding, Relative Encoding, Lempel-Ziv Encoding, Image Compression, JPEG, MPEGText Books:Data Communication and Networking by Behrouz A.Forouzan, 4th Edition, Tata McGraw Hill Understanding Data Communication and Networks by William A. Shay, 2ND Edition , Vikas Publishing House.Reference Book:Electronic communication Systems by Kenney.Communication Systems by Singh and SapreData communication by Fred Halsall, Pearson Education.55CS2: Numerical ComputingPolynomial Equation : Newton -Raphson method, Regula Falsi Method, Bairstow method, Multipoint iteration method, Convergence/ Rate of Convergence of iterative method, Evaluation of Multiple & complex roots. Simultaneous equations.Linear System and Matrices Gauss elimination with pivoting, Gauss- Seidal iteration,Triangularization/ Cholesky methos, Iterative determination of Eigen values. Interpolation & Approximation: Lagrange's divaricates interpolation , Least squares approximation, Uniform approximation , Rational Approximation, Hermite Iterpolation. Differentiation / Integration: Doubleintegrals by Trapezoidal & Simpson rule, Methods of undermined coefficients for numerical integration, GaussOLegendre, Gauss- Hermite formula, Romberg Integration, Approximation of derivates, Richardson's Extrapolation. Differential Equations: Initial value problems by Euler's method, Picard's, Taylor series, Runge- Kutta methods, Predictor- Corrector methods, Boundary value problems (Second order)by finite difference methods.Related topics: Simplex method for linear programming programming problems,Errors & Method of errors analysis.Text Books:Numerical methods for Scientific and Engg. Computations by M.K. Jain, SRK Iyengar, R.K.Jain , Wiley Eastern Ltd.Numerical methods for Science & Engg. By Stanton R.G. PHIIntroductory Methods of Numerical Analysis by Sastry S.S.PHI.55CS3: Object Oriented MethodologiesUNIT 1:The Object Oriented ParadigmWhat is Object Orientation ?, What is Object Oriented Development ?, The Object Oriented Themes ;The Object modeling Technique (OMT).Object ModelingObjects and Classes; Links and Association ; Advanced Links and Associations Concepts; Generalization and Inheritance; Grouping Constructs; A Sample Object Model. Advanced Object Modeling Aggregation; Abstract and Concrete Classes;Generalization as Extension and Restriction ;Multiple Inheritance; Metadata; Candidate Keys.UNIT 2:Dynamic ModelingEvents and States; Operations; Nested State Diagrams; Concurrency of State; Advanced Dynamic Modeling Concepts; A Sample Dynamic Model; Relation of Dynamic Model to Object Model .Functional Modeling The Functional Model; The Data Flow Diagrams (DFD) ; Properties of DFD; Construction of DFD; Specifying Operations; Constraints; A Sample Functional Model; Relationship between the Object, Dynamic and the Functional Models.UNIT 3:Pre- Analysis the need for Pre-Analysis ; Pre -Analysis Steps: Interviews, Questionnaire, Observation, Documentation and Notations; the Bus Stop Problem Domain Example. Analysis: The Analysis Overview ; the Problem Statement; the ATM example; Object Modeling in ATM; Dynamic Modeling in ATM; Functional Modeling in ATM; Adding Operations; Iterating Analysis ; Recording Analysis.UNIT 4:DesignHow does Design differ from Analysis ? The Logical and Physical Design ; Qualities and Objectives of Analysis and Design; Measurable Objectives in Design; Planning for Design. System Design Overview of System Design; Breaking System into Subsystems; Identifying Software Control Implementation; Handling Boundary Conditions; Setting Trade-Off Priorities; Common Architectural Frame Works; the Architecture of ATM System.UNIT 5:The object design paradigm:Overview of Object Design; Class Specifications; Interfaces; Criteria for Good Design; Designing Algorithms; Design Optimization ; Implementation of Control ; Adjustment of Inheritance; Design of Associations; Integrity Constraints; Object Representations ; physical Packaging; Documenting Design Decision.UNIT 6:The Human Computer InteractionWhat is Human Computer Interaction ? Qualities of Good User Interface; Approaches to User Interface Design; the Standards and Legal requirements. The Programming Style the subject-Oriented Style; Extensibility and Robustness; Programming -in-the-Large; Last Binding and Early Binding. Reusable Components What is meant by Reuse ?, Why Reuse ? , Planning Strategy for Reuse; the Reusability approaches.Software Development Methodologies The Method and the Methodology; Why use Methodology ? the Unified Software Development Process; Participative Design Approaches ; Issues in Choosing Methodology; Hard Vs Soft Methodologies.(Practical Implementation in "c++")Text Books:Object Oriented Modeling and Design; James Rumbaugh, Michael Blaha, Pearson Education.REFERENCES:Object Oriented System Analysis and Design using UML; Second Edition ; Simon Bennett, Steve McRobb, Ray Farmmer ; Tata McGraw Hill ; 2004.Object Oriented Analysis and Design with Application ;Second Edition ; Grady Booch ;Pearson Education.Object Oriented Analysis and Design; Andrew Haigh; Tata McGraw Hill;200155CS4: Concept in Programming LanguageUNIT IDefinition of Programming Language , Implementation of high -level languages, Data elements , binding time , binding identifiers to names, binding of attributes, Binding time. Concept of r-value and I- value and their implementation . Effect of Environment on a language, Language paradigms. Language translation issues.UNIT IIData type, Type checking and type conversion, elements of specification and implementation of data type . . Implementation of elementary data types; integer, real, character, Boolean Pointer, enumerated type Implementation of structured data types. Vectors & arrays, sets, Files.UNIT IIIAbstract data type, encapsulation . Implementation of new data types, Subprogram definition and activation, their Implementation, parameter passing methods, generic subprograms, Scope rules.Unit IVType equivalence, type definitions with parameters , Implementation of Inheritance. Storage management issues like static and dynamic allocation, stack based allocation and management, Heap based allocation and management.UNIT VSequence control, Implicit and explicit sequence control, Sequencing with arithmetic expression, Sequence control between statements, prime programs, implementation of case statement.UNIT VISubprogram sequence control, recursive and non recursive subprogram. Data control , referring environment, dynamic and static scope, static chain implementation and display implementation.BOOKS:Â§ Programming Languages, 1st edition by T.W. Pratt and M.V.Zelkowitz &T.V. Gopal by Pearson Education, 2006Â§ Programming Languages, Ravi Sethi, Addison Wesley.55CS5: System ProgrammingUNIT I:IBM 360/370 & Assembler- Introduction to System Programming & its components. M/C Architecture, Data Formats & Register Formats, Concept of assembler, design of single pass and two pass assembler.UNIT II:Microprocessor -concept of macro , macro call within macro, macro definition within macro, recursive macro calls, design of macro processor.UNIT III:Linker and Loader- concept of static and dynamic relocation , external symbols, design of linker, design of object file for different loading schemes.UNIT IV:Common Object file format & System Utilities - Structure of object file and executable file, section or segment headers, symbol table , concept of storage class, string various, data type line insert, character, arrays structures . Source code control system, make , link editor, symbolic debugger.UNIT V:Unix Device Drivers- Definition, Anatomy and Types, Device programming, Installation, Incorporation of driver routines, Basic device driver operation, Implementation with Line Printer & Disk , Comparative study between device drivers for UNIX & Windows.UNIT VI :Compiler- Phases of Compilers, Overview of Databases and Algorithms required for all phases. Role of lexical analyzer, recognition of tokens, Study of LEX &YACC.BOOKS:System Programming-J.J.Donovan.System Programming and Operating system - D.M. Dhamdhere.Unix system Utilities manual.Unix Programming Environment- Keringham and Pike, Pearson Education.Unix Device Drivers - George Pajari , Pearson Education.SYLLABUS OF VI SEMESTER B.E. COMPUTER SCIENCE (SEMESTER PATTERN)66CS1: DESIGN AND ANALYSIS OF ALGORITHMSUNIT I:Mathematical foundations, summation of arithmetic and geometric series, n, n2, bounding summation using integration, recurrence relations, solution of recurrence relations using technique of characteristic equation and generating functions, Complexity calculation of various standard function s, principles of designing algorithms.UNIT II:Asymptotic notations of analysis of algorithms, analyzing control structures, worst case and average case analysis , amortised analysis, application of amoterized analysis, Sorting networks, comparison networks, biotonic sorting network, advanced data structures link Fibonacci heap , disjoint set reprentation, red and black trees and their applications.UNIT III:Divide and conquer basic strategy, binary search, quick sort, merge sort, matrix operations, Greedy method- basic strategy, application to job sequencing with deadlines problem, minimum cost spanning trees, single source shortest path etc.UNIT VI:Dynamic Programming basic strategy, multistage graphs, all pairs shortest path, single source shortest paths, optimal binary search trees, traveling salesman problem, graph colouring , Hamiltonian cycles etc, Approximation algorithm and concepts based on approximation algorithms.UNIT VI:NP-hard and NP- complete problems, basic concepts, non-deterministic algorithms, NP- hard and NP- complete, decision and optimization problems, graph based problems on NP Principle, Computational Geometry, Approximation algorithm.Text BooksÂ· Thomas H. Cormen et al "Introduction to Algorithms" , Prentice Hall of India.Â· Design & Analysis of Computer Algorithms by Aho, Pearson education. Horowitz, Sahani , RajsekharamÂ· "Computer Algorithms", Galgotia Publications Pvt. Ltd. Brassard , Bratley, "Fundamentals of Algorithms" ,Prentice Hall.Reference Books:Â· Computer Algorithems: Introduction to Desing and analysis, 3rd Edition , By Sara Baase & A.V. Gelder Pearson Education.66CS2: Database Management SystemsUNIT I:Database system concepts and Architecture- concept of relational database, Relational algebra, SQL- the relational database standard, introduction to PL/SQL.UNIT II:Database design theory- Functional dependencies and normalization, relational database design algorithms, practical database design and demoralization, Relational constants, programmatic ways for implementing constraints, tiggers.UNIT III:Physical database design- concept of physical and logical hierarchy, storage structures link cluster, index organized table, partitions, various table storage parameters, concept of index , B-trees, hash index, function index ,bitmap index.UNIT IV:Process and memory management in database: Various type of tasks in database, database buffer management, log buffer management code reuse, concept of two tier and N-tier architecture, data dictionary and catalog information database recovery technique. Aries Algorithm for recovery.UNIT V:Query optimization and performance tuning - Various techniques for query optimization strong and weak equivalence, cost base optimization, Use of different storage structures in query optimization.UNIT VI:Transaction Processing- Transaction and system concepts, Desirable properties of transaction, Schedules and recoverability, serializability of schedules, concurrency control, lockbase protocols and time stamp based protocols , red consistency.BOOKS:Â· Fundamentals of Database System- Elmasiri, Navathe & Gupta, Pearson Education.Â· Database System by S.K.Singh, Pearson Education.Â· Principles of Database System- Ullman, Golgotia Publications 1998.REFERENCE BOOKS:Database System Concepts by Henry Korth and Others.Database Systems by Connolly, 3rd edition, Pearson Education.66CS3: computer networksUNIT I:Uses of Computer Networks, Network Hardware:- LAN, WAN, MAN ,Network Software- protocol hierarchies, design issues for layers, connection oriented and connection oriented and connection less service primitives, Services to protocol relationship . reference models-OSI and TCP/IP . Performance : Bandwidth and Latency, Delay X Bandwidth Product, High Speed Networks, Application Performance Needs.UNIT II:Switching and MAC Layer: Packet Switching: Multiplexing: TDM FDM.Multiple Access: Random Access, Controlled Access, Channelization, LAN: Token Ring, FDDI, Ethernet, Gigabit Ethernet, Wireless LANs: IEEE 80.211.UNIT III:Data Link Layer : Error Detection and Correction, Flow Control protocols, Error control protocols, HDLC, PPP.UNIT IV:Network Layer: Routing Algorithms - Shortest path Algorithm, Flooding, Flow based routing , Distance vector routing , Link state routing , Hierarchical routing.Congestion Control Algorithms: Leaky bucket algorithm, Token bucket algorithm . Congestion prevention Policies, Traffic shaping , Choke packets, Load shedding, Jitter Control.UNIT V:Transport Layer: The transport Service : Service Provided to upper layers, Transport Service primitives, Berkeley sockets, Elements of Transport protocols: Addressing, Connection establishment, Connection release, Flow control and buffering, Multiplexing, Crash recovery, Introduction to Internet Transport protocols: Introduction to UDP, Remote procedure call, Introduction to TCP, Performance issues: Performance problems in Computer Network, Network performance measurement, System design for better performance, Fast TPDU processing, Protocols for Gigabit Networks.UNIT VI:Wide Area Network : Packet switching principals, X.25, ATM and frame relay: ATM protocol Architecture, cells, cell format, Segmentation and reassembly in ATM, ATM adaptation Layer 5:Introduction to Frame relay and frame relay protocol architecture.TEXT BOOK:Â· Computer Networks: 4th ed by Andrew .S. Tanenbaum, Pearson Education.Â· Data Communications and Networks: 4th ed by Behrouz. A. Forouzan. Tata McGraw Hill Publication.Â· Computer Networks: A system approach by Larry L. Peterson and Bruce S. Davie, 3rd Edition, Morgan Kaufmann Publishers.Â· Data & Computer Communications: William Stallings, Sixth Edition, Pearson Edition Asia.REFERENCE BOOK:Â· Communication Networks: By Alberto Leon -Garcia & Indara Widjaja, 2nd Edition, McGraw Hill.Â·66CS4: MICROPROCESSOR & INTERFACINGUNIT I:8085 based Microprocessor organization , 8085 Instruction set , Assembly language programming.UNIT II:Memory & I/O organization, Address decoding, interrupts of 8085, Basic timing of 8085.UNIT III:8085 Interfacing with 8255, Sample keyboard matrix interfacing with 8085,Interfacing of 7 segments LED with 8085,Introduction to DAM using HOLD/HLDA Signals.UNIT IV:8279 Keyboard/ display controller, Interfacing of Stepper motor with 8085.UNIT V:8051 architecture, code/ data memory interfacing, I/O interfacing, Address decoding logic , Interrupts.UNIT VI:Serial data communication, UART operation, 8051 Instruction set, assembly language programming.TEST BOOKS:Â§ Microprocessor Architecture, Programming and Applications with 8085/8080 A by R.S. Gaonkar, Wiley Eastern Ltd.Â§ The 8051 Microcontroller & Embedded Systems. By Mazidi , Pearson Education.Â§ The 8051 Microcontroller, Architecture, programming & applications, second edition by K.J. Ayala, Penram International.Â§ Microcontrollers: Architecture, Programming , Interfacing & System design by Rajkamal, Pearson Education.Â§ The 8 bit microprocessor & Microcontroller by V.J. Vibhute.Â·Â·66CS5: SOFTWARE ENGINEERING AND PROJECT MANAGEMECOURSE MODULES:MODULELEARNING OBJECTIVEINDICATIVE HOURSSoftware Engineering an IntroductionIntroduction to Software Engineering, Software Myths, Software Engineering- A Layered Technology, Software Process Framework, Software Process Models. The waterfall Model, Incremental Process Models, Evolutionary Process Models, Specialized Process Models, The Unified Process Model, Agile Process Models.8Software Engineering PracticeAn Overview, Communication Practices, Planning Practices, Modeling Practices, Construction Practice & Deployment, System Engineering Hierarchy, Business Process Engineering, Product Engineering, System Modeling, Requirements Engineering.7Software Engineering Analysis & DesignAn overview, Requirements analysis, analysis Modeling Approaches, Data Modeling, Object- Oriented Analysis, Scenario- Based Modeling, Flow- Oriented Modeling, Class- based Modeling, Behavioral Model.Design Engineering Concepts, Design Model, Pattern- Based Software Design.8Testing Strategies and TacticsAn overview, Unit Testing, Integration Testing, Validation Testing, System Testing Debugging.Software Testing Fundamentals, Black- Box Testing, White- Box Testing .5Product MetricsAn overview, Software Quality, A Framework for Product Metrics, Metrics for Analysis & Design Models, Metrics for Testing & Maintenance.7Software Project ManagementAn overview, Software Measurements, Metrics for Software Quality, Software Project Estimation Techniques, Project Scheduling, Risk Management, Quality Management, Change Management, Software Reengineering.9Total44Â§ Text Books:Â§ Software Engineering - A Practitioner's Approach (Sixth Edition )-Roger Pressman(TMH)Â§ Reference Books:Â§ Software Engineering (Seventh Edition)- Ian Summerville, Pearson Education.Â§ The 8 bit microprocessor & Microcontroller by V.J. Vibhute.Â§ tice by Pfleeger, Pearson EducationÂ§ Software Engineering - Schaum's Series (TMH)Object - Oriented Analysis and Design using UML in Rational Rose 2003 Enterprise Edition (Case Studies)Soft6ware Engineering Theory andSYLLABUS OF VII SEMESTER B.E. COMPUTER SCIENCE (SEMESTER PATTERN) 77CS1: TCP/ IP & InternetUNIT I:Introduction and Overview. Comparison of OSI Model and TCP/IP model. Networking Technologies: LANS, WANS, Connecting Devices. Internetworking concept and Architectural model. Internet Backbones, NAP, ISP's, RFC's, internet Standards.UNIT II:Internet Addresses: IP address classes, subnet mask, CIDR, ARP, RARP, Internet Protocol, Routing IP Datagrams, ICMP and IGMP.UNIT III:UDP, TCP, Sockets and socket Programming Routing in Internet, Routing protocols- RIP, OSPF and BGP Introduction to Multicasting and Multicast routing.UNIT IV:Host Configuration :BOOTP, DHCP; Services; Domain Name System ,FTP, TFTP and Electronic Mail: SMTP, MIME, IMAP, POP.UNIT V:Network Management: SNMP, WWW: HTTP, Mobile IP Multimedia: RTP, RTCP.UNIT VI:Middiewares: RPC, RMI, Introduction to IPv6and ICMPv6, Internet Security: IPSec, PGP, Firewalls, SSL.BOOKS:Internetworking and TCP/IP: Principles, Protocols and Architectures, Douglas Comer, Pearson Education.TCP/IP Protocol suite, Behrouz A. Forouzan, Third Edition TMH.Computer Networking- Atop- Down Approach Featuring the Internet, James F. Kurose, Keith W. Ross, Pearson Education, Asia.Computer Network: A system approach by LARRY L. Peterson and Bruce S. Davie, 3rd Edition , Morgan Kaufmann Publishers.Reference Book:Stevens W.R. TCP/IP IIIustrated, volume1,2,3, Pearson education.Book for Practical:"Hands- On Networking with Internet Technologies" by Douglas E. Comer, Pearson Education, Asia, 2002.Â·Â·77CS2: Language ProcessorsUNIT I:Introduction to Compilers : Compilers and translators, Phases of compiler design , cross compiler, Bootstrapping, Design of Lexical analyzer, LEX.UNIT II:Syntax Analysis: Specification of syntax of programming languages using CFG, Top - down parser, design of LL (1)Parser, bottom up parsing technique, LR Parsing algorithm, Design of SLR, LALR, CLR parses.UNIT III:Syntax directed translation : Study of syntax directed definitions & syntax directed translation schemes, implementation of SDTS, intermediate notation : postfix, syntax tree, TAC, translation of expression, controls structures, declarations, procedure calls, Array reference.UNIT IV:Storage allocation & Error Handling: Run time storage administration, stack allocation, symbol table management, Error detection and recovery : lexical, syntactic, semantic.UNIT V:Code optimization : Important code optimization techniques, loop optimization, control flow analysis, data flow analysis Loop invariant computation, Induction variable removal, Elimination of Common sub expression.UNIT VI:Code generation - Problems code generation , Simple code generator, Register allocation and assignment, Code generation from DAG, Peephole optimization.TEXT BOOKS:Â§ Compilers: Principles Techniques and Tools 1st edition by A.V. Aho, Sethi, Ullman, Pearson education.Â§ Principal of Compiler Design - Alfred V. Aho & Jeffery D. Ullman, Narosa Pub. House.77CS3: Elective I:- Digital Signal Processing:UNIT I:Basic elements of a Digital Signal Processing system, Classification of signals, Concept of frequency in Continous-time and discrete - time singles, Sampling theorem, Quantization of continous-amplitude signals, quantization of sinusoidal signals. Discrete- time signals, Discrete-time systems, Analysis of discrete-time LTI systems, Correlation of discrete-time signals.UNIT II:The Z-transform, Properties, Rational Z-transforms, The inverse Z-transform by Contour Integration , Power series expansion, Partial- faction expansion, Decomposition of rational Z-transforms, One sided Z- transform, Properties, Solution of difference equations.UNIT III:Frequency analysis of Continous- time signals, Frequency analysis of discrete- time signals, Fourier series for discrete- time periodic signals, Power density spectrum of periodic signals, Fourier transform of Discrete- time aperiodic signals, Energy density spectrum of aperiodic signals, Concept of bandwidth, Symmetry properties of the Fourier transform theorems and properties.UNIT IV:The Discrete Fourier Transform : Its properties and application , Frequency domain sampling: The DFT, Properties of the DFT, Linear filtering methods based on the DFT, Use of THE DFT in linear filtering ,Filtering of long data sequences, Frequency analysis of signals using the DFT.UNIT V:Introduction to FFT algorithms: Decimation in time - FFT algorithm, Decimation in frequency- FFT algorithm, Quantization effect in the computation of the DFT, Quantization errors in the direct computation of the DFT, Quantization errors in FFT algorithms, DCT.UNIT VI:Design of digital filters: Design of FIR filters based on windows, Design of IIR filters from analog filters, IIR filter design by approximation of derivatives, Impulse invariance, Bilinear transformation, Examples of digital filter designs based on the bilinear transformationText Books:Â§ Digital Signal Processing : Alan V. Oppenheim .W. Schaffer, Pearson Education.Â§ Digital Signal Processing: John G. Proakies and D. Monalkies & D. Sharma, Pearson Education.Reference Books:Â§ Digital Signal Processing , 2nd Edition by E. Pearson Education.Â§ Theory and application of signal processing -Rabiner & Gold (PHI) .Â§ Digital filter design and analysis- Andreas Antonius.77CS3: Elective I:- Computer GraphicsUNIT I:Basic fundamentals of random scan, raster- scan devices and LAD displays. Video Basics , Interactive Devices. Line, Circle, Ellipse drawing techniques and Algorithms.UNIT II:Polygon filling method : Scan Conversion Algorithms: Simple Ordered edge Fill, Fence fill and Edge Fill, Fence fill and Edge Flag Algorithm, Seed fill Algorithms: Simple and Scan Line Seed Fill Algorithm, Antialiasing and Halftoning techniques.UNIT III:2D Clipping algorithms for regular and irregular windows: Sutherland Cohen Subdivision, Mid - Point subdivision , Cyrus Beck and Sutherland Hodgman polygon clipping Algorithm. Clipping about Concave regions. 2D Transformations, Normalized Device Coordinates and Viewing Transformation.UNIT IV:3D System Basics and 3D Transformations, Prarallel and Perspective projections, Hidden line/ surface Removal Algorithms. Rendering- Shading, Ray tracing techniques and Color Systems.UNIT V:Curve generation- Interpolation Technique, B-spline and Bezier curves, Graphics Software Packages- Rules for designing Graphics Package, Segmentation and Display file Compilation.UNIT VI:Graphics Systems- Display Processors, Device Independent Graphics Systems, User Interface Design. Graphics Standard -Basic principles of X-windows, X-terminal.Test Books :Â§ Computer Graphics, Hearn and Baker, Pearson EducationÂ§ Procedural Elements of Computer Graphics III Edition, Rogers, McGraw Hill.Â§ Principles of Interactive Computer Graphics, Newman and Sproull, McGraw Hill.Reference Books:Computer Graphics: Principles and Practice in "C" by J.D. Foley Pearson Education.77CS3: Elective- I:- Real Time Operating SystemsUNIT I :Introduction : Car & driver example, Issues in real time systems, Structure of a Real time systems ,Structure of a Real time system. Hard versus soft real time systems: Jobs & processors, release times, deadlines, timing , constraints, Hard & Soft timing constrains, Hard real time systems, soft real time systems. A Reference model of Real-time systems: processors and resources, temporal parameters of real-time workload, periodic Task model, precedence constraints & data dependencies other types of dependencies, functional parameters, resource parameters of Jobs & parameters of resources, scheduling Hierarchy.UNIT II:Effective release times and deadlines, Optimality and non optimality of EDF & LST, Challenges in validating timing constraints in priority- driven systems, off-line versus on-line scheduling. Clock- driven scheduling, Priority driven scheduling of periodic tasks.UNIT III:Scheduling aperiodic & sporadic jobs in priority-driven systems: Deferrable servers, Sporadic servers , Constant utilization, total bandwidth and weighted fair-queuing servers, scheduling of sporadic jobs. Resource and resource access control : assumption on resources and their usage, effects of resource contention & resources access control, non preemptive critical sections, basic priority- inheritance protocol, basic priority - ceiling protocol, stack- based priority-ceiling protocol, use of priority-ceiling protocol in dynamic-priority systems, preemption- ceiling protocol, controlling accesses to multiple- unit resources.UNIT IV:Model of multiprocessor & distributed systems, Task assignment, Multiprocessor priority- ceiling protocol, Elements of scheduling algorithms for end-to end periodic tasks, Scheduability of fixed priority end-to-end periodic tasks, end-to- end tasks in heterogeneous systems.Programming Languages and Tools: Desired language characteristics, Data typing , control structures, Facilitating hierarchjical decomposition, packages, Run time error handling , Overloading and generics, Multitasking , Lowlevel programming, Task scheduling, Timming specifications, Programming environments, Run time support.UNIT V:Real Time Database: Introduction, Basic Definations, real time vs. general purpose databases, main memory databases, Transaction priorities, Transaction aborts, concurrency control issues, disk schedulinh algorithms, maintaining serialization consistency, database for hard real time systemsReal Time Communication : Introduction, Network Topologies, Contention based protocol, token based protocol, Stop and go protocol, Polled bus protocol, Hierarchical round pro5tocol, Deadline based protocols, Fault tolerant routing.UNIT VI:Fault Tolerance Techniques: Causes of failures, Fault types, Fault detection, Fault and error containment, Redundancy, Data diversity, Reversal checks, Integrated failure handling.TEXT BOOK:Â§ Real- Time Systems: Jane W.S. Liu, Pearson Education.Â§ Real Time System: C.M. Krishna & Kang G. Shin (TMH)77CS3: Elective- I: Fundamentals of MultimediaUNIT I:Multimedia Authoring and Data Representations;Introduction to Multimedia, Multimedia Authoring and Tools, Graphics and Image Data Representations.UNIT II:Color in Image and Video, Fundamental Concepts in Video, Basis of Digital Audio.UNIT III:Multimedia Data Compression: Lossless Compression Algorithms, Run-Length Coding, Variable- Length Coding (VLC), Huffman Coding, Adaptive Huffman Coding, Lossy Compression Algorithms, Quantization, Transform Coding, Discrete Cosine Transform (DCT), Image Compression Standards.UNIT IV:Basic Video Compression Techniques, MPEG Video Coding I-MPEG- I and 2, MPEG Video Coding II- MPEG Video Coding II-MPEG-4,7 and Beyond, MPEG Audio Compression .UNIT V:Multimedia Communication : Computer and Multimedia Networks, Multimedia Network Communications and Applications, Interactive TV (ITV) and Set-Top Box (STB),, Broadcast Schemes for Video-on -Demand, Buffer Management, Further Exploration, Wireless Networks, Multimedia over Wireless Networks, Trends in Wireless Interactive Multimedia.UNIT VI :Multimedia Retrieval: Content - Based Retrieval in Digital Libraries, Minimum three Case studies.Text book :Â§ Fundamentals of Multimedia 1st Edition by Mark S. Drew & Ze- Nian Li, Pearson Education.Refverence Books:Â§ Multimedia Fundamentals, Volume 1: Media Coding and Content and Content processing, 2nd Edition by Ralf Steinmetz, Klara Nahrstedt, Pearson Education .Â§ Multimedia Marking Work (TMH Pub.) by Tay Vaughan.Â§ Advanced Multimedia Programming (McGraw Hill Pub)- Steve RimmerÂ§ Digital Image Processing- Gonzalez and Woods, Pearson Education.77CS4::Elewctive I;- Advanced Computer ArchitectureUNIT I:Models of parallel computer, multiprocessors and multicomputers, multivector and SIMP computers, PRAM and VLSI models conditions of parallelism, data and resource dependencies, grain size and latency, grain packing and scheduling , program flow mechanisms, system interconnect architectures.UNIT II:Principles of scalable performance, performance metrics and measures, speedup performance laws, advanced processor technology, superscalar and vector processors, verified memory organizations, shared memory organizations.UNIT III:Pipeline and superscalar techniques, liner pipeline processors, reservation and latency analysis, collision free scheduling, pipeline schedule optimization, instruction pipeline design, arithmetic pipeline design , arithmetic pipeline design, superscalar and superscalar and superpipeline design.UNIT IV:Multiprocessors and multicomputers, multiprocessor system interconnects, cache coherence and synchronization mechanisms, messing passing schemes.UNIT V:Multivector and SIMD computers vector processing principles, compound vector processing, SIMD computer organizations scalable multithread and dataflow architectures.UNIT VI :Introduction to parallel Programming Models, Parallel Language Constructs ,Elementary theory about dependence analysis, Code optimizations and Scheduling.Books:Kai Hiwang, "Advanced Computer Architecture" McGraw Hill Richard Y.Kausi, "Advanced Computer Architecture" Prentice Hall of India.Advanced Computer Architecture by D. Sima, Fountain & Kacsuk, 1st Edition, Pearson Education.77CS4: Elective-II:-Artificial IntelligenceUNIT I:Introduction: Scope of AI, AI problems, AI technique, Production system Characteristics, Basics of problem solving :problem representation paradigms Defining problem as a state space representation.UNIT II:Search Techniques: Problem size, complexity , approximation and search; depth, breadth and best search; Heuristic Based Search; Heuristic search, Hill climbing, best - first search, branch and bound.UNIT III:Knowledge representation: First order logic, Unification , Resolution in Predicate Logic.Structured Knowledge Representation: Semantic Nets, Frames and Scripts.Learning : Block architecture of learning system, Types of learning, performance Measures.UNIT IV:Uncertainty Treatment: Formal and empirical approaches including Bayesian theory, belief functions, certainty factors and fuzzy sets.UNIT V:Expert Systems: Fundamental blocks, knowledge Engineering, knowledge Acquisition , Need and justification for expert systems, Detailed Discussion form Example Domains- (form)Industry, Language, Medicine, Verification, Vision, Knowledge Based Systems; concept of shells.UNIT VI:Language Machine: Introduction to Natural Language understanding Level of knowledge in NLU, Approaches to NLU, Problems in NLU, Basic parsing techniques.Text Books:E. Rich and Knight, Artificial Intelligence, Tata McGraw Hill, 1990.Introduction to Artifitial Intelligence by E. Charniack and D. Mcdemott, Pearson Education.Artifitial Intelligence structures and strategies for complex problem solving, 4th edition, Pearson education.Stuart Russell and Peter Norving, Artificial Intelligence: A Modern Approach, 2nd edition, Pearson Education.Introduction to Artificial Intelligence & Expert system (PHI Pub)- D.W.Patterson.Reference Books:N.J.Nilsson, " Principles of AI,"Narosa Publ. House, 1990.P.H.Winston, "Artificial Intelligence", Pearson Education, 3rd Edition, 2002.M.N.Hoda, "Foundation Course in Artificial Intelligence", Vikas Pub, 2004.77CS4: Elective:-II:- Enterprise Resource PlanningCourse Modules:ModuleLearning ObjectiveIndicative HoursERP- Curtain RaiserAn overview, Accommodating variety, Integrated Management Information, Seamless Integration, Supply Chain Management, Resource Management, Integrated data model, scope, Technology, Benefits of ERP, Evolution, ERP revised, ERP & Modern Enterprise, problems.6ERP& Related TechnologiesAn overview, Business Process Reengineering(BPR), Management Information System(MIS), Decision Support Systems (DSS), Executive Information System (EIS), Data Warehousing, Data Mining, OLAP.6Business Engineering & ERPAn overview, What is Business Engineering (B.E.)? Significance of BE, Principles of BE, BPR, ERP & IT, BE with IT, ERP and Management concerns, problems.Business Modeling: An overview, Building the Business Model, problems.6ERP Implementation and the Competitive AdvantageAn overview, Role of consultants, vendors & users, customization, precautions, ERP: Post- implementation options, ERP implementation Lifecycle, Guidelines for ERP implementation problems. ERP & competitive strategy, problems.8The ERP Market & Making of ERPAn overview, SAP AG , SAPR/3 Applications, Baan, Oracle, People Soft, JD Edwards, Examples of Indian ERP packages, problems.An overview, Market Dynamics & Competitive Strategy, problems, Future Directions in ERP.8ERP Case StudiesVarious ERP Case studies.6Total40Text Books:Enterprise Resource Planning- Concepts & Practice (Second Edition) By V.K. Garg & N.K. Venkitakishnan (PHI)Enterprise Resource Planning - Alexis Leon (TMH)Reference book:ERP Demystified- By Alexis Leon (TMH)77CS4: Elective- II:- Operating System DesignUNIT I:General overview of the Unix System, Kernel: Architecture of Unix OS, Kernel data structures, system administration. The buffer cache; advantages & disadvantages.UNIT II :Internal representation of files , inodes, structures, directories, super block, allocation of disk blocks, System Calls for the file system in Unix.UNIT III:Processes: States & transitions, Layout of system memory. Context Sleep. Process Control, Process Scheduling and Time.UNIT IV:Memory management policies in Unix. Swapping, demand paging hybrid system. I/O subsystem: drivers & streams.UNIT V:Interprocess Communication : process tracing, system V IPC Network communications, sockets.UNIT VI:Multiprocessor Systems: Problems & solutions with master slave processors. Distributed Unix System.Text Books:Â§ M.J.Bach: The Design of Unix Operating System, Pearson EducationÂ§ A.S. Tanenbaum : Operating System Design & Implementation , 2nd edition, Pearson education D.Comer: Operating System Design (Prentice Hall)SYLLABUS OF VIII SEMESTER B.E. COMPUTER SCIENCE (SEMESTER PATTERN)88CS1: Distributed And Object Oriented Database ManagementUNIT I:Distributed databasesDistributed databases: What and Why? The Distributed Database Management Systems.The Distributed Transparency-the Reference Architecture for Distributed Databases, Data Fragmentation, Distributed Transparency for Read- Only and Applications, Distributed Database Access Primitives, Integrity Constraints in Distributed Databases.UNIT II:Distributed Database DesignFramework for Distributed Database Design, the Database Fragmentation Design, Allocation of Fragments.Translation of Global Queries to Fragments Queries.The Equivalence Transformation for Queries, Transforming Global Queries, Distributed Grouping and Aggregate Function Evaluation, Parametric Queries.UNIT III :Optimization of Access StrategiesFramework for Query Optimization, Join Queries-use of Semi- Join Programs for Join Queries, the SDD-1 Algorithm, the AHY approach, Use of Join as Query Processing Tactic: General Queries-Effect of Commuting Joins and Unions, Methods for the Optimization of General Queries. The Management of Distributed Transaction; Concurrency Control for Distributed Transactions; Architectural Aspects of Distributed Transactions.UNIT IV:Concurrency Control Foundations of Distributed Concurrency Control; Distributed Deadlocks; Concurrency Control based on Timestamps; Optimistic Method for Concurrency Control Distributed Database Administration Catalog Management in Distributed Database, Authorization and Protection. The System R*The Architecture of System R *Compilation. Execution and Recompilation of Queries; Protocols for Data Definition and Authorization in R* Transaction and Terminal Management.UNIT V:The Object Oriented Database Object Oriented Database- What and Why? ; the Object Oriented Database Management Systems; Evolution of Object Oriented Concepts; Characteristics of an Object Oriented Database Data Model; Object Schema; Inter- object Relationships; Late and Early Binding; Similarities and differences between object Oriented Database Models and other Data models.Object Oriented DBMS Architectures; Performance Issues in Object Oriented DBMS; Application Selection for Object Oriented DBMS; the Database Design for an Object Relational DBMS. The Structured Typed and ADTs; Extending the ER Model; Storage and Access Methods; Query Processing; Query Optimization; Design and Architecture of POSTGRES; Distributed Computing in CORBA and EJB.(Practical Implementation in Oracle 8i or Oracle 9i covering both Distributed and Object Oriented Database Features)Text books :Â§ Distributed Database- Principles and Systems: Stefano Ceri, Guiseppe Pelagatti;Tata McGraw Hill; 1985.Â§ Object Oriented Database Systems- Approaches and Architectures; C.S.R. Prabhu; Prentice Hall OF India.Â§ Database Systems- Design, Implementation and Management; Peter Rob, Carlos Coronnel; Course Technology; 2000.Reference:Â§ Principles of Distributed database systems by M.T. Ozsu/ S. Sridhar, Pearson educationÂ§ Database Managements Systems; Raghu Ramakrishnan, Johnaas Gehrke; Tata McGraw Hill; 2000Â§ Fundamentals of Database Systems- Third Edition; Elmasri, Navathe; Addison- Weseley; 2002.Â§ Database- Principles, Programming and Performance; Second Edition; Patrick O'Neil,Â§ Elizabeth O'Neil; Morgan Kaufmann; 2002.Â§ Oracle 8i- DBA Handbook; Loney, Koch; Tata McGraw Hill.5. Oracle9i- The Complete Reference; Tata McGraw Hill- Oracle Press; 2004.88CS2: Computer System Security:UNIT I:Introduction to the concepts of security: need, principles, Type of Attacks, Services, Mechanisms, A model for network security, Encryption model Classical encryption techniques: substitution techniques, substitution techniques, transposition techniques, Rotor Machines, SteganographyBlock ciphers: simplified DES, Block cipher principles, Data encryption standard, Strength of DES, Block cipher design principles, Block cipher mode of operation, Characteristics of advanced symmetric block ciphers.UNIT II:Confidentiality using symmetric Encryption: Placement of encryption function, Traffic confidentiality, Key distribution, Random number generation,Public Key cryptography : Principles, RSA algorithm, Key management , Diffie-Hellman key exchangeUNIT III:Message authrenticanoa &Hash functions: Authentication requirement, Functions, Codes, Hash functions, Security of hash function & MAC's .Hash algorithms: MD5 message digest algorithm, Secure hash algorithm (SHA-I), Digital signatures and authentication protocols: Digital signatures, Authentication protocols, Digital signature standard.UNIT IV:UNIT V:IP security : Overview, Architecture, Authentication header, Encapsulating security payload, Combining security associations, Key management. Web security: Web security considerations, Secure Socket Layer and Transport Layer Security, Secure Electronic Transaction, SHTTP.UNIT VI:Security systems: Intruders , Intrusion detection, viruses and related threats, Firewalls design principles, Trusted systems, Virtual private networks.Text books:Cryptography & Networks Security Principles & Practice (Pearson Education)-William Stallings.Networks Security Essentials Applications & Standards (Pearson Education)- William Stallings.Cryptography and Networks Security by Atul Kahate, Tata Mc. Graw Hill .Reference Books:Introduction to Computer Security by Matt Bishop Pearson education.Security in outing by Pfleeger & Pfleeger Pearson education.88CS3: Elective- III:- Natural Language Processing :UNIT I:Introduction and requirement of NLP, Words and their distribution, PERL, Corpus Processing.UNIT II:Language modeling and Smoothing, Part of speech tagging, Word sense disambiguation. Basic Search algorithms, Blind Graph Search algorithm, Search Space with FSM and CFG, Search space for Bi- grams and Uni- grams, Viterbi Beam Search.UNIT III:Classification and retrieval of information, Syntax parsing.UNIT IV:Clustering Techniques, Machine Translation and Sentence alignment, Document Structure detection , Text normalization: Domain specific tags, Number formats.UNIT V:Methodologies of discourse analysis, Context Sensitive Speech conversion, Text Summarization techniques.UNIT VI:Dialog and Question- Answering, Information Retrieval Vector Space Model- Latent semantic indexing, etc. Information Extraction.Text Books:"Foundations of Statistical Natural Language Processing" by Manning & Schutze.Natural Language understanding by James Allen, Pearson Education."Speech and Language Processing" by Jurafsky & Martin.88CS3:Elective- III: Mobile Computing :UNIT I:Introduction to wireless communication, wireless transmission, frequencies for radio transmission , signal prorogation, multiplexing, modulation, speard spectrum, introduction to cellular system.UNIT II:Medium access control: Motivation for a specialized MAC, SDMA, FDMA,TDMA, CDMA, GSM: System architecture, protocols localization and calling, handover.UNIT III:Satellite systems, Wireless LAN: IEEE 802.11UNIT IV:Wireless LAN: HIPERLAN, BluetoothUNIT V:Mobile Network Layer: Mobile IP, dynamic host, configuration protocol, adhoc networks, Mobile transport layer: Traditional TCP, Indirect TCP, Snoopy TCP, mobile TCP, Transaction oriented TCP.UNIT VI:Security Issues in Mobile ComputingText Books:Â§ Mobile Communication 2nd edition by Jochen Schiller, Pearson educationÂ§ Mobile Computing by Asoke Talukder, Roopa Yavagal (Tata McGraw Hill)88CS3: Elective- III:- Soft Computing:UNIT I:Learning and Soft Computing : Example of Applications in Diverse Fields, Basic Tools of Soft Computing , Basic Mathematics of Soft Computing Learning and Statistical Approaches to Regression and Classification.UNIT II:Single- Layer networks: The Perceptron, Adaline and Least Mean Square Algorithm. Multilayer Perceptrons: The Error Backpropogation Algorithm, The Generalized Delta Rule, Heuristics or Practical Aspects of the Error Backpropogation Algorithm.UNIT III:Radial Basis Networks: III Posed problems and the Regularization Technique, Stabizers and Basis Functions, Generalized Radial Basis Function Networks, Moving Centers Learning, Regularization with Nonaradial Basis Functions,Orthogonal Least Squares, Optimal Subset Selection by Linear Programming.UNIT IV:Fuzzy Logic Systems: Basics of Fuzzy Logic Theory, Crisp and Fuzzy Sets, Basic Set Operations, Fuzzy Relations, Composition of Fuzzy Relations, Fuzzy Inference, Zadeh's Compositional Rule of Inference , Defuzzification, Mathematical Similarities between Neural Networks and Fuzzy Logic Models, Fuzzy Additive Models.UNIT V:Evolutionary Algorithms: Difficulties with Classical Optimization Algorithms, Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming , Multi- Model Function Optimization, Crowding Model, Sharing Function Model.UNIT VI:Non-Elitist Multi- Objective Evolutionary Algorithms: Motivation for Finding Multiple Pareto- Optimal Solutions, Early Suggestions, Example Problems, Vector Evaluated Genetic Algorithm, Vector- Optimized Evolution Strategy, Weight- Based genetic Algorithm, Random Weighted Genetic Algorithm, Predator- Prey Evolution Strategy, Other Methods, Suggestions for Assignments: Implementation of algorithms in 'C/C++/MATLAB'Text Books:Â§ Learning and Soft Computing by Vojislav Kecman, Pearson education.Â§ Multi - Objective Optimization using Evolutionary Algorithms by Kalyanmoy Deb, WSE Willey.Reference Books:Artificial Neural Networks by Robert J. Schalkoff(McGraw Hill)88CS3: Elective III:-Topics In Distributed Systems:UNIT I:Motivation and goals, broad overiew and advantages of distributed systems main characteristics: absence of global clock and state and possibility of large network delays. Issues in distributed systems such as transparency, sclability, security, resource management etc. theoretical foundation- Lamport's clocks Chandy- Lamport Global State algorithm- termination detection.UNIT II:Distributed mutual exclusion - Lamport, Ricart- Agrawal non- token based algorithm- token based algorithm- token based algorithms- comparative performance analysis.UNIT III:Distributed deadlock detection issues- central and distributed detection algorithm- agreement protocols - model of processor failures- Byzantine agreement and other problems- solutions and applications.UNIT IV:Distributed file systems- design issues - case studies with emphasis on NFS- distributed shared memory- coherence and coherence protocols- design issues and case studies.UNIT V:Distributed scheduling- issues, load distributing algorithms- load sharing policies and case studies- task migration and issues.UNIT VI:Recovery : Introduction and basic concepts- backward and forward error recovery, checkpointing: Synchronous and asynchronous- atomic actions and commit protocols- voting protocols-reliable communication- cryptography: private and pubic- implementation issues, RSA algorithm- algorithm- authentication in distributed systems- Kerberos case study.Text Books:Advanced concepts in Operating Systems- Singhal and Shivratri; McGraw HillDistributed Systems- George Colouris, Pearson EducationReference Books:-Â§ Modern Operating Systems - Tanenbaum, Pearson Education.Â§ Distributed Systems: Principles and Paradigmsm, A.S. Tanenbaum, Paerson Education.88CS4: ELECTIVE- IV: Data Warehousing and Mining:UNIT I:The Compelling Need for data warehousing: Escalating Need for strategic information, failures of Past decision- support systems, operational versus decision - support systems, data warehousing- the only viable solution, data warehouse define.UNIT II:Data warehouse- The building Blocks: Defining Features, data warehouses and data marts, overview of the components, metadata in the data warehouse Defining the business requirements: Dimensional analysis, information packages- a new concept , requirements gathering methods, requirements definition: scope and content.UNIT III:Principles of dimensional modeling: Objectives, From Requirements to data design , the STAR schema, STAR Schema Keys, Advantages of the STAR Schema Dimensional Modeling: Updates to the Dimension tables, miscellaneous dimensions, the snowflake schema, aggregate fact tables, fact tables, families of STARS.UNIT IV:OLAP in the Data Warehouse:Demand for Online analytical processing, need for multimensional analysis, fact access and powerful calculations, limitations of other analysis methods, OLAP is the answer, OLAP definitions and rules.UNIT V:OLAP characteristics, major features and functions, general features, dimensional analysis, what are hypercubes? Drill- down and roll-up, slice-and-dice or rotation, OLAP models, overview of variations, the MOLAP model, the ROLAP model, ROLAP versus MOLAP, OLAP implementation considerations, Introduction to OLTP.UNIT VI:Data Mining Basics , What is Data Mining, Data Mining Defined, The knowledge discovery process, OLAP versus data mining, data mining and the data warehouse , Major Data Mining Techniques, Cluster detection, decision trees, memory - based reasoning link analysis, neural networks, genetic algorithms, moving into data mining, Data Mining Applications, Benefits of data mining, applications in industry, applications in industry, application in banking and finance.Text Books:Â§ Data Mining and Data Warehousing and OLAP-Alex Berson and Smith (McGraw Gill Pub)References Books:Â§ W.H.Immon ," Building the operational data store " , 2nd Ed, John Wiley, 1999.Â§ Kamber and Han, " Data Mining Concepts and Techniques", Hartcourt India P.Ltd.2001 3. Paul Raj Poonia." Fundamentals of Dat Warehousing", John Wiley & Sons, 2004.Â§ Sam Anthony ," Data Warehousing in the real world: A practical guide for building decision support systems", John Wiley, 2004.88CS4: Elective- IV:-Grid Computing :UNIT I:Overview. Focuses on grid computing as new computing paradigm for solving complex collaborative problems that require massive resources and infinite CPU cycle. The topics included: Definition of Grid : Basic Building Blocks: Issues in Management of Grid Models: Evolution of Grid Models.UNIT II:Architecture. Deals with grid architecture providing an anatomical look into fundamental system components and their functionalities as well as interactions . Topics: Requirements concerning abstractions, behaviors, resources, connectivity and protocols; Open grid service architectures.UNIT III:Environment. Talks about grid computing environments. Topics; Overview of GCE; Programming models; Middleware for building grid computing environments; Language support (MPI- G, MPI-G2, etc) for grid computing; Meta models for grid programming; Security.UNIT IV:Applications. Delas with case studies, how the global computing infrastructure has become a reality for collaborative complex data intensive computing aid for federated database services, web services, bioinformatics. It will also include among others some selection of topics form Seti project, Sun grid engine Sky sever and some national grid projects.UNIT V:Monitoring and evaluation. It will include following: Monitoring; Scheduling; Performance tuning; Debugging and performance diagnostic issues:UNIT VI:Computational geometry, geometric preliminaries, models of computation.Text Books:Â§ Grid Computing: A research: momograph: D .Janakiram, Tata McGrawhill Publication.Â§ The Grid: Blueprint for a New Computing Infrastructure (2nd edition) by Ian Foster (Editor), Carl Kesselman (Editor) Publisher : Morgan Kaufmann; 2nd edition (November 2003) ISBN: i-558-60933-4.Â§ Grid Computing: Making the Global Infrastructure a Reality by Francine Berman (Editor), Geoffrey Fox (Editor),Tony Hey (Editor)Publisher: John Wiley & Sons; (April 8,2003) ISBN: 0-470-85319-0.Â§ Grid Resource Management : State of the Art and Future Trends by Jarek Nabrzyski (Editor), Jennifer M.Schopf (Editor) , Jon Weglarz (Editor) Publisher: Kluwer Academic Publishers: (September 2003) ISBN: 1-402-07575-8.88cs4: Elective- IV:-Digital Image Processing:UNIT I:Introduction: Introduction, Fundamental Steps in Image Processing, Elements of DIP systems, Element of visual perception.Fundamentals of Image Processing: A Simple Image Models, Sampling and Quantization, Some Basic Relationships between Pixels, Image Geometry in 2D.UNIT II:Image Enhancement in the Spatial Domain: Introduction to Spatial and Frequency Methods, Basic Gray Level Transformations, Histogram Equalization, Histogram Processing, Local Enhancement, Image Subtraction, Image Averaging, Basic of Spatial Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters.UNIT III:Transforms:- Introduction to Fourier Transformation, Discrete Fourier Transformation, Fast Fourier Transformation, Fourier Properties, 2D FT, Inverse Fourier Transform.UNIT IV:Image Enhancement in the Frequency Domain: Filtering in the Frequency Domain, Correspondence between Filtering in Spatial and Frequency Domain, Smoothing Frequency Domain Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering, Implementation. Introduction to Color Image Processing: RGB and HIS color Models.UNIT V:Image Segmentation : Point Detection, Line Detection, Edge Detection, Gradient Operator, Edge Linking and Boundary Detection, Thresholding, Region- oriented Segmentation.UNITVI:Representation: Chain Codes, Polygonal Approximations, Signatures, Boundary Segments, Skeleton of a Region.Description: Boundary Descriptors, Shape Numbers, Fourier Descriptors, Regional Descriptors, Simple Descriptors, Topological Descriptors.Suggestions for Assignments: Implementation of Image Processing algorithms in 'C/C++/MATLAB'.Text Books:Â§ Rafal C.Gonzalez and Richard E.Woods,"Digital Image Prtocessing", 2nd Edition, Pearson Education.Referenc Books:Â§ K.Jain,"Fundamentals of Digital Image Processing", Pearson education.Â§ W.K.Pratt,"Digital Image Processing", 3RD Edition, John Wiley and Sons, New York.88CS4: Elective -IV:-Embedded Systems:UNIT I:An Introduction to Embedded SystemsAn Embedded system, Processor in the system. Other hardware units, Software embedded into a system. Exemplary embedded systems, embedded system-on-chip(SOC) and in VLSI circuit. Processor and memory organization- Structural Units in a Processor. Processor. Processor selection for an embedded system, memory devices. Memory selection for an embedded system, allocation of memory to program cache and memory management links. Segments and block and memory map of a system, DMA. interfacing processors, memories and Input Output Devices.UNIT II:Devices AND Buses For Device Networks1/0 devices. Timer and colmting devices. Serial communication using the "12C" CAN. Profibus foundation field bus and advanced I/O buses between the network multiple devices. host systems or computer parallel communication between the networked 1/0 multiple devices using the ISA.PLC PCI-X and advanced buses.UNIT III:Device drivers and interrupts servicing mechanism devices, parallel port and serial port device drivers in a system, devices drivers for internal programmable timing devices, interrupt servicing mechanism.UNIT IV:Programming concepts and embeddedsTotal TotalMicroprocessor Architecture, Programming and Application with 8085/8080 By R.S.Gaonkar, Wiley Eastern Ltd.The 8051 Microcontroller & Embedded Systems. By Mazidi, Pearson Education.The 8051 Microcontroller, Architecture, programming & applications, second edition by K.J.Ayala Penram International.Microcontrollers; Architecture, Programming, Interfacing & System design by Rajkamal, Pearson Education.The 8 bit microprocessor & Microcontroller by V.J.Vibhute.Â· SSSSSÂ·Â·Â·Â· Text books:Â·Â·Â· TEXT BOOKS:Â·Â·Â· TEXT BOOKS:Â·Â·Â·Â·Â·Â·

How many houses can be powered by one hydro dam?

Add your answer:

Are dams helpful or harmful?

What are alternative ways of getting energy?

How does networking improve the usefulness of computers?

What is the syllabus of 8th sem computer eng in rtmnu?

How many-houses can be powered by one hydro dam?

When was the first hydro dam built?

What kind of dam is the Three Gorges Dam?

How many watts of electricity does a hydro electric dam produce?

Is their a river dam?

When was Wellington Dam Hydro Power Station created?

What is hydro- electric?

Is idukki dam a hydro electric project dam?

What is A Hydro Dam?

What are some disatvantages of water energy?

What is the biggest hydro electric dam?

Can you take an already existing hydro dam and expand it?

Resources

Top Categories

Product

Company