Code Name a b c d e f g h i j K CS121 / MA02 Mathematics – II CS122 / PH02 Engineering Physics – II CS123 / CY02 Engineering Chemistry – II CS/IT 124 Digital Logic Design CS125 / BT01 Environmental Studies CS126 / ME01 Engineering Graphics CS161 / PHCYL01 Physics & Chemistry Lab – II CS162 / ENL01 English Language Lab CS163 / MEL01 Workshop BAPATLA ENGINEERING COLLEGE : BAPATLA (Autonomous) SCHEME OF INSTRUCTION & EXAMINATION FOR COMPUTER SCIENCE & ENGINEERING w.e.f 2010-2011 (Semester System) II/IV B.Tech., SEMESTER I Code No. Subject Scheme of Instruction (Periods per week) Scheme of Examination (Maximum marks) No. of Credits Theory Tutorial Lab CA FE Total Marks CS 211/ MA03 Mathematics – III 4 - - 40 60 100 4 CS/IT212 Computer Organization 3 1 - 40 60 100 3 CS/IT213 Computer Graphics 3 1 - 40 60 100 3 CS/IT214 Object Oriented Programming 4 1 - 40 60 100 4
COMPUTER SCIENCE & ENGINEERING II/IV B.Tech., SEMESTER II Mapping of Course Objectives to Program Outcomes II/IV B.Tech., SEMESTER II Subject Program Outcomes Code Name a b c d e f g h i j k CS221/ MA05 Probability & Statistics CS222/ EC01 Electronic Devices & Circuits CS223/ EE04 Electrical Technology CS/IT224 GUI Programming CS/IT225 System Software CS/IT226 Microprocessors & Microcontrollers CS/IT261 EDC Lab CS/IT262 Microprocessors & Microcontrollers Lab CS/IT263 GUI Programming Lab BAPATLA ENGINEERING COLLEGE : BAPATLA (Autonomous) SCHEME OF INSTRUCTION & EXAMINATION FOR COMPUTER SCIENCE & ENGINEERING w.e.f 2010-2011 (Semester System) III/IV B.Tech., SEMESTER I Code No. Subject Scheme of Instruction (Periods per week) Scheme of Examination (Maximum marks) No. of Credits Theory Tutorial Lab CA FE Total Marks
CS/IT 311 Professional Ethics & Human Values 3 1 - 40 60 100 3 CS/IT 312 Data Communications 3 1 - 40 60 100 3 CS/IT 313 Automata Theory & Formal Languages 3 1 - 40 60 100 3 CS/IT 314 Operating Systems 4 1 - 40 60 100 4 CS/IT 315 Database Management Systems 4 1 - 40 60 100 4 CS/IT 316 Web Technologies 4 1 - 40 60 100 4 CS/IT 351/ ENL02 Soft Skills Lab - - 3 40 60 100 2 CS/IT 352 RDBMS Lab - - 3 40 60 100 2 CS/IT 353 Web Technologies Lab - - 3 40 60 100 2 TOTAL 21 6 9 360 540 900 27 CA: Continuous Assessment FE: Final Examination BAPATLA ENGINEERING COLLEGE : BAPATLA (Autonomous) SCHEME OF INSTRUCTION & EXAMINATION FOR COMPUTER SCIENCE & ENGINEERING III/IV B.Tech., SEMESTER I Mapping of Course Objectives to Program Outcomes III/IV B.Tech., SEMESTER I Subject Program Outcomes Code Name a b c d e f g h i j k CS/IT 311 Professional Ethics & Human Values CS/IT 312 Data Communications CS/IT 313 Automata Theory &
(A) Bioinformatics (B) Digital Image Processing (C) Open Source Systems (D) Soft Computing (E) .Net Technologies CS/IT 361 UNIX Programming Lab CS/IT 362 Enterprise Programming Lab CS/IT 363 Elective – I Lab BAPATLA ENGINEERING COLLEGE : BAPATLA (Autonomous) SCHEME OF INSTRUCTION & EXAMINATION FOR COMPUTER SCIENCE & ENGINEERING w.e.f 2010-2011 (Semester System) IV/IV B.Tech., SEMESTER I Code No. Subject Scheme of Instruction (Periods per week) Scheme of Examination (Maximum marks) No. of Credits Theory Tutorial Lab CA FE Total Marks CS/IT 411 Cryptography & Network Security 3 1 - 40 60 100 3 CS/IT 412 Distributed Systems 3 1 - 40 60 100 3 CS/IT 413 Object Oriented Analysis & Design 4 1 - 40 60 100 4 CS/IT 414 Design & Analysis of Algorithms 4 1 - 40 60 100 4 CS/IT 415 Elective – II 4 1 - 40 60 100 4
CS/IT 422 Data Engineering CS/IT 423 Elective – III (A) Real-Time Systems (B) Grid Computing (C) Wireless Networks (D) Biometrics (E) Network Management Systems CS/IT 424 Elective – IV (A) Advanced Computer Architecture (B) Natural Language Processing (C) Information Retrieval (D) Multimedia Systems (E) Software Testing Methodologies CS/IT 461 Project Work CS/IT 462 Data Engineering Lab MATHEMATICS – I (Common for all branches) CS111/ MA01 Lectures : 4 Periods/Week, Tutorial: 1 Continuous Assessment : 40 Final Exam : 3 hours Final Exam Marks : 60 Prerequisites: Elementary differential and integral calculus, Elementary Matrix algebra. Course Objectives: Upon completion of this course, students should be able to: Compute the rank and inverse of a matrix. Solve the system of the algebraic equations. Verify whether the given set of vectors form a vector space or not. Determine the dimension and basis of a vector space. Compute Eigen values and Eigen vectors of a given matrix. Understand the geometrical interpretation of mean value theorems. Compute the extreme values of a given function in two variables.
Demonstrate an ability to apply the knowledge of Mathematics, Computer Science and Engineering appropriate to the development of software systems to solve real world problems. Demonstrate an ability to analyze a problem and design a computing system or a component or a process confirming to standards using various methodologies and architectures. Be able to analyze and understand an existing software & hardware system and extend the system to meet evolving requirements. Demonstrate an ability to implement and test a computing system or a component or a process, to evaluate and compare efficiencies of alternative solutions. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools. Be able to interact professionally with peers and clients with diverse cultures and medium of communication located in geographically dispersed locations in the context of computing and software engineering. Have the knowledge of professional and ethical responsibilities in the corporate sector and be aware of contemporary issues. Demonstrate the ability to communicate effectively in both verbal and written form. Have an ability to analyze the social and human context of computing and be aware of contemporary issues. Recognize the need for continuing education, research and professional development. Possess the knowledge and skills for employability and to succeed in national and international level competitive examinations. PROBABILITY & STATISTICS CS221/ MA05 Lectures : 4 Periods/Week, Tutorial: 1 Continuous Assessment : 40
RELATIONSHIP OF COURSE OUTCOMES TO PROGRAM OUTCOMES FOR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING S.No Program Out Comes None Low High Demonstrate an ability to apply the knowledge of Mathematics, Computer Science and Engineering appropriate to the development of software systems to solve real world problems. Demonstrate an ability to analyze a problem and design a computing system or a component or a process confirming to standards using various methodologies and architectures. Be able to analyze and understand an existing software & hardware system and extend the system to meet evolving requirements. Demonstrate an ability to implement and test a computing system or a component or a process, to evaluate and compare efficiencies of alternative solutions. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools. Be able to interact professionally with peers and clients with diverse cultures and medium of communication located in geographically dispersed locations in the context of computing and software engineering. Have the knowledge of professional and ethical responsibilities in the corporate sector and be aware of contemporary issues. Demonstrate the ability to communicate effectively in both verbal and written form. Have an ability to analyze the social and human context of computing and be aware of contemporary issues. Recognize the need for continuing education, research and professional development. Possess the knowledge and skills for employability and to succeed in national and international level competitive examinations.
After the completion of this course the student will be able to Analyze the complexity of a given algorithm. Apply classical sorting, searching, optimization and graph algorithms. Compare, contrast, and choose appropriate algorithmic design techniques to present an algorithm that solves a given problem. Explain NP-Completeness and deal with NP-complete problems. Use different algorithm-design techniques, including, but not limited to, greedy, conquer, and dynamic programming techniques, to solve particular problems. Model real problems abstractly using the language of graphs and flows. Make intelligent decisions about alternative data structures and algorithmic techniques in the context of practical software problems, choosing from existing data structures and algorithms or designing your own when necessary. Course Syllabus: Implement Strassen’s Multiplication. Implement Dijkstra’s Algorithm. Implement Prim’s Algorithm. Implement Kruskal’s Algorithm. To determine Shortest Path in Multi-stage graph using Forward & Backward approach. Implement Traveling Salesman Problem using Dynamic Programming. Implement longest common sequence algorithm. Implement DFS traversal of a given graph. Find the strongly connected components of a graph. Find the articulation bi-connected components. Implement FIFO branch and bound algorithm for 0/1 Kanpsack problem. Implement LC branch and bound algorithm for Traveling Salesman problem.