Skip to content

 Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech Operation Research 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Download Operation Research Study Materials

operation research pdf ebook free downloadDownload
operations research lecture notes pptDownload
operations research problems and solutions pdfDownload
operations research pdf ebook downloadDownload
Operation Research Question PaperDownload

Recommended Books

  •  P. Sankara Iyer,” Operations Research”, Tata McGraw-Hill, 2008.
  • A.M. Natarajan, P. Balasubramani, A. Tamilarasi, “Operations Research”, Pearson Education, 2005.
  •  J K Sharma. “Operations Research Theory & Applications, 3e”, Macmillan India Ltd, 2007.
  • P. K. Gupta and D. S. Hira, “Operations Research”, S. Chand & co., 2007.
  • J K Sharma., “Operations Research, Problems and Solutions, 3e”, Macmillan India Ltd
  •  N.V.S. Raju, “Operations Research”, HI-TECH, 2002

Syllabus

UNIT-I:

Introduction to Operations Research: Basics definition, scope, objectives, phases, models, and limitations of Operations Research. Linear Programming Problem – Formulation of LPP, Graphical solution of LPP. Simple Method, Artificial variables, big-M method, two-phase method, degeneracy, and unbound solutions.

UNIT-II:

Transportation Problem. Formulation, solution, unbalanced Transportation problem. Finding basic feasible solutions – Northwest corner rule, least cost method, and Vogel’s approximation method. Optimality test: the stepping stone method and MODI method

UNIT-III:

Assignment model. Formulation. The Hungarian method for the optimal solution. Solving the unbalanced problem. Traveling salesman problem and assignment problem Sequencing models. Solution of
Sequencing Problem – Processing n Jobs through 2 Machines – Processing n Jobs through 3 Machines – Processing 2 Jobs through m machines – Processing n Jobs through m Machines

UNIT-IV:

Dynamic programming. Characteristics of dynamic programming. Dynamic programming approach for Priority Management employment smoothening, capital budgeting, Stage Coach/Shortest Path, cargo loading and Reliability problems Games Theory. Competitive games, rectangular game, saddle point, minimax (maximin) method of optimal strategies, value of the game. Solution of games with saddle points, dominance principle. Rectangular games without saddle point – mixed strategy for 2 X 2 games

UNIT-V:

Replacement Models. The Replacement of Items that Deteriorate whose maintenance costs increase with time without change in the money value. Replacement of items that fail suddenly: individual replacement policy, group replacement policy

UNIT-VI:

Inventory models. Inventory costs. Models with deterministic demand – model (a) demand rate uniform and production rate infinite, model (b) demand rate non-uniform and production rate
infinite, model (c) demand rate uniform and production rate finite.

Important Questions

  • Explain briefly the characteristics of a queuing system.
  • A TV repairman finds that the time spent on his jobs has an exponential distribution with mean 30 minutes. If he repairs sets in the order in which they come in, and if the arrival of sets is approximately Poison with an average rate of 10 per 8 hour day, what is repairman’s expected idle time each day? How many jobs are ahead of the average set just brought in?
  • Find the optimal economic order quantity for a product having the following characteristics: Annual demand=2400 unit Ordering cost=Rs.100 Cost of storage=24% of unit cost
  • What are the demerits of dynamic programming?
  •  What are the pre-requisites for applying dynamic programming?
  • Discuss the types of simulation models.
  • What do you understand by simulation? Explain briefly its advantages and disadvantages.

 Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Human-Computer Interaction 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Human Interaction

Research in Human-Computer Interaction (HCI) in today’s world has fundamentally changed computing. For instance, the spectacular growth of World Wide Web is an outcome of the HCI research – we’re talking about applying hypertext technology to browsers that will let them traverse a link across the world with a click of the mouse.

Download Human-Computer Interaction Notes

human-computer interaction   lecture notes in computer science Download
human-computer interaction questions and answers pdf  Download
human-computer interaction lecture notes ppt  Download
 human-computer interaction ebook download  Download
 introduction to human-computer interaction pdf  Download
 Human-Computer Interaction ppt  Download

Recommended Books for Human Computer Interaction

  • Wilbert O. Galitz, “The Essential Guide to User Interface Design”, Wiley India Edition
  • Price, Rogers, “Sharps Interaction Design”, Wiley India.
  •  Ben Schneidermann,” Designing the user interfaces”. 3rd Edition, Pearson Education Asia.
  •  Soren Lauesen, “User Interface Design” , Pearson Education
  • Alan Cooper, Robert Riemann, David Cronin, “Essentials of Interaction Design”, Wiley
  • Alan Dix, Janet Finlay, GreGoryd, Abowd, Russell, Bealg,”human-computer Interaction”, Pearson Education.

Syllabus

UNIT-I:

The User Interface: Introduction, Importance of the User Interface, Importance, and benefits of Good Design History of Human-Computer Interface. Characteristics of Graphical and Web User Interface: Graphical User Interface, the popularity of graphics, concepts of Direct Manipulation, Graphical System advantage and disadvantage, Characteristics of GUI. Web User Interface, the popularity of the web, Characteristics of Web Interface, Merging of Graphical Business systems& the Web, Principles of User Interface Design

