www.jntuworld.

com

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Course Structure and Syllabus for I Year I Sem MCA 2009-2010

Code

Practicals

Subject

Mathematical Foundations of Computer Science

Computer Organization

Object Oriented Programming through C++

Probability and Statistics

Accounting and Financial Management

IT Workshop
Object Oriented Programming Lab through C++

3
3

2
2

Computer Organization Lab

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
UNIT I
Mathematical Logic: Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology,
equivalence implication, Normal forms,Quantifiers,universal quantifiers.
Predicates: Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of
contradiction, Automatic Theorem Proving.
UNIT II
Relations: Properties of binary Relations, equivalence,transitive closure, compatibility and partial ordering
relations, Lattices,Hasse diagram. Functions: Inverse Function, Composition of functions, recursive
Functions, Lattice and its Properties.
Algebraic structures: Algebraic systems, Examples and general properties, Semi groups and monoids,
groups, and sub groups, homomorphism, Isomorphism.
UNIT III
Elementary Combinatorics: Basics of counting, Combinations & Permutations, with repetitions, Constrained
repetitions, Binomial Coefficients, Binomial and Multinomial theorems, the principles of Inclusion
Exclusion,Pigeon hole principles and its application.
UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Calculating Coefficients of generating
functions, Recurrence relations, Solving recurrence relation by substitution and Generating functions, the
method of Characteristic roots, solution of Inhomogeneous Recurrence Relations.
UNIT V
Graph Theory: Representation of Graphs, DFS, BFS, Spanning Trees, Planar Graphs.
Graph Theory and Applications, Basic Concepts, Isomorphism and Sub graphs, Multi graphs and Euler
circuits, Hamiltonian graphs, Chromatic Numbers.
TEXT BOOKS:
1. Elements of Discrete Mathematics- A Computer Oriented Approach,C.L.Liu,
rd
D.P. Mohapatra,3 edition,TMH.
2. Discrete Mathematics for Computer Scientists & Mathematicians, second edition,
J.L.Mott, A. Kandel, T.P. Baker, PHI
3. Discrete and Combinatorial Mathematics- An Applied Introduction-5th Edition
Ralph. P.Grimaldi, Pearson Education.
REFERENCE BOOKS:
1. Discrete Mathematics and its applications, 6th edition, K.H.Rosen, TMH.
2. Discrete Mathematical Structures, Mallik and Sen, CengageLearning.
3. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby, Sharon Cutler Ross, PHI/
Pearson Education.
4. Discrete Mathematics with Applications,Thomas Koshy,Elsevier.
5. Discrete Mathematics, Lovasz, Springer.
6. Logic and Discrete Mathematics, Grass Man and Tremblay,Pearson Education.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
COMPUTER ORGANIZATION
UNIT I
NUMBER SYSTEMS AND COMPUTER ARITHMETIC- Signed and unsigned numbers, Addition and
subtraction, multiplication, division, Floating point representation, logical operation, Gray code, BCD codes,
Error detecting codes, Boolean algebra, Simplification of Boolean expressions, K-Maps.COMBINATIONAL
AND SEQUENTIAL CIRCUITS- decoders, Encoders, Multiplexers, Half and Full adders, Shift registers,
Sequential circuits- flip-flops.
UNIT II
MEMORY ORGANIZATION-Memory hierarchy, Main memory-RAM, ROM chips, Memory address map,
memory contention to CPU, Associative Memory-Hardware logic, match, read and write logic, Cache
Memory-Associative mapping, Direct mapping, Set-associative mapping, hit and miss ratio.
UNIT III
BASIC CPU ORGANIZATION-Introduction to CPU,Instruction formats-INTEL-8086 CPU architectureAddressing modes - generation of physical address- code segment registers, Zero, one, two, and three
address instructions.
UNIT IV
INTEL 8086 ASSEMBLY LANGUAGE INSTRUCTIONS-Data transfer instructions-input- output instructions,
address transfer, Flag transfer, arithmetic, logical, shift, and rotate instructions.conditional and unconditional
transfer, iteration control, interrupts and process control instructions, assembler directives, Programming
with assembly language instructions.
UNIT V
INPUT -OUTPUT ORGANIZATION-Peripheral devices, input-output interface-I/0 Bus and interface modules,
I/O versus Memory bus, isolated versus memory mapped I/O, Modes of transfer-Programmed I/O, Interruptinitiated I/O, priority interrupts-Daisy chaining, parallel priority, interrupt cycle, DMA- DMA control, DMA
transfer, Input output processor-CPU-IOP communication.
TEXT BOOKS:
1. Computer System Architecture, M. Morris Mano , 3rd Edition, PHI/Pearson Education,2008.
2. Microprocessors and Interfacing, Douglas Hall, Tata McGraw-Hill.
REFERENCE BOOKS:
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Vth Edition, McGraw Hill.
2. Fundamentals of Computer Organization and Design, Sivarama P.Dandamudi ,Springer Int.
Edition.
3. Computer Organization and Architecture, William Stallings, 7th Edition, Pearson/PHI,2007.
4. Digital Design , M. Morris Mano, PHI/Pearson Education .
5. Computer Organization and Design ,D.A.Paterson and John L.Hennessy,Elsevier.
6. Computer Architecture and Organization,M.Murdocca andV.Heuring,Wiley Inda.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
OBJECT ORIENTED PROGRAMMING THROUGH C++
UNIT I
Different paradigms for problem solving, need for OOP paradigm, classes and instances, fundamental
characteristics of OOP (Alan key), differences between OOP and Procedure Oriented Programming.
C++ Basics: Structure of a C++ program, Data types, Declaration of variables, Expressions, Operators,
Operator Precedence, Evaluation of expressions, Type conversions, Pointers, Arrays, Pointers and Arrays,
Strings, Structures, References. Flow control statements- if, switch, while, for, do, break, continue, goto
statements.
UNIT II
C++ Functions-Scope of variables, Parameter passing methods, Default arguments, inline functions,
Recursive functions, Pointers to functions.
C++ Classes And Data Abstraction: Class definition, Class objects, Class scope, this pointer, Friends to a
class, Static class members, Constant member functions, Constructors and Destructors, Data abstraction,
ADT and information hiding.
UNIT III
Dynamic memory allocation and deallocation operators-new and delete, Dynamic creation and destruction of
objects, Preprocessor directives, name spaces.
Polymorphism: Function overloading, Operator overloading, Generic programming-necessity of templates,
Function templates and class templates.
UNIT IV
Inheritance: Defining a class hierarchy, Different forms of inheritance, Defining the Base and Derived
classes, Access to the base class members, Base and Derived class construction, Destructors, Virtual base
class.
Virtual Functions And Run Time Polymorphism: Overriding, Static and Dynamic bindings, Base and Derived
class virtual functions, Dynamic binding through virtual functions, Virtual function call mechanism, Pure
virtual functions, Abstract classes. UNIT V
C++ I/O: I/O using C functions, C++ Stream classes hierarchy, Stream I/O, File streams and String
streams,File Operations, Overloading << and >> operators, Error handling during file operations, Formatted
I/O.
Exception Handling: Benefits of exception handling, Throwing an exception, The try block, Catching an
exception, Exception objects, Exception specifications, Stack unwinding, Rethrowing an exception, Catching
all exceptions.
TEXT BOOKS:
1. C++, The Complete Reference, 4th Edition, Herbert Schildt, TMH.
2. Object Oriented Programming in C++, 4th Edition, R.Lafore, SAMS, Pearson Education
REFERENCE BOOKS:
1. An Introduction to OOP, 3rd Edition, T. Budd, Pearson Education,2008.
2. Programming Principles and Practice Using C++, B.Stroutstrup, Addison- Wesley, Pearson
Education.
3. Problem solving with C++, 6th Edition, Walter Savitch, Pearson Education,2007..
4. The Art, Philosophy and Science of OOP with C++, R.Miller,SPD.
5. OOP in C++, 3rd Edition, T.Gaddis, J.Walters and G.Muganda, Wiley DreamTech Press.
6. An Introduction to OOP in C++ with applications in Computer Graphics, 2nd Edition, G.M.Seed,
Springer.
7. Programming with ANSI C++, B.Trivedi,Oxford Press.
8. Programming in C++,M.T.Somasekara,PHI.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
PROBABILITY AND STATISTICS
UNIT I
Probability: Sample space and events Probability The axioms of probability - Some elementary
theorems - Conditional probability Bayes theorem.
UNIT II
Random variables Discrete and continuous Distribution Distribution function.
Distribution - Binomial, poisson and normal distribution related properties.
UNIT III
Sampling distribution: Populations and samples - Sampling distributions of mean (known and unknown)
proportions, sums and differences.
Estimation: Point estimation interval estimation - Bayesian estimation.
UNIT IV
Test of Hypothesis Means and proportions Hypothesis concerning one and two means Type I and

