JNTUH_MCA_SYLLABUS_R22_ALL_READING_MCA IMPORT

R22 MCA
JNTUH
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MASTER OF COMPUTER APPLICATIONS (MCA)
Effective from Academic Year 2022-23 Admitted Batch
COURSE STRUCTURE & SYLLABUS (R22)
I YEAR I SEMESTER
Category Course Title L T P Credits
Core Course - I Mathematical Foundations of Computer Science 3 0 0 3
Core Course - II C Programming and Data Structures 3 1 0 4
Core Course – III Python Programming 3 0 0 3
Core Course – IV Operating Systems 3 0 0 3
Core Course – V Accounting and Financial Management 3 0 0 3
Laboratory – I C Programming and Data Structures Lab 0 0 3 1.5
Laboratory – II Python Programming Lab 0 0 2 1
Laboratory – III Operating Systems Lab 0 0 3 1.5
Total Credits 15 1 8 20
Regulations for Project Work Review – I & II.

R22 MCA JNTUH
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
MCA I Year I Sem. L T P C
3 0 0 3
Pre-requisites: An understanding of Math in general is sufficient.
Course Objectives: To learn
● Introduces the elementary discrete mathematics for computer science and engineering.
● Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory,
permutations and combinations, counting principles; recurrence relations and generating functions.
Course Outcomes: After learning the contents of this paper the student must be able to
● Ability to understand and construct precise mathematical proofs.
● Ability to use logic and set theory to formulate precise statements.
● Ability to analyze and solve counting problems on finite and discrete structures.
● Ability to describe and manipulate sequences.
● Ability to apply graph theory in solving computing problems.
UNIT-I:
The Foundations Logic and Proofs: Propositional Logic, Applications of Propositional Logic,
Propositional Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference,
Introduction to Proofs, Proof Methods and Strategy.
UNIT-II:
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations: Sets, Functions, Sequences
& Summations, Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary Relations
and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial
Orderings.
UNIT-III:
Algorithms, Induction and Recursion: Algorithms, The Growth of Functions, Complexity of Algorithms.
Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions
and Structural Induction, Recursive Algorithms, Program Correctness.
UNIT-IV:
Discrete Probability and Advanced Counting Techniques:
An Introduction to Discrete Probability. Probability Theory, Bayes’ Theorem, Expected Value and
Variance. Advanced Counting Techniques:
Recurrence Relations, Solving Linear Recurrence Relations, Divide-and-Conquer Algorithms and
Recurrence Relations, Generating Functions, Inclusion-Exclusion, Applications of Inclusion-Exclusion.
UNIT-V:
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing Graphs
and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar
Graphs, Graph Coloring.
Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning
Trees.
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay, R.
Manohar, McGraw-Hill, 1st
ed.
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe l. Mott, Abraham Kandel,
Teodore
P. Baker, Prentis Hall of India, 2nd
ed.
REFERENCES:
1. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, Pearson
education, 5th
edition.

R22 MCA JNTUH
2. Discrete Mathematical Structures: Thomas Kosy, Tata McGraw Hill publishing co.

R22 MCA JNTUH
C PROGRAMMING AND DATA STRUCTURES
3 1 0 4
Pre-requisites:
1. Requires analytical skills and logical reasoning.
Course Objectives: To learn
● This course covers the basics of computers and program development
● It covers various concepts of C programming language
● It introduces searching and sorting algorithms
● It provides an understanding of data structures such as stacks and queues.
Course Outcomes: After learning the contents of this paper the student must be able to
● Ability to develop C programs for computing and real-life applications using basic elements like
control statements, arrays, functions, pointers and strings; and data structures like stacks, queues
and linked lists.
● Ability to implement searching and sorting algorithms
UNIT-I:
Introduction to Computers: Computer Systems, Computing Environments, Computer Languages, Creating
and running programs, Software Development Method, Algorithms, Pseudo code, flow charts, applying
the software development method.
Introduction to C Language: Background, Simple C programs, Identifiers, Basic data types, Variables,
Constants, Input / Output, Operators. Expressions, Precedence and Associativity, Expression Evaluation,
Type conversions, Bit wise operators, Statements, Simple C Programming examples.
UNIT-II:
Statements: if and switch statements, Repetition statements – while, for, do-while statements, Loop
examples, other statements related to looping – break, continue, go to, Simple C Programming
examples.
Designing Structured Programs: Functions, basics, user defined functions, inter function
communication, Scope, Storage classes-auto, register, static, extern, scope rules, type qualifiers,
recursion- recursive functions, Pre-processor commands, example C programs
UNIT-III:
Arrays and Strings: Concepts, using arrays in C, inter function communication, array applications, two –
dimensional arrays, multidimensional arrays, C program examples. Concepts, C Strings, String Input /
Output functions, arrays of strings, string manipulation functions, string / data conversion, C program
examples.
Pointers: Introduction (Basic Concepts), Pointers for inter function communication, pointers to pointers,
compatibility, memory allocation functions, array of pointers, programming applications, pointers to
void, pointers to functions, command –line arguments.
UNIT-IV:
Derived Types: Structures – Declaration, definition and initialization of structures, accessing structures,
nested structures, arrays of structures, structures and functions, pointers to structures, self-referential
structures, unions, typedef, bit fields, enumerated types, C programming examples.
Input and Output: Concept of a file, streams, standard input / output functions, formatted input / output
functions, text files and binary files, file input / output operations, file status functions (error handling), C
program examples.
UNIT-V:
Sorting and Searching: selection sort, bubble sort, insertion sort, linear and binary search methods.
Data Structures: Introduction to Data Structures, abstract data types, Linear list – singly linked list
implementation, insertion, deletion and searching operations on linear list, Stacks-Operations, array and
linked representations of stacks, stack applications, Queues-operations, array and linked