UNIT-II:

The User Interface Design Process: Obstacles and Pitfall in the Development Process, Usability, The Design Team, Human Interaction with Computers, Important Human Characteristics in
Design, Human Consideration in Design, Human Interaction Speeds, Performance versus Preference, Methods for Gaining and Understanding of Users

UNIT-III:

Understanding Business Functions: Business Definitions & Requirement analysis, Determining Business Functions, Design standards or Style Guides, System Training and Documentation

UNIT-IV:

Principles of Good Screen Design: Human considerations in screen Design, interface design goals, test for a good design, screen meaning and purpose, Technological considerations in Interface Design System Menus and Navigation Schemes: Structure, Functions, Context, Formatting, Phrasing and Selecting, Navigating of Menus, Kinds of Graphical Menus Windows Interface: Windows characteristic, Components of Window, Windows Presentation Styles, Types of Windows, Window Management, Web systems

UNIT-V:

Device and Screen-Based Control: Device-based controls, Operable Controls, Text entry/read- Only Controls, Section Controls, Combining Entry/Selection Controls, Other Operable Controls and Presentation Controls, Selecting proper controls

UNIT-VI:

Effective Feedback Guidance and Assistance: Providing the Proper Feedback, Guidance and Assistance Effective Internationalization and Accessibility- International consideration, Accessibility, Create meaningful Graphics, Icons and Images, Colors-uses, possible problems with colors, choosing colors

Important Questions

  • Describe five main issues that may affect the design, implementation or marketing
  • Explain Shneiderman’s three pillars of design
  • Discuss the classification of Menus
  • Provide three examples of an application where menu selection and form filling are more appropriate than a direct-manipulation strategy
  • Elaborate on various pointing devices
  • What are the various abbreviation strategies and also discuss on abbreviation guidelines
  •  What are the guidelines for alphanumeric displays, spreadsheets, and Graphs
  •  List a few common mistakes of web-based display of information
  • Discuss the advantages and disadvantages of reading on paper and reading on a computer display
  • “Online communities are useful for User Assistance” – Justify this statement describing various weaknesses and strengths
  •  What is Information Visualization? Explain how it caters to the perceptual abilities of humans
  • Explain advanced filtering and search techniques

 Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Data Structure 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Data Structure

Data structure represents the logical relationship which exists between different singular elements of data. Data structure is a way of organizing every data items that consider not alone the elements which are stored, but also their relationship to each other.

Download Data Structure in ‘C’ Study Materials

DS ebook pdf free downloadDownload
Data structure using c Notes pdfDownload
Data structures study material pdfDownload
Data Structures Question paperDownload
 Data Structures Text Book Pdf Download

Recommended Books

  • Data structures, Algorithms, and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd.
  • Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition.
  • Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson
  • Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition.
  • Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.
  • Problem-solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.

Syllabus

UNIT-I: ARRAYS

Abstract Data Type, The Array as an Abstract Data Type, The Polynomial Abstract Data type- Polynomial Representation- Polynomial Addition. Spares Matrices, Introduction- Sparse Matrix Representation- Transposing a Matrix- Matrix Multiplication, Representation of Arrays.

UNIT-II: STACKS AND QUEUES

The Stack Abstract Data Type, The Queue Abstract Data Type, Evaluation of Expressions, Expression- Postfix Notation- Infix to Postfix.

UNIT-III: LINKED LISTS

Single Linked List and Chains, Circular Lists, Available Space Lists, Linked Stacks and Queues, Polynomials, Polynomial Representation- Adding Polynomials- Circular List Representation of Polynomials, Equivalence Classes, Sparse Matrices, Sparse Matrix Representation- Sparse Matrix Input- Deleting a Sparse Matrix, Doubly Linked Lists, Generalized Lists, Representation of Generalized Lists- Recursive Algorithms for Lists- Reference Counts, Shared and Recursive Lists

UNIT-IV: TREES

Representation of Trees, Binary Trees, The Abstract Data Type, Properties of Binary Tress, Binary Tree Representations, Binary Tree Traversal, Introduction, Inorder Traversal Preorder Traversal, Postorder Traversal, Thread Binary Trees, Threads, Inorder Traversal of a Threaded Binary Tree, Inserting a Node into a Threaded Binary Tree, Heaps, Priority Queues, Definition of a Max Heap, Insertion into a Max Heap, Deletion from a Max Heap, Binary Search Trees, Definition, Searching a Binary Search Tree, Insertion into a Binary Search Tree, Deletion from a Binary Search Tree, Height of Binary Search Tree.

UNIT-V: GRAPHS

The Graph Abstract Data Type, Introduction, Definition, Graph Representation, Elementary Graph Operation, Depth First Search, Breadth First Search, Connected Components, Spanning Trees,
Biconnected Components, Minimum Cost Spanning Trees, Kruskal S Algorithm, Prims Algorithm, Sollin’s Algorithm, Shortest Paths, and Transitive Closure, Single Source/All Destination: Nonnegative Edge Cost, Single Source/All Destination: General Weights, All-Pairs Shortest Path, Transitive Closure.

