THIRD SEMESTER

Lectures-3 Tutorial-1 Credits-4

HUM-201 ENGINEERING ECONOMICS & BUSINESS ORGANIZATION Unit I : Introduction to Economics Introduction to Economics, its importance, principles, approaches and use of study, Engineering and economics, Economic problems, economic good and wealth, demand and supply, competition, monopoly, theory of firm, money and its function, theory of money and choice, the bank and iys functions, employment and income, gross national product, net national product consumption, savings and investment. Unit II : Features of Indian Economy-I Broad features of Indian Economy, Natural resources and economic development, Infrastructure in the Indian Economy, Agriculture development, green revolution, population, population theories, unemployment , poverty and balance regional development. Economic growth and economic development , Indian industries, industrials policy, industrialization in India, role , plan and pattern of Industrialization, public vs practice sectors, economic reforms in India, India’s five year plans. Unit III : Features of Indian Economy –II The indigenous and modern banking system in India, reserve bank of India, monetory and fiscal policies, financial institutions and SEBI, free trade protection, India’s foreign trade and WTO, balance of payments, Indian currency system and foreign exchange, foreign capital investment , foreign aid and FEMA. Unit IV : Introduction to Business Organization –I Concept , nature and scope of business, business and its environment, profit maximization vs social responsibility of business, business ethics, business enterprise, entrepreneurship, promotions, types and functions, stages in company formation, concept of business growth, rationale and types of growth , rationale and types of growth strategies, joint venture-definition, scope, role and problems of small business, concepts and features of public enterprise, multinationals. Unit V : Introduction to business Organization –II Time value formoney, simple and compound interest , annuity , depreciation, definitions, characteristics, life and salvage value, method of proving for depreciation, relationship between depreciation, repairs, renewals, depletion cost, replacement , amortization and present worth. Books :1.Economics of Development & Planning 2. Engineering Economics 3. Economics 4. Business Organization

Agraeal & Lal, Vikas Pub. Tarachand Samualson Shukla

BI-201 - Discrete Structures
Lectures-3 Tutorial-1 Credits-4

Propositional and predicate calculus: Logic Propositions and logical operations truth tables and proposition generated by a set equivalence and implication. The laws of first order predicate logic, mathematical systems. Fuzzy sets, operations on fuzzy sets, Fuzzy Relations, properties and operations on fuzzy relations. Relations : definitions, graphs of relations, properties of relations, matrices of relations, equivalence relations, Posets, Lattices , Complemented Lattices, Sub lattices. Distributive and Modular lattices. Boolean Algebra. Graph Theory: Notions & terminology, directed and undirected graphs, incidence and degrees, Sub-graphs, Walks paths, cycles, circuits, components, connectedness algorithms, shorter path algorithm. Euclidian and Hamiltonian graphs, The traveling Salesman Problem, Trees: Spanning trees, rooted trees and binary trees. Discrete numeric functions, Generating functions, Recursion and recurrence relation, many faces of recursion, sequences solving a recurrence relation including nonhomogeneous finite order linear relations. Coding Theory, Binary symmetric channel, Coding Process, decoding, error detection and correction codes. Vector Spaces : Linear Independence, bases, Subspaces, dimensionality, Linear mapping, linear in-equality, inner products, norms. TEXT BOOK : Applied Discrete Structures for Computer Science by A Doerr and K Levasser. Reference Books : 1. 2. 3. 4. 5. Discrete Mathematical Structures for Computer Science by B Kolman & R.C. Busby. Discrete Mathematical Structures with Application to Computer Science by J.P.Trembley & R.P.Manohar. Graph Theory by F.Harary. Elements of Discrete Mathematics by C.Liu. Graph Theory with Application to Computer Science by N.Deo.

BI-202 - Microbiology Lectures-3 Tutorial-1 Credits-4

Introduction and historical perspective -Discovery of the microbial world, controversy over spontaneous generation, role of microorganisms in transformation of organic matter and in the causation of diseases, development of pure culture methods, enrichment culture methods. Methods in Microbiology -Principles of microbial nutrition, Culture media, Theory and practice of sterilization, Pure culture techniques, Enrichment culture techniques for isolation of chemoautotroph, chemoheterotrophs and photosynthetic microorganisms. Prokaryotic structure and function -functional anatomy of bacteria: cell envelope, cell wall, cytoplasmic membrane, capsule, surface appendages, cytoplasm and cytoplasmic inclusions. Microbial nutrition and growth -The definition of growth, mathematical expression of growth, growth curve, measurement of growth and growth yields, synchronous growth, continuous culture, culture collection and maintenance of cultures. Overview of basic metabolism and microbial nutrition Metabolic diversity among microorganisms -Photosynthesis in microorganisms; Role of chlorophylls, carotenoids and phycobilins; Calvin cycle; Chemolithotrophy; hydrogen- ironnitrite- oxidizing bacteria; nitrate and sulfate reduction; methanogenesis and acetogenesis; Fermentations diversity, nitrogen fixation. Books & References 1. General Microbiology by R.Y. Stanier, J.L. Ingraham, M.L.Wheelis and P.R. Painter. Publisher : Macmillian 2. Microbiology VI Edition by M.J. Pelczar, E.C.S. Chan and N.R. Kreig. Publisher : Tata McGraw Hill 3. Principles of Microbiology by R.M. Atlas. Publisher Wm C. Brown Publisher. 4. The microbes – An Introduction to their Nature and Importance by P.V. Vandenmark and B.L. Batzing. Publishers : Benjamin Cummings. 5. The Microbial World by Roger Y. Stanier. Publisher : Prentice Hall 6. Microbiology by Tortora, Funke and Chase. Publisher Benzamin & Cummings 7. Principles of Fermentation Technology by Salisbury, Whitaker and Hall. Publisher : Aditya Books Pvt. Ltd. 8. Industrial Microbiology by Casida. Publisher : New Age International 9. Industrial Microbiology by Prescott and Dunn. Publisher : C.B.S. Publishers

BI-203 - Biochemistry Lectures-3 Tutorial-1 Credits-4

Introduction, aims and scope Chemical foundations of Biology -Properties of water, acids, bases and buffers, covalent bonds, Non-covalent interactions in biological systems. Introduction to biomolecules - Carbohydrates -Sugars; Polysaccharides; Glycoproteins -structure and function. Vitamins and Coenzymes Lipids classification, structure and function. Lipids and biological membranes, Transport across cell membranes; Lipid linked proteins and lipoproteins. Proteins -Amino acids and peptides -classification, chemical reactions and physical properties. Introduction to protein structure and function. Enzymes - Introduction to kinetic and catalytic mechanisms of enzymes; Regulation of enzyme activity; Effects of physical parameters on enzyme activity. Nucleic acids -nitrogenous bases, nucleotides, types, structure and properties of nucleic acids Separation techniques for biomolecules. Metabolism and bioenergetics -First and second law, free energy and chemical equilibrium, Organic reaction mechanisms, Design of metabolism -concept of t:1Go, ATP-ADP cycle. Cellular energy transactions -role of mitochondria and chloroplast Carbohydrate metabolism -glycolysis pathway and reactions, Glycogen breakdown and synthesis, control of glycogen metabolism, glycogen storage and its disease Citric acid cycle -Overview, Metabolic sources of Acetyl Co-A, enzymes and regulation, The amphibolic nature of the Citric acid cycle Electron transport chain and oxidative photophosphorylation -mitochondrion and electron transport, phosphorylation and control of ATP production Gluconeogenesis, The glyoxylate pathway, Biosynthesis of Oligosaccharides and glycoproteins, Pentose phosphate pathway Books & References 1. Cellular Biophysics I & II by Thomas F. Weiss 1995, Publisher : MIT Press 2. Biochemical calculations by I.H. Segal. Publisher : John Wiley and Sons 3. Biochemistry by C.K. Mathews, K.E. Van Holde and K.G. Ahern. Publisher: Benjamin / Cummings. 4. Devlin’s Textbook of Biochemistry with Clinical correlations. Publisher : John Wiley and Sons Inc. 5. Principles of Biochemistry by A.L. Lehninger, D.L. Nelson, M.M. Cox. Publisher : Worth Publishing 6. Harper’s Biochemistry by K. Robert, M.D. Murray, D.K. Granner, P.A. Mayes and V.I. Rodwell. Publisher : McGraw-Hill/Appleton and Lange. 7. Biochemistry by L. Stryer. Publishers : W.H. Freeman and Company 8. Tools of Biochemistry by T.G. Cooper. Publisher : John Wiley and Sons Inc.