test. Estimation of
Type II errors. One tail, two-tail tests.Tests of significance Students t-test, F-test,
proportions.
UNIT V
Curve fitting: The method of least squares Inferences based on the least squares estimations - Curvilinear
regression multiple regressions correlation for univariate and bivariate distributions.
TEXT BOOKS:
1. Probability and statistics for engineers (Erwin Miller And John E.Freund), R A Johnson And
C.B.Gupta.. 7th edition, Pearson Education / PHI.
2. Introduction to Probability and Statistics, 12th edition, W.Mendenhall, R.J.Beaver and B.M.Beaver,
Thomson. (Indian edition).
REFERENCE BOOKS:
1. Text book of Probability and Statistics Dr.Shahnaz Bathul, V.G.S.Publishers 2003.
2. Probability and Statistics in Engineering, 4th Edition, William W.Hines, Douglas C.Montgomery,
David M.Goldsman, Connie M.Borror, Wiley Student Edition.
3. Probability, Statistics and Queuing Theory, 2nd Edition, Trivedi, John Wiley and Sons
4. Introduction to Probability and Statistics, J.S.Milton, Jesse C.Arnold, 4th edition, TMH.
5. Probability,Statistics and Random Processes,Dr.K.Murugesan,P.Guruswamy,Anuradha Agencies,
Deepti Publications.
nd
6. Probability and Statistics for Engineers,G.S.S.Bhisma Rao,Sitech,2 edition,2005.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
ACCOUNTING AND FINANCIAL MANAGEMENT
UNIT I
Introduction to Accounting: Principles, concepts and conventions, double entry system of accounting,
introduction to basic books of accounts, Journal, ledger- Trial Balance - Preparation of Final accounts:
Trading Account, Profit and Loss Account and Balance Sheet.
UNIT II
Financial Management - Meaning and scope, role of Financial Manager, Objectives of time value of money
- Goals of Financial Management, Leverages: Operating, Financial Leverage and Combined Leverage Cost
of Capital: Cost of Equity, Preference Shares, Bonds- Weighted Average Cost of Capital Capital GearingOvercapitalization and Undercapitalization, Sources of Finance.
Unit III
Tools and Techniques for Financial Statement Analysis: Ratio Analysis Classification of Ratios Short
term solvency and long term solvency Profitability ratios - Analysis and Interpretation of Financial
Statements through ratios of Liquidity, Solvency and Profitability ratios. Fund Flow Statement - Meaning,
Importance, Statement of changes in working capital and statement of Sources and application of funds.
Cash flow Analysis: cash flow Statements: Preparation, Analysis and interpretation.
UNIT IV
Break-even Analysis: Concept of Break Even Point, Cost-Volume-Profit Analysis, Determination of Break
Even Point, Margin of Safety and PV ratio, Impact of changes in Cost or selling price on BEP Practical
applications of Break-even Analysis.
Unit V
Capital Budgeting: Capital and its significance, Types of Capital, Estimation of Fixed and Working capital
requirements, Methods and sources of raising capital.. Capital Budgeting: features of capital budgeting
proposals, Methods of Capital Budgeting: Payback Method, Accounting Rate of Return (ARR) and Net
Present Value Method (simple problems).
Text Books:
1. Aryasri: Accounting And Financial Management,, TMH, 2009
2. Van Horne, James, C: Financial Management and Policy, Pearson, 2009
References
1. Prasanna Chandra, Financial Management, TMH, 2009
2. S.N.Maheshwari, Financial Accounting, Sultan Chand, 2009.
3. Tulsian, Financial Accounting, S Chand, 2009.
4. Khan and Jain: Financial Management, TMH, 2009
5. Gokul Sinha: Financial Statement Analysis, PHI, 2009
6. Bhat Sundhindra:Financial Management, Excel:2009
7. Jawaharlal:Accounting for Management, Himalaya, 2009

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
IT WORKSHOP
Objectives:
The IT Workshop for engineers is a training lab course spread over 40 hours. The modules include training
on PC Hardware, Internet & World Wide Web and Productivity tools including Word, Excel, Power Point.
PC Hardware introduces the students to a personal computer and its basic peripherals, the process of
assembling a personal computer, installation of system software like MS Windows , Linux and the required
device drivers. In addition hardware and software level troubleshooting process, tips and tricks would be
covered. The students should work on working PC to disassemble and assemble to working
condition and install Windows and Linux on the same PC. Students are suggested to work similar
tasks in the Laptop scenario wherever possible.
Internet & World Wide Web module introduces the different ways of hooking the PC on to the internet from
home and workplace and effectively usage of the internet. Usage of web browsers, email.
Productivity tools module would enable the students in crafting professional word documents, excel
spread sheets and power point presentations. (Recommended to use Microsoft office 2007 in place of
MS Office 2003)
PC Hardware
Week 1 Task 1 : Identify the peripherals of a computer, components in a CPU and its functions. Draw the
block diagram of the CPU along with the configuration of each peripheral and submit to your instructor.
Week 2 Task 2 : Every student should disassemble and assemble the PC back to working condition.
Lab instructors should verify the work and follow it up with a Viva. Also students need to go through the
video which shows the process of assembling a PC. A video would be given as part of the course content.
Week 3 Task 3 : Every student should individually install MS windows on the personal computer. Lab
instructor should verify the installation and follow it up with a Viva.
Week 4 Task 4 : Every student should install Linux on the computer. This computer should have windows
installed. The system should be configured as dual boot with both windows and Linux. Lab instructors
should verify the installation and follow it up with a Viva
Week 5 Task 5 : Hardware Troubleshooting : Students have to be given a PC which does not boot due
to improper assembly or defective peripherals. They should identify the problem and fix it to get the
computer back to working condition. The work done should be verified by the instructor and followed up with
a Viva
Week 6 Task 6 : Software Troubleshooting : Students have to be given a malfunctioning CPU due to
system software problems. They should identify the problem and fix it to get the computer back to working
condition. The work done should be verified by the instructor and followed up with a Viva.
Internet & World Wide Web
Week 7 - Task 1 : Orientation & Connectivity Boot Camp : Students should get connected to their Local
Area Network and access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate, to the instructor, how to access the websites and email. If there is no internet
connectivity preparations need to be made by the instructors to simulate the WWW on the LAN.
Week 8 - Task 3 : Search Engines & Netiquette : Students should know what search engines are and how
to use the search engines. A few topics would be given to the students for which they need to search on
Google. This should be demonstrated to the instructors by the student.

