f 2009 -10

Code: MCA 09


T 2 4 4 4 4 4 -


Code Practical’s

2 4 4

Dr E. V. Prasad, Chairman, B.O.S – CSE.

idiomatic distortions. eliciting and giving information. .Clarity of voice UNIT IV: Technical presentations .K R Lakshminarayana. Rajendra Pal.O.Business and Technical Reports – Types of reports . brevity.differences between spoken and written communication . Pearson Education Asia.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Prasad. All India Traveller Bookseller 5.. RK Madhukar.A ENGLISH LANGUAGE COMMUNICATION SKILLS UNIT I: Features of Indian English .Analysis of sample reports from industry . B. recruiting. Cambridge Dr E.rate of speech. UNIT VI: Written communication . Essentials of Business Communication. IDG Books. Advanced Communication Skills. Business Communication. English in Mind. English.features of effective writing such "as clarity. UNIT II: Informal conversation Vs Formal expression Verbal and non-verbal communication.w.. 4.Tenses . GRE and TOEFL. Cliffs Test Prep for GRE and TOEFL.Structures . V. Writing and reading . Kaplan and Baron's 10. Sultan Chand & Sons. promptness . Computer Based Test. SCITECH Publications 7.types of presentation –video conferencing-.C.. Rutherford.S – CSE.e.interviewing in different settings and for different purposes e. Lesikav. balance etc.style – effectiveness.progress reports. for Technical Communication – vols I & 2. Edmond H Weiss: Writing Remedies: Practical Exercises for Technical Writing.format . UNIT V: Formal and informal interviews – ambiance and polemics .email. aural.Analysis of sample letters collected from industry . Vikas Publishing House Pvt Ltd 6. TOEFL models UNIT VII: Letter-writing . routine reports Annual reports .Word-Power .participation in meetings . Basic Communication Skills for Technology.Synopsis and thesis writing REFERENCE BOOKS: 1. UNIT VIII: Technical Report writing .ambiguity . appropriate tone clarity.Vocabulary. Atma Ram Publications. Universities Press 8.Raymond .business letters – pro forma culture . Business Communication.Oral. pitch. Andrea J. 3. Herbert Puchta and Jeff Stranks. Prasad.Jargon .. V. Pettit Jr. fax.g. tone . 9.Correction of sentences . 2. Theory & Application . J S KorlahaHi . John D.format .chairing sessions.GRE. barriers to effective communication – kinesics UNIT III: Types of Communication . performance appraisal. Chairman.

UNIT VII Introduction to data structures. storage classes.S – CSE. example c programs.C. structure of C program.A.O. dangling memory. variables. UNIT VIII Trees. A structured programming approach using C. auto. block structure. UNIT IV Pointers. selection sort. postfix expression evaluation. passing by address –dangling memory.terminology. initialization of pointer variables.Binary tress. and functions. single linked lists. Dr E.A C PROGRAMMING AND DATA STRUCTURES UNIT I Introduction to Computers. goto . V. . 2-D character arrays – 2-D arrays other than character arrays – Multidimensional arrays – Practical examples to expose Engineering problems. Quick sort. identifiers. command line arguments. Gilberg.declaration. UNIT VI Introduction to Data Structures – Time Complexity – Space Complexity – Pattern matching – naive method – Robin Karp Algorithm . do-while and for statements.e. Some novice HW and SW concepts. basic data types and sizes. Control structures such as if. Algorithm / pseudo code. Only Algorithms TEXT BOOKS: 1. expressions. bit-wise operators. Thomson. Formatted I/o. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering Examples.concepts. Computer science. dynamic memory managements functions. accessing elements. static.while. Character pointers and functions. Prasad. N. programming examples. B. 1D arrays other than strings. representation. header files. representing stacks and queues in C using arrays and linked lists.concepts. 2. parameter passing. doubly linked lists. flowchart. Third edition.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Forouzan and R. structures and functions. scope rules.F. basics. pointers and multidimensional arrays. Chairman. relational and logical operators. Prasad. and switch statements. 2009. pointers and function arguments. A Simple C program. infix to post fix conversion. UNIT II Loops. Constants. typedef. Graphs . storing elements. conditional operator. conditional expressions. Adding two large integers using linked lists. traversals. precedence and order of evaluation. UNIT V Derived types. representation. sorting – Bubble sort. pointers to pointers. labels. circular list. Insertion sort. program development steps. C program examples. Venkateswarlu & E. file I/o operations.Searching – Linear and binary search methods. nested structures. accessing structures. graph traversals (dfs & bfs) – Warshalls – Dijkstra – Kruskal – Prims Algorithms. address arithmetic. Input and output – concept of a file. Arrays . recursive functions. bit-fields. S Chand & Co. increment and decrement operators. break. Introduction to various IDE’s and their use in C program development.V. standard library functions. Passing 1-D arrays. C program examples. unions. C pre-processor. B. pointers to structures. definition and initialization of structures. 2-D arrays .extern.B. continue.w. self referential structures. arithmetic. arrays of structures. user defined functions.structures. register. terminology. text files and binary files. type conversions. declaration. Strings and string manipulations. assignment operators. merge sort. definition. UNIT III Functions.