UNIT-VI: SORTING

Insertion Sort, Quick Sort, Merge Sort Merging, Iterative Merge Sort, Recursive Merge Sort, Heap Sort, Summary of Internal Sorting

Important Questions

  • Define an algorithm.
  • State the various steps in developing algorithms?
  • State the properties of algorithms.
  • Define the efficiency of an algorithm?
  • State the various methods to estimate the efficiency of an algorithm.
  • Define the time complexity of an algorithm?
  • Define the worst case of an algorithm.
  • Mention the various spaces utilized by a program.
  • Define the average case of an algorithm.
  • Define the best case of an algorithm.
  • What is the importance of the stopping case in recursive functions?
  • Write a function with one positive integer parameter called n. The function will
  • write 2^n-1 integers (where ^ is the exponentiation operation). Here are the patterns of output for various values of n: n=1: Output is: 1; n=2: Output is: 1 2 1; n=3: Output is: 1 2 1 3 1 2 1; n=4: Output is: 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 And so on. Note that the output for n always consists of the output for n-1, followed by n itself, followed by a second copy of the output for n-1.
  • Write a recursive function for the mathematical function: f(n) = 1 if n = 1; f(n) = 2 * f(n-1) if n >= 2
  • Which method is preferable in general?

a) Recursive method
b) Non-recursive method

  • Write a function using Recursion to print numbers from n to 0.
  •  Write a function using Recursion to enter and display a string in reverse and state whether the string contains any spaces. Don’t use arrays/strings.

 Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Computer Network2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Computer Network

The word network is used in computer terms to describe “a group of computers and other devices connected in some ways which enables them to exchange data”. Every device on a network is called a node. Every node will have a unique address. Addresses are basically numeric quantities that makes everything easier for a computer to work on.

Download Computer Network for B.Tech

Computer Networks notes for CSE  pdfDownload
computer networks   handwritten notesDownload
computer networks notes for CSE 5th semDownload
computer networks notes pdfDownload
computer networks notes pdf for ECE PPTDownload
computer networks Question Paper PdfDownload

Recommended Books

  • Tanenbaum and David J Wetherall, Computer Networks, 5th Edition, Pearson Edu, 2010
  • Computer Networks: A Top-Down Approach, Behrouz A. Forouzan, FirouzMosharraf, McGraw Hill Education
  • Larry L. Peterson and Bruce S. Davie, “Computer Networks – A Systems Approach” (5th ed), Morgan Kaufmann/ Elsevier, 2011
  • Data Communications and Networking, Behrouz A. Forouzan, TMH
  • Data and Computer Communications, William Stallings, PHI
  • Computer Networks, Andrew S. Tanenbaum, PHI Version 2 CSE IIT, Kharagpur
  • Wireless Communications; Principles and Practice, Theodore E. Rappaport, 2nd Edition, Pearson Education
  • Satellite Communications, Timothy Pratt, Charles Bostian, and Jeremy Allnutt, 2nd Edition, Wiley
  • Internetworking with TCP/IP; Principles, Protocols, and Architecture, Douglas E. Commer, 3rd Edition, Prentice Hall of India
  • Data Compression; The Complete Reference, David Solomon, 3rd Edition, Springer
  • Network Security; Private Communication in a Public World, CharlieKaufman, RadiaPerlmon and Mike Speciner, 2nd Edition, Prentice Hall of India

Syllabus

UNIT – I:

Introduction: Network Topologies WAN, LAN, MAN. Reference models- The OSI Reference Model- the TCP/IP Reference Model – A Comparison of the OSI and TCP/IP Reference Models

UNIT – II:

Physical Layer – Fourier Analysis – Bandwidth Limited Signals – The Maximum Data Rate of a Channel – Guided Transmission Media, Digital Modulation and Multiplexing: Frequency Division Multiplexing, Time Division Multiplexing, Code Division Multiplexing Data Link Layer Design Issues, Error Detection and Correction, Elementary Data Link Protocols, Sliding Window Protocols

UNIT – III:

The Data Link Layer – Services Provided to the Network Layer – Framing – Error Control – Flow Control, Error Detection and Correction – Error-Correcting Codes – Error Detecting Codes, Elementary Data Link Protocols- A Utopian Simplex Protocol-A Simplex Stop and Wait Protocol for an Error free channel-A Simplex Stop and Wait Protocol for a Noisy Channel, Sliding Window Protocols-A One Bit Sliding Window Protocol-A Protocol Using Go-Back-N- A Protocol Using Selective Repeat

UNIT – IV:

The Medium Access Control Sublayer-The Channel Allocation Problem-Static Channel Allocation-Assumptions for Dynamic Channel Allocation, Multiple Access Protocols-Aloha- Carrier Sense Multiple Access Protocols-Collision-Free Protocols-Limited Contention Protocols- Wireless LAN Protocols, Ethernet-Classic Ethernet Physical Layer-Classic Ethernet MAC Sublayer Protocol-Ethernet Performance-Fast Ethernet Gigabit Ethernet-10-Gigabit Ethernet- Retrospective on Ethernet, Wireless Lans-The 802.11 Architecture and Protocol Stack-The 802.11 Physical Layer-The802.11 MAC Sublayer Protocol-The 805.11 Frame Structure Services

UNIT – V:

Design Issues-The Network Layer Design Issues – Store and Forward Packet Switching-Services Provided to the Transport layer- Implementation of Connectionless Service-Implementation of Connection-Oriented Service-Comparison of Virtual Circuit and Datagram Networks, Routing Algorithms-The Optimality principle-Shortest path Algorithm, Congestion Control Algorithms- Approaches to Congestion Control-Traffic Aware Routing-Admission Control-Traffic Throttling-Load Shedding.

UNIT – VI:

Transport Layer – The Internet Transport Protocols: UDP, the Internet Transport Protocols: TCP Application Layer –The Domain Name System: The DNS Name Space, Resource Records, Name Servers, Electronic Mail: Architecture and Services, The User-Agent, Message Formats, Message Transfer, Final Delivery

Important Questions

  • Compare the WAN, LAN and MAN topologies.
  • Define Encapsulation and Peer to Peer communication in the layered architecture.
  • With neat sketch Explain Packet switching technique in detail.
  •  Give a brief explanation about copper cables with neat sketch.
  •  Describe the stop and wait for a protocol with a neat sketch.
  • Explain the Distance Vector routing algorithm with an example.
  •  What are the differences between the Static Routing Algorithm and Dynamic Routing Algorithm?
  • Explain TCP Connection management Finite State Machine. Explain all states in it.
  • What is the significance of the data link layer? Explain the design issues of the data link layer.
  • Explain the different layers of ATM.
  • Write short notes on
    (a) SNMP
    (b) Network Security

 Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Professional Ethics and Human Values 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Professional Ethics and Human Values

In human values, we are talking about a character-based education that instills fundamental values and ethnic values in one’s psyche. This subject enables a student to realize what is essential or valuable in a person’s life.

Download Professional Ethics and Human Values

Human values and professional ethics question and answersDownload
Human values and professional ethics notes pptDownload
HVPE  pdf downloadDownload
Human values and professional ethics notes unitDownload
Human values and professional ethics Question Paper PdfDownload

Recommended Books

  • Professional Ethics by R. Subramaniam – Oxford Publications, New Delhi.
  •  Ethics in Engineering by Mike W. Martin and Roland Schinzinger – Tata McGraw-Hill – 2003.
  • Professional Ethics and Morals by Prof.A.R.Aryasri, DharanikotaSuyodhana – Maruthi Publications.
  • Engineering Ethics by Harris, Pritchard, and Rabins, Cengage Learning, New Delhi.
  •  Human Values & Professional Ethics by S. B. Gogate, Vikas Publishing House Pvt. Ltd., Noida.
  •  Engineering Ethics & Human Values by M.Govindarajan, S.Natarajan and V.S.SenthilKumar-PHI Learning Pvt. Ltd – 2009.
  • Professional Ethics and Human Values by A. Alavudeen, R.Kalil Rahman and M. Jayakumaran – University Science Press.
  • Professional Ethics and Human Values by Prof.D.R.Kiran-Tata McGraw-Hill – 2013
  •  Human Values And Professional Ethics by Jayshree Suresh and B. S. Raghavan, S.Chand Publications

Syllabus

UNIT I: Human Values:

Morals, Values, and Ethics – Integrity –Trustworthiness – Work Ethics – Service-Learning – Civic Virtue – Respect for others – Living Peacefully – Caring – Sharing – Honesty –Courage – Value Time – Co-operation – Commitment – Empathy – Self-confidence – Spirituality- Character.

UNIT: II: Principles for Harmony:

Truthfulness – Customs and Traditions -Value Education – Human Dignity – Human Rights – Fundamental Duties – Aspirations and Harmony (I, We & Nature) – Gender Bias – Emotional Intelligence – Salovey – Mayer Model – Emotional Competencies – Conscientiousness.

UNIT III: Engineering Ethics and Social Experimentation:

History of Ethics – Need of Engineering Ethics – Senses of Engineering Ethics- Profession and Professionalism ––Self Interest – Moral Autonomy – Utilitarianism – Virtue Theory – Uses of Ethical Theories – Deontology- Types of Inquiry –Kohlberg’s Theory – Gilligan’s Argument – Heinz’s Dilemma – Comparison with Standard Experiments –– Learning from the Past – Engineers as Managers – Consultants and Leaders – Balanced Outlook on Law – Role of Codes – Codes and Experimental Nature of Engineering.

UNIT IV: Engineers’ Responsibilities towards Safety and Risk:

The concept of Safety – Safety and Risk – Types of Risks – Voluntary v/sInvoluntary Risk – Consequences – Risk Assessment –Accountability – Liability – Reversible Effects – Threshold Levels of Risk – Delayed v/sImmediate Risk – Safety and the Engineer – Designing for Safety – Risk-Benefit Analysis-Accidents.

UNIT V: Engineers’ Duties and Rights:

Concept of Duty – Professional Duties – Collegiality – Techniques for Achieving Collegiality – Senses of Loyalty – Consensus and Controversy – Professional and Individual Rights – Confidential and Proprietary Information – Conflict of Interest-Ethical egoism – Collective Bargaining – Confidentiality – Gifts and Bribes – Problem solving-Occupational Crimes- Industrial Espionage- Price Fixing-Whistle Blowing.

UNIT VI: Global Issues:

Globalization and MNCs –Cross Culture Issues – Business Ethics – Media Ethics – Environmental Ethics – Endangering Lives – Bio Ethics – Computer Ethics – War Ethics – Research Ethics -Intellectual Property Rights.

Important Questions

  • Suggest the steps to ensure the safety of the Engineer as well as the safety of the design of the equipment?
  • Define – (a) Privileged information (b) Proprietary information
  • Write about
    (a) Kohlberg’s theory
    (b) Use of ethical theories
  • Explain Intellectual Property Rights.
  •  Explain the terms: Integrity, Work ethic, Civic Virtue, Character.
  • What are the functions and limitations of the ‘code of ethics’?
  • Write an essay on the Accountability and Responsibility of Engineers towards society.
  • Give an account of ‘Computer Ethics’ and the problems associated with the autonomous nature of computers.
  •  What were the conclusions made by ‘Gilligan’s about men and women?
  •  Mention the uses of ‘Ethical Theories’.
  • What do you understand by ‘acceptable risk’?
  • Explain in detail – (a) values (b) ethics (c) value time (d) courage
  • What is meant by ‘voluntary risk’?
  •  What is meant by ‘Whistle Blowing’?
  •  List any two limitations of ‘Whistleblowing’

Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rdStatistics with R Programming 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from. 

Statistics with R Programming

Here, we are talking about using the program language R for statistical programming, computation, graphics and modeling, writing functions, and efficiently using R.

Download Statistics with R Programming

introduction to r statisticsDownload
introduction to r programmingDownload
Statistics with R Programming notes pdf Study materialDownload
Statistics with R Programming Question PaperDownload

Recommended Books

  • The Art of R Programming, Norman Matloff, Cengage Learning
  • R for Everyone, Lander, Pearson
  • Siegel, S. (1956), Nonparametric Statistics for the Behavioral Sciences, McGraw-Hill International, Auckland.
  • R Cookbook, PaulTeetor, Oreilly.
  • R in Action, Rob Kabacoff, Manning
  • Venables, W. N., and Ripley, B. D. (2000), S Programming, Springer-Verlag, New York.
  • Venables, W. N., and Ripley, B. D. (2002), Modern Applied Statistics with S, 4th ed., Springer-Verlag, New York.
  • Weisberg, S. (1985), Applied Linear Regression, 2nd ed., John Wiley & Sons, New York.
  • Zar, J. H. (1999), Biostatistical Analysis, Prentice Hall, Englewood Cliffs, NJ

Syllabus

UNIT-I:

Introduction, How to run R, R Sessions, and Functions, Basic Math, Variables, Data Types, Vectors, Conclusion, Advanced Data Structures, Data Frames, Lists, Matrices, Arrays, Classes.

UNIT-II:

R Programming Structures, Control Statements, Loops, – Looping Over Nonvector Sets,- If-Else, Arithmetic, and Boolean Operators and values, Default Values for Argument, Return Values, Deciding Whether to explicitly call return- Returning Complex Objects, Functions are Objective, No Pointers in R, Recursion, A Quicksort Implementation-Extended Extended Example: A Binary Search Tree.

UNIT-III:

Doing Math and Simulation in R, Math Function, Extended Example Calculating Probability- Cumulative Sums and Products-Minima and Maxima- Calculus, Functions Fir Statistical Distribution, Sorting, Linear Algebra Operation on Vectors and Matrices, Extended Example: Vector cross Product- Extended Example: Finding Stationary Distribution of Markov Chains, Set Operation, Input /out put, Accessing the Keyboard and Monitor, Reading and writer Files,

UNIT-IV:

Graphics, Creating Graphs, The Workhorse of R Base Graphics, the plot() Function – Customizing Graphs, Saving Graphs to Files.

UNIT-V:

Probability Distributions, Normal Distribution- Binomial Distribution- Poisson Distributions Other Distribution, Basic Statistics, Correlation and Covariance, T-Tests,-ANOVA.

UNIT-VI:

Linear Models, Simple Linear Regression, -Multiple Regression Generalized Linear Models, Logistic Regression, – Poisson Regression- other Generalized Linear Models-Survival Analysis, Nonlinear Models, Splines- Decision- Random Forests,