operation and application of Stacks.Definition and concepts storage representation and Manipulation of Binary tree conversion of general tree to Binary trees. Static and Dynamic storage. Hash table methods. B tree. Bubble sort Merge sort quick sort. procedure. Trees . circular linked list. String Manipulation and Pattern matching Markov Algorithm Primitive and composite function. Data Structure . Priority Queue definition concepts operation and application of Queue. Linear data structures . Sub-algorithm function. shortest path algorithm. 4. Shell sort. Multi-linked structure. Search trees. call by ref. Queue. Introduction to Algorithm analysis for time and space requirement. Searching-Sequential search. parameter passing call by value. Poly phase and Oscillating sorting. Threaded Binary tree. Internal Sorting External sorting . parameters. 2. sparse matrices. Primitive data structure. Tape sorting. Binary search. Abstract Data Types. Non-linear data structures . Height balance tree. string manipulation Application .Concept and Technology of Storage structure of arrays row major column major Stacks Definition.Pointers and linked allocation concepts and operations on singly linked list.BI-204.Tremble & Sorenson Data Structure in `C’ Language : by Tanenbaum Data Structure by Bhagat Singh Data Structure by Horowitz & Sohani . concepts. BOOKS : 1. Dqueue. Multiple precision arithmetic. doubly linked lists Associative list Application of linked linear list.Text handling only.Selection sort. (taking best case/worst case examples) sorting on Disk. Multi weight tree. Polynomial Manipulation. B+ tree. graph and their representation Matrix representation of graph Breadth first and depth first search. Recursion and Polish notations. 3.Data Structure & Algorithm using ‘C’ Lecture – 3 Tutorial – 1 Credits-4 Introduction to data structure. Rate of growth and Order of notation Basic time and space analysis of an algorithm. radix sort.

secondary databases. biological classification and nomenclature. internet packages specializing in DNA and protein analysis. Bioinformatician and bioinformaticist. Building a sequence search protocol. protein and genome information resources. European molecular biology network. chronological history of Bioinformatics. Importance of bioinformatics. softwares and comprehensive packages. Computer Science.K. role. web browsers. Introduction to Bioinformatics – Arthur M. Fundamental Concepts in Bioinformatics – Krane and Raymer . national centre for biotechnological information. analysis packages. homology and analogy. human genome project and its status. need and importance of Biology. DNA sequence analysis. The dawn of sequencing. practical approach for structural and functional interpretation. commercial databases. Attwood and Parry Smith 2. BOOKS: 1. the biological sequence or structure deficit. life in space and time.Introduction to Bioinformatics Lecture – 3 Tutorial – 1 Credits-4 Introduction. information networks. introduction to analysis package. future scope of Bioinformatics. mathematics and information technology in bioinformatics. specialized genomic resources.BI-205 . Introduction. Bioinformatics in business. Lesk 3. Objectives of Bioinformatics. evolution of Bioinformatics. multiple alignment techniques. pairwise alignment techniques. Introduction to Bioinformatics – T.

Solution of Non-linear equations. BOOKS: 1. B. Jain & Iyengar: Numerical Methods for Scientists & Engineers . Khanna Publications.K.Numerical Techniques Lecture – 3 Tutorial – 1 Credits-4 Newton forward and backward formulae. Grewal : Numerical Algorithms. Monte Carlo methods of integration. Lagrange’s. GaussSiedel and Gauss-Jacobi iteration techniques. 2. Lin-Barstow’s and Graffe’s method for complex roots. Gauss-Legendre.S. Newton’s method for multiple roots. Everett and Bessel Interpolation formulae. Differential Equations: Modified Euler. Runge-Kutta methods. Invertion of Matrix by Cholesky’s method. Non-linear Equations: Solving simple non-linear equations. Predictor-Corrector methods. Programs of simultaneous and non-linear equations. Solution of algebraic and transcendental equation: Newton-Raphsan method. Integration: Weddle. Accuracy of Runge-Kutta and Milen’s methods. Hermite and spline interpolation. Krishnamutrhy & Sen : Numerical Algorithms EWP. 3.FOURTH SEMESTER MTH-251 . Simultaneous Equations: Gauss elimination and Pivot. Implementation of these method in C. M.Milne Adams-Bashforth methods.

shadow paging. Coronel. . Web interface to database. Integrity. Entity relationship diagram : Basic and Advance concepts Application of ER diagram in designing database system. validation technique. Referential. Normalization 1NF. DCL. BCNF and 5NF. Data `Models. Ullman. Multi-version scheme Insert and delete operation. functional dependency. Tuple Relational Calculus SQL. Crash recovery. 4NF. testing. (ii) Database System By Aho. Time stamp protocol. Korth ABRAHAM SILBER SCHATZ REFERENCE BOOK: (i) Database System Concept By C. Query processing and Query optimization and Embedded and Dynamic SQL Database design issues. Triggers. Multidatabase system. commit protocol Deadlock handling. Different type of file organization.BI-251 . serializability. Log based recovery. buffer management checkpoints. Parallel database concept and related issues. 2NF. TEXT BOOK: Database System Concept By Henry F. live database design problem. Schedules. Security and Integrity: Security and Integrity: Use of SQL for specifying Security and integrity. Multiple granularity. Design transparency and Autonomy. Storage structure indexing and hashing. Authorization. Object oriented databases Distributed database structure. Distributed Query processing Recovery. Encryption. Assertions.J. Relational Algebra. Lock based Protocol. DDL and structure of Data Base Management System. (iii) Database Systems By Rob. view. Transaction & concurrency control.DATA BASE MANAGEMENT SYSTEM Lecture – 3 Tutorial – 1 Credits-4 Introduction to database: Data Abstraction. QUEL. Domain relational calculus. Date. Domain constraints. Basic concepts of database: Data Independence DML. 3NF. Database System Architecture.

