JNTU MCA SYLLABUS BOOK

adminComment(0)
    Contents:

COURSE STRUCTURE AND SYLLABUS . MCA - I Year - I SEM . Text book of Probability and Statistics Dr. Shahnaz Bathul, V.G.S. Publishers 2. MCA I, II, III, IV, V, VI Semesters [R17] Course Structure & Detailed Syllabus. Note: R17 = For the Students admitted into MCA in & JNTUA MCA I Semester R17 kungranaleapu.tk mca jntu syllabus - Free download as PDF File .pdf), Text File .txt) or read Text book of Probability and Statistics by kungranaleapu.tkz Bathul, kungranaleapu.tkhers.


Jntu Mca Syllabus Book

Author:JANELL NOFSINGER
Language:English, Arabic, Portuguese
Country:United Kingdom
Genre:Fiction & Literature
Pages:792
Published (Last):24.03.2016
ISBN:585-2-78482-861-7
ePub File Size:22.70 MB
PDF File Size:14.75 MB
Distribution:Free* [*Sign up for free]
Downloads:31339
Uploaded by: LIDA

Constituent Colleges. JNTUA - Ananthapuramu · JNTUA - Pulivendula · JNTUA - Kalikiri Syllabus. Under-Graduate Courses · Post-Graduate Courses. kungranaleapu.tk - JNTU Syllabus of Master of Computer Applications (MCA ) Semester V - Semester V (From batch) - Information Retrieval Systems. Download MCA Books & Notes For All Semesters in PDF - 1st, 2nd, 3rd Year. MCA full for is Masters of Computer Applications. Master of.

You can simply download the respective syllabus books from below links. If you have any queries or any link not working, feel free to add your comments below. Click Here. Tech Sem Syllabus M. Pharmacy Sem Syllabus M. The content given in this site has been collected from various sources. We try and ensure all the information contained on the website is accurate and up to date. We do not hold any responsibility of miscommunication or mismatching of information.

Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalence implication, Normal forms. Set Theory: Properties of binary Relations, equivalence, compatibility and partial ordering relations, Hasse diagram. Inverse Function Comports of functions, recursive Functions, Lattice and its Properties, Pigeon hole principles and its application. Algebraic structures: Elementary Combinatorics: Recurrence Relation: Generating Functions, Function of Sequences Calculating Coefficient of generating function, Recurrence relations, Solving recurrence relation by substitution and Generating funds.

Characteristics roots solution of In homogeneous Recurrence Relation. Discrete Mathematical Structures with applications to computer science Trembly J.

P, TMH. Mott, A. Kandel, T. Mathematical Foundations of computer science Dr D. Chandrasekharaiaha Prism books Pvt Ltd. Discrete Mathematics, Lovasz, Springer. Boolean algebra, Simplification of Boolean expressions, K-Maps. UNIT V: Programming with assembly language instructions. Control memory, Address sequencing, Microprogram example, design of control unit Hard wired control. Douglas V. David A. Paterson and john L. Structured Computer Organization — Andrew S.

Flow control statement- if, switch, while, for, do, break, continue, goto statements. Functions-Scope of variables, Parameter passing, Default arguments, inline functions, Recursive functions, Pointers to functions.

Dynamic memory allocation and de-allocation operators-new and delete, Preprocessor directives. Class definition, Class structure, Class objects, Class scope, this pointer, Friends to a class, Static class members, Constant member functions, Constructors and Destructors, Dynamic creation and destruction of objects, Data abstraction, ADT and information hiding. Function overloading, Operator overloading, Generic programming- necessity of templates, Function templates and class templates.

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.

Static and Dynamic bindings, Base and Derived class virtual functions, Dynamic binding through virtual functions, Virtual function call mechanism, Pure virtual functions, Abstract classes, Implications of polymorphic use of classes, Virtual destructors. Benefits of exception handling, Throwing an exception, The try block, Catching an exception, Exception objects, Exception specifications, Stack unwinding, Re-throwing an exception, Catching all exceptions, Design issues in exception handling.

Stroutstrup, Pearson Education. Gaddis, J. Walters and G. Muganda, Wiley DreamTech Press. Lafore, Galigotia Publications pvt ltd. Forouzan and R. Sampling distribution: Populations and samples - Sampling distributions of mean known and unknown proportions, sums and differences. One tail, two-tail tests.

Estimation of proportions. Curve fitting: The method of least squares — Inferences based on the least squares estimations - Curvilinear regression — multiple regressions — correlation for univariate and bivariate distributions.

Probability and statistics for engineers: Erwin Miller And John E. Text book of Probability and Statistics by Dr. Shahnaz Bathul, V. Publishers Probability, Statistics and Random Processes Dr.

Gurusamy by Anuradha Agencies, Deepti Publications. Probability and Statistics for Engineers: Bhishma Rao,sitech. UNIT I: Principles, concepts, conventions, double entry system of accounting, introduction of basic books of accounts ledgers.

Financial Management - meaning and scope, role, objectives of time value of money - over vitalization - under capitalization - profit maximization - wealth maximization - EPS maximization. Ratio Analysis - advantages - limitations - Fund flow analysis - meaning, importance, preparation and interpretation of Funds flow and cash flow statements-statement of changes in working capital. Costing - nature and importance and basic principles. Absorption costing vs. Marginal costing and Break-even Analysis: Standard costing and budgeting: Introduction to computerized accounting system: Van Horne, James, C: Financial Management and Policy.

Pearson Education, 12th Edition. Financial Accounting, S. Maheshwari, Sultan Chand Company 3. Financial Management, S. Unit —I: Features of Indian English - Correction of sentences - Structures - Tenses - ambiguity - idiomatic distortions.

Informal conversation Vs Formal expression Verbal and non-verbal communication, barriers to effective communication — kinesics. Technical presentations - types of presentation —video conferencing-- participation in meetings - chairing sessions. UNIT - V: Written communication - differences between spoken and written communication - features of effective writing such "as clarity, brevity, appropriate tone clarity, balance etc.

TOEFL models. Unit — VII: Letter-writing - business letters — pro forma culture - format - style — effectiveness, promptness - Analysis of sample letters collected from industry - email, fax. Unit — VIII: Technical Report writing - Business and Technical Reports — Types of reports - progress reports, routine reports - Annual reports - format - Analysis of sample reports from industry - Synopsis and thesis writing.

Advanced Communication Skills, V. Raymond V. Lesikav; John D. Pettit Jr. Nagar, Chennai Edmond H Weiss: Writing Remedies: India P Ltd. New Delhi- The language Lab focuses computer-aided multi-media instruction and language acquisition to achieve the following targets:.

To expose the students to a variety of self-instructional, learner-friendly modes of language learning. To enable them to learn better pronunciation through stress on word accent, intonation, and rhythm. To train them to use language effectively to face interviews, group discussions, public speaking. To initiate them into greater use of the computer in resume preparation, report writing, format-making etc.

However, 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 a Conventional Lab the details of which are given below. The lab should cater to the needs of the students to build up their confidence to help them develop leadership qualities through their communicative competence. Introduction to Phonetics. Introduction to Vowels and Consonants and associated Phonetic symbols.

Introduction to Accent, Intonation and Rhythm. Public Speaking. Computer aided multi media language lab with 30 systems with LAN facility. Conventional Language Lab.

Suggested Software: Balasubramanian Macmillan 7. Write assembly language programs to evaluate the expressions: Considering 8-bit, 16 bit and 32 bit binary numbers as b, c, d, e. Considering 2 digit, 4digit and 8 digit BCD numbers. Take the input in consecutive memory locations and results also. Validate program for the boundary conditions. Write an ALP of to take N numbers as input.

And do the following operations on them. Arrange in ascending and Descending order. Find max and minimum Find average Considering 8-bit, 16 bit binary numbers and 2 digit, 4digit and 8 digit BCD numbers. Find the length b. Find it is Palindrome or not c. Find whether given string substring or not. Reverse a string e. Write the ALP to implement the above operations as procedures and call from the main procedure. Write an ALP of to find the factorial of a given number as a Procedure and call from the main program which display the result.

A computer uses RAM chips of X 1 capacity. How many chips are needed, and how should their address lines be connected to provide a memory capacity of bytes?

Other books: DUKAN DIYETI PDF

How many chips are needed to provide a memory capacity of 16K bytes? Draw a memory-address map for the system. Draw the logic diagram for it and compare with the actual match logic diagram.

Account Options

The cache can accommodate a total of words from main memory. The main memory size is K X Formulate all pertinent information required to construct the cache memory. What is the size of the cache memory? The cache uses direct mapping with a block size of four words. How many bits are there in each word of cache, and how are they divided into functions?

Include a valid bit. How many bits are there in the tag, index, block, and word fields of the address format?

How many blocks can the cache accommodate? How many words are there in the address space?

JNTUK MCA R13 Syllabus & Course Structure I-VI Semesters

How many words are there in the memory space? If a page consists of 2K words, how many pages and blocks are there in the system. 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. A Fibonacci sequence is defined as follows: Subsequent terms are found by adding the preceding two terms in the sequence. To find the GCD of two given integers.

To find the nth Fibonacci number. Use overloaded functions. The operations supported by this ADT are: Filename , number of the byte in the file to be changed and the new character are specified on the command line. Use the following in solving the above problems wherever they make sense: Suggested Books for lab: Malik, Thomson.

Bhave, S. Patekar, Pearson Education. Creation of java, java buzzwords, data types, variables, operators, expressions, control flow statements- if and switch statements, loops- for, while, do- while, jump statements, classes, objects, class modifiers, class members and access control, methods, simple input and output statements, an example program, string handling, inheritance- super and sub classes, member access rules, method overriding, dynamic method dispatch, abstract classes, Object class, interfaces- implementing interfaces, multiple inheritance in interfaces.

Packages- defining, creating and accessing a package, importing packages, exception handling- concepts of exception handling, types of exceptions, usage of try, catch, throw, throws and finally key words, creating own exception sub classes, multi threading- thread life cycle, creating multiple threads using Thread class, Runnable interface, java library- java. Notion of algorithm, pseudo code, performance analysis- time complexity and space complexity, asymptotic notation big- oh, omega, theta , data abstraction, concept of ADT, linear and non linear data structures, sequential and linked allocation, arrays and linked lists, representation of single, two and multi dimensional arrays, sparse matrices and their representation, the list ADT-array based implementation and linked list implementation.

Stack ADT-array based implementation, linked list implementation, applications-infix to postfix conversion, postfix evaluation, implementation of recursion, Queue ADT- array based implementation, linked list implementation, circular queues, Dequeue ADT- array based implementation, linked list implementation, Priority Queues ADT- implementation, heaps. Binary search trees, operations- insertion, deletion and searching, AVL trees, operations- insertion and searching, B-trees, operations-insertion, deletion and searching, comparison of performance of search trees.

Linear search, binary search, hashing-hash table, its implementation, hash functions, collision handling schemes, bubble sort, selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort, comparison of searching and sorting methods. Pattern matching algorithms- Brute force, the Boyer-Moore algorithm, the KMP algorithm, tries- standard tries, compressed tries, suffix tries, text compression- Huffman coding algorithm.

Goodrich and R. Tamassia, John Wiley and Sons, Inc. Reference Books: Collins, McGraw Hill. Tenenbaum, Pearson Education.

Data Structures with Java, J.

Hubbard and A. Big Java, C. Horstmann, John Wiley. UNIT-II Behavioral theories of organization, limitations of formal organization, human relation, group behaviour, committee and group making, motivation and morale. Parts of organization system, development of corporate strategy, dynamics of decision, role of system, types models, mathematical planning models, deterministic and probabilistic models. Uses benefits problems and limitations, manpower, inventory, manpower forecasting, job description, recruitment, job specification and job selection interviewing techniques, transfers, promotion and its policies.

Objectives and policies planning, organizing the training department, training manager and his job, on and off the job training, techniques, career planning, objectives of performance appraisal. Objectives, importance policies, concept of core competence capability of organizational learning. Importance of communication, interpersonal communication barriers of communication, communication in organizations, using communication skills to manage conflicts.

Text Book: Rudrabasavaraj M. Dynamic personnel Administration, 2nd Edn. Himalaya Publishing House, Bombay, Characteristics and phases scientific Method, Types of models, General methods for solving. Operations Research models. Introduction, Linear programming Formulation, Graphical solution, Simplex method, artificial variable technique, Duality principle. Formulation, optimal solution, un-balanced transportation problem, Degenracy. Assignment problem: Introduction, optimal solution for processing each of n-jobs through three machines, travelling salesman problem i.

Introduction, replacement of items that deteriorate when money value is not counted and counted, replacement items that fail completely i. Introduction, single channel, poisson arrivals, exponential service times, unrestricted queue, with infinite population and finite population models, single channel, poisson arrivals, exponential service times with infinite population and restricted queue, multi channel, poisson arrivals, exponential service times with infinite population and unrestricted queue.