Important Questions

  • Explain about Variables, Constants and Data Types in R Programming
  • How to create, name, access, merging, and manipulate list elements? Explain with examples.
  •  Write about Arithmetic and Boolean operators in R programming?
  •  How to create user-defined function in R? How to define default values in R? Write syntax and examples?
  •  Explain functions for accessing the keyboard and monitor, Reading and writing files
  •  Write an R function to find sample covariance.
  • Write about the following functions with example
    a)points() b) legend() c)text() d) locator()
  •  Describe R functions for Reading a Matrix or Data Frame From a File
  • Fit a poisson distribution to the following data
    x 0,1,2,3,4,5
    f 3,9,12,27,4,1
    Also, test the adequacy of the model
  •  Calculate the coefficient of correlation to the following data
    X 10 12 18 24 23 27
    Y 13 18 12 25 30 10

Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Web Technology 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from. 

Web Technology

This subject introduces you to the basics of Web Technology. This includes dealing with resources that will help in accessing the internet. This will help the student in establishing an internet connection, explaining the role of internet services and other similar cases. 

Download B.Tech 3rd Year Web Technology Study Materials

Web technology notes engineeringDownload
Web technology pdf downloadDownload
Web technology notes for CSE 6th semDownload
Web technology notes PPTDownload
Web technology notes Question PaperDownload

Recommended Books

  • TCP/IP – Forouzan (TMH)
  • Internet and World Wide Web, How to Program, Dietel and Dietel, Pearson Education.
  • Complete Reference JAVA – Naughton Schildt
  • Web Technologies – Achyut S Godbole and Atul Kahate
  • Programming the World Wide Web, Robert W Sebesta, 7ed, Pearson.
  • Web Technologies, Uttam K Roy, Oxford
  •  The Web Warrior Guide to Web Programming, Bai, Ekedahl, Farrell, Gosselin, Zak, Karparhi, Maclntyre, Morrissey, Cengage
  •  Ruby on Rails Up and Running, Lightning fast Web development, Bruce Tate, Curt Hibbs, Oreilly( 2006)
  • Programming Perl, 4ed, Tom Christiansen, Jonathan Orwant, Oreilly (2012)
  •  Web Technologies, HTML< JavaScript, PHP, Java, JSP, XML and AJAX, Black book, Dream Tech.
  •  An Introduction to Web Design, Programming, Paul S Wang, Sanda S Katila, Cengage

Syllabus

UNIT-I: HTML, CSS

Basic Syntax, Standard HTML Document Structure, Basic Text Markup, Images, Hypertext Links, Lists, Tables, Forms, HTML5

CSS: Levels of Style Sheets, Style Specification Formats, Selector Forms, The Box Model, Conflict Resolution

UNIT-II: Javascript

The Basic of Javascript: Objects, Primitives Operations, and Expressions, ScreenOutput and Keyboard Input, Control Statements, Object Creation and Modification, Arrays, Functions, Constructors, Pattern Matching using Regular Expressions DHTML: Positioning Moving and Changing Elements

UNIT-III:

XML: Document type Definition, XML schemas, Document object model, XSLT, DOM and SAX Approaches, AJAX A New Approach: Introduction to AJAX, Integrating PHP and AJAX.

UNIT-IV:

PHP Programming: Introducing PHP: Creating a PHP script, Running PHP script. Working with variables and constants: Using variables, Using constants, Data types, Operators.Controlling program flow: Conditional statements,Control statements, Arrays, functions. Working with forms and Databases such as MySQL.

UNIT-V:

Introduction to PERL, Operators and if statements, Program design, and control structures, Arrays, Hashes and File handling, Regular expressions, Subroutines, Retrieving documents from the web with Perl.

UNIT-VI:

Introduction to Ruby, Variables, types, simple I/O, Control, Arrays, Hashes, Methods, Classes, Iterators, Pattern Matching. Overview of Rails.

Important Questions

  • Write the HTML code to display your class timetable.
  • Explain different types of cascading style styles with suitable examples.
  • Write a JavaScript code to test whether the given number is an Armstrong number or not.
  • What are the differences between DTDs and XML Schema?
  •  Write an XML program to illustrate XSLT.
  • Explain the importance of XML in web applications.
  • What are the differences between a traditional web application and an AJAX-based web application?
  •  Explain the working mechanism of AJAX with a suitable example.
  •  Write a PHP script for uploading a file to the server and display the uploaded file details.
  • Write a PHP script to validate the student data (Name, Regd.No, Email) using regular expressions and store it in the database.
  •  Explain HTML tags emulation,arrays,hashes in PERL.
  • Which feature of Perl provides code reusability? Give an example of that feature.
  • Explain hashes and classes in ruby with suitable examples.
  • Describe MVC architecture and Write ruby code for web application

Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Operating System 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from. 

Operating System 

Personal computers and mainframes which come under modern general-purpose computers have an operating system of their own which will help run other programs, such as application softwares. Eg: Microsoft Windows, Mac OS, Unix, Linux.

Download Operating System Study Materials BOOK PDF

Operating System notes for B.tech pdfDownload
Operating System notes pptDownload
Operating System Pdf handwritten notesDownload
Operating System notes for engineering pdfDownload
Operating System for engineering Question PaperDownload

Recommended Books

  • Modern Operating Systems, Andrew S. Tanenbaum, Second Edition, Addison Wesley, 2001.
  •  Operating Systems: A Design-Oriented Approach, Charles Crowley, Tata Mc Graw Hill Education”, 1996.
  • The  Operating Systems: A Concept-Based Approach, D M Dhamdhere, Second Edition, Tata Mc Graw-Hill Education, 2007.
  • Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin and Greg Gagne 9th Edition, John Wiley and Sons Inc., 2012.
  • The Operating Systems – Internals and Design Principles, William Stallings, 7th Edition, Prentice Hall, 2011.
  • Operating Systems-S Halder, Alex A Aravind Pearson Education Second Edition 2016.

Syllabus

UNIT I

Introduction to Operating System Concept: Types of operating systems, operating systems concepts, operating systems services, Introduction to System call, System call types.

UNIT-II:

Process Management – Process concept, The process, Process State Diagram, Process control block, Process Scheduling- Scheduling Queues, Schedulers, Operations on Processes, Interprocess Communication, Threading Issues, Scheduling-Basic Concepts, Scheduling Criteria, Scheduling Algorithms.

UNIT-III:

Memory Management: Swapping, Contiguous Memory Allocation, Paging, the structure of the Page Table, Segmentation

Virtual Memory Management: Virtual Memory, Demand Paging, Page-Replacement Algorithms, Thrashing

UNIT-IV:

Concurrency: ProcessSynchronization, The Critical- Section Problem, Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors, Synchronization

examples Principles of deadlock – System Model, Deadlock Characterization, Deadlock Prevention, Detection and Avoidance, Recovery from Deadlock

UNIT-V:

File system Interface- the concept of a file, Access Methods, Directory structure, File system mounting, file sharing, protection.

File System implementation- File system structure, allocation methods, free-space management mass-storage structure overview of Mass-storage structure, Disk scheduling, Device drivers,

UNIT VI:

Linux System: Components of LINUX, Interprocess Communication, Synchronization, Interrupt, Exception and System Call. Android Software Platform: Android Architecture, Operating System Services, Android Runtime Application Development, Application Structure, Application Process management

Important Questions

  • What are the various components of the operating system structure, and explain the operating system's simple and layered approach in detail?
  • In a multiprogramming and time-sharing environment, several users share the system simultaneously; this situation can result in various security problem:
    i) What are two such problems?
    ii) Can ensure the same degree of security in a time-shared machine as in a dedicated machine? Justify your answer.
  • Name five major activities of an OS concerning process management and briefly describe why each is required.
  •  Write in detail about the thread libraries.
  •  What is Readers-Writer’s problem? Give a solution to Readers-Writers problem using Monitors.
  •  What is a Critical Section problem? Give the conditions that a solution to the critical section problem must satisfy.
  • What is Virtual Memory? Discuss the benefits of virtual memory techniques.
  •  What is Thrashing? What is the cause of Thrashing? How does the system detect Thrashing? What can the system do to eliminate this problem?
  •  What is deadlock? Consider the deadlock situation that could occur in the dining philosopher’s problem when the philosophers obtain the chopsticks one at a time.
  • Discuss how the four necessary conditions for deadlock indeed hold in this setting. What are the
    solutions to this problem?
  • Explain the Deadlock Detection scheme for Several Instances of a Resource Type.
  • Explain the three allocation methods in file system implementation. Illustrate with a proper diagram.
  • What are the objectives of file management systems? Explain the file system architecture.
  • Explain different structures and page tables with strengths and weaknesses.

Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Year Software testing Methodologies 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Download Study Materials

Software testing methodologies by Boris beizer pdfDownload
Software testing methodologies Aditya engineering collegeDownload
Software testing methodologies pptDownload
Software testing methodologies Question PaperDownload
Software Testing Methodologies Notes PdfDownload

Recommended Books

  • Software testing techniques – Boris Beizer, Dreamtech, second edition.
  • Software Testing- Yogesh Singh, Camebridge
  •  The Craft of software testing – Brian Marick, Pearson Education.
  • Software Testing, 3rd edition, P.C. Jorgensen, Aurbach Publications (Dist.by SPD).
  • Software Testing, N.Chauhan, Oxford University Press.
  • Introduction to Software Testing, P.Ammann&J.Offutt, Cambridge Univ.Press.
  • Effective methods of Software Testing, Perry, John Wiley, 2nd Edition, 1999.
  •  Software Testing Concepts and Tools, P.NageswaraRao, dreamtech Press
  • Win Runner in simple steps by Hakeem Shittu, 2007 Genixpress.
  • Foundations of Software Testing, D.Graham& Others, Cengage Learning

Syllabus

UNIT-I:

Introduction: 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.

UNIT-II:

Transaction Flow Testing: Transaction Flows, Transaction Flow Testing Techniques. Data flow testing: Basics of Dataflow Testing, Strategies in Dataflow Testing, Application of Dataflow Testing.

