CS/IT 223 Electronic Devices & Circuits 4+1 - 30 70 100 CS/IT 224 Computer Organization 4+1 - 30 70 100 CS/IT 225 Microprocessors & Microcontrollers 4+1 - 30 70 100 CS/IT 226 Operating Systems 4 - 30 70 100 CS/IT 261 EDC Lab - 3 25 50 75 CS/IT 262 Microprocessors & Microcontrollers Lab - 3 25 50 75 CS/IT 263 Soft Skills Lab - 3 25 50 75 TOTAL 24+3 9 255 570 825 : NAGARJUNA SCHEME FOR COMPUTER SCIENCE & ENGINEERING w.e.f 2007-2008 (Semester System) III / IV B.Tech., (COMPUTER SCIENCE & ENGINEERING) (SEMESTER – I) Code No. Subject Periods per week Maximum Marks Total Marks L/T D/P Sessional University CS/IT 311 Professional Ethics & Human Values 4 - 30 70 100 CS/IT 312 Data Communications 4 - 30 70 100 CS/IT 313 Automata Theory & Formal Languages 4 - 30 70 100 CS/IT 314 Java Programming 4+1 - 30 70 100 CS/IT 315 Database Management Systems 4+1 - 30 70 100 CS 316 Advanced Unix Programming 4+1 - 30 70 100 CS/IT 351 Java Programming Lab - 3 25 50 75 CS/IT 352 RDBMS Lab - 3 25 50 75
TESTING TACTICS: Software Testing Fundamentals, and White-Box Testing, White-Box Testing, Basis Path Testing, Control Structure Testing, Black-Box Testing, Object-Oriented Testing Methods, Testing for Specialized Environments, Architectures, and Applications, Testing patterns PRODUCT METRICS: Software Quality, A Framework for Product Metrics, Metrics for the Analysis Metrics for the Design Model, Metrics for Source Code, Metrics for Testing, Metrics for Maintenance. Textbooks: Roger S.Pressman, 'Software Engineering- A Practitioner's Approach', Sixth Edition, McGraw- Hill International. Reference Books: Ian Sommerville, 'Software Engineering', Sixth Edition, Pearson Education. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, 'Fundamentals of Software Engineering', Second Edition, PHI. RajibMall, 'Fundamentals of Software Engineering', Second Edition, PHI. CS 325 DESIGN AND ANALYSIS OF ALGORITHMS Lectures : 4 periods/week, Tutorial: 1 Sessional Marks : 30 University Exam : 3 University Examination : 70 UNIT – I Introduction: Algorithm Design paradigms – motivation, concept of algorithmic efficiency, run time analysis of algorithms, Asymptotic Notations. Divide and Conquer: Structure of divide and conquer algorithms: examples, quick sort, Strassen Multiplication; Analysis of divide and conquer run time recurrence relations. UNIT – II Greedy Programming: Overview of the greedy paradigm examples of optimization solution, Approximate solution (Knapsack problem) Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra’s Algorithm – Minimum Spanning Tree – Prim’s and Kruskal’s algorithms. Dynamic Programming: Overview, difference between dynamic programming and divide and conquer, Applications: Shortest path in graph, Matrix multiplication, Traveling Salesman Problem, longest Common sequence. UNIT – III Graph Searching and Traversal: Overview, Traversal methods (depth first and breadth first search), Applications of DFS – connected components, Bi-connected components. Back tracking: Overview, problem and Knapsack problem. UNIT – IV Branch and Bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Travelling Salesman Problem. Computational Complexity: Complexity measures, Polynomical Vs Non-polynomial time complexity; NP-hard and NP-complete classes, examples.
Lectures : 4 periods/week Sessional Marks : 30 University Exam : 3 hours University Examination Marks : 70 UNIT – I (12 Introduction – Applications – A Short History of Wireless Communications – A Market for Communications – A Simplified Reference Model. Wireless Transmission – Frequencies – Signals – Antennas – Signal Propagation – Multiplexing – Modulation – Spread Spectrum. Medium Access Control – Motivation for a Specialized MAC – SDMA – FDMA – TDMA – CDMA – Comparison. UNIT – II (18 Hours) Telecommunication Systems – GSM, DECT, TETRA, UMTS and IMT-2000 Satellite Systems – History, Applications, Basics (GEO, LEO, MEO), Routing, Localization, Handover. Broadcast Systems – Overview, Cyclic Repetition of Data, Digital Broadcasting – Digital Video Broadcasting. UNIT – III (15 Hours) Wireless LAN – Infrared Vs. Radio Transmission – Infrastructure and Ad Hoc Networks – IEEE 802.11 – HIPERLAN – Bluetooth. Mobile Network Layer –Mobile IP – Dynamic Host Configuration – Ad Hoc Networks. UNIT – IV (15 Hours) Mobile Transport Layer – Traditional TCP – Indirect TCP – Snooping TCP – Mobile TCP – Fast Retransmit / Fast Recovery – Transmission / Time-Out Freezing – Selective Retransmission – Transaction Oriented TCP. Wireless Application Protocol – Architecture – Wireless Datagram Protocol – Wireless Transport Layer Security – Wireless Transaction Protocol – Wireless Session protocol – Wireless Application Environment – Wireless Markup Language – WML Script – Wireless Telephony Application – Example Stacks with WAP. Textbooks: 1. J.Schiller, “Mobile communications”, Addison-Wesley, 2003 Reference Books: William Stallings, “Wireless Communication Networks”, UWE Hansmann, Lother Merk, Martin S.Nicklous, Thomas Stober, “Principles of Computing”, 2nd Edition. CS 412 DISRIBUTED SYSTEMS Lectures : 4 periods/week Sessional Marks : 30 University Exam : 3 hours University Examination Marks : 70 UNIT- I (12 Hours)
1. D.A. Patterson and J.L.Hennessey, "Computer organization and Design", Morgan Kaufmann, 2nd Edition. V.Rajaram & C.S.R.Murthy, "Parallel Computer", PHI. Wilkinson and Michael Allen, “Parallel Programming” Pearson Education. CS/IT 423 DATA ENGINEERING Lectures : 4 periods/week, Tutorial: 1 Sessional Marks : 30 University Exam : 3 University Examination Marks : 70 UNIT – I (18 Periods) Data Warehouse – Introduction, A Multi-dimensional data model, Data Warehouse Architecture, Data Warehouse Implementation. Data Mining – Introduction, Data Mining, Kinds of Data, Data Mining Functionalities, Classification of Data Mining Systems, Major issues in Data Mining. UNIT – II (18 Periods) Data Preprocessing – Data cleaning, Data Integration & Transformation, Data Reduction, Discretization & Concept Hierarchy Generation, Data Mining Primitives. Mining Association roles in large databases – Association rule mining, mining Boolean Association rules from Transactional Databases, Mining Multi-dimensional Association rules from relational databases & Data Warehouses. UNIT – III (15 Periods) Cluster Analysis – Introduction, of data in Cluster analysis, A categorization of major clustering methods, partitioning methods, Hierarchical methods, Density-Based Methods: DBSCAN, Grid-based Method: STING; Model-based Clustering Method: Statistical approach, Outlier analysis. UNIT – IV (20 Periods) Classification & Prediction – Introduction, Classification by Decision tree induction, Bayesian Classification, , Classification by Back propagation, Other Classification Methods, Prediction, Classifier accuracy. Mining Complex Type of Data – Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining Text Databases, Mining the World Wide Web. Textbooks: Data Mining Concepts & Techniques – Jiawei Han Micheline Kamber – Morgan Kaufmann Publishers. Reference Books: Data Warehouse Toolkit – Ralph Kinball – John Wiley Publishers. Data Mining (Introductory and Advanced Topics) – Margaret H.Dunham – Pearson Education. Data Warehousing in the real world – A Practical guide for Building decision support systems – Sam Anahory, Dennis Murray – Pearson Education. Introduction to Data Mining with case studies – G.K.Gupta, PHI Publications, 2006 CS/IT 424 INDUSTRIAL ENGINEERING & MANAGEMENT