Syllabus. trigvanrakarba.ml Syllabus: Civil Engineering · Computer Science and Engineering · Electrical and Electronics Engineering · Electronics and Communication. JNTUK Syllabus: JNTU Kakinada syllabus books for R16, R13 Regulations. ( AE), Civil Engineering (CE), Computer Science & Engineering (CSE), Computer . We will upload the full Clarity Syllabus Books For semester R16 regulation All Branches like ECE, CSE, EEE, CIVIL, MECH, IT, Automobile.

Jntuk Cse Syllabus Book

Language:English, German, French
Genre:Academic & Education
Published (Last):10.04.2016
ePub File Size:29.68 MB
PDF File Size:16.27 MB
Distribution:Free* [*Registration Required]
Uploaded by: DOREATHA

Download, Total Views, Stock, ∞. File Size, KB. File Type, pdf. Create Date, June 10, Last Updated, June 10, JNTUK Syllabus Books for R16, R13, R10 Regulation Download JNTU Kakinada Course-wise Syllabus – Here we have provided JNTUK Syllabus Books in. jNTU KAKINADA CSE SYLLABUS - Free download as PDF File .pdf), Text File A text Book of Engineering Mathematics, Shahnaz Bathul, Right Publishers. 4.

Population growth, variation among nations. Population explosion - Family Welfare Programme. Field work: Rajagopalan, Oxford University Press. Anji Reddy, BS Publication. Data Representation. Fixed Point Representation.

Floating — Point Representation. Error Detection codes. Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic Mircrooperatiaons, logic micro operations, shift micro operations, Arithmetic logic shift unit. Instruction codes. Computer Registers Computer instructions — Instruction cycle. Memory — Reference Instructions. Input — Output and Interrupt. STACK organization. Instruction formats. Addressing modes. DATA Transfer and manipulation. Program control.

Reduced Instruction set computer. Control memory, Address sequencing, microprogram example, design of control unit Hard wired control. Microprogrammed control. Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating — point Arithmetic operations. Decimal Arithmetic unit Decimal Arithmetic operations. Basic concepts semiconductor RAM memories. Read-only memories Cache memories performance considerations, Virtual memories secondary storage. Introduction to RAID. Shared Memory Multiprocessors.

Computer Systems Architecture — M. Structured Computer Organization — Andrew S. Computer Architecture a quantitative approach, John L. Hennessy and David A. Patterson, Fourth Edition Elsevier 5. Computer Architecture: Fundamentals and principles of Computer Design, Joseph D. History of Data base Systems. Relational Algebra — Selection and projection set operations — renaming — Joins — Division — Examples of Algebra overviews — Relational calculus — Tuple relational Calculus — Domain relational calculus — Expressive Power of Algebra and calculus.

A Dynamic Index Structure. Introduction to Database Systems, C. Object oriented thinking: Java Basics History of Java, Java buzzwords, datatypes, variables, scope and life time of variables, arrays, operators, expressions, control statements, type conversion and costing, simple java program, classes and objects — concepts of classes, objects, constructors, methods, access control, this keyword, garbage collection, overloading methods and constructors, parameter passing, recursion, string handling.

Inheritance — Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of inheritance- specialization, specification, construction, extension, limitation, combination, benefits of inheritance, costs of inheritance.

Member access rules, super uses, using final with inheritance, polymorphism- method overriding, abstract classes. Packages and Interfaces: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, differences between classes and interfaces, defining an interface, implementing interface, applying interfaces, variables in interface and extending interfaces.

Exploring packages — Java. Exception handling and multithreading - Concepts of exception handling, benefits of exception handling, Termination or resumptive models, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions, creating own exception sub classes.

Differences between multi threading and multitasking, thread life cycle, creating threads, synchronizing threads, daemon threads, thread groups. Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model, handling mouse and keyboard events, Adapter classes, inner classes. The AWT class hierarchy, user interface components- labels, button, canvas, scrollbars, text components, check box, check box groups, choices, lists panels — scrollpane, dialogs, menubar, graphics, layout manager — layout manager types — boarder, grid, flow, card and grib bag.

Applets — Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets, creating applets, passing parameters to applets. Networking — Basics of network programming, addresses, ports, sockets, simple client server program, multiple clients, Java. Java; the complete reference, 7th editon, Herbert schildt, TMH.

Budd, pearson eduction. Nino and F. Budd, pearson education. Introduction to Java programming 6th edition, Y. Daniel Liang, pearson education. An introduction to Java programming and object oriented application development, R. Johnson- Thomson.

Core Java 2, Vol 1, Fundamentals, Cay. Object Oriented Programming through Java, P. Radha Krishna, University Press. 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 fist two values in the sequence are 1 and 1. Every subsequent value is the sum of the two values preceding it. Write a Java program that uses both recursive and non recursive functions to print the nth value in the Fibonacci sequence. Week 2: Week 3: MADAM is a palindrome. Week 5: Week 7: Write a Java program that works as a simple calculator.