Ullman.Kruse. Fundamentals of Data Structures in C . Harrow.2006 9. 2nd ed. 7. J. Prasad. PHI. Sahni. B. Kernighan.S – CSE. Data Structures and Algorithms. Pearson .2008. E Balaguruswamy. Hopcroft.2nd ed. Ashok N. Kochan. and M. Augenstein. Dennis M. Pearson.e. 2008.Tanenbaum. Pearson. 8. C and Data Structures. Stephen G. 2009.C. .Ritchie. Shashi M.. The C Programming Language. C Programming with problem solving. 2nd Edition. R. Y. Anderson-Freed. V. Leung. Dreamtech Press 5 DataStructures Using C . TMH. PHI/ Pearson. Programming in C . PHI/ Pearson. 10. Pearson . Tondo. Classic Data Structures.A REFERENCES: 1.W.S. A. Data Structures and Program Design in C. 3. 4.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Horowitz. B. 6.w. Universities Press. Aho. III Edition. 2.Kamthane. Dr E.O. C Programming and Data Structures. Langsam. Chairman.A.J. Jones & K. Samanta.

5D Organization of Memory Systems. Writing data In Memory Cell. Design of Control Unit. Representation of Pictures. Binary Floating Point Numbers. Clocks and Timing. Realization of Boolean Expressions Using NAND/NOR Gates. Instruction set.O. Incompletely Specified Function. Memory Parameters. Indirect addressing. A Combinatorial Circuit for Multiplication UNIT IV Central Processing Unit: Learning Goals. PC Relative Addressing. Error Detection and Correction in Memories. Tri-state Gates. Binary division. Half. address Translation. Addition/Subtraction of Numbers in 1’s Complement Notation. Representation of Audio Boolean Algebra and Logic Gates: Learning Goals. Quine-McCluskey Procedure UNIT II Digital logic circuits: Combinatorial Switching Circuits.: Introduction. Precedence of operators. Floating Point Multiplication. Introduction. Binary Coded Decimal Numbers. Modelling Sequential Circuits – FSM. Virtual Memory-Another Level in Hierarchy. Logic Circuits for Addition/Subtraction. Binary Multiplication. CPU Buses. Introduction. Binary Operators and Logic Gates. Dataflow. Duality Principle. How to Encode Various Addressing Modes. UNIT V Micro programmed Control: Control Memory. Design and Performance of Cache Memory System. Integer Representation. MSI arithmetic Logic Unit. Decimal to Binary Conversion. Floating Point Division. Operation Code Encoding and Decoding. Dr E. Basic Theorems of Boolean Algebra. Program Behaviour and Locality Principle. Representation of Multimedia Data. Static Memory Cell. Realization with PALs Sequential Switching Circuits: Types.w. Alphanumeric Codes.e. Simplifying Boolean Expressions. Veitch-Karnaugh Map Method. 2D Organization of Semiconductor Memory. Symbolic Microinstructions. Design of Combinatorial Circuits with Multiplexers. Combinatorial Circuits Commonly Used in Digital Systems. fast address Translation . Synthesis of synchronous. Binary Addition. Flip-Flops. Binary Micro program . Dynamic Random Access Memory. . Instruction Set and Instruction Formats. Control Flow. Data Paths and Microprogramming. Subroutines. Multiplication of signed Numbers.A DIGITAL LOGIC AND COMPUTER SYSTEMS ORGANIZATION UNIT I Digital Components and Data Representation: Learning Goals. Conditional Branching. A Two-Level Hierarchy of Memories. Register Sets. Enhancing Speed and Capacity of Memories. 2. Canonical Forms for Boolean Functions. Driving a Bus from Many Sources. Representation of Video. Page Fetching. Integrated NAND-NOR Gates. Addressing Modes. NAND-NOR Gates with CMOS Transistors. Theorems. Four Variable Karnaugh Map. Instruction Format. Floating Point Representation of Numbers. Floating Point Arithmetic Operations. Prasad. Micro program Example. The Fetch Routine. Weighted Codes. Venn Diagram . Base Addressing. Read Only Memory. Segment Addressing. Realization with FPLAs.and Full-Adder Using Gates. ASCII Code. Dynamic Memory Cell. Cache in Memory Organization. Error Correcting Codes. Semiconductor Memory Cell. Combinatorial Circuit Design Procedure. Wired AND Gate. Introduction. Static Memory Cell. Page Replacement. Symbolic Micro program. Cyclic Codes. Microinstruction Format. IEEE Standard Floating Point Representation. Micro program Sequencer UNIT VI Memory Organization: Learning Goals. A Four-bit Adder. Counters. Introduction. Floating Point addition/Subtraction. Binary counters. Reading the Contents of Cell. addition/Subtraction of Numbers in Two’s Complement Notation. Boolean Functions and Truth Tables. Open Drain and Tri-state Gates. Numbering Systems. Complement Representation of Numbers.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Address Sequencing. Programmable Logic Devices. Chairman.S – CSE. Self-Complementing Codesm. Binary Subtraction. Indian Script Code for Information Interchange (ISCII). UNIT III Arithmetic and Logic Unit: Learning Goals. Summary of CPU Organization. Computer Configuration. V. Page Tables. IC Chips for Organization of RAMs . Error Detecting Codes.C. Dual-Ported RAM. Hamming Code for Error Correction. B. Postulates of Boolean Algebra. Mapping of Instruction. Introduction. Page size. CMOS Transistor Gates.

