Mca i Year Syllabus 9-9-2011

8/2/2019 Mca i Year Syllabus 9-9-2011

1/21


2/21


3/21


4/21


5/21


6/21


7/21

The objective of this course is to present the foundations of many basic computer relatedconcepts and provide a coherent development to the students for the courses like Fundamentals of Computer

Organization, RDBMS, Data Str uctures, Analysis of Algorithms, Theory of Computation ,Cryptography,Art ificial Intelligence and others. This course wi ll enhance the students ability to think logically andmathematically.

Knowledge of basic concepts on Sets, di fferent operations on sets, binary operations,functions.

RELATION: Type and composit ions of relations, Pictor ial representation of relations, Equivalence relations,Part ial ordering relation. Function: Types, Composition of function, Recursively defined functionMathematical Induction: Pianos axioms,Mathematical Induction, Discrete Numeric Functions and Generatingfunctions, Simple Recurrence relation wi th constant coefficients, linear recurrence relation wi thout constantcoefficients, Asymptotic Behavior of functions, Algebraic Structures: Propert ies, Semi group, monoid, Group,Abelian group, properties of group, Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism,Isomorphism and Automorphism of groups.Preposit ional Logic: Preposit ion, First order logic, Basic logical operations, Tautologies, Contr adictions,Algebra of Propositi on, Logical impl ication, Logical equivalence, Normal forms, Inference Theory, Predicatesand quantifi ers, Posets, HasseDiagram, Latt ices: Introduction, Ordered set, Hasse diagram of part ially ordered set, Consistent enumeration,Isomorhic ordered set, Well ordered set, Latt ices,Propert iesof latt ices, Bounded latt ices, Distr ibuti ve latti ces,and Complemented latt ices.Introduction to defining language, Kleene Closure, Arithmetic expressions, Chomsky Hierarchy, Regular

expressions,Generalized Transit ion graph.finit eBoolean algebra, functionsof Boolean algebra.

Conversion of regular expression to Fini te Automata, NFA, DFA, Conversion of NFA to DFA, Optimizing DFA,FA with our Moore machine,Mealy machine,Conversions.

1. Bernard Robert Busby, Sharon C. Ross, , Sixth Edit ion,

2008,Pearson Education Inc.,New Delhi. / PrenticeHall of India (PHI) Pvt. Ltd.,New Delhi.

1. Kenneth H. , Sixth Edit ion, 2008,Tata McGraw-Hill(TMH) PublicationsPvt. Ltd.,New Delhi.

2. D. S. & M. K. Sen, , First Edition, 2005, CENGAGE LearningIndia Pvt. Ltd.,New Delhi .

3. Judith L. , , Fifth / Sixth Edition (Asian Student Edit ions), 2008, W. H. Freeman & Company, NewDelhi.

4. Richard , , Seventh Edit ion, 2008, Pearson Education Inc., NewDelhi.

5. C.L.Liu Elements of Discrete Mathematics, McGraw Hil l

1


8/21

The objective of this course to provide awareness of the underl ine financial structure andprocedures of the organization so that the interaction of financial system with informationsystemscan beunderstood by the information system designer.

None

Principles, concepts and conventions, double entry system of accounting, Ledger posti ng andTrial balance. Trading,profit and loss accounts and balance sheet of sole proprietary concern with normalclosing entr ies. Introduction to manufactur ing account, final account of partnership f ir ms, limited company.

Meaning, role and scope of financial management. Time value of Money, present value, future value of aseriesof cash flows, annuity.Practical applicationsof compounding and present value techniques.

Int roduction to shares, debentures, preferenceshares.

Meaning, importance, dif ficulties. Introduction to evaluation techniques Traditionaltechniques (ARRPayback method). Discounting cash flow techniques(Present value,NPV, IRR) Meaning, advantages, limitationsof ratio analysis, Types of ratiosand their usefulness.

Nature, importance and typesof cost Nature, scope and importance of marginal costing, Break-even analysis, its uses andlimitations,construction of break-even charts. Practi cal applicationsof marginal costing. Theneed, cost of inventory, methods of inventory costing.

: Coding logic and codes required, master files,transaction files, introduction to documents used for data collection. Processing of different files and outputsobtained.

1. Khan & Jain, Management Accounting,Tata McGraw Hil l Publication