Multidimensional Dynamic Programming. Pairwise Alignment . Parameter Estimation for HMMs. Eddy. Rhodes. Scoring a Multiple Alignment. Durbin. Introduction. Krogh. Multiple Sequence Alignment Methods . Phylogenetic distances. More Complex Marcov Chains. An Introduction. An Introduction to Probability.BI-252 – Biological Sequence Analysis Modeling Molecular Evolution. multiple Alignment by Profile HMM Training. Conditional Probabilities. Hidden Marcov Models. Alignment algorithm. Dynamic Programming with more Complex Models. References: Fundamental Concepts in Bioinformatics – Krane and Raymer. Mitchison.K. G. Matrix Models of Base Substitution. Introduction to Bioinformatics – T. Heuristic Alignment Algorithms. S. Linear Space Alignment. By R. Mathematical Models in Biology. Background of DNA. Attwood and Parry Smith. numerical Stability of HMM Algorithms. The Scoring Model. HMM Model Structure. . Marcov Chains. Marcov Chains and Hidden Marcov Models. A. Allman and John A. By Elizabeth S. Biological Sequence Analysis. Progressive alignment Methods. What a Multiple Alignment Means.

Growth and Decay model examples. fixed time stop versus event to event model. analog methods. BOOKS: 1. SIMULA. probability concepts in simulation. Model Type. feedback system. analog computers.PHI . languases. block-structured continuous simulation languages. Simulation languages. simulation of an interactive system. Simulation of queuing systems. measures of queues. service times. factor in selection of a discrete simulation language. Gordan – Simulation and Modeling . static physical model. continuous and discrete simulation languages. stochastic variable generation. Discrete system simulation. stochastic activities. hyper-exponential distribution. 2. real time simulation. differential equations.Narsingh Dev . continuous system simulation. exponential distributions.BI-253 .PHI. random number generations and their testing. CSMP III hybrid simulation. system modelling. Continuous systems models. Poisson arrival pattern. dynamic and probabilistic models. hybrid computer. arrival pattern. simulation of a single-server queue. GPSS. analog simulations. continuous and discrete simulation. Principles of Mathematical modeling.Modelling and Simulation Lecture – 3 Tutorial – 1 Credits-4 System Models : Concept. environment. SIMSCRIPT. normal distribution. System simulation and modelling .static.

Cn3D. 2. Clustal W. evolutionary basis for sequence alignment. progressive alignment methods. Methods of optimal alignment. BLAST. PHI-BLAST & PROBE etc. multiple sequence alignment (MSA). Bioinformatic Tools – Genscan. Comparing a sequence against a database. tools and applications of MSA. Needleman and Wunsch dynamic programming algorithms. motifs & patterns. FASTA. . Scoring matrices for similarity search PAM. alignments presentation methods. Biojawa – Tisdall and James.BI-254 .. space efficient sequence alignment. practical aspects of MSA. MOLSCRIPT etc. Oligo. Algorithms & Tools for Bioinformatics Lecture – 3 Tutorial – 1 Credits-4 Sequence comparison. Biojava. BioXML etc.Languages. The comlete reference –Java2. longest common subsequence problem. Smith Waterman. method of sequence database similarity search. Rasmol. sequence alignment. alignment with gap penalties. Programming languages – Java. Sequence similarity search. and other methods for comparing databases of sequence and patternsPSI-BLAST. Phylip. Patrick Naughton et al. BLOSUM etc. distance and similarity. computational models for sequence analysis. BOOKS: 1. HTML. ALSCRIPT.

An Introduction. Diffusion of Drugs. Allman and John A. 2.BI-255 . Population in Natural and Laboratory Environments. Control of an Epidemic. Oxygenation and Deoxygenating of Blood. Further Discussion of Basic Model for Inheritance of Genetic Characteristics.J. Trans-Capillary Exchange. Epidemic Models. Models for Genetic Inbreeding Pharmaco-Kinetics. By J. Mathematical Biology. Temperature regulation in Human Subjects. General Deterministic Models with removal and Immigration. D. 3. By Elizabeth S. Stability Analysis Interacting Population with Predation. Curve Fitting and Biological Modeling. Fitting curves to Data. Fung Bio-Fluid Mechanics: By F. Bio-Diffusion. Kapur Mathematical Models in Biology. Basic Models and Their solutions. Text Books: 1. Murray Mathematical Models in Biology and Medicine. 8. N. Rhodes Linear Models in Biology (Pharmacy): By Cullen Bio-Physics Bio-FluidDynamics : By F. 5. C. . Compartmental Models in terms of System of Differential Equations. Models in Genetics. Deterministic models with and without Removal. Basic models for Inheritance. Stochastic Epidemic Model without removal. Intoxicants and Nutrients.Biomathematics Lecture – 3 Tutorial – 1 Credits-4 Growth and Decay Models in Biological. The Method of Least Squares. Fung Introduction to Mathematical Biology: By Rubinov. Models for Genetic Improvement: Selection and Mutation. C. 6. 7. Cardio Vascular Flow Patterns. 4. Polynomial curve Fitting.

(v) Introduction to operations Research. Job sequencing : Processing n jobs through 2 machines. simplex Method. Walk’s Path and Circuits . Degree . applications. Model . Exponential process. network diagram representation. to reduce size of game. Assumptions of Linear Programming. Isolated Vertex .Adjacency Matrix. Degeneracy. Dominance.E. Model -II General Erlang Queuing model.D. SubGraph .DPP Algorithms. Introduction to operations Research . & Algorithm Assignment Problem. PERT – CPM: introduction.Optimization Techniques and Graph theory Lecture – 3 Tutorial – 1 Credits-4 Linear Programming. Dual Simplex Method. Poisson process. Hamiltonian Paths and Circuits. Hungarian Method & its Algorithm.III (M/M/1) : (N/FCFS).A Computer Algorithm Approach. Mathematical Model. 7/e by Hillier. Processing n jobs through 3 machines & Algorithms. Transportation Problem. Chromatic numbers Games Theory : solution of games with saddle points. S. Determination of the critical path. Sharma Operations Research. Incidence Matrix. Pendent Vertex . Branch and Bound techniques. Graphical method. Model I (M/M/1) : (∝/FCFS). Applications in linear programming.Shortest path algorithms . Colouring . optimal subdivision problem.Chand & Co. Meerut (ii) P. (iv) Gillet.IV (M/M/S) : (∝/FCFS).Gupta & D. Dynamic Programming Approach. Undirected Graph.S. Graph Theory : Finite and Infinite Graphs : Basic concepts Incidence . Algorithms. Dynamic Programming:. Model . updating.FIFTH SEMESTER BI-301 .K.Directed Graph . S. Integer Programming :. . Disconnected Graphs and Components. TMH. Connected Graph . solution of (mxn) game by simplex method & Algorithms. B. Applications. McGraw Hill. Path and Circuits : Isomorphism . classification of queuing models. Decomposition. TEXT BOOKS : (i) S. Kedarnath Ramnath & Co. Minimax-Maxmin principle for Mixed strategy games. Null Graphs . Duality. Transient and steady state distributions in queuing system.Gomorra’s method.Bellman’s Principle of optimality. Euler’s Graphs . (iii) Kantiswaroop Operations Research. Queuing Theory : Queuing problem and system.Hira Operations Research. Integer Programming Algorithm.Chand & Sons.

4. resources. Analysis Modeling – elements of analysis model. area analysis. specification. landscape. PHI 3. 2. three feasibilities. A Leon & M Leon. Software qualityMcCall’s quality factor. management spectrum. risk projection. models. R. domain engineering building reusable components.Software design and engineering. FURPS. measures of reliability. validation testing. unit and integration testing. review Design Concepts and Principles. Software Testing Methods.Software Engineering Lecture – 3 Tutorial – 1 Credits-4 Software characteristics. transaction mapping. Effective modular design. scheduling. Design Methods. interface design and guide lines. prototyping. design process. data dictionary. selecting tasks. economics of reuse. S/W process models.Software Engineering. Object-Oriented software engineering. prototyping. architectural design & process. Object-oriented analysis. Test case design.Fundamentals of s/w engineering.Software Engineering. principles. basic path testing. System engineering : Hierarchy. Soummerville. Design steps. make buy decision. control testing. SQA plan. P. reuse process. data modeling. reviews. Quality assurance – meaning. refinement. Object-oriented testing. monitoring and management Project Scheduling and Tracking – Basic concepts. Analysis Concepts – requirement analysis. Jalote. system design process.A Practitioner’s Approach Mc GrawHill. TEXT BOOKS: 1. evolutionary models.Software Engineering. strategy planning.Data design. risk identification. Risk Management – S/W risks. black-box testing.Management of Object-oriented software projects. Narosa. decomposition techniques. concepts. movement. principles. unit testing. Vikas. components. product engineering. criteria for completion testing. formal methods. Framework for software matrices.BI-302 . Software Project Planning – objectives. task set for s/w project. task data and resource management. Pressman. project estimation. RAD.Testing OOA and OOD models.Fundamentals. Testing strategies-strategic approach. object-oriented design. transform mapping. white box testing.issues. Software Reuse management issues. functional modeling. system testing. behavioral modeling. project plan. . empirical estimation models. domain analysis. scope.

Basic concepts of database: Data Independence DML. Transaction & concurrency control. Ullman. Tuple Relational Calculus Database design issues. Relational Algebra.J. Different type of file organization. Normalization 1NF. Nucleic acid sequence data banks: Genbank. Distributed database structure. view. TrEMBL. Design transparency and Autonomy. Object oriented databases. 2NF. Authorization. Database System Architecture Introduction to biological databases. Parallel database concept and related issues. serializability. DDL and structure of Data Base Management System. database design problem.BI-303 . Web interface to database. Protein sequence data banks: NBRF-PIR. Entity relationship diagram: Basic and Advance concepts Application of ER diagram in designing database system. 4NF. Encryption. Crash recovery.Biological Databases and their Management Lecture – 3 Tutorial – 1 Credits-4 Introduction to database: Data Abstraction. Multidatabase system. Date. REFERENCE BOOKS: (i) (ii) (iii) Database System Concept By C. testing. nucleotide sequence databank. validation technique. DCL. Signal peptide data bank etc. cDNA databanks. 3NF. Data `Models. EMBL. Multi-version scheme Insert and delete operation. Multiple granularity. Security and Integrity: Use of SQL for specifying Security and integrity. commit protocol Deadlock handling. rRNA data bank. buffer management checkpoints. Lock based Protocol. Schedules. BCNF and 5NF. GenPept. Database System By Aho. SWISSPROT. Time stamp protocol. Log based recovery. Coronel. Storage structure indexing and hashing. DDBJ. Database Systems By Rob. . Distributed Query processing Recovery. AIDS Virus sequence data bank. shadow paging.

. phylogenetic trees. Methods of phylogenetic analysis like distance matrix. unweighted pair group method with arithmetic mean (UPGMA). relationship of Phylogenetic analysis to sequence alignment.BI-304 . maximum likely hood method. Mount 2. sequence alignment based on evolutionary model. concept of evolutionary trees. Molecular Evolution and Phylogenetics – Nei and Kumar. comparison of open reading frames by distance methods. genome complexity and Phylogenetic analysis. correcting of distances between nucleic acid sequences for multiple changes and reversions. Fitch and Margoliash method. choosing an outgroup. Reliability of Phylogenetic predictions. Bioinformatics – Sequence and Genome analysis By David W. maximum parsimony method. Books: 1. problems and complications from Phylogenetic analysis. neighbour-joining method and character based methods. jumbling sequences. automated tools for Phylogenetic analysis. comparison of protein sequences and protein encoding genes. Converting sequence similarity to distance scores. evaluation of phylogenetic methods. bootstrapping and jack knife replicates.Computational Phylogenetics Lecture – 3 Tutorial – 1 Credits-4 Introduction to trees.

computational proteomics. proteins . eavesdropping on the transmission of genetic information. peptide sequencing. Genome rearrangements. Gelbart. protein classification. expected reversal distance.BI-305 – Computational Genomics & Proteomics Lecture – 3 Tutorial – 1 Credits-4 Genes. Single nucleotide polymorphisms (SNPs). genetic diversity in anthropology. genomes of Eukaryotes. Miller . the breakpoint graph.Jeffery H. Evolution of genomes. New York. signed permutations. genomes of Prokaryotes. comparative genomics of Eukaryotes. Genome information resources. spectral alignment of peptides. genomes of Saccharomyces cervisiae (baker's yeast). the genome of the archaeon Methanococcus jannaschii. Different types of structures of proteins. duality theorem and genomic distance. Computational Molecular Biology – An algorithmic approach – Pavel A. Drossophila melanogaster (Fruit fly). genomes. the genome of the simplest organism Mycoplasma genitalium. the genome of Homo sapiens (human genome).William M. algorithm for sorting by reversals. spectral convolution. specialized genomic resources. interleaving graphs and hurdles. tools for proteome analysis. the genome of the bacterium Escherichia coli. horizontal gene transfer. Caenorhabditis elegans. peptide identification problem. methods of structure prediction (known folds and unknown folds). mapping between the maps.F. Arabidopsis thaliana etc. transforming men in to mice. Griffiths. Bioinformatics – A practical guide to the analysis of Genes and Proteins – Baxevanis and Fancis Ouellette. 2. picking out genes in the genomes. Wiley Interscience. genetic diversity and personal identification. protein coding genes. Modern Genetic Analysis :Integrating Genes and Genomes . proteomes. repeat sequences. genome analysis. different structural proteins. Pevzner 3.AnthonyJ. prediction of protein functions. genetic analysis of cattle domestication. Proteome analysis. BOOKS: 1. high-resolution maps.

Data warehouse implementation. data reduction. processing of OLAP queries. Discretization and concept Hierarchy Generation. web mining. classifier accuracy. Data preprocessing. M.H. data integration and transformation. Analytical characterization. definition. . multidimensional data models and different OLAP operations. 5. Mining class comparisons. Mining Association Rules in large databases: Association rule mining.Murray. John Wiley & Sons 2. MOLAP and HOLAP. fact and dimension data. Types of Data Mining. Data warehouse architecture.Inmon. OLAP Server: ROLAP. I Azramson & Ben Taub. Data Mart. TMH Oracle 8i Building Data Ware Housing by Michall Corey. Temporal and spatial data mining.H. partitioning and hierarchical methods. partitioning.K. Multi level association rules from transaction DBS. classification based in association rules. Whiffen (Morgan Kanffmen) 6. Data Mining Concepts & Techniques by Jiawei Han & Micheline Kamber. Data Mining Techniques by A. Classification and Prediction : Classification by decision tree induction. indexing OLAP data. star. single dimensional Bookan association rules from Transactional DBS.Data Mining and Data Warehousing Lecture – 3 Tutorial – 1 Credits-4 Need for data warehouse. vertical partitioning. Back propagation. Harcourt India PVT Ltd. Constraint based association mining. Designing fact tables. Bayesian classification. Wong 7.Abbey. clean and transform data. Mining descriptive statistical measures in large data bases. 4. Data Ware Housing with oracle by Sima Yazdanri & Shirky S. Pearson Education. partitioning strategy – horizontal partitioning. Pujari . Cluster analysis. Data Mining. Prediction. multidimensional association rules from relational DBS and DWS. Text Books: 1. goals of data warehouse. Correlation analysis. extract and load process. Building Data Ware House by W.BI-306 . data generation & Summarization based characterization. Architectures of data mining. Anahory and D. Practical Machine Cearing tools & techniques with Java by I. efficient computation of data cubes. Denrity based methods Grid based methods. University Press. Data Mining query language. ASIA 3. Data warehouse and OLAP technology. Data warehousing by S . Data mining primitives. snowflake and galaxy schemas for multidimensional databases.

sequence correlations. dynamic programming. evolutionary and genetic algorithms. size and structure. stochastic grammars and linguistics. Bayesian modelling. applications of grammars to biological sequences. Bioinformatics – Machine learning approach by Baldi & Brunak 2. Introduction to neural networks. Markov chain.Machine Learning Lecture – 3 Tutorial – 1 Credits-4 Foundation of pattern recognition. prediction performance evaluation. BOOKS: 1. Biological data in digital symbol sequences. Bayesian inference and induction. likelihood and basic algorithms. Probabilistic graphical models in bioinformatics. probabilistic modelling and inferences. Machine learning foundation. information content recognition of biological sequences. sequence encoding and output interpretations. statistical mechanics. Statistical methods in Bioinformatics: an introduction – Ewens and Grant. substitution probabilities and evolutionary rates.SIXTH SEMESTER BI-351 . genomes diversity. backpropagation. Hidden Markov models. applications of HMMs. . probabilistic models of evolution. optimal trees and learning. machine learning algorithms. gradient descent.

Overview. Type of networks. Error detecting codes. Internetworking: How network differ. IP address. choke packets. IEEE standard 802 for LANs and MANs: Ethernet. socket implementations. token bus. Novel Netware. Traffic shaping. Error detection and correction. Unix Domain Protocols. Davis. 802. Example networks: The Internet. services primitives. Satellite versus fiber. interface and services. fragmentation. token ring. Network layer in the Internet: IP protocol. Design. Network software: protocol hierarchies.5. 802. shortest path.4. Error control. Local Area Networks by KeiserWindows Network Programming by R. firewalls. digital. multiple access protocols: ALOHA. connectionless internetworking. socket-address. Window NT. simplex stop and wait. types of services. TCP/IP reference model. comparison of 802. simplex protocol for noisy channels. The Data link layer Design issues: services provided. limited contention. Twisted pair. Reference models: The OSI reference model. subnets. collision free. Computer Networks by A. BGP. etc. Transparent bridges. Davis. Network Layer : Design issues. flow control. fiber optics. I/O asynchronous & multiplexing. issues for the layers. wireless transmission. prevention. Computer Networks by Leon & Garcia 2. broadcast. socket-system calls. Network Programming : Basically Sockets : Overview. PHI 4.x and 802. telnet. hierarchical. email.S. High speed LANs. Base band / broadband coaxial cable. passing file descriptions. sliding window protocols: one bit. reserved ports. carrier sense. Internet organization of network layer.BI_352 . OSPF. Analog. Rating algorithms: optimality principle. TEXT BOOK: 1. Add Wesley 3. wireless LAN. Elementary data link protocols: Unrestricted simplex. congestion control algorithms: General principle. FTP. Medium access sub layer : Static/dynamic channel allocation in LANs and MANs. Tunneling. Tanenbaum . DLL in the Internet. selective repeat..bared.COMPUTER NETWORKS Lecture – 3 Tutorial – 1 Credits-4 Use of computer networks. Error correcting codes. Bridges: bridges from 802. Physical layer: Transmission media: magnetic media. Flow . Transmission and switching. Unix Network Programming by S. go back n. load shading etc. multicast. framing. Terminal handling. ISDN system architecture. Unix Domain Protocols. flooding. internetworking.y.3.

transposons. Applications of genetic engineering. labeling of nucleic acids. southern and northern blotting. vectors used in genetic engineering. primer extension. in vivo expression techniques. BOOKS: 1. radioactive and non-radioactive phosphatases. Detection of target DNA. end labeling. Genomics: the science and technology behind human genome project. protein and metabolic engineering. Biological sequence analysis: Probabilistic models of proteins and nucleic acids – Durbin R. yeast artificial chromosome. site directed mutagenesis. labeling techniques.Genetic Engineering: Lecture – 3 Tutorial – 1 Credits-4 Introduction to genetic engineering. DNA ligases. polymerase chain reaction (PCR) and its applications. enzymes involved in manipulation of genetic material. ethical issues and patenting of genetically modified objects.BI-353 .. Chemical synthesis of oligonucleotides. Kinases. restriction endonucleases. diagnostics of genetic expressions. Cantor and Smith . exonucleases. reverse transcriptase. random priming methods. DNA polymerase. concept and use of linkers and adapters. DNA foot printing. ribonucleases and proteases. nick translation. generations of novel plants and animals. gene transfer in animal and plant cells. plasmids and cosmids. phages. cell fusion techniques. genomic and cDNA library. et al. 2.

various learning techniques Introduction to Expert System . Approaches to knowledge representation. Connectionist Model Hopfield networks leraning in Neural Networks Application Common Sense Common Sense ontologies and Memory organizations TEXT BOOKS : 1. 2. Forward and back ward reasoning . Parallelism in reasoning system. Game planning Minimax Search procedure. Statistical reasoning Probability and Bayes Theorem Certaininty factor and rule base system Baysiean Networks Dempster Shafer Theory Fuzzy Logic. Adding Alpha Beta cut-offs. Understanding Parallel and distributed AI Psychological Modeling. Ascent Hill climbing. AI by Norwing. Knowledge representation using predicate logic resolution. Semantic nets. Natural language processing and study of its different phases. BFS. Frames Conceptual dependency.Hill climbing. Knowledge representation using rules procedural versus declarative knowledge logic programming. and Different heuristic search techniques.AI and Soft Computing techniques Lecture – 3 Tutorial – 1 Credits-4 Introduction to AI various types of production system. and unification algorithm. Knowledge Representation: Representation and mappings. AI by Rich & Knight. Constraint satisfaction.BI-354 . Problem characteristics. DFS.Symbolic reasoning under uncertainty monotonic and non monotonic reasoning. Issue in knowledge representation. Iterative deepening Planning components of planning system Goal stack planning Nonlinear and Hierarchical planning. Analysis of problem for developing an AI system. . A* algorithm AO* Algorithm. Production system and its characteristics. Introduction to learning.

growth of functions. Rivets. Single-Source Shortest Paths in directed acyclic graphs. TEXT BOOKS : (i) (ii) Fundamentals of Computer Algorithms Ellis Horowitz. Augmenting Data Structures: Dynamic order statistics. Matrix Operations: Properties of matrices. Single-Source Shortest Paths: The Bellman-Ford algorithm. deletion. Sartaj sehni galgotia publications. Introduction to NP-Completeness.Advanced algorithms for Bioinformatics Lecture – 3 Tutorial – 1 Credits-4 Introduction: Analyzing algorithm. Leiserson. The Simplex algorithm.BI-355 . Strassen’s algorithm for matrix multiplication. Dijkstra’s algorithm. Introduction: Graph and Minimum Spanning Trees. Sorting Networks: A bitonic sorting network. master method. All-Pairs Shortest Paths: Shortest paths and matrix representation. optimal binary search tree. Formulating problems as linear programs. Divide and Conquer approach: Performance analysis of binary search. iteration method. Matrix –chain multiplication. merge sort. The Floyd-Warshall algorithm. heap sort. asymptotic notation. A task scheduling problem. insertion. Rotations. quick sort. potential method. sorting network. merging network. Huffman codes. accounting method. Dynamic Programming: Elements of Dynamic Programming. standard notation and common functions. How to augment a data structure. Greedy Algorithm: Elements of the greedy strategy. Linear Programming: Stander and slack forms. Recurrences: Substitution method. Introduction to Algorithms Cormen. Red-Black Trees: Properties of red-black trees. Amortized Analysis: Aggregate method. . proof of master theorem. PHI. Kruskal’s and prim’s algorithm.

Properties of Regular languages. By John 2. Closure properties of regular set. Finite state systems. Closure properties of CFL . By John E. Greibach Normal form. Intractable problem. Chomsky Normal form. Two way finite automata. Undecidability Universal turning machine and an undecidable problem Rice theorem Greibach theorem. Context free grammar. E. TEXT BOOK: 1. Decision algorithm for Regular set. Modification of turning machine. Hopcraft & Jeffary D.L. Chomsky hierarchy. Introduction to Automata Theory Language and Computation. Introduction to LR grammar. 4. Pushdown automata: Informal description Definition Equivalence of PDA’s and CFL’s Prop Turning machine construction. Pumping lemma for regular set. ChandraShekaran .CYK algorithm. Context sensitive Language Computational Complexity theory. Myhill Ners de theorem and initialization of finite automata Regular Expression and Language. Application for CFL of Pumping lemma. Pumping lemma for CFL. Recursion finite theory. Ullman & Rajeev Motwani. Unrestricted Grammar. Ullman 3. Hopcraft Jeffary D. Removal of ∈ transition from ∈ – NDFA.THEORY OF COMPUTATION Strings Alphabets and language. Determinstic finite automata with ∈ moves.SEVENTH SEMESTER BI-401 . Mishra. Theory of Computer Science K. Introduction to Automata Theory Language and Computation. N. finite automata with output. YACC. Mealy & Moore machines Conversion of NDFA to DFA.P.

P. scaling. Three Dimensional concepts : Polygon surfaces. inside outside tests. character attributes. boundary fill algorithm. basic working of these input devices. color and gray levels. 4. spline representation. window viewpoint transformation.Hearn and M. Line width. request mode. spline specification. depth-buffer and A-buffer methods.A programming approach by Harriyton. Bresenham live & circle drawing algorithm. touch panels. curved lines and surfaces. Three Dimensional transformation and viewing methods : 3 D transformations. transformation from world to viewing co-ordinates. parallel and perspective projections. Baker Computer Graphics . translation. fixed point scaling.BI-402 . ellipse generation. plasma displays. Line clipping algorithms. general scaling direction. plane equation. event mode. lines. Three Dimensional Computer Graphics by Folley and Dam . Back face detection. Filled area Primitives : scan line polygon fill algorithm. DDA. raster-scan displays. Bezier curves and surfaces. image scanners. Procedural Elements of Computer Graphics by Roger. 2 3. Input modes. B-splines and surfaces. DVST. Horner’s rule. TEXT BOOK : 1. Two-dimensional Geometric Transformation: Basic transformation. LCD. Output Primitives : Points. The viewing pipeline. rotation. Displaying spline curves and surfaces. viewing co-ordinates. quadric surfaces.Computer Graphics Lecture – 3 Tutorial – 1 Credits-4 Graphic Systems : Refresh CRT. Computer Graphics by D. Input devices : functions provided by input devices. color.

Introduction to cheminformatics. Valerie J. cell cycle – key to drug discovery. emerging approaches to drug design and discovery. applications of pharmacogenetics and pharmacogenomics. chemical information source.K. proteomics. BOOK: 1. technologies and strategies in drug discovery. drug development time lines. strategic issues in drug discovery.Chemoinformatics & Drug Design Lecture – 3 Tutorial – 1 Credits-4 Basics of biochemistry. Gillet Introduction to Computational Chemistry by Frank Jensen Targeted and Controlled Drug Discovery . distribution. Introduction to Chemoinformatics by Andrew R. Rastogi et al. evolution of cheminformatics. ligand design methods. and excretion (ADME) property prediction. Introduction to drug discovery. docking algorithms and programs. history of cheminformatics. strategy to identify possible drug target molecules.VYAS and R. drug design approaches. stages of drug discovery. 3. 4. future scope of cheminformatics.Khar Bioinformatics – Genomics.BI-403 . introduction to pharmacogenetics and pharmacogenomics. methods of computer aided drug design. Drug life cycle.S. areas influencing drug discovery. 2. absorption. . biochemical structure of protein molecules. metabolism. important parameters in drug discovery. use of cheminformatics. Leach. computer based tools for drug design.P. definition of drug discovery. Computer aided drug design. and drug discovery.

sigma Factors. Fingerprinting. Techniques – foot printing. II & III transcribed genes. immunoglobulin. ESTs. Leach .. BOOKS: 1. Kyoto Encyclopedia of Genes and Genomes (KEGG). analysis of pathways. Metabolic network properties. general framework for spatial modelling and simulation of cellular physiology. elongation and termination of transcription – template & enzyme Properties. Microarrays. rRNA and 5 sRNA genes. et al. Organisation of globin. operons – positive & negative regulation. RFLP. Eukaryotic RNA pdymerase I. signaling pathways. metabolic control analysis. HLA. genetic pathways. V-cell.Transport and Stability. stress & hormones regulated gene expression Organization of human genome. databases of metabolic pathways. 3. simulation of cellular activities. Biomolecular Structure Interaction and Dynamics Lecture – 3 Tutorial – 1 Credits-4 Prokaryotic gene expression. promoter & regulatory sequences. processing of RNA and Proteins . Genetic Data Analysis – Weir B. transcription factors. Reporter genes.Elective-I BI-411.S. RAPDs. 2. Computational methods for pathways and systems biology. Initiation. Glycolysis. E-cell. modelling and simulation environment for biochemical and genetic processes. Biological sequence analysis: Probabilistic models of proteins and nucleic acids – Durbin R. Molecular Modelling by Andrew R.

alternating cycles in colored graphs. . Jerome K.A.BI-412 . mapping with unique and non-unique probes. screening clone libraries. overlap. string rearrangements. optical mapping. fidelity probes for DNA arrays. DNA double digest problem. physical mapping. SBH and the shortest superstring problem. gene prediction tools. probed partial digest problem. Lander-Waterman statistics.. finishing phase of DNA sequencing. design of DNA microarrays. Introduction to sequencing. doublebarreled shotgun sequencing. gene prediction. shortest superstring problem. introduction to restriction mapping and map assembly. DNA Sequencing by Brown T. Patterson. DNA arrays. partial digest problem. homometric sets.Modelling Gene Mapping & Sequencing Lecture – 3 Tutorial – 1 Credits-4 Computational gene mapping and gene hunting. layout and consensus sequencing concepts. BOOKS: 1. some other problems and approaches. gene prediction methods. transformations in Eulerian cycles. Gene mapping. sequencing by hybridization (SBH). physical maps and alternating Eulerian cycles. Mathematics of Genome analysis – Percus. mapping with restriction fragment fingerprints. interval graphs. radiation hybrid mapping. comparative genomics. multiple solutions to double digest problem. Press. SBH and the Eulerian path problem. gene expression. probability of unique sequence rearrangements. positional sequencing by hybridization. 3. IRL press Oxford. sequencing similarity search. Cambridge Univ. 2. Techniques in Quantification and Localization of Gene Expression . genetic mapping. mutational analysis..Bruce K.

tools and techniques in proteomics and transcriptomics. alignment of protein structures.BI-413 . spectral alignment and convolution. dynamic programming. beta-sheet. peptide sequencing and antisymmetric paths.. classes of protein structure. hydrophobicity and its applications. scoring paths in spectrum graphs. Oxford University Press. Ramachandran plot. protein stability and folding. Introduction to computational molecular biology – Setubal and Meidanis. Approaches from proteomics to genomics. peptide identification problem. Genes VII – Lewin B. protein-protein interaction. Protein structure prediction. large scale protein analysis. . importance of transcription. protein prediction from a DNA sequence. the peptide sequencing problem.Proteomics and Transcriptomics Lecture – 3 Tutorial – 1 Credits-4 Protein classification. protein structure classification databases. fast structure similarity and significance of alignments. protein function prediction. distance matrix alignment (DALI). alpha-helix. learning Ion types. Evolution of protein structures. protein stability and denaturation. Ab Initio approaches for protein prediction. 2. the side chains. BOOKS: 1. Computational proteomics. post-translational modifications. use of sequence patterns for structure prediction. loops and coils. viewing protein structure.

3. .Introduction to Bioperl Bioperl classes References: 1. Larrywall. Tata Macgrawhill Publishing. hash). O'Reilly publisher. Harshwardhan P.Wainwright Peter.Tata McGraw-Hill Publishing company Ltd. Kobes Randy.Control structure & File handle. Shroff Publishers 4. 2. Perl Developemnt . Bal. Perl programming for Bioinformatics. Editors Data structure (scalar .Elective-II BI-421 – Perl/ Bio Perl Lecture – 3 Tutorial – 1 Credits-4 Introduction to perl Unix basics. Programming Perl . Perl Ground up Mike Macmillan. Array.Regular Expression Modules. 2003.

Force field Energy minimization Grid search method. Andrew McCammon and Stephen C. Dynamics of Proteins and Nucleic Acids by J. Ed. J. Harvey Cambridge University Press. Building small molecules. J. Molecular graphics and surfaces basic principles. 1990 6. W. on symmetrical. Molecular mechanics and dynamics . 1998. E. Molecular Mechanics across Chemistry.Molecular Dynamic: Application in Molecular Biology by Julia M. Leach.BI-422 – Molecular modelling Lecture – 3 Tutorial – 1 Credits-4 Basic principle behind theoretical modeling. grid and line search methods.Kothekar (kothekar@hotmail. Prentice Hall . Use of MolMol. and polymers. Computer modeling of Biomolecular Interactions V. Goodfellow. Hehre.CRC Press Inc. Use of Hyperchem References: 1. Use of ISIS draw. Use of Rasmol. symmetrical and ab initio methods Potential energy surface and systematic. postulates. Brief Guide to Molecular Mechanics and Quantum Chemical Calculations.. 4. 5. Molecular Modeling : Principles & Applications Andrew R. Anthony Rappe and Carla Casewit. Klunzinger and L. P. 1987 2. Lou. Yu. Quantum chemical methods basic assumptions.com) available directly from the author) 3.

Maximum Flow : Flow networks. Single-Source Shortest Paths: The Bellman-Ford algorithm. Matrix –chain multiplication. Dijkstra’s algorithm. Huffman codes. The Ford-Fulkerson method. deletion. Introduction: Graph and Minimum Spanning Trees. Divide and Conquer approach: Performance analysis of binary search. Rivets. All-Pairs Shortest Paths: Shortest paths and matrix representation. . heap sort. Leiserson. potential method. Greedy Algorithm: Elements of the greedy strategy. standard notation and common functions. Sorting Networks: A bitonic sorting network. Recurrences: Substitution method. Dynamic Programming: Elements of Dynamic Programming. sorting network. quick sort. accounting method. Matrix Operations: Properties of matrices. Introduction to Algorithms Cormen. Linear Programming: Stander and slack forms. How to augment a data structure. optimal binary search tree. Kruskal’s and prim’s algorithm. The Floyd-Warshall algorithm. Number-Theoretic algorithms: The Chinese remainder theorem. merge sort. Push –relabel algorithm. Rotations. Introduction to NP-Completeness. Strassen’s algorithm for matrix multiplication. iteration method. growth of functions. proof of master theorem. PHI. A task scheduling problem Amortized Analysis: Aggregate method. Max-flowmin-cut theorem. Sartaj sehni galgotia publications. master method. TEXT BOOKS : (i) (ii) Fundamentals of Computer Algorithms Ellis Horowitz. Formulating problems as linear programs. The RSA public-key cryptosystem.BI-423 ALGORITHM ANALYSIS AND DESIGN Lecture – 3 Tutorial – 1 Credits-4 Introduction: Analyzing algorithm. asymptotic notation. Augmenting Data Structures: Dynamic order statistics. Red-Black Trees: Properties of red-black trees. insertion. merging network. Single-Source Shortest Paths in directed acyclic graphs. The Simplex algorithm.

BOOK: 1. Bioinformatics basics applications in biological science and medicine. internet grateful med (IGM). surgical simulations. computer assisted surgery (CAS). telemedicime and tele surgery. . computerized physician order entry. 3. volume image data file. history of medical informatics. internet and its relay chat. computer assisted medical and patient education. Rangayyan. virtual endoscopy Three dimensional navigation systems. three dimensional imaging. merits and demerits of CAS. Rashidi et al. polyclinic module. hospital information and management system.Medical Informatics Lecture – 3 Tutorial – 1 Credits-4 Introduction. health and disaster management plan.Rangaraj M. materials and methods for virtual environment Telecommunication based medical systems. Biomedical Signal Analysis . virtual environment. computer based patient records. Medical Informatics – A primer By Mohan Bansal 2.EIGHTH SEMESTER BI-451 . prospects of medical informatics. Medical expert systems.

glutamate and glutametergic transmission. Hadgkin Huxley experiments. The structure and function of voltage gated channels: structure of sodium and potassium channels. calcium channel. the potassium pumps. the Nernest plank equation. Fain. the channel pore. modulation of electrical synapses. anions. the mechanism of action potential. structure of GABA receptor and Glycine receptor.Neuroinformatics Lecture – 3 Tutorial – 1 Credits-4 Introduction: Structure and functions of Neurons. electrical synapses. Pre Synaptic mechanism of synaptic transmission. the diversity of voltage gated channels: sodium channel. ion permeability and membrane potential at equilibrium: the Nernest equation.BI-452 . action potential. potassium channel. Molecular and cellular physiology of neurons by Gordon L. inhibitory transmissions. Books references: 1. the sodium pumps. Ion pumps and homeostasis: sodium and potassium. 2. chemical synapses and the calcium hypothesis. . signal spread. the regulation of pH. passive electrical properties of neurons. Hadgkin Huxley model. principles of electrical circuits. Excitatory transmission. electrical models of real neurons. mechanism of activation and inactivation. Acetyl choline and cholinergic transmission. Brain facts by Candle. the cable equation. gap junctions. calcium.

acceptance and rejection techniques. Using standard package like SPSS. 2) Introduction to Mathematical Statistics by F. Sampling Distributions.S.Sample spaces. the F distributions. finite populations Chi - Hypothesis Testing-Testing of statistical hypothesis.Elective-III BI-461 -STATISTICAL COMPUTING Lecture – 3 Tutorial – 1 Credits-4 Probability Theory.E. Affi 4) Statistics. Binomial. t.By M. Analysis of Variance. order statistics. Freund and R. some rules of probability. independent events and baye’s theorem. standard deviation. Chi-square. The discrete uniform distributions. Hyper geometric distributions. Random Variables and Distributions-Random variables. Continuous probability distributions. conditional probability. testing of hypothesis etc. uniform. square. Null hypothesis. Spiegel . z and F tests. Random Numbers: Algorithms for generation of random numbers. Walpole REFERENCE: 1) Probability and Statistics with reliability queuing and Computer Science Applications by K. one failed proportions. Non-linear regression. Poisson.E. events and probability. Kreyzic 3) Statistical Analysis: Computer Oriented Approach by A. Trivedi. continuous random variables. discrete random variables.One way and two-way analysis Programming Students must be encouraged to develop programs in C for correlation and regression.Schaum’s Series . exponential and Normal distributions. TEXT BOOK: Mathematical Statistics by J. multiple correlation and regression. that.Distribution of mean. Losses and risks.A. probability density functions. tests of hypothesis and significance.R.

process termination. change directory and change root. Buffer cache: buffer headers. l-seek.) Introduction to distributed UNIX system. Multiprocessor systems. scenarios for the retrieval of a buffer. manipulation of the process address space. pipes. System calls for the file system: Open. layout of system memory. file and record locking. Internal representation of the files: I nodes. write. directories. dup. TEXT BOOK 1. unlink. Process scheduling and System call for Time. saving the context of a process. structure of the buffer port. mounting and un mounting file systems link.BI-462 . Back REFERENCE BOOK 1) 2) UNIX Utilities by Tare UNIX Operating System BY Subhajit Das . the context of a process. signals shell system boot and init process. sleep. file system maintenance. i-node assignment to a new file. Advantage and disadvantage of the buffer cache. Process control: process creation. conversion of a path name to an i-node. close. file system abstractions. reading and writing disk blocks. file creation. (Semaphore. read.UNIX AND ITS INTERNALS Lecture – 3 Tutorial – 1 Credits-4 Introduction to Unix operating system. super block. structure of a regular file. STAT AND FSTA. system structure and operating system services. Memory management policies and I/O subsystem and I/O related concepts in UNIX Interposes communication available facilities in UNIX. creation of special files. Design of UNIX Operating System By Maurice J. messages etc. allocation of disk block. Structure of processes: Process states and transitions. change owner and change mode.

Windows Programming. by Herbett Schildts . Text and Font. Database Building Overview. Building a Database Application Using BOOKS : (i) (ii) (iii) (iv) Windows Programming . by Charles Petzold.. TMH. View Document Architecture Using Microsoft Foundation Class (MFC) Library. Scroll bars. by Steve Holzner. by Murray. Data Access Objects (DAO) versus Open Database Connectivity (ODBC). Visual C++ Basic: Introduction. Visual C++ resources: Application Wizard. Introduction to Child Window Controls. Cursor and Bitmaps. Multitasking Process and Threads. Microsoft process. VC++. Tab controls. Clipboard Drag and Drops. Advance features of Windows Programming GDI Metafiles. . DLL. Sound API. Toolbars Visual C++ And Database Management: MFC programming without View Document Architecture.BI-463 . Building a Basic Application.WINDOWS PROGRAMING AND VISUAL C++ Lecture – 3 Tutorial – 1 Credits-4 Introduction to Windows Program. Progress bar. Check boxes. SDI and MDI. Radio Buttons. Advance Window Controls : Toolbars up down controls. Consoles. Introduction to VC++. Message boxes and Menu and Accelerators. Accelerators and Menus. Building a Database Application using ODBC. Static control. Dialog Box. Spin control. Tree view. Message processing in Windows Programming. Creating Icons. Working with Graphics.

Schimmel W. Part. Branden & Tooze. Cantor and Paul R. Freeman and Company. Refinement of the Structures. 2. Crystal symmetry methods of structure determination NMR Techniques for protein structure determination: 1D NMR.H. Inc. New York Biophysical Chemistry. New York Recent Research Papers .Elective-IV BI-471 . Introduction to Protein Structure.I (The Conformation of Biological Macromolecules) By: Charles R. Garland Publishing. 2D NMR (COSY & NOSY) Imaging of Apoptosis Imaging cell death in vivo and advances in the imaging of programmed cell death Applications of Molecular Imaging in Humans Recent literature for New application of Molecular Imaging References: 1.Molecular Imaging Lecture – 3 Tutorial – 1 Credits-4 Overview of Protein & DNA Structure Protein Structure Determination by X-ray diffraction: Isolation. 3. purification & crystalisation of proteins.

Pearson Education Association . memory based learning. accelerated convergence of back-propogtion learning. generalized radial basis function networks. Stastical neture of learning process. Output representation and decision rule. lern-mean-square algorithm. XOR problem. How to build a support vector machine. Hessian matrix. back-propagation and differentation. network architectures. XOR problem. converction networks regularization theory. for pattern reorganization. unconstrained optimization techniques. generalized radial basis function networks.NEURAL NETWORKS AND FUZZY LOGIC Lecture – 3 Tutorial – 1 Credits-4 Introduction:. Simon Haykin.Adaptive Fillering problem.Models of Neuron. for paltern recognization. perceptron convagence theorem relation between the perceptron and bayes classifier for gaussian enviroment. Neural Networks viewed as directed grephe of Feebdrck. Hebbian learning competitive learning. Supervized learning on Posed Hyper-surface reconstruction problem Cover’s theorem on seperability of patterns interpolation problem regulerization network. Memory Adeptation. learning tasks. XOR problem. linear least square fillers. TEXT BOOK: Neural Network. knowledge representation. Hyper-surface recon struction problem. Heuristic for making the back propogetion algorithm perform better. learning with teacher learning without a teacher. back-propagation algorithm. summary of back propogation algorithm. Cover’s theorem on seperability of patterns interpolation problem regularization network. Bottzmonn learning credit assignment problem. Computer experiment.Some priteminaries. Single Layer Perceptions:. approximation of functions virties and limitations of back-propagetion learning. generalization. stastical learning theory probably approximately correct model of learning. learning rate anhealing techniques. applications of neural network. Supervised learning on Posed. Learning Processes:. learning curves.. Multi-leyer Perceptorns:. Geature detection. Perceptron.BI-472 .Error correction learning. How to build a support vector machine.

BI-473 . microarray detection and gene expression profiling Mass/Flux Balance Analysis Systems Approach to Metabolic Networks and Protein-Protein Interaction Networks Modeling Complex Biological Systems Approach to Numerical Simulation of Regulatory Pathways Pharmaco-kinetics References: Latest Research papers .targets and probes. manufacturing.Systems Biology Lecture – 3 Tutorial – 1 Credits-4 Introduction to Systems Biology Microarray : microarray surfaces.

Sign up to vote on this title
UsefulNot useful