www.jntuworld.com

MS Word
Week 9&10: The mentor needs to give an overview of Microsoft (MS) word 2007: Accessing, overview of
toolbars, saving files, Using help and resources, rulers, format painter in word. Give a task covering to
create project certificate. Features to be covered:-Formatting Fonts in word, Drop Cap in word, Applying
Text effects, Using Character Spacing, Borders and Colors, Inserting Header and Footer, Inserting table,
using Drawing toolbar in word.
MS Excel
Week 11&12: The mentor needs to tell the importance of MS office 2007 Excel as a Spreadsheet tool
covering Accessing, overview of toolbars, saving excel files, Using help and resources., Also give a task
that is covering the features like Gridlines, Format Cells, Summation, auto fill, Formatting Text.
MS Power Point
Week 13&14: Students will be working on MS power point which help them create basic power point
presentation. Topic covered during this week includes :- PPT Orientation, Slide Layouts, Inserting Text,
Word Art, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows in both d Power point.
Students will be given model power point presentation which needs to be replicated (exactly how its asked).
REFERENCES :
1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech
2. The Complete Computer upgrade and repair book,3rd edition Cheryl A Schmidt, WILEY Dreamtech
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.
4. PC Hardware and A+Handbook Kate J. Chase PHI (Microsoft)
5. LaTeX Companion Leslie Lamport, PHI/Pearson.
6. IT Essentials PC Hardware and Software Companion Guide Third Edition by David Anfinson and Ken
Quamme. CISCO Press, Pearson Education.
7. IT Essentials PC Hardware and Software Labs and Study Guide Third Edition by Patrick Regan CISCO
Press, Pearson Education.
th
8.Troubleshooting,Maintaining and Repairing PCs,S.J.Bigelow,5 edition,TMH.
9.Office 2007,C.Grover,M.Donald and E.A. Vander Veer,O Reilly,SPD.
10.Step by Step 2007 Microsoft Office System,J.Cox and others(Microsoft),PHI.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
OBJECT ORIENTED PROGRAMMING LAB THROUGH C++
List of Sample Problems/Experiments:
1. Write a C++ program to find the sum of individual digits of a positive integer.
2. A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and
1.Subsequent terms are found by adding the preceding two terms in the sequence.Write a C++ program
to generate the first n terms of the sequence.
3. Write a C++ program to generate all the prime numbers between 1 and n ,
where n is a value supplied by the user.
4. Write C++ programs that use both recursive and non-recursive functions
a. To find the factorial of a given integer. b. To find the GCD of two given integers.
c. To find the nth Fibonacci number.
5. Write a C++ program that uses a recursive function for solving Towers of Hanoi problem.
6. Write a C++ program that uses functions
a. To swap two integers. b. To swap two characters.
c. To swap two reals. Note: Use overloaded functions.
7. Write a C++ program to find both the largest and smallest number in a list of integers.
8. Write a C++ program to sort a list of numbers in ascending order.
9. Write a C++ program that uses function templates to solve problems-7&8.
10. Write a C++ program to sort a list of names in ascending order.
11. Write a C++ program to implement the matrix ADT using a class. The operations
supported by this ADT are:
a) Reading a matrix.
c) Addition of matrices.
b)Printing a matrix.
d) Subtraction of matrices.
e)Multiplication of matrices.
12. Implement the matrix ADT presented in the problem-11 using overloaded operators
(<<, >>, +, -, *) and templates.
13. Implement the complex number ADT in C++ using a class. The complex ADT is used to represent
complex numbers of the form c=a+ib, where a and b are real numbers. The operations supported by
this ADT are:
a) Reading a complex number.
d) Subtraction of complex numbers.
b) Writing a complex number.
e) Multiplication of complex numbers.
c) Addition of Complex numbers.
f) Division of complex numbers.
14. Write a C++ program that overloads the + operator and relational operators (suitable) to perform the
following operations:
a) Concatenation of two strings.
B)Comparison of two strings.
15. Implement the complex number ADT in C++ using a class. The complex ADT is used to represent complex
numbers of the form c=a+ib, where a and b are real numbers. The operations supported by this ADT
are:
a) Reading a complex number.
d) Subtraction of complex numbers.
b) Writing a complex number.
e) Multiplication of complex numbers.
c) Addition of Complex numbers.
f) Division of complex numbers.
Note: 1. overload << and >> operators in part a and part b.
2. overload +, - , * , / operators in parts c, d, e and f.
16. Write a template based C++ program that determines if a particular value occurs in an array
of values.
17. Write a C++ program that uses functions to perform the following operations:
a. Insert a sub-string into the given main string from a given position.
b. Delete n characters from a given position in a given string.
18. Write a C++ program that uses a function to reverse the given character string in place, without any
duplication of characters.
19. Write a C++ program to make the frequency count of letters in a given text.
20. Write a C++ program to count the lines, words and characters in a given text.
21. Write a C++ program to determine if the given string is a palindrome or not.
22. Write a C++ program to make frequency count of words in a given text.
23. Write a C++ program that displays the position or index in the string S where the string t
begins , or 1
if S doesnt contain t.