1. Jawahar Lal, Financial Accounting, Wheeler Publishing.2. S.N.Maheswari & S. K.Maheswari, Introduction to Financial Accountancy, Vikas Publication.


9/21

Theobjectivesof this course is

To learn the basic methodsfor the design of digital circuits and provide the fundamental conceptsused in the computer systems, microprocessor etc.

Toprovidean exposure to deal with various electroniccir cuits.At the end of the course the studentswil l gain knowledge to design electroniccircuits and for consumer and industr ial products as well.

Intr oduction to Computer:-Defini tion, Characteristics. Generation of Computers, Capabili ti es and Limitations.Introduction to Operating System. Concept of Bios, Booting Files. Basic Components of a Computer System-Control Unit , ALU, Input/ output functions and characteristics. Memory Introduction, Classifications- Volati leMemory and Non- Volati le , Flash Memory, ROM, RAM,EPROM,PROM,EEPROM other typesof memory.

Input, Output and storage Units:-Computer Keyboard, Pointing Devices: Mouse, Trackball, Touch Panel, andJoystick, Light Pen, Scanners, Various types of Monitors,Touch-sensiti ve screens, Optical Recognit ion System,Pen based systems, Digitizers, MICR, OCR, OMR, Bar-code Reader, digital camera.Hard Copy Devices:- Impact and Non- Impact Printers- Daisy Wheel, Dot Matr ix, Line Printer, Chain Printer,Comb Printers, Non Impact Printers- DeskJet, Laser Printer, Thermal Transfer Printer, Barcode Printers,Electro static printers and plotters.

High Level Language and Low Level Language, Software and its different types- System Software, Applicationsoftware. Hardware , Firmware, , Compiler, Interpr eter and Assembler. File Allocation Table (FAT, FAT 32 &NTFS). Introduction to algorithm and Flow chart: - Representation of an algorithm, flowchart symbols andlevels of flow chart , rules, advantage and limitationsof flowchart and pseudo code.

Binary, Octal, Decimal, Hexadecimal-Number base conversions complements signed Binarynumbers. Binary Arithmetic- Binary codes: Weighted BCD-2421-Gray code-Excess 3 code-ASCII Error detecting code conversion from one code t o another-Boolean postulates and laws De-

Morgans Theorem- Principle of Duality- Boolean expression Boolean function- Minimization ofBoolean expressions Sum of Products (SOP) Product of Sums (POS)- Minterm- Maxterm- Canonicalforms Conversion between canonical forms Karnaugh map Minimization Dont care condit ions.

LOGIC GATES: AND, OR, NOT, NAND, NOR, Exclusive OR and Exclusive NOR- Implementations ofLogic Functions using gates, NAND NOR implementati ons Mult i level gate implementations- Mul tioutput gate implementations.COMBINATIONAL CIRCUITS:Design procedure Adders-Subtr actors Serial adder/ Subtr actor -Parallel adder/ Subtractor - Carry look ahead adder- BCD adder- Magnitude Comparator- Mult iplexer/Demult ipl exer- encoder / decoder parity checker code converters.

1. M. Morris Mano, Digital Design, 3.ed., Prentice Hall of India Pvt. Ltd., New Delhi , 2003/ Pearson Education

(Singapore) Pvt. Ltd.,New Delhi ,20032. John .M Yarbrough, Digital Logic and Design, Thomson- Vikas publ ishing house, New Delhi,

2002.


10/21

Thishands-on courseprovides a comprehensive intr oduction to programming, and builds a solidfoundation of programming skil ls that can beused to master addit ional programming languageslike C, C++. In this course, student wr ite, compile,and debug programsin C.

Structure and properties of algorithm, Flow chart, Algorithms for g.c.d., Factorial, Fibonacci series, Primenumber generation and other simpleproblems, searching & sorti ng techniques

C language fundamentals: Character set, Key words, Identifiers, data types, Constants and variables,Statements,Expressions, Operators,Precedence and Associativity of operators,Side effects, Type conversion,Managing input and outputControl structures: Decision making, branching and looping. Arrays: one dimensional, mult idimensional array and their applications, Declaration and manipulation ofarrays

Str ings: Str ing variable, Str ing handling functions, Array of str ingsFunctions: Designing structured programs, Functions in C, User defined and standard functions, Formal vs.actual arguments, Function category, Function prototype, Parameter passing,Recursive functions.Storageclasses: Auto, Extern, register and static variablesPointers: Pointer variable and its importance, pointer ari thmetic and scale factor, Compatibility,Dereferencing, L-value and R-value, Pointers and arrays, Pointer and character str ings, Pointers andfunctions, Array of pointers, pointers to pointers Dynamic memory allocationStructur e and union: declaration and initialization of str uctures, Structure as function parameters, Structurepointers,Unions.