Introduction, single item deterministic models, production is instantaneous or at a constant rate, shortages are allowed or not allowed and withdrawals from stock is continuous, download inventory model with one price break, shortages are not allowed, Instantaneous production demand, production or download cost is relevant, stochastic models, demand may be discrete or variable or instantaneous production, instantaneous demand and no setup cost.

Introduction, Minimax maximum criterion and optimal strategy, solution of games with saddle points, rectangular games without saddle points. Operations Research 2. Operations Research 3.

Operations Research.

An introduction to control break processing, Program Requirements for control break processing, Multiple-level control breaks. Data Validation: Avoiding logic errors by validating input, What to do if input errors occur, When data should be validated, Understanding program interrupts. Systems overview of Sequential processing: Sequential file updating, Validity checking in update procedures, Update procedures with multiple transaction records, Rewriting records on a disk.

Systems considerations for organizing disk files, Features of magnetic disks and disk drives, Processing indexed disk files, Processing relative Disk Files, Converting a key field to a relative key. The Report Writer Module: Introduction, The benefits of the report writer module, The report section in the data division, Procedure division statements.

Cobol Programming — Collopy — Pearson Ed. Nancy Stern and Robert A. Read in a, b, c and use the quadratic formula. If the discriminant b2 -4ac is negative; display a message stating that there are no real solutions. The Fibonacci sequence is defined by the following rule.

The fist two values in the sequence are 1 and 1. Every subsequent value is the run of the two values preceding it.

JNTUH Syllabus Books – JNTU Hyderabad Syllabus For B.Tech, MBA, MCA, M.Tech, B.Pharmacy, M.Pharmacy

Write a Java program that uses both recursive and non-recursive functions to print the nth value in the Fibonacci sequence. Write a Java program that prompts the user for an integer and then prints out all prime numbers up to that. Write a Java program that checks whether a given string is a palindrome or not. MADAM is a palindrome. Write a Java Program that reads a line of integers, and then displays each integer, and the sum of all the integers use StringTokenizer class.

Write a Java program that reads a file name from the user then displays information about whether the file exists, whether the file is readable, whether the file is writable, the type of file and the length of the file in bytes.

Write a Java program that reads a file and displays a file and displays the file on the screen, with a line number before each line.

Write a Java program that displays the number of characters, lines and words in a text file. Write a Java program that illustrates how run time polymorphism is achieved.

Write a java program that illustrates the following. Write a java program that illustrates the following a Handling predefined exceptions b Handling user defined exceptions. Write Java programs that use both recursive and non-recursive functions for implementing the following searching methods: Write java programs to implement the following using arrays and linked lists d List ADT.

Write a java program that reads an infix expression, converts the expression to postfix form and then evaluates the postfix expression use stack ADT. Write a java program that uses both stack and queue to test whether the given string is a palindrome.

Hence the students are requested to go through the syllabus book and prepare plans for the semester. With the help of this Syllabus Book, Student can get an appropriate idea how the semester syllabus is going to be and can get the basic knowledge of the subjects. The study of B. Tech is completely different form Intermediate.

Tech, students mainly need the concept in a particular topic and can easily write the Semester exams excellently with that concept in a particular topic. Reading Skills are most important one; Students are going to ask some questions in the examination like to guess the meaning of some words which are hard to get them. Students can come up where some students are habituated of silent reading of comprehension and develop writing skills in the students how to write in exact form and formal one.

Paragraph writing or essay on the particular topic becomes easier for a student. Go through the syllabus copy and get some idea about the subjects that are going to be in the Semester. Tech Sem Syllabus M. Pharmacy Sem Syllabus M. Tech for all the branches of 1 st year, 2 nd Year, 3 rd Year, and 4 th Year students.Human — Computer Interaction. Information Retrieval Systems: Ratio Analysis - advantages - limitations - Fund flow analysis - meaning, importance, preparation and interpretation of Funds flow and cash flow statements-statement of changes in working capital.

Detecting the Player Version 6. To understand ETL processes 5. Some of the ideas regarding case studies are given in reference books, which were mentioned in theory syllabus, can be referred for some idea.

MARIANNA from Dayton
I do like studying docunments tenderly. Review my other posts. One of my hobbies is warhammer.
>