R22 MCA JNTUH
representations.
TEXT BOOKS:
1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg,3rd Edition, Cengage Learning.
2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, 5th Edition, Pearson
Education.
3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education.

R22 MCA JNTUH
REFERENCES:
1. C for Engineers and Scientists, H.Cheng, Mc.Graw-Hill International Edition.
2. Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education /
PHI.
3. C Programming & Data Structures, P. Dey, M Ghosh R Theraja, Oxford University Press.

R22 MCA JNTUH
PYTHON PROGRAMMING
3 0 0 3
Prerequisites:
1. Requires analytical skills and logical reasoning.
Course Objectives:
1. To learn syntax and semantics and create functions in Python.
2. To handle strings and files in Python.
3. To understand lists, dictionaries and regular expressions in Python.
4. To implement object-oriented programming concepts in Python.
5. To build web services and introduce network and database programming in Python.
Course Outcomes:
1. Demonstrate proficiency in handling Strings and File Systems.
2. Create, run and manipulate Python programs using core data structures like Lists, Dictionaries
and use Regular Expressions.
3. Interpret the concepts of GUI Programming as used in Python.
4. Implement applications related to Network Programming, Web Services and Databases in Python.
UNIT - I
Python Basics, Objects- Python Objects, Standard Types, Other Built-in Types, Internal Types, Standard
Type Operators, Standard Type Built-in Functions, Categorizing the Standard Types, Unsupported Types
Numbers - Introduction to Numbers, Integers, Floating Point Real Numbers, Complex Numbers,
Operators, Built- in Functions, Related Modules Sequences - Strings, Lists, and Tuples, Mapping and Set
Types
UNIT - II
Files: File Objects, File Built-in Function, File Built-in Methods, File Built-in Attributes, Standard Files,
Command- line Arguments, File System, File Execution, Persistent Storage Modules, Related Modules
Exceptions: Exceptions in Python, Detecting and Handling Exceptions, Context Management, Exceptions
as Strings, Raising Exceptions, Assertions, Standard Exceptions, Creating Exceptions, Exceptions and the
sys Module, Related Modules, Modules and Files, Namespaces, Importing Modules, Importing Module
Attributes, Module Built-in Functions, Packages, Other Features of Modules
UNIT - III
Regular Expressions: Introduction, Special Symbols and Characters, Res and Python Multithreaded
Programming: Introduction, Threads and Processes, Python, Threads, and the Global Interpreter Lock,
Thread Module, Threading Module, Related Modules
UNIT - IV
GUI Programming: Introduction, Tkinter and Python Programming, Brief Tour of Other GUIs, Related
Modules and Other GUIs Web Programming: Introduction, WebSurfing with Python, Creating Simple
Web Clients,
Advanced Web Clients, CGI-Helping Servers Process Client Data, Building CGI Application, Advanced CGI,
Web (HTTP) Servers
UNIT - V
Database Programming: Introduction, Python Database Application Programmer’s Interface (DB-API),
Object Relational Managers (ORMs), Related Modules
TEXT BOOK:
1. Core Python Programming, Wesley J. Chun, Second Edition, Pearson.
REFERENCES:
1. Python for Programmers, Paul Deitel, Harvey Deitel, Pearson.
2. Think Python, Allen Downey, Green Tea Press
3. Introduction to Python, Kenneth A. Lambert, Cengage