www.jntuworld.com

24. 2s 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. Thus 2s complement of 11100 is 00100. Write a C++ program to find
the 2s complement of a binary number.
25. Write a C++ program that counts the number of 1 bit in a given integer.
26. Write a C++ program to generate Pascals triangle.
27. Write a C++ program to construct of pyramid of numbers.
28. Write a C++ program to compute the Sine series.
29. Write a C++ program that converts Roman numeral into an Arabic integer.
30. Write a C++ program which converts a positive Arabic integer into its
corresponding Roman Numeral.
31. Write a C++ program to display the contents of a text file.
32. Write a C++ program which copies one file to another.
33. Write a C++ program to that counts the characters, lines and words in the text file.
34. Write a C++ program to change a specific character in a file.
Note: Filename , number of the byte in the file to be changed and the new character are
specified on the command line.
35. Write a C++ program to reverse the first n characters in a file.
36. Write a C++ program that uses a function to delete all duplicate characters
in the given string.
37. Write a C++ program that uses a function to convert a number to a character string.
38. Write a C++ program that uses a recursive function to find the binary equivalent of a given non-negative
integer n.
39. Write a C++ program to generate prime numbers up to n using Sieve of Eratosthenes method.
40. Write a C++ program
a)
To write an object to a file.
b)
To read an object from the file.
41. Write C++ programs that illustrate how the following forms of inheritance are supported:
a) Single inheritance
b) Multiple inheritance
c) Multi level inheritance d) Hierarchical inheritance
42. Write a C++ program that illustrates the order of execution of constructors and destructors when new
class is derived from more than one base class.
43. Write a C++ program that illustrates how run time polymorphism is achieved using virtual functions.
44. Write a C++ program that illustrates the role of virtual base class in building class hierarchy.
45. Write a C++ program that illustrates the role of abstract class in building class hierarchy.
TEXT BOOKS:
1. Mastering C++, K.R.Venu Gopal, Raj Kumar and T.Ravi Shankar, TMH.
2. C++ Programming, D.S.Malik, Cengage Learning.
3. Practical C++ Programming,S.Qualline,SPD.
th
4. Object Oriented Programming with C++, E.Balaguruswamy, 4 Edition, TMH,2008.
5. OOP with C++,S.Sahay,Oxford Higher Education.
nd
6. C++ and OOP Paradigm,D.Jana,2 Edition, PHI
7. Fundamentals of C++ Programming,S.Subramanian,Jaico Publishing House.
th
8. C++ Programming, Al Stevens,7 edition,Wiley India.
9. Learning C++, Eric Nagler, Jaico Publishing House.
10. C How to program,P.J.Deitel and H.M.Deitel,PHI.