Add a text field to display the result. Week 9: Week Write a program that creates a user interface to perform integer divisions. The user enters two numbers in the textfields, Num1 and Num2.

The division of Num1 and Num2 is displayed in the Result field when the Divide button is clicked. If Num2 were Zero, the program would throw an ArithmeticException Display the exception in a message dialog box. The client sends data to a server. The server receives the data, uses it to produce a result, and then sends the result back to the client.

The client displays the result on the console. For ex: The data sent from the client is the radius of a circle, and the result produced by the server is the area of the circle. Use java. The program lets the user select one of three lights: When a radio button is selected, the light is turned on, and only one light can be on at a time No light is on when the program starts.

Provide three classes named Trapezoid, Triangle and Hexagon such that each one of the classes extends the class Shape. Each one of the classes contains only the method numberOfSides that shows the number of sides in the given geometrical figures. The first line in the file is the header, and the remaining lines correspond to rows in the table.

The elements are 49eparated by commas. Write a java program to display the table using Jtable component. Dietel and P. Introduction to Java programming, Sixth edition, Y. Daniel Liang, Pearson Education 3. The purpose of this course is to acquaint the student with an overview of the theoretical foundations of computer science from the perspective of formal languages.

Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers. Finite Automata: Conversions and Equivalence: Regular Languages: Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions.

Pumping lemma of regular sets, closure properties of regular sets proofs not required. Grammar Formalism: Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees, sentential forms. Right most and leftmost derivation of strings. Context Free Grammars: Ambiguity in context free grammars.

Minimisation of Context Free Grammars. Enumeration of properties of CFL proofs omitted. Push Down Automata: Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence.

Proofs not required. Turing Machine: Turing Machine, definition, model, design of TM, Computable functions, recursively enumerable languages. Chomsky hierarchy of languages, linear bounded automata and context sensitive language, LR 0 grammar, decidability of, problems, Universal Turing Machine, undecidability of posts.

Hopcroft H. Introduction to Computer Theory, Daniel I. Cohen, John Wiley. Purpose of testing, Dichotomies, model for testing, consequences of bugs, taxonomy of bugs. Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates and achievable paths, path sensitizing, path instrumentation, application of path testing. Transaction Flow Testing: Transaction flows, transaction flow testing techniques.

Dataflow testing: Domain Testing: Paths, Path products and Regular expressions: Logic Based Testing: Overview, decision tables, path expressions, kv charts, specifications. State, State Graphs and Transition testing: Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of a matrix, node reduction algorithm, building tools. Software Testing techniques - Baris Beizer, Dreamtech, second edition. Software Testing Tools — Dr.

Prasad, Dreamtech. The craft of software testing - Brian Marick, Pearson Education. Introduction, Application areas of Computer Graphics, overview of graphics systems, video-display devices, raster-scan systems, random scan systems, graphics monitors and work stations and input devices p. Output primitives: Points and lines, line drawing algorithms, mid-point circle and ellipse algorithms.

Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms p. Translation, scaling, rotation, reflection and shear transformations, matrix representations and homogeneous coordinates, composite transforms, transformations between coordinate systems. The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland —Hodgeman polygon clipping algorithm p.

Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods.

Translation, rotation, scaling, reflection and shear transformations, composite transformations. Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping p.

Visible surface detection methods: Classification, back-face detection, depth-buffer, scan-line, depth sorting, BSP-tree methods, area sub-division and octree methods p.

Computer animation: Design of animation sequence, general computer animation functions, raster animation, computer animation languages, key frame systems, motion specifications. Pauline Baker, Pearson Education.

Special functions of General purpose registers. Addressing modes of Instruction set of Assembler directives, simple programs, procedures, and macros. Timing diagram. Need for DMA. DMA data transfer Method. Interfacing Keyboard, Displays, Stepper Motor and actuators. Vector interrupt table.

Interrupt service routines. Asynchronous and Synchronous data transfer schemes. Sample program of serial data transfer. Introduction to High-speed serial communications standards, USB.

Advanced microprocessor and Peripherals - A. Ray and K. Bhurchandi, TMH, Hall, Reference Books 1.

Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation,Probabilistic analysis, Amortized analysis.

Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components. Divide and conquer: Greedy method: Dynamic Programming: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

Branch and Bound: Algorithm Design: Foundations, Analysis and Internet examples, M. Goodrich and R. Tomassia,John wiley and sons. Introduction to Algorithms, secondedition,T.

Leiserson, R.

JNTUK B.Tech 2-2 Syllabus books For R16 Regulation CSE, EEE, ECE, MECH, CIVIL, EIE.