R22 MCA JNTUH
4. Python Programming: A Modern Approach, Vamsi Kurama, Pearson
5. Learning Python, Mark Lutz, O’Reilly

R22 MCA JNTUH
OPERATING SYSTEMS
3 0 0 3
Prerequisites:
1. A course on “Computer Programming and Data Structures”.
2. A course on “Computer Organization and Architecture”.
Course Objectives:
● Introduce operating system concepts (i.e., processes, threads, scheduling, synchronization,
deadlocks, memory management, file and I/O subsystems and protection)
● Introduce the issues to be considered in the design and development of operating system
● Introduce basic Unix commands, system call interface for process management,
interprocess communication and I/O in Unix
Course Outcomes:
● Will be able to control access to a computer and the files that may be shared
● Demonstrate the knowledge of the components of computers and their respective roles in
computing.
● Ability to recognize and resolve user problems with standard operating environments.
● Gain practical knowledge of how programming languages, operating systems, and architectures
interact and how to use each effectively.
UNIT - I
Operating System - Introduction, Structures - Simple Batch, Multiprogrammed, Time-shared, Personal
Computer, Parallel, Distributed Systems, Real-Time Systems, System components, Operating System
services, System Calls
Process - Process concepts and scheduling, Operations on processes, Cooperating Processes, Threads
UNIT - II
CPU Scheduling - Scheduling Criteria, Scheduling Algorithms, Multiple -Processor Scheduling. System
call interface for process management-fork, exit, wait, waitpid, exec
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock
UNIT - III
Process Management and Synchronization - The Critical Section Problem, Synchronization Hardware,
Semaphores, and Classical Problems of Synchronization, Critical Regions, Monitors
Interprocess Communication Mechanisms: IPC between processes on a single computer system, IPC
between processes on different systems, using pipes, FIFOs, message queues, shared memory.
UNIT - IV
Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging, Demand Paging, Page
Replacement, Page Replacement Algorithms.
UNIT - V
File System Interface and Operations -Access methods, Directory Structure, Protection, File System
Structure, Allocation methods, Free-space Management. Usage of open, create, read, write, close, lseek,
stat, ioctl system calls.
TEXT BOOKS:
1. Operating System Principles - Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John
Wiley
2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson education.
REFERENCES:
1. Operating Systems- Internals and Design Principles, William Stallings, Fifth Edition–2005,
Pearson Education/PHI

R22 MCA JNTUH
2. Operating System A Design Approach- Crowley, TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education
5. UNIX Internals -The New Frontiers, U. Vahalia, Pearson Education.

R22 MCA JNTUH
ACCOUNTING AND FINANCIAL MANAGEMENT
3 0 0 3

R22 MCA JNTUH
COMPUTER PROGRAMMING & DATA STRUCTURES LAB
0 0 3 1.5
Prerequisites:
1. Requires analytical skills and logical reasoning
Course Objectives:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.
Course Outcomes:
 Develop C programs for computing and real life applications using basic elements like control
statements, arrays, functions, pointers and strings, and data structures like stacks, queues and
linked lists.
 Implement searching and sorting algorithms
Week 1:
1. Write a C program to find the sum of individual digits of a positive integer.
2. 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 a C program to find the roots of a quadratic equation.
Week 2:
5. Write a C program to find the factorial of a given integer.
6. Write a C program to find the GCD (greatest common divisor) of two given integers.
7. Write a C program to solve Towers of Hanoi problem.
8. Write a C program, which takes two integer operands and one operator from the user,
performs the operation and then prints the result. (Consider the operators +,-,*, /, % and use
Switch Statement)
Week 3:
9. Write a C program to find both the largest and smallest number in a list of integers.
10. Write a C program that uses functions to perform the following:
i) Addition of Two Matrices
ii) Multiplication of Two Matrices
Week 4:
11. Write a C program that uses functions to perform the following operations:
i) To insert a sub-string in to a given main string from a given position.
ii) To delete n Characters from a given position in a given string.
12. Write a C program to determine if the given string is a palindrome or not
13. Write a C program that displays the position or index in the string S where the string T begins, or
– 1 if S doesn’t contain T.
14. Write a C program to count the lines, words and characters in a given text.
Week 5:
15. Write a C program to generate Pascal’s triangle.
16. Write a C program to construct a pyramid of numbers.
17. Write a C program to read in two numbers, x and n, and then compute the sum of this
geometric progression:
1+x+x2
+x3
+...............+xn
For example: if n is 3 and x is 5, then the program computes
1+5+25+125. Print x, n, the sum

R22 MCA JNTUH
Perform error checking. For example, 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, then go back and read in the next pair of numbers of
without computing the sum. Are any values of x also illegal ? If so, test for them too.
Week 6:
18. 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. Thus 2’s complement of 11100 is 00100. Write a C program
to find the 2’s complement of a binary number.
19. Write a C program to convert a Roman numeral to its decimal equivalent.
Week 7:
20. Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number
iii) Addition of two complex numbers
iv) Multiplication of two complex
numbers (Note: represent complex number using
a structure.)
Week 8:
21. i) Write a C program which copies one file to another.
ii) Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
22. i) Write a C program to display the contents of a file.
ii) Write a C program to merge two files into a third file (i.e., the contents of the first file followed
by those of the second are put in the third file)
Week 9:
23. Write a C program that uses functions to perform the following operations on singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
Week 10:
24. Write C programs that implement stack (its operations) using
i) Arrays ii) Pointers
25. Write C programs that implement Queue (its operations) using
i) Arrays ii) Pointers
Week 11:
26. Write a C program that implements the following sorting methods to sort a given list of integers
in ascending order
i) Bubble sort ii) Selection sort
Week 12:
27. 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
TEXT BOOKS:
1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, 3rd
Edition, Cengage Learning.
2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, 5th
Edition, Pearson
Education.
3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education
REFERENCES:
1. C for Engineers and Scientists, H.Cheng, Mc.Graw-Hill International Edition
2. Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education /
PHI

R22 MCA JNTUH
3. C Programming & Data Structures, P. Dey, M Ghosh R Thereja, Oxford University Press

R22 MCA JNTUH
PYTHON PROGRAMMING LAB
0 0 2 1
Course Objectives:
 To install and run the Python interpreter
 To learn control structures.
 To Understand Lists, Dictionaries in python
 To Handle Strings and Files in Python
Course Outcomes: After completion of the course, the student should be able to
● Develop the application specific codes using python.
● Understand Strings, Lists, Tuples and Dictionaries in Python
● Verify programs using modular approach, file I/O, Python standard library
● Implement Digital Systems using Python
Note: The lab experiments will be like the following experiment examples
Week -1:
1. i) Use a web browser to go to the Python website http://python.org. This page contains
information about Python and links to Python-related pages, and it gives you the ability to search
the Python documentation.
i) Start the Python interpreter and type help() to start the online help utility.
2. Start a Python interpreter and use it as a
Calculator. 3.
i) Write a program to calculate compound interest when principal, rate and number of periods are
given.
ii) Given coordinates (x1, y1), (x2, y2) find the distance between two points
4. Read name, address, email and phone number of a person through keyboard and print the details.
Week - 2:
1. Print the below triangle using for
loop. 5
4 4
3 3 3
2 2 2 2
1 1 1 1 1
2. Write a program to check whether the given input is digit or lowercase character or uppercase
character or a special character (use 'if-else-if' ladder)
3. Python Program to Print the Fibonacci sequence using while loop
4. Python program to print all prime numbers in a given interval (use break)
Week - 3:
1. i) Write a program to convert a list and tuple into arrays.
ii) Write a program to find common values between two arrays.
2. Write a function called gcd that takes parameters a and b and returns their greatest common divisor.
3. Write a function called palindrome that takes a string argument and returnsTrue if it is a palindrome
and False otherwise. Remember that you can use the built-in function len to check the length of a
string.
Week - 4:
1. Write a function called is_sorted that takes a list as a parameter and returns True if the list is sorted in
ascending order and False otherwise.
2. Write a function called has_duplicates that takes a list and returns True if there is any element that
appears more than once. It should not modify the original list.
i). Write a function called remove_duplicates that takes a list and returns a new list with only the
unique elements from the original. Hint: they don’t have to be in the same order.
ii). The wordlist I provided, words.txt, doesn’t contain single letter words. So you might want to add “I”,
“a”, and the empty string.

R22 MCA JNTUH
iii). Write a python code to read dictionary values from the user. Construct a function to invert its
content. i.e., keys should be values and values should be keys.
3. i) Add a comma between the characters. If the given word is 'Apple', it should become 'A,p,p,l,e'
ii) Remove the given word in all the places in a string?

R22 MCA JNTUH
iii) Write a function that takes a sentence as an input parameter and replaces the first letter of every word
with the corresponding upper case letter and the rest of the letters in the word by corresponding
letters in lower case without using a built-in function?
4. Writes a recursive function that generates all binary strings of n-bit length
Week - 5:
1. i) Write a python program that defines a matrix and prints
ii) Write a python program to perform addition of two square matrices
iii) Write a python program to perform multiplication of two square matrices
2. How do you make a module? Give an example of construction of a module using different geometrical
shapes and operations on them as its functions.
3. Use the structure of exception handling all general purpose exceptions.
Week-6:
1. a. Write a function called draw_rectangle that takes a Canvas and a Rectangle as arguments and
draws a representation of the Rectangle on the Canvas.
b. Add an attribute named color to your Rectangle objects and modify draw_rectangle so that it uses
the color attribute as the fill color.
c. Write a function called draw_point that takes a Canvas and a Point as arguments and draws a
representation of the Point on the Canvas.
d. Define a new class called Circle with appropriate attributes and instantiate a few Circle objects.
Write a function called draw_circle that draws circles on the canvas.
2. Write a Python program to demonstrate the usage of Method Resolution Order (MRO) in multiple
levels of Inheritances.
3. Write a python code to read a phone number and email-id from the user and validate it for correctness.
Week- 7
1. Write a Python code to merge two given file contents into a third file.
2. Write a Python code to open a given file and construct a function to check for given words present in
it and display on found.
3. Write a Python code to Read text from a text file, find the word with most number of occurrences
4. Write a function that reads a file file1 and displays the number of words, number of vowels, blank spaces,
lower case letters and uppercase letters.
Week - 8:
1. Import numpy, Plotpy and Scipy and explore their functionalities.
2. a) Install NumPy package with pip and explore it.
3. Write a program to implement Digital Logic Gates – AND, OR, NOT, EX-OR
4. Write a program to implement Half Adder, Full Adder, and Parallel Adder
5. Write a GUI program to create a window wizard having two text labels, two text fields and two buttons as
Submit and Reset.
TEXT BOOKS:
1. Supercharged Python: Take your code to the next level, Overland
2. Learning Python, Mark Lutz, O'reilly
REFERENCES:
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson
2. Python Programming A Modular Approach with Graphics, Database, Mobile, and Web
Applications, Sheetal Taneja, Naveen Kumar, Pearson
3. Programming with Python, A User’s Book, Michael Dawson, Cengage Learning, India Edition
4. Think Python, Allen Downey, Green Tea Press
5. Core Python Programming, W. Chun, Pearson
6. Introduction to Python, Kenneth A. Lambert, Cengage

R22 MCA JNTUH
OPERATING SYSTEMS LAB
0 0 3 1.5
Prerequisites:
 A course on “Programming for Problem Solving”.
 A course on “Computer Organization and Architecture”.
Co-requisite:
 A course on “Operating Systems”.
Course Objectives:
● To provide an understanding of the design aspects of operating system concepts
through simulation
● Introduce basic Unix commands, system call interface for process management,
interprocess communication and I/O in Unix
Course Outcomes:
● Simulate and implement operating system concepts such as scheduling,
deadlock management, file management and memory management.
● Able to implement C programs using Unix system calls
List of Experiments:
1. Write C programs to simulate the following CPU Scheduling algorithms
a) FCFS b) SJF c) Round Robin d) priority
2. Write programs using the I/O system calls of UNIX/LINUX operating
system (open, read, write, close, fcntl, seek, stat, opendir, readdir)
3. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance and Prevention.
4. Write a C program to implement the Producer – Consumer problem using semaphores using UNIX/
LINUX system calls.
5. Write C programs to illustrate the following IPC mechanisms
a) Pipes b) FIFOs c) Message Queues d) Shared Memory
6. Write C programs to simulate the following memory management techniques
a) Paging b) Segmentation
7. Write C programs to simulate Page replacement policies
a) FCFS b) LRU c) Optimal
TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John
Wiley
2. Advanced programming in the Unix environment, W.R. Stevens, Pearson education.
REFERENCES:
1. Operating Systems – Internals and Design Principles, William Stallings, Fifth Edition–2005,
Pearson Education/PHI
2. Operating System - A Design Approach-Crowley, TMH.
3. Modern Operating Systems, Andrew S Tanenbaum, 2nd edition, Pearson/PHI
4. UNIX Programming Environment, Kernighan and Pike, PHI/Pearson Education
5. UNIX Internals: The New Frontiers, U. Vahalia, Pearson Education

JNTUH_MCA_SYLLABUS_R22_ALL_READING_MCA IMPORT

More Related Content

Similar to JNTUH_MCA_SYLLABUS_R22_ALL_READING_MCA IMPORT (20)

Recently uploaded (20)

JNTUH_MCA_SYLLABUS_R22_ALL_READING_MCA IMPORT