File Management: Defining and opening a file, Closing a file, Input/ output Operations in files, Random Accessto files, Error handlingThePre-processor directi ves,command line arguments, Macros.

1. Behrouz A. and Richard F.Gilberg.Computer Science: A Str uctured ApproachUsing C,

Third Edit ion, 2007,CENGAGELearning India Pvt. Ltd.,New Delhi.2. E. , Programming in ANSI C, 4th edit ion, 2007,McGraw-Hil l Publication,New Delhi.3. Fundamentalsof Computer Algorithms,(Galgotia,New Delhi )

1. Let us C-Yashwant Kanetkar.2. K.R.Venugopal, S.R. Prasad, Mastering C,McGraw-Hil l Education India

3. P.Dey,M.Ghosh, Programming in C, Oxford University Press4. K.N.King,CProgramming-Amodern approach,W.W.Norton5. S.Prata, CPrimer plus,5th Edition,Pearson Education India


11/21

Theobjective of thecoursewill be to introduce the main notionsof mathematical logic: logicalnotations (syntax) and how to assign meaning to them (semantics). Wewi ll then study formal frameworks (in

the sense of being rigorousaswell as in the sense of manipulating "form") for constructing logical arguments(proof theory), studying in particular somedeductive systems for proposit ional and fir st -order logic.Naturally,we wil l beconcerned with the correctness andcompleteness of thesedeductivesystems,as well aswith thealgorithmic.

Formal mathematics,and should have the ability t o think rigorously and program intelligently

logic, truth tables, equivalence, language to logic, applications to circuit design, exponentialgrowth, Semantic Tableaux, problem solving with semantic Tableaux.

Syntax of proposit ional logic, rules of natural deduction, the sequent calculus,r esolutionin proposit ional logic: Normal forms,Resolving arguments,Resolution,Combinatorial search problems.

Introduction, objects, predicates and quantifiers, functions, first order languages,quanti fiers,scope,and binding,Interpretations, higher order logic, semantic tableaux in predicate logic.

Normal Forms, Herbrand Universes,Resolut ion, Unification, Problem solvingusing resolution

1. TheEssenceof Logic. John Kelly.Prentice-Hall International

1. Virginia Klenk, UnderstandingSymbolic Logic,5/ e, Pearson Education2. C. L.Changand R. C. T.Lee, Symbolic Logic and Mechanical Theorem Proving,Academic

Press.


12/21

Technical Communication is most essential for students and professionals. Thusthere is a drasticneed for effective communication. Due to the vari ous phenomenal changes in the businessenvironment, recrui ters are now looking for students wi th good computer knowledge as well as

good communication skil ls. Thus, the objective of this course is to equip the students wi th thebasics of communication skil ls and technical wri ting, so that they can put i t into use in their day-to-day activit ies.

What is Communication, Levels of Communication, Importance of Technical Communication, Barriers toCommunication, Non-Verbal Communicati on, Technology-Enabled Communication, Impact of Technology,Selection of Appropriate Communication Technology

Effecti ve listening, Active vs Passive Listening, Effective Presentation Str ategies, Effective Use of Visual Aids,

Understanding the Nuances of Delivery, Interviews, Types of Interviews, Group Discussion, Meetings,Conferences

Punctuation and Capitalization, Nouns and Verbs, Pronouns, Adjectives, Prepositions, Conjunctions, Tenses,Active and Passive Voice,Useof Articles, Common Err ors in Usage, Words Commonly Misspelt

Words and Phrases, Guidelines for Effecti veness, Sentence Construction, Paragraph Development, PrecisWri ting,Reading Comprehension Letter Wri ti ng, Memorandums, E-mails, Report Wri ting, Technical Proposals, Research Paper, Dissertation,Thesis, Instruction Manuals,Technical Descript ion

a. Technical Communication Pri nciples and Practice by Meenakshi Raman & Sangeeta Sharma,Oxford University Press, Sixteenth Impression 2007.

2. Business Communication by Meenakshi Raman & Prakash Singh, Oxford University Press, SeventhImpression 2008.