Vector Operations. Handling Multiple Interrupts. Instruction Pipeline. B. Multiple Interrupt Lines. V. Array Processors. UNIT VIII Pipeline and Vector Processing: Parallel Processing. Arithmetic Pipeline..A UNIT VII Input-Output Organization: Learning Goals.S – CSE. M.2002 2.w. Delayed Branch. Prasad. Vectored Interrupts. Computer Organization. PHI. Naresh Jotwani. Bus Structure. DMA Based Data Transfer. PHI. Ethernet Local area Network-Bus Topology.. SIMD Array Processor TEXT BOOKS: 1. Data Dependency. 7th ed. Rajaraman. Client-Server Computing Using LAN. Bus Transaction Type . . Attached Array Processor. Asynchronous Serial data communication. Computer Organization & Architecture: Designing for Performance. Timings of Bus Transactions. Bus Arbitration. John D. 2009 4. Vranesic and Zaky. 1994 REFERENCE BOOKS: 1. VLSI Chip Interrupt Controller. Asynchronous Communication Interface Adapter (ACIA). Vector Processing.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Overview of I/O Methods. 2006 Dr E.. RISC Pipeline. Single level Interrupt Processing. Input/output (I/O) Processors. Delayed load. Pipelining-General Considerations. Computer System Architecture. Interrupt Structures. Chairman. Wireless LAN. Pearson. Software Polling. Matrix Multiplication Memory Interleaving Supercomputers. Local area Networks. 2006 2. Ex: Four-Segment Instruction Pipeline. Radhakrishnan. Ex: Three-Segment Instruction Pipeline. 5th ed. some Standard Buses. TMH. Computer System Organization. Ethernet Using star Topology. Handling of Branch Instructions.C. Interrupt Controlled data Transfer. Introduction. Morris Mano. device Interfacing. Program Controlled Data Transfer. Structure of a Bus Types of Bus. Digital Modems. Carpinelli. Bus Arbitration. Digital Logic and Computer Organization. 2008 3. William Stallings.e. 3rd ed . TMH . Serial Data Communication. Programmable Peripheral Interface Unit. Hamacher.O. Computer System Organization & Architecture. PHI. Daisy Chaining.