www.jntuworld.com

MASTER OF COMPUTER APPLICATIONS

I Year I Semester
COMPUTER ORGANIZATION LAB
List of Sample Problems/Experiments:
Write assembly language programs for the following using MASAM.
1. Write assembly language programs to evaluate the expressions:
i) a = b + c d * e
ii) z = x * y + w v +u / k
a. Considering 8-bit, 16 bit and 32 bit binary numbers as b, c, d, e.
b. Considering 2 digit, 4digit and 8 digit BCD numbers.
Take the input in consecutive memory locations and results also.
Display the results by using int xx of 8086. Validate program for the
boundary conditions.
2. Write an ALP of 8086 to add two exponential numbers which are in IEEE 754 notation.
Display the results by using int xx of 8086. Validate program for the boundary
conditions.
3. Write an ALP of 8086 to take N numbers as input. And do the following operations
on them.
a) Arrange in ascending and Descending order.
b) Find max and minimum
c) Find average
Considering 8-bit, 16 bit binary numbers and 2 digit, 4digit and 8 digit BCD numbers.
Display the results by using int xx of 8086. Validate program for the
boundaryconditions.
4. Write an ALP of 8086 to take a string of as input (in C format)and do the
following Operations on it.
a) Find the length
b) Find it is Palindrome or not
c) Find whether given string substring or not.
d) Reverse a string
e) Concatenate by taking another sting
Display the results by using int xx of 8086.
5. Write the ALP to implement the above operations as procedures and call
from the main procedure.
6. Write an ALP of 8086 to find the factorial of a given number as a
Procedure and call from the main program which display the result.
7. Write an assembly language program to encrypt digits as shown below:
Input digit : 0 1 2 3 4 5 6 7 8 9
Encrypted digit : 4 6 9 5 0 3 1 8 7 2
Your program should accept a string consisting of digits. The encrypted
string should be displayed using int xx of 8086.
8. Write a procedure to locate a character in a given string. The procedure receives a
pointer to a string and character to be located. When the first occurrence of the character is located , its
position is returned to main. If no match is found , a negative value is returned. The main procedure
requests a character string and a character to be located and displays the result.
9. Write an assembly language program to read a string of characters from the user and
that prints the vowel count . Display the results by using int xx of 8086.
ex.
Input : Advanced Programming in UNIX
Out put:
Vowel
count
a or A
3
e or E
1
i or I
3
o or O
1
u or U 1
10. A computer uses RAM chips of 1024 X 1 capacity.
a) How many chips are needed, and how should their address lines be connected to provide a
memory capacity of 1024 bytes?
b) How many chips are needed to provide a memory capacity of 16K bytes?
11. A computer employs RAM chips of 256X8 and ROM chips of 1024 X 8. The computer

www.jntuworld.com

needs 2K bytes of RAM, 4K bytes of ROM, and four interface units, each with four
registers. A memory-mapped I/O configuration is used. The two highest-order bits of the
address bus are assigned 00 for RAM, 01 for ROM, 10 for interface registers.
a. How many RAM and ROM chips are needed?
b. Draw a memory-address map for the system.
c. Give the address range in hexadecimal for RAM, ROM and interface.
12. Obtain the complement function for the match logic of one word in an associative
memory. Draw the logic diagram for it and compare with the actual match logic diagram.
13. A two-way set associative cache memory uses blocks of four words. The cache can
accommodate a total of 2048 words from main memory. The main memory
size is 128K X 32.
a. Formulate all pertinent information required to construct the cache memory.
b. What is the size of the cache memory?
14. A digital computer has a memory unit of 64K X 16 and a cache memory of 1K words.
The cache uses direct mapping with a block size of four words.
a. How many bits are there in each word of cache, and how are they divided
into functions? Include a valid bit.
b. How many bits are there in the tag, index, block, and word fields of the
address format?
c. How many blocks can the cache accommodate?
15. An address space is specified by 24 bits and the corresponding memory space by 16 bits.
a. How many words are there in the address space?
b. How many words are there in the memory space?
c. If a page consists of 2K words, how many pages and blocks are there in the system.
16. A virtual memory has a page size of 1K words. There are eight pages and four blocks.
The associative memory page table contains the following entries. Make a list of all virtual
addresses(in decimal) that will cause a page fault.
Page
Block
0
3
1
1
4
2
6
0
TEXT BOOKS:
1.
2.
3.

IBM PC Assembly Language and Programming, P. Abel, 5th Edition, PHI/Pearson Education.
Introduction To Assembly Language Programming, Sivarama P.Dandamudi, Springer Int.
Edition,2003.
The 8088 and 8086 Microprocessors: Programming , Interfacing, Software, Hardware and
th
Application,4 edition, W.A. Triebel, A.Singh, N.K. Srinath, Pearson Education.