3. High School English Grammar and Compositi on by Wren & Mart in

1. Effective Business Communication by Herta A Murphy, Herbert W. Hilderbrandt & Jane P Thomas,Seventh Edit ion, Tata McGraw Hill Publication

2. Effective BusinessCommunication by AshaKaul, Prentice-Hall India Pvt. Ltd.,March 20083. Technical Writ ing by B. N.Basu,Prentice-Hall India Pvt. Ltd.,2007


13/21

1. Write program to find largest of three integers.2. Write program to check whether thegiven str ing is palindromeor not.

3. Write program to find whether the given integer is a primenumber & an Armstrong number.4. Write program for Pascal triangle.5. Write program to find sum and average of n integer using linear array.

6. Write program to perform addition, multiplication, transpose on matr ices.7. Write program to find fibbonacci series of iterative method using user-defined function.8. Write program to find factorial of n by recursion using user-defined functions.9. Write program to perform following operationsby using user defined functions:10. Concatenation11. Reverse12. Str ing Matching13. Write program to find sum of n terms of series: n n*2/ 2! + n*3/ 3! - n*4/ 4! + ...............14. Write program to interchange two values using15. Call by value.16. Call by reference.17. Write program to sort t he list of integers using dynamic memory allocation.

18. Write program to display the mark sheet of a student using structure.19. Wri te program to perform following operations on data files: Read from data file & Write to data file.20. Wri te Cprogram to copy thecontent of one file to another file using command line argument.

Lab sessions wil l bedevoted to practiceactivit iesbased on all threemodules of theory.

Students wil l be trained to find out the correct pronunciation of words with the help of a dictionary, toenable them to monitor and correct their own pronunciation.

(i ) transcript ion of words and short sentences in normal English orthography (wri ting) into theirIPA equivalents ;

(ii) transcription of words presented orally ;(ii i) conversion of words presented through IPA symbols into normal orthography(iv) syllabledivision and stress marking (in wordspresented in IPA form)

(i ) listening with a focus on pronunciation (ear-training) : segmental sounds, str ess, weak forms,intonation Students should be exposed, if possible, to the following varieties of English duringlistening practice: Standard Indian, Bri tish and Ameri can.

(i ) pronunciation practice (for accent neutralization), parti cularly of problem sounds, in isolatedwords as well assentences

(ii ) practising word str ess, rhythm in sentences, weak forms, intonation(ii i) reading aloud of dialogues, poems, excerpts from plays, speeches etc. for practice in

pronunciation

The focus wil l be on the elimination of common err ors. Somewri ting activi ties (e.g. wr iting of shortparagraphson assigned topics) can beused to identify these err ors. identifying the central ideaaswell assupport ing ideas preparingnotes in diagrammatic form after readinga text, showing the main idea and support ingideas and the relationships between them.

Studentswi ll be required to produceand submit by the end of Semester 1 a350-500 word project report on atopic of their choice. Theproject should involve data collection,analysisand report ing.


14/21

1. Study of Logic Gates: Truth-table veri fication of OR, AND, NOT, XOR, NAND and NOR gates;Realization of OR, AND,NOT and XORfunctionsusing universal gates.2. Half Adder / Full Adder: Realization using basicand XOR gates.3. Half Subtractor / Full Subtractor: Realization using NANDgates.4. Parallel Adder / Subtractor: Perform adder and subtractor operation using IC7483 chip.5. 4-Bit Binary-to-Gray & Gray-to-Binary CodeConverter: Realization using XORgates.6. 4-Bit and 8-Bit Comparator: Implementation using IC7485 magnitude comparator chips.7. Multiplexer: Truth-table veri fication and realization of Half adder and Full adder using IC74153 chip.8. Demultiplexer: Truth-table veri fication and realization of Half subtractor and Full subtractor usingIC74139 chip.9. LEDDisplay: Useof BCDto 7 Segment decoder / dri ver chip to drive LED display.

10. Encoder: Truth table verification and realization.

11. Decoder : Truth Table verification and realization

12. Flip Flops: Truth-table veri fication of JK Master Slave FF, T-typeand D-typeFFusing IC7476 chip.13. Asynchronous Counter: Realization of 4-bit up counter and Mod-N counter using IC7490 & IC7493 chip.14. Synchronous Counter: Realization of 4-bit up/ down counter and Mod-N counter using IC74192 &IC74193 chip.15. Shift Register: Study of shift ri ght, SIPO, SISO, PIPO, PISO & Shift left operations using IC7495chip.16. Ring counter and Twisted Ring Counter: Realization using IC7495 chip.17. RAM:Studyof RAM (2K x 8 RAM) operation.18. DACOperation: Study of 8-bit DAC(IC08/ 0800 chip), obtain staircase waveform using IC7493 chip.


15/21

Theobjectives of this courseare two-fold. First, the courseis intended to providea comprehensivebackground in the strategic, economic, financial and organizational aspects of Industry. Secondly,the course will seek to provide a practical framework for managerial decision-making in the

context of IT sector. none

Classical theories of Management: Scientif ic management theory, Fayols 14principles of Management, Webars bureaucratic theory. Defini tion of organization and organizationStructure. Line and Staff authority, Centralization andDecentralization, Span of control, Formal and Informal Organization. Function based, Product based, Geography based, Projectbased ( Matrix) : Mechanistic and Organic Structure,Vir tual and Network organization Str ucture

Definit ion of Motivation, Importance of Motivation, Motivation and behavior, Theories ofMotivation Maslows need Hierarchy, Two- Factor Theory, McClellands Need Theory, Theory X and TheoryY. Nature of training and Development, Inputs in training and Development,impor tance of tr aining and Development, tr aining process, training of International assignment

Scope of HRM, HRM functions and objectives, HRMmodel. Personnel polices and principles, duties and responsibilities of personnel manager,

differences between HRM and PM Emerging tr endsof personnel management in India

Meaning, definition and importanceof HRP. Meaning and definition, process of job analysis. Meaning and defini tion, importance,sources of recrui tment. Indian scenari o Meaning and definit ion,selection process, typesof interview

1. L.M.Prasad, Organizational Behavior , S.Chand.2. V.S. P.Rao, P. S.Narayana,Organizational Theory and Behavior , Konark Publishers Pvt. Ltd.3. Tripathi, Reddy, Principlesof Management,TMH

4. Koontz,Weihr ich,Essentials of Management, TMH5. Fred Luthans,Organizational Behaviour, McGraw Hil l6. K.Aswathappa, Human Resourceand Personnel Management, TMH7. L.M.Prasad, Human RecourseManagement, S.Chand


16/21

Todevelop proficiency in the specification, representation,and implementation of Data Types andData Structures.

To beable to carr y out the Analysis of variousAlgorithms for mainly Timeand SpaceComplexity.

Toget a good understanding of applications of Data Structures. Todevelop a base for advanced computer sciencestudy.

: Any programming languagel ike C, C++

Basic Terminology, Elementary Data Organization, Structure operations, Algorithm Complexityand Time-Space trade-off: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, addresscalculation, application of arrays, Character String in C, Character string operation, Array as Parameters,Ordered List, SparseMatr icesand Vectors. Array Representation and Implementation of stack,Operationson Stacks:Push& Pop,Array Representation of Stack, Linked Representation of Stack, Operations Associated wi th Stacks,

Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expressionusingstack. Recursive definiti on and processes, recursion in C, example of recursion, Tower of HanoiProblem,simulating recursion,Backtracking, recursive algorithms.

Array and linked representation and implementation of queues, Operations on Queue: Create, Add,Delete,Full and Empty, Circular queues, D-queuesand Prior it y Queues : Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing andSearching of Linked List, Overf low and Underfl ow, Insertion and deletion to/ from Linked Lists, Insert ion anddeletion Algorithms, Doubly l inked li st, Linked List in Array, Polynomial representation and addit ion, GarbageCollection and Compaction.

: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary

Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees,Threaded Binary tr ees,path length algorithm Huffman Algorithm. : Sequential search, binary search, comparison and analysis, Hash Table, HashFunctions, Collision Resolution Strategies, Hash Table Implementation.

: Insert ion Sort, Bubble Sort ing,Quick Sort , Two Way Merge Sort, Heap Sort, Sorti ng on Different Keys. : Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of SearchAlgorithm.

Terminology & Representations, Graphs & Multi -graphs, Directed Graphs,Sequential Representations of Graphs, Adjacency Matr ices,Traversal : Physical Storage Media File Organization, Organization of records into Blocks, SequentialFiles, Indexing and Hashing, Primary indices, Secondary indices, B+ Tr ee index Files, B Tree index Files,

Indexing and Hashing Comparisons.

1. Horowitz and Sahani, Fundamentals of dataStr uctures, Galgotia2. R.Kruseetal, Data Structuresand Program Design in C Pearson Education3. A M Tenenbaum etal, Data Structures using C& C++,PHI4. Lipschutz, Data Str ucture, TMH5. Adam Drozdek, Data Str uctures and Algori thms in C++,Thomson Asia6. Pal G.Sorenson,An Introduction to Data Structur es with Application,TMH.


17/21

The objective of this course is to study the design options i n computer architecture andorganization. This course also includes functi onal units of the PC, basic working of CPU, memory

organization and I/ Odeviceetc. Fundamental of Computers Systemsand Digital Electronics

Register Transfer Language, Bus and Memory Transfers, Bus Architecture, Bus Arbitr ation, Ari thmeticLogic, Shift Microoperation, Ari thmetic Logic Shift Unit , Design of Fast address, Arithmetic Algori thms(addition, subtraction, Booth Multi plication), IEEEstandard for Floating point numbers.

Hardwir ed & Micro Programmed (Control Unit): Fundamental Concepts (RegisterTransfers, Performing of ari thmetic or logical operations, Fetching a word from memory, stor ing a wordin memory) , Execution of a complete instruction, Multiple-Bus organization, Hardwi red Control,

Micro programmed control(Microinstruction, Microprogram sequencing, Wide-Branch addressing,Microinstr uction with Next-address field, Prefetching Microinstr uction).

Processor Organization: General register organization, Stack organization,Addressing mode, Instruction format, Data transfer & manipulations, Program Control, Reduced Instructi onSet Computer. I/ O Interface, Modes of transfer, Interrupts & Interrupt handling, DirectMemory access, Input -Output processor, Serial Communicati on.

Memory Hierarchy, Main Memory (RAM and ROM Chips), organization of 2Dand 21/ 2D, Auxiliary memory, Cache memory, Vir tual Memory, Memory management hardware.

1. Computer Organization, Vravice, Zaky & Hamacher (TMH Publication)

2. Structured Computer Organization, Tannenbaum(PHI)

3. Computer Organization, Stallings(PHI)4. Computer Organization, John P.Hayes (McGraw Hil l)


18/21

With the current deployment of computer technology and tools, it is very important to developefficient algorit hms for solving problems in science, engineeri ng, technology, i nsurance &banking. Thus, the objective of this course is to enable students to obtain an intuitive andworking understanding of numerical methods for the basic problems of numerical analysis and

gain experi ence in the implementation of numerical methodsusing a computer. They would alsogain an appreciation of the concept of error in thesemethods and the need to analyzeand predictit .

Basic knowledge of functions, logarithmic, tr igonometr ic and exponential functions, graph ofa function,polynomials,and roots of a polynomial, differentiation and integration.

: Representation of floating point numbers, Operations, Normalization, Pit falls offloating point representation, Err ors in numerical computation Zeros of a single transcendental equation and zeros of polynomial using BisectionMethod, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate ofconvergence of it erative methods.

: Solutions of system of Linear equations, Gauss Elimination di rect methodand pivoting, Il l Condit ioned system of equations, Refinement of solut ion. Gauss Seidal iterative method, Rateof Convergence : Finite Differences, Difference tables,Polynomial Interpolation Newtonsforward and backward formula,Central Difference Formulae: Gauss forward and backward formula, Sti rlings,Bessels, Everett s formula. Langranges Interpolation, Newton Divided difference formula,

Hermites Interpolation,Approximation of function by Taylors seri es and Chebyshev polynomial

: Introduction, Numerical Differentiation,Numerical Integration,

Trapezoidal r ule,Simpsons rules,BoolesRule,WeddlesRule Euler- Maclaurin Formula : Picards Method,EulersMethod, Taylors Method, Runge-Kutta methods,Predictor-corrector method, Automatic err or monitor ing,stabilit y of solution.

: Method of least squares, fitt ing of straight lines,polynomials, exponential curvesetc : Different fr equency chart like Histogram,Frequency curve, Pi-chart . : Linear and Non-linear r egression, multiple regressions

1. Rajaraman V.,Computer Oriented Numerical Methods, PHI

2. Gerald & Wheatley,Applied Numerical Analyses, AW3. Jain,Iyengar and Jain, Numerical Methods for Scienti fic and Engineeri ng Computations, New AgeInt.4. Grewal B.S.,Numerical methodsin Engineering and Science, Khanna Publishers,Delhi5. T.Veerarajan, T Ramachandran, Theory and Problems in Numerical Methods, TMH6. Pradip Niyogi, Numeri cal Analysis and Algori thms,TMH


19/21

To provide an understandingof the functionsof operatingsystems. To provide an insight into internals and functional modulesof operating systems. Tostudy the concepts underlying the design and implementation of operating systems.

Prepare a basefor advanced subjects in Computer Scienceand Applications.

Basic knowledge of Computer hardware and software Knowledge of programming languagel ikeC/ C++

Intr oduction: Operating System and Function,Evolution of Operating System,Batch, Interactive, Time Sharingand Real Time System, System Protection. Operating System Structure: System Components, SystemStructur e,Operating System Services.

Concurr ent Processes: Process Concept, Principl e of Concurr ency, Producer / Consumer Problem, Crit icalSection, Problem, Semaphores, Classical Problems in Concurrency, Inter Processes Communication, Process

Generation, ProcessScheduling.

CPU Scheduling: Scheduling Concept, Performance Criteria Scheduling Algorithm, Evolution, MultiprocessorScheduling. Deadlock: System Model, Deadlock Characterization, Prevention, Avoidance and Detection,Recovery from Deadlock.

Memory Management: Basic Machine, Resident Monitor , Multiprogramming with Fixed Part ition,Multiprogramming With Variable Part ition, Multiple Base Register, Paging, Segmentation, PagedSegmentation, Virt ual' Memory Concept, Demand Paging, Performance,Paged Replaced Algorit hm, Allocation of Frames, Thrashing, Cache Memory Organization, Impact onPerformance.

I/ O Management & Disk Scheduling: I / O Devices and the Organization of I/ O Disk I/ O, Operating SystemDesign Issues. File System: File Concept, File Organization and Access Mechanism, File Directories, FileSharing,Implementation Issues.

1.Stalling, Will ium, "Operati ngSystem", Maxwell Macmillan2.Silveschatza,Peterson J, "Operating System Concepts", Willey.3.Tannenbaum, "Operating System Design and Implementation", PHI.

1.Milenekovie , "Operating System Concept", McGraw Hill .2. Petersons,"Operating Systems", Addision Wesley.3.Dietal, "An Introduction to Operating System",Addision Wesley.4.Gary Nutt , "Operating System,A Modern Perspective", Addision Wesley.5.Crow ley, "Operating System",TMH.


20/21


21/21

1. Matrix Operations-Add,Multiply, Rank, Det.etc.2. Stack & Queue operationsusing Arrays.3. Self-referential structures & single linked list operations.4. Implementing Stack and queues using linked lists.5. ImplementingPolish Notations using Stacks.

6. Circular and double linked list operations.7. Implementing prior ity queue& dequeueusing lists.8. Evaluating polynomial operationsusing Linked lists.9. Implementingset related operations& Hashing.10. linear & binary search,bubblesort technique.11. Insertion sort , selection sort & merge sort techniques.12. Quick sort, counting sort and Shell sort techniques.13. Radix (bucket) and address calculation sort methods.14. Binary tr ee traversals (preorder, inorder, postorder).15. Heap sort & AVL tree implementations.16. Graph representation with matr ix & adjacency lists.

1. To deduce err or envolved in polynomial equation.2. To Find out the root of the Algebraic and Transcendental equationsusing Bisection,Regula-falsi,

Newton Raphson and Iterati veMethods. Also give the rate of convergenceof roots in tabular form foreach of these methods.

3. To implement NewtonsForward and Backward Interpolation formula.4. To implement Gauss Forward and Backward, Bessels,Sterl ingsandEvert ts Interpolation formula5. To implement NewtonsDivided Differenceand Langranges Interpolation formula.6. To implement Numerical Differentiations.7. To implement Numerical Integration using Trapezoidal, Simpson 1/ 3 and Simpson 3/ 8 rule.

8. To implement Least Square Method for curve fi tt ing.9. To draw frequency chart like histogram, frequency curveand pie-chart etc.10. To estimate regression equation from sampled data and evaluatevaluesof standard deviation, t-

statistics, regression coeffi cient, value of R2 for atleast two independent variables.

Mca i Year Syllabus 9-9-2011

Documents

Transcript of Mca i Year Syllabus 9-9-2011