UNIT-III:

Domain Testing: Domains and Paths, Nice & Ugly Domains, Domain testing, Domains, and Interfaces Testing, Domain and Interface Testing, Domains and Testability. Paths, Path products, and Regular expressions: Path Products & Path Expression, Reduction Procedure, Applications, Regular Expressions & Flow Anomaly Detection.

UNIT-IV:

Syntax Testing: Why What and How, A Grammar for formats, Test Case Generation, Implementation and Application and Testability Tips. Logic-Based Testing: Overview, Decision Tables, Path Expressions, KV Charts, and Specifications.

UNIT – V:

State, State Graphs, and Transition Testing: State Graphs, Good & Bad State Graphs, State Testing, and Testability Tips. Graph Matrices and Application:-Motivational overview, matrix of graph, relations, power of a matrix, node reduction algorithm.

UNIT -VI:

Software Testing Tools: Introduction to Testing, Automated Testing, Concepts of Test Automation, Introduction to list of tools like Win runner, Load Runner, JMeter, About Win Runner ,Using Win runner, Mapping the GUI, Recording Test, Working with Test, Enhancing Test, Checkpoints, Test Script Language, Putting it all together, Running and Debugging Tests, Analyzing Results, Batch Tests, Rapid Test Script Wizard.

OUTCOME:
• Understand the basic testing procedures.
• Able to support in generating test cases and test suites.
• Able to test the applications manually by applying different testing methods and
automation tools.
• Apply tools to resolve the problems in the Real-time environment.

Important Questions

  • Discuss Myths related to software testing and its facts.
  • Explain the life cycle of Bug.
  • How to verify high-level decision? Discuss briefly.
  • A program calculates the GCD of three numbers in the range [1, 50]. Design test cases for this program using BVC, robust testing, and worst-case testing methods.
  • Explain in detail about Cyclomatic Complexity. Illustrate with an example.
  • Write and explain about Top-down integration testing.
  • Discuss about Selective Retest Technique.
  • What is the need for minimizing test cases in a project? Illustrate with an example.
  • What is Six Sigma? Explain briefly.
  • List and explain various guidelines for Automated testing.
  • What is the procedure for performing thread-based integration testing? Discuss briefly.

Here, we have provided the links containing the study materials, which will help you study and prepare for your B.Tech 3rd Year Data Mining 2020 edition examinations. Referring to the connections we’ve provided below and the links containing the study materials in PDF format, and the list of recommended books that we’ve provided below, you will be able to ace your examinations. We have also provided you with further details that will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything quickly and creates a better space for you to work on. These study materials give you the best resources to study from.

Download Data Mining Study Materials

Data Mining Notes 7th semDownload
Data Mining Notes  for StudentsDownload
Data Mining Lecture NotesDownload
Data Mining Notes PPTDownload

Recommended Books

  • Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin Kumar, Pearson.
  • Data Mining concepts and Techniques, 3/e, Jiawei Han, Michel Kamber, Elsevier.
  • The  Data Mining Techniques and Applications: An Introduction, Hongbo Du, Cengage Learning.
  • Data Mining : Vikram Pudi and P. Radha Krishna, Oxford.
  • Data Mining and Analysis – Fundamental Concepts and Algorithms; Mohammed J. Zaki, Wagner Meira, Jr, Oxford
  • Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH.

Syllabus

UNIT –I:

Introduction: Why Data Mining? What Is Data Mining?1.3 What Kinds of Data Can Be Mined?1.4 What Kinds of Patterns Can Be Mined? Which Technologies Are Used? Which Kinds of Applications Are Targeted? Major Issues in Data Mining. Data Objects and Attribute Types, Basic Statistical Descriptions of Data, Data Visualization, Measuring Data Similarity and Dissimilarity

UNIT –II:

Data Pre-processing: Data Preprocessing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation, and Data Discretization

UNIT –III:

Classification: Basic Concepts, General Approach to solving a classification problem, Decision Tree Induction: Working of Decision Tree, building a decision tree, methods for expressing attribute test conditions, measures for selecting the best split, Algorithm for decision tree induction.

UNIT –IV:

Classification: Alternative Techniques, Bayes’ Theorem, Naïve Bayesian Classification, Bayesian Belief Networks

UNIT –V:

Association Analysis: Basic Concepts and Algorithms: Problem Defecation, Frequent Item Set generation, Rule generation, compact representation of frequent item sets, FP-Growth Algorithm. (Tan & Vipin)

UNIT –VI:

Cluster Analysis: Basic Concepts and Algorithms: Overview: What Is Cluster Analysis? Different Types of Clustering, Different Types of Clusters; K-means: The Basic K-means Algorithm, K-means Additional Issues, Bisecting K-means, Strengths, and Weaknesses;
Agglomerative Hierarchical Clustering: Basic Agglomerative Hierarchical Clustering Algorithm DBSCAN: Traditional Density Center-Based Approach, DBSCAN Algorithm, Strengths, and Weaknesses. (Tan & Vipin)