Sen. free & bound variables. Discrete Mathematics. V. UNIT VII Graph Theory: Representation of Graph. Discrete Mathematics. Prasad. Solution of Inhomogeneous Recurrence Relation. Sengadir. Cengage Learning. UNIT VI Recurrence Relations: Generating Function of Sequences. 3. Ramana. Malik. Discrete Mathematics.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. B.T.e. Pearson. Multi graphs and Euler circuits. Examples. Calculating Coefficient of generating functions. variables and quantifiers. . Basic Concepts. Rama Rao et al. Normal forms. Pearson. Properties of binary Relations. homomorphism. Recurrence relations. Rajendra Prasad. Theory of inference for the statement calculus UNIT II Rules of inference. 2005 Dr E. Inverse Function. Discrete Mathematical for computer Scientists & Mathematicians “ J. Pigeon hole Principles and its application. 2nd ed. sub groups. Binomial Multinomial theorems. 2005 5. Spanning Trees. DFS. PHI. Hamiltonian graphs. Grimaldi..Baker. statement functions.P. Elements of Discrete Mathematics. Busby. Solving recurrence relation by substitution and Generating functions. Chairman. inference theory of predicate calculus UNIT III Set theory & Relations:Introduction. Schaum’s Outlines. 2006 9. D P Mohanpatra. Bogart. Equivalence. predicate formulas. 2009 4. BFS. Binomial Coefficients. principles of Inclusion – Exclusion. Automatic Theorem Proving Predicate calculus: Predicates.. Partial ordering. Truth Tables. UNIT V Elementary Combinatorics: Basis of counting. 5th ed. Stein and Drysdale. Connectives. Well formed formulas.Lipson TMH. A.. C L Liu. Chromatic Numbers TEXT BOOKS: 1. Johnsonbaugh. equivalence implication. 6th ed. Isomorphism and Sub graphs.. Kolman. Compatibility Relations. Discrete Mathematics for computer science. Relations and ordering.Kandel . 6th ed. Mathematical Foundations of Computer Science. Discrete Mathematical Structures with Applications to computer science J. tautology. R. Definitions.Manohar. 2004 6. TMH 2. Binary trees. Lattice and its Properties. 6th ed.w. universe of discourse. UNIT IV Algebraic structures: Algebraic systems.L. Ross. Consistency of premises and indirect method of proof. Kruskals Algorithm.. 2005 7.S – CSE. J K Sharma. Molt. Enumerating of Combinations & Permutations with repetitions and constrained repetitions. Enumeration of Combinations & Permutations. Semi groups and monoids. PHI REFERENCE TEXTBOOKS: 1. 2009 10.TMH 2.O. Recursive Functions. Hasse diagram.P Tremblery. Examples and general properties. Planar Graphs UNIT VIII Graph Theory and Applications. The method of Characteristic roots. Discrete Mathematics. 2009 8.A DISCRETE STRUCTURES AND GRAPH THEORY UNIT I Mathematical Logic: Statements and notations. Discrete Mathematical Structures. Macmillan. Pearson. Functions: composition of functions. Isomorphism and related problems.C.. Springer. Discrete and Combinatorial Mathematics. Discrete Mathematics and Combinatorics.Lipschutz. USP. groups.

Prasad. Cengage Learning. T M Graw-Hill ed. Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M.e.O. John Schlipf. Jayant Ganguly. Discrete Mathematics and its Applications. 2007. Cengage. Gary Haggard. 2005 Discrete Mathematics with Applications. Rosen.. Sue Whitesides. Chairman. 16.A Discrete Mathematics with Combinatorics and Graph Theory. Discrete Mathematical. Levassure.S – CSE.f 2009 -10 11.2008. 14.2006. 5th ed.w. 15.C. 2006. Sanguine. 12. Santha. Discrete Mathematics for Computer Science. 2009 Applied Discrete Structures For Computer Science. Dr E.2006. 13. 17. Discrete Mathematical Structures. Elsevier. V. . Cengage. Koshy. Alan Doerr. Kevin Ferland. B. GP.

Statistics and Queuing Theory Applications. Continuous probability distribution. Statistical Quality Control Methods-bar charts p-charts etc. Binomial. TMH. Chairman. Central limit theorem and other limit theorems. John Wiley and Sons. polynomial and Curve fittings UNIT VII: Time series and Forecasting : Moving averages . Non Linear regression Least square fit . B. Student’s t and F distributions. Poisson.Sampling distributions of mean (σ known and unknown) proportions. intersection and compliments of events. psychology. t-test. . Probability. Trivedi. agriculture etc χ2 test.K. REFERENCE BOOKS: 1. Exponential. V. Statistics and Random Processes . 2. India Anuradha Agencies. Generalized Poisson Queueing model – Specialized Poisson Queues. Statistics and Random Processes Dr. 2. Application to medicine. TEXT BOOKS: 1. Smoothening of curves Forecasting models and methods . Probability. PHI. UNIT II Random variables and distribution: Random variables Discrete Probability Distributions..w. Probability and Statistics for Engineers: Miller and Freund. F-test. UNIT III Expectations and higher order moments – Moment Generating Function.Veerarajan. Factor Analysis ANOVA.O. Dr E. sums and differences. Discrete Probability. uniform. Probability. Characteristic functions – Laws on large numbers – Weak Laws and strong laws of large numbers. Statistics based on Normal. Conditional probability . UNIT V Tests of significance –Z-test. Prasad. Union .Gurusamy by Deepti Publications.e.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M.Murugesan & P.A PROBABILITY AND STATISTICAL APPLICATIONS UNIT I Probability Theory: Sample spaces Events & Probability. 2nd ed. UNIT VIII Queuing theory – Markov Chains – Introduction to Queuing systems – Elements of a queuing model – Exponential distribution – Pure birth and death models.S – CSE. UNIT VI Linear correlation coefficient Linear regression . T.Baye’s theorem.C. UNIT IV Sampling distribution: Populations and samples . Normal.

introduction of basic books of accounts ledgers. scope and computation and analysis . Characteristics and limitations of single entry system.under capitalization .over vitalization . Ashish. A. Vijay Kumar. D. UNIT V: Costing . role. transaction files. T.w. profit analysis. Prasad. PHI. marginal costing Financial accounting vs. Chatterjee.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Chairman.A ACCOUNTING AND FINANCIAL MANAGEMENT UNIT I: Accounting: Generally Accepted Accounting Principles(GAAP) & Accounting standards. John Tannent. Ambaresh Gupta.materials variance. labor variance and sales variance -cash budget. master files.S – CSE. Viva.practical applications of marginal costing. preparation and interpretation of Funds flow and cash flow statements-statement of changes in working capital. Himalaya. master budgets. cost accounting vs. importance. Role of Accountant in modern Organization UNIT III: Financial Management . Financial Accounting. 2. Haneef. Accounts and Finance for Non Accounts.K.profit maximization . V. Maheswari. Basic Financial Accounting for Management. Maheswari and S. objectives of time value of money . limitations and importance of cost .O. REFERENCES: 1. scope and importance . Accounting for Management.wealth maximization . P.flexible Budgets. Mukherjee and M. Users of Accounting Information. UNIT IV: Ratio Analysis .Absorption costing vs. Elements of cost .volume.nature and importance and basic principles.meaning. .Madan Mohan.S. TMH 4. 7. Himalaya 6.Final accounts . Essential of Financial Accounting. processing of different files and Outputs obtained. Premchand Babu and M. 8. TMH. UNIT VII: Standard costing and budgeting: nature.C. Guide to Financial Management. Financial Accounting.Fund flow analysis .limitations . double entry system of accounting. Short run decisions. introduction documents used for data collection.EPS maximization.advantages . sales budget . Financial Analysis and Accounting.N.K. UNIT VI: Marginal costing and Break-even Analysis: nature. K and Ballacharya. management accounting. Dr E.e. Pearson 5..company final accounts.meaning and scope. UNIT II: Preparation of trial balance . Vikas 3. UNIT VIII: Introduction to computerized accounting system: coding logic and codes. B.

TOEFL. Suggested Software for Lab classes: Cambridge Advanced Learners’ Dictionary with exercises The Rosetta Stone English Library Clarity Pronunciation Power Mastering English in Vocabulary. 5. Cambridge Dr E.C.GMAT MODELS LAB SESSIONS 2 1 1 1 1 2 2 1 1 2 1. However.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. 3 4 5 6 7 8 9 10 TOPICS/SUB-TOPICS INTRODUCTION TOPHONETICS -Vowels. TOEFL. Punctuation.correspondence MODULE 1. Aptitude Test etc.O. ENGLISH LANGUAGE LABORATORY PRACTICE 1.4 CDs Microsoft Encarta Murphy’s English Grammar. learner-friendly modes of language learning. To train them to use language effectively to face interviews. 2. Brain-teasers. Debate 6. Facing Interviews 9. The lab should cater to the needs of the students to build up their confidence to help them develop leadership qualities through through their communicative competence. Herbert Puchta and Jeff Stranks with Meredith Levy. To help the students cultivate the habit of reading passages from the computer monitor. report writing. V. 5. To enable them to learn better pronunciation through stress on word accent. Cambridge Time series of IQ Test. Composition Dorling Kindersley series of Grammar. thus providing them with the required facility to face computer-based competitive exams such GRE. e. and rhythm. Composition etc. intonation. English in Mind.making etc. Introduction to Phonetics. 3.w. Prasad.e. Resume preparation 10. format. . 4. Group Discussions 8. To initiate them into greater use of the computer in resume preparation. -Diphthongs INTRODUCTION TO STRESS & INTONATION -Articulation. Public Speaking. Introduction to Vowels and Consonants and associated Phonetic symbols. 2. Oxford Advanced Learner’s Compass. Foundation Books Pvt Ltd Learning to Speak English . Chairman.A ENGLISH LANGUAGE COMMUNICATION SKILLS LAB Objectives: The language lab focuses computer-aided multi-media instruction and language acquisition to achieve the following targets: To expose the students to a veriety of self-instructional.S – CSE. -Respiration. group discussions. Situational Dialogues/Role Play. -Phonation SITUATIONAL/DIALOGUE/ ROLE PLAY PUBLIC SPEAKING DEBATE GROUP DISCUSSIONS FACING INTERVIEWS RESUME PREPARATION e-CORRESPONDENCE GRE. 2. 4. Grammar. B. Intonation and Rhythm. Spellings. depending upon the available of infrastructure and budget. the above targets can also be achieved by procuring the minimum required equipment suggested for the establishment of Conventional Lab the details of which are given below. 7. public speaking. 7th Edition Language in Use. 3. GMAT etc. -Consonants. Introduction to Accent.

iii) To solve Towers of Hanoi problem.e. Dr E. To learn problem solving techniques • To Introduce the student to simple linear and non linear data structures such as lists. (Consider the operators +. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’. % and use Switch Statement) Exercise 5 a) Write a C program to find both the larges and smallest number in a list of integers.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. c) Write a C program to implement Newton Raphson method for a quadratic equation d) Write a C program to implement Newton Raphson method for a general purpose algebriac equation Exercise 3 a) Write C programs that use both recursive and non-recursive functions i) To find the factorial of a given integer. V. d) Write a program which checks a given integer is Fibonacci number or not. b) Write a C program to determine if the given string is a palindrome or not Exercise 7 a) Write a C program that displays the position/ index in the string S where the string T begins. ANSI C Compiler with Supporting Editors. iv) Calculating transpose of a matrix in-place manner. Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. Exercise 6 a) Write a C program that uses functions to perform the following operations: i) To insert a sub-string in to given main string from a given position. b) Write a C program that uses functions to perform the following: i) Addition of Two Matrices ii) Multiplication of Two Matrices iii) Checking symmetricity of a square matrix. where n is a value supplied by the user. a) Write a C program to calculate the following Sum: Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10! b) Write a C program to find the roots of a quadratic equation. IDE’s such as Turbo C. which takes two integer operands and one operator form the user.C. or –1 if S doesn’t contain T. Recommended Systems/Software Requirements: • Intel based desktop PC. Subsequent terms are found by adding the preceding two terms in the sequence.*.A COMPUTER PROGRAMMING DATA STRUCTURES LAB Objectives: • To learn/strengthen a programming language like C. b) Write a C program.-. . c) Write a C program to generate all the prime numbers between 1 and n. b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. ii) To find the GCD (greatest common divisor) of two given integers. /. B. a) Write a C program to find the sum of individual digits of a positive integer. performs the operation and then prints the result..w. Prasad. b) Write a C program to count the lines. Exercise 2. Exercise 4 a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec. ii) To delete n Characters from a given position in a given string. stacks. etc. Chairman. words and characters in a given text.O.) and acceleration (m/sec2). iv) Write program to calculate probability of head/tail by generating random numbers using random() function. queues. Write a C program to generate the first n terms of the sequence. Bloodshed C Exercise l.S – CSE.

the sum Perform error checking.: i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways Exercise 15 a. Prasad. (Note: The file name and n are specified on the command line.) Exercise 13 a) Write a C program that uses functions to perform the following operations on singly linked list. . x and n.A Exercise 8 a) Write a C program to generate Pascal’s triangle. Write a C program to find the 2’s complement of a binary number. then the program computes 1+5+25+125.O. Print x.S – CSE. Exercise 9 Write a C program to read in two numbers.) Write C programs that implement stack (its operations) using i) Arrays ii) Pointers iii) linked list. Program to check for its strictness.C. b. Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers iii) linked lists. For example. b) Write a C program to construct a pyramid of numbers.e.: i) Creation ii) Insertion iii) Deletion iv) Traversal b) Adding two large integers which are represented in linked list fashion. then go back and read in the next pair of numbers of without computing the sum. Exercise 10 a) 2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Dr E. Exercise 17 Write a C program that uses Stack operations to perform the following: i) Converting infix expression into postfix expression ii) Evaluating the postfix expression Exercise 18 a. c. Are any values of x also illegal ? If so. inorder and postorder. and then compute the sum of this geometric progression: 1+x+x2+x3+………….w.+xn For example: if n is 3 and x is 5. b) Write a C program to reverse the first n characters in a file. b) Write a C program to convert a Roman numeral to its decimal equivalent. the formula does not make sense for negative exponents – if n is less than 0. Have your program print an error message if n<0. V. Chairman. Exercise 14 Write a C program that uses functions to perform the following operations on doubly linked list. test for them too. Thus 2’s complement of 11100 is 00100. B. Exercise 16 a. Program to check balance property of a tree. n. Write a C program that uses functions to perform the following: i) Creating a Binary Tree of integers ii) Traversing the above binary tree in preorder.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Exercise 11 Write a C program that uses functions to perform the following operations using Structure: i) Reading a complex number ii) Writing a complex number iii) Addition of two complex numbers iv) Multiplication of two complex numbers Exercise 12 a) Write a C program which copies one file to another.

w. Write C programs to implement the linear regression and polynomial regression algorithms. Reference Books: 1. Exercise 24 a. Write C programs to implement Trapezoidal and Simpson methods. B. Floyd. and b) Program for Calculating pi value. V. Digital Fundamentals.C. PHI.e.Gregory forward interpolation. Program to calculate mean and standard deviation of a population. Chairman. Digital Logic and Computer Organization. Recursive implementation of sorting algorithms.S – CSE.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. Exercise 22 Write C programs to implement the Lagrange interpolation and Newton. Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Insertion sort ii) Bubble sort b. 8th ed . b. Prasad. Jain. Exercise 23 a. .A Exercise 19 Write C programs that use both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers : i) Linear search ii) Binary search Exercise 20 Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Bubble sort ii) Quick sort Exercise 21 a. Pearson 2. Rajaraman. Radhakrishnan.O. 2006 Dr E.

Logic Function Generator Exercise 8 Decoders and Encoders Exercise 9 BCD adders and Comparators Exercise 10 Registers: Basic Shift Register (SR). EPROM – Testing Memory Chips REFERENCE BOOKS 1. PHI. Binary – to. JK.D.to –Decimal. 1 ‘s and 2’s complement addition Exercise 7 Multiplexers/ Data Selector : 2. BCD.w.5. . Ripple Counter. Radhakrishnan.C. 2. SI/PO SR.f 2009 -10 Code: MCA 09 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA I YEAR I SEMESTER M. SI/SO SR. PROM. Pearson . Digital Logic and Computer Organization. Synchronous/Asynchronous Binary Counter. PI/SO SR.input and 8. Floyd & Jain . Edge – Triggered Flip – Flops Exercise 4 Counters: Binary Counter.O. Decimal – to.S – CSE. Binary – to – Decimal. Demultiplexers . Sequence Generator. gray.Hexa Decimal. B. Rajaraman.input. Chairman. Modulo – 10 Exercise 6 Adders / Sub tractors: Half Adder. PI/PO SR Exercise 11 Johnson Counter. Decade Counter. Digital Fundamentals. Full Adder. Up/Down Counter Exercise 5 Modulo Counter: Modulo . collector Buffers Exercise 14 Gates : CMOS / NMOS/TTL – Basic Operational Characteristics and parameters Exercise 15 RAM.to -Binary Exercise 13 Buffers / Derivers : Open . Master –Slave FF.T.gray. ROM. Prasad.A DIGITAL LOGIC AND COMPUTER SYSTEMS ORGANIZATION (DLCSO) LAB Exercise 1 Boolean Algebra: Theorems and logical guides.e. 2005. Using (i) AND – OR-NOT Gates (ii) NAND Gates (iii) NOR Gates Exercise 3 Latches Flip – Flops : RS. 2006 Dr E. V. Parity Generators/ Checkers Exercise 12 Code Converters : Decimal –to-Binary. verification of truth tables Exercise 2 Realization of Boolean expressions .


Sign up to vote on this title
UsefulNot useful