Rivest,and C. Stein,PHI Pvt. Lee, S. Tseng, R. Chang and T. Tsai, Mc Graw Hill. Introduction The introduction of the English Language Lab is considered essential at 3rd year level. At this stage the students need to prepare themselves for their careers which may require them to listen to, read, speak and write in English both for their professional and interpersonal communication in the globalised context.

This Lab focuses on using computer-aided multimedia instruction for language development to meet the following targets: The following course content is prescribed for the Advanced Communication Skills Lab:. Suggested Software: The software consisting of the prescribed topics elaborated above should be procured and used. Advanced Skill Practice. Books Recommended: Effective Technical Communication, M. Ashraf Rizvi, Tata Mc.

JNTUK B.Tech R16 1-2 Sem syllabus books For All Branches

Graw-Hill Publishing Company Ltd. Shalini Verma, S. Chand, Pauley, Biztantra Publishers, Rutherford, 2nd Edition, Pearson Education, Muralikrishna, Pearson Education, Advanced Communication Skills Lab Practicals: The practical examinations for the English Language Laboratory practice shall be conducted as per the University norms prescribed for the core engineering practical sessions.

For the English Language lab sessions, there shall be a continuous evaluation during the year for 25 sessional marks and 50 End Examination marks. Of the 25 marks, 15 marks shall be awarded for day-to- day work and 10 marks to be awarded by conducting Internal Lab Test s. The End Examination shall be conducted by the teacher concerned with the help of another member of the staff of the same department of the same institution.

Microprocessor By using string operation and Instruction prefix: Reading keyboard Buffered with and without echo — Display characters, Strings. Generate an interrupt using timer. Write a small program to display a string of characters.

Write a program in ALP to establish Communication between two processors. Microcontroller 1. Reading and Writing on a parallel port. Timer in different modes. Serial communication implementation. Equipment required for Laboratories: ADC Interface 5. DAC Interface 6. Traffic Controller Interface 7.

Computer System and Operating System Overview: Overview of computer operating systems operating systems functions protection and security distributed systems special purpose systems operating systems structures and systems calls operating systems generation. Memory Management: Swapping, contiguous memory allocation, paging, structure of the page table , segmentation, virtual memory, demand paging, page-Replacement, algorithms, case studies UNIX, Linux, Windows. File system Interface- the concept of a file, Access Methods, Directory structure, File system mounting, file sharing, protection.

File System implementation- File system structure, file system implementation, directory implementation, directory implementation, allocation methods, free-space management, efficiency and performance, case studies. Mass-storage structure overview of Mass-storage structure, Disk structure, disk attachment disk scheduling, swap-space management, RAID structure, stable-storage implementation, Tertiary storage structure.

Protection, Goals of Protection, Principles of Protection, Domain of protection Access Matrix, Implementation of Access Matrix, Access control, Revocation of Access Rights, Capability- Based systems, Language — Based Protection, Security- The Security problem, program threats, system and network threats cryptography as a security tool, user authentication, implementing security defenses, firewalling to protect systems and networks, computer —security classifications, case studies UNIX, Linux, Windows.

Operating systems- A Concept based Approach-D. Dhamdhere, 2nd Edition, TMH. Phases of Compilation — Lexical Analysis, Regular Grammar and regular expression for common programming language features, pass and Phases of translation, interpretation, bootstrapping, data structures in compilation — LEX lexical analyzer generator. Context free grammars, Top down parsing — Backtracking, LL 1 , recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing.

Intermediate forms of source Programs — abstract syntax tree, polish notation and three address codes. Attributed grammars, Syntax directed translation, Conversion of popular Programming languages language Constructs into Intermediate code forms, Type checker.

Symbol table format, organization for block structures languages, hashing, tree structures representation of scope information. Block structures and non block structure storage allocation: Consideration for Optimization, Scope of Optimization, local optimization, loop optimization, frequency reduction, folding, DAG representation.

Flow graph, data flow equation, global optimization, redundant sub expression elimination, Induction variable elements, Live variable analysis, Copy propagation. Object code forms, machine dependent code optimization, register allocation and assignment generic code generation algorithms, DAG for register allocation. Principles of compiler design -A. Ullman; Pearson Education. Appel, Cambridge University Press.

Bal, Cariel T. Jacobs, Wiley dreamtech. Compiler Construction, Louden, Thomson. IEEE Virtual circuit and Datagram subnets-Routing algorithm shortest path routing, Flooding, Hierarchical routing, Broad cast, Multi cast, distance vector routing. Rotary for mobility. Internet working: Data Communications and Networking — Behrouz A. Third Edition TMH. Keshav, 2nd Edition, Pearson Education 2. Understanding communications and Networks, 3rd Edition, W. Intruders, Viruses and related threats.

Manzuik and Ryan Permeh, wiley Dreamtech. Principles of Information Security, Whitman, Thomson. Network Security: Introduction to Cryptography, Buchmann, Springer.

