Books and online learning materials herbert schildt

1

KUMARAGURU COLLEGE OF TECHNOLOGY,

CURRICULUM AND SYLLABI

III to VIII Semesters

VISION

To evolve as a School of Computer Science with centers of excellence having international reputation to serve the changing needs of Indian industry and society.

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

The objectives of the Under Graduate programme in Computer Science and Engineering are to: I.Enable graduates to be successful in their chosen careers, by applying their continual learning of Computer Science and Engineering in their work and life situations.

PO 1:Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems.

PO 2:Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.

3

PO 5:Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations.

PO 10:Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions. PO 11:Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.

PO 12:Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change.

4

5

7

9

U17MAT3104 DISCRETE MATHEMATICS (Common to CSE, IT, ISE)

Pre-requisite courses:NIL

3.J.P.Trembly, R. Manohar, Discrete Mathematical Structures with applications to Computer Science, TMHInternational Edition (Latest Edition).

4.NarsinghDeo, Graph Theory with Applications to Engineering and Computer Science, Prentice – Hall, Engle Cliffs, N. J.

11

Pre-requisite :NIL

THEORY COMPONENT CONTENTS

12

STACKS AND QUEUES 9 Hours ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks: Expression Conversion and evaluation – corresponding algorithms and complexity analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on each types of Queues: Algorithms and their analysis.

REFERENCES
1. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, SartajSahni, Computer Science Press.

2. M.A.Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson Education Asia, 2013.

2.Singly, Doubly and Circular Linked list implementations.

3.Linked list implementations of Stack and Queue ADT.

13

CO2: Build applications using various types of Inheritance and Interfaces
CO3: Explain the concepts of exception handling and multithreading to develop an application or program.

CO4: Apply the concepts of data abstraction, encapsulation and polymorphism for problem solving. CO5: Develop solutions to a given problems using collections, files and streams.

2. Paul Deitel and Harvey Deitel, ―”Java How to Program (Early Objects)”, Tenth Edition, Pearson Prentice Hall 2014.

3.Timothy Budd, ―”An Introduction to Object-Oriented Programming”, Third Edition, Pearson Education, 2008.

2.Program for User Defined Exception Handling.

3.Program for Method Overloading and Method Overriding a)Use the concept of Packages and Interfaces 4.Thread Creation
a)Using Thread Class and Runnable Interface b)Inter Thread Communication
5.Program using inbuilt methods of String class.

ONLINE COURSES AND VIDEO LECTURES

Pre-requisite: NIL

THEORY COMPONENT CONTENTS
BASIC STRUCTURE OF COMPUTERS 7 Hours Functional Units - Basic Operational Concepts - Bus Structures - Software Performance - Memory Locations and Addresses - Memory Operations - Instruction and Instruction Sequencing - Addressing Modes - Assembly Language - Basic I/O Operations - Stacks and Queues.

CO1 Understand the functional components of DBMS and Relational Model. CO2 Devise queries using SQL to develop database application
CO3 Describe the database design approaches.

CO4 Understand data storage and retrieval techniques.

Relational Databases: Relational model, Database schema, Keys, Formal Relational Query Languages

Accessing Databases from Programs using JDBC, Building Web Applications using PHP &MySQL.

Case Study: Open Source Relational DBMS

Transactions: Concept and purpose, ACID properties and their necessity, transactions in SQL .Transaction Schedules: Conflicts and Aborts, Serializability, Recoverability. Concurrency Control: lock-based protocols, 2-phase locking, Timestamp based protocols. Deadlock handling

McGraw-Hill.2016.

2.R. Elmasri and S. Navathe, “Fundamentals of Database Systems”, Sixth Edition, Pearson Education,

OTHER REFERENCES

1.https://onlinecourses.nptel.ac.in/noc17_cs33/course
2.http://www.db-book.com
3.http://nptel.ac.in/courses/IIT-MADRAS/Intro_to_Database_Systems_Design 4.http://www.iitg.ernet.in/awekar/teaching/cs344fall11/
5.www.w3schools.com/sql/

LIST OF EXPERIMENTS: (Open Source RDBMS-MYSQL/POSTGRES)

1. Creation of a database and writing SQL queries to retrieve information from the database.

AFTER SUCCESSFUL COMPLETION OF THIS COURSE, THE STUDENTS SHOULD BE ABLE TO: CO1: Identify a practical problems and find a solution
CO2: Understand the project management techniques
CO3: Demonstrate their technical report writing and presentation skills

Pre-requisite: NIL

2.Multi-disciplinary/ Multi-focus group of 5-6 students.

3.Groups can select to work on a specific tasks, or projects related to real world problems.