Agents and Environments,the concept of rationality, the nature of environments, structure of agents, problem solving agents, problemformulation. Searching for solutions, uniformed search strategies — Breadth first search, depth first Search. Adversial search, Games, minimax, algorithm, optimal decisions in multiplayer games, Alpha- Beta pruning, Evaluation functions, cutting of search.

Inference in first order logic, propositional Vs. Analysis of Pattern Mapping Networks. Artificial Intelligence — A Modern Approach. Artificial Neural Networks B. Artificial Intelligence , 2nd Edition, E. Rich and K. Knight TMH. Expert Systems: Classes, Relationships, common Mechanisms, and diagrams. Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and Roles, Packages. Use cases, Use case Diagrams, Activity Diagrams. Events and signals, state machines, processes and Threads, time and space, state chart diagrams.

Component, Deployment, Component diagrams and Deployment diagrams. Meilir Page-Jones: Pascal Roques: Atul Kahate: Mark Priestley: Appling UML and Patterns: Part - A 1. Implement the data link layer framing methods such as character, character stuffing and bit stuffing.

Take an example subnet graph with weights indicating delay between nodes. Now obtain Routing table art each node using distance vector routing algorithm 5. Take an example subnet of hosts.

Obtain broadcast tree for it. Take a 64 bit playing text and encrypt the same using DES algorithm. Write a program to break the above DES coding 8. Part - B 1.

The student should take up the case study of Unified Library application which is mentioned in the theory, and Model it in different views i. Some of the ideas regarding case studies are given in reference books which were mentioned in theory syllabus can be referred for some idea.

The analysis, design, coding, documentation, database design of mini project which will be carried out in 4th year should be done in object-oriented approach using UML and by using appropriate software which supports UML, otherwise the mini project will not be evaluated. Simulate all file allocation strategies a Sequentialb Indexed c Linked 3. Simulate Paging Technique of memory management. PART - B Consider the following mini Language, a simple procedural high-level language, only operating on integer data, with a syntax looking vaguely like a simple C crossed with Pascal.

JNTUK B.Tech 3-1 Syllabus Books (R16) Download – All Branches

The syntax of the language is defined by the following BNF grammar: The language has rudimentary support for 1-dimensional arrays. The declaration int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. A simple program written in this language is: Design a Lexical analyzer for the above language. The lexical analyzer should ignore redundant spaces, tabs and newlines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value.

Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools. Design Predictive parser for the given language 4. Design LALR bottom up parser for the above language.

Convert the BNF rules into Yacc form and write code to generate abstract syntax tree. Write program to generate machine code from the abstract syntax tree generated by the parser. The following instruction set may be considered as target code. The following is a simple register-based machine, supporting a total of 17 instructions. It has three distinct internal storage areas.

The first is the set of 8 registers, used by the individual instructions as detailed below, the second is an area used for the storage of variables and the third is an area used for the storage of program.

The instructions can be preceded by a label.

This consists of an integer in the range 1 to and the label is followed by a colon to separate it from the rest of the instruction. The numerical label can be used as the argument to a jump instruction, as detailed below.

In the description of the individual instructions below, instruction argument types are specified as follows: L specifies a numerical label in the range 1 to A specifies a constant value, a variable location, a register or a variable location pointed to by a register an indirect address.

Constant values are specified as an integer value, optionally preceded by a minus sign, preceded by a symbol. An indirect address is specified by an followed by a register. So, for example, an A-type argument could have the form 4 variable number 4 , 4 the constant value 4 , r4 register 4 or r4 the contents of register 4 identifies the variable location to be accessed.

JNTUK b.tech 4-2 sem syllabus books for R13 regulation of All Branches

The instruction set is defined as follows: OUT R outputs the value in register R. NEG R negates the value in register R. JMP L causes an unconditional jump to the instruction with the label L. NOP is an instruction with no effect. Usage of web browsers, email, newsgroups and discussion forums would be covered. In addition, awareness of cyber hygiene, i.

Productivity tools module would enable the students in crafting professional word documents, excel spread sheets, power point presentations and personal web sites using the Microsoft suite of office tools and LaTeX.

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. Tech sem R16 syllabus Books download. Previously we have the Syllabus for R13, R10 Regulations. Students can check their course structure and download syllabus books pdf branch wise below.

Also Check: Tech sem Syllabus Books For R All Branches of Engineering Links are Updated. Also check here:Microprocessor The data sent from the client is the radius of a circle, and the result produced by the server is the area of the circle. Are any values of x also illegal? W support for more ILP at compile time- H. Instruction set of Then, in the body of your pages, you refer to these selectors to activate the styles. Burkhardt et. UNIT V: Growing energy needs, renewable and non-renewable energy sources use of alternate energy sources.

Creating project abstract Features to be covered: