Andhra Pradesh State Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus UNIT IV Pointers: Understanding Computer Memory – Introduction to Pointers – declaring Pointer Variables – Pointer Expressions and Pointer Arithmetic – Null Pointers – Generic Pointers - Passing Arguments to Functions using Pointer – Pointer and Arrays – Passing Array to Function – Difference between Array Name and Pointer – Pointers and Strings – Array of pointers – Pointer and 2D Arrays – Pointer and 3D Arrays – Function Pointers – Array 0f Function Pointer – Pointers to Pointers – Memory Allocation in C Programs – Memory Usage – Dynamic Memory Allocation – Drawbacks of Pointers Structure, Union, and Enumerated Data Types: Introduction – Nested Structures – Arrays of Structures – Structures and Functions – Self referential Structures – Union – Arrays of Unions Variables – Unions inside Structures – Enumerated Data Types UNIT V Files: Introduction to Files – Using Files in C – Reading Data from Files – Writing Data from Files – Detecting the End-of-file – Error Handling during File Operations – Accepting Command Line Arguments – Functions for Selecting a Record Randomly - Remove() – Renaming a File – Creating a Temporary File REFERENCE BOOKS Introduction to C programming by THAREJA from OXFORD UNIVERSITY PRESS E Balagurusamy: ―COMPUTING FUNDAMENTALS & C PROGRAMMING – Tata McGraw-Hill, Second Reprint 2008, ISBN 978-0-07-066909-3. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Edition Publ, 2002. Henry Mullish & Huubert L.Cooper: The Spirit of C An Introduction to modern Programming, Jaico Pub. House,1996. Student Activity: Write a program for preparing the attendance particulars of students of your college at the end of semester according to following guidelines Above 75 % promoted Above 65% condoned Below 65% detained a program for creating timetable or your class taking work load of faculty into consideration. Page 5 of 50
Andhra Pradesh Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus II YEAR IV SEMESTER Paper-IV : DATA STRUCTURES Course Objectives To introduce the fundamental concept of data structures and to emphasize the importance of data structures in developing and implementing efficient algorithms.. Course Outcomes Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented in memory and used by algorithms Describe common applications for arrays, records, linked structures, stacks, queues, and graphs. programs that use arrays, records, linked structures, stacks, queues, trees, and graphs Demonstrate different methods for traversing trees Compare alternative implementations of data structures with respect to performance Compare and contrast the benefits of dynamic and static data structures implementations Describe the concept of recursion, give examples of its use, describe how it can be implemented a stack . Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing. UNIT I Concept of Abstract Data Types (ADTs)- Data Types, Data Structures, Storage Structures, and File Structures, Primitive and Non-primitive Data Structures, Linear and Non-linear Data Structures. Linear Lists – ADT, Array and Linked representations, Pointers. Arrays – ADT, Mappings, Representations, Sparse Matrices, Sets – ADT, Operations Linked Lists: Single Linked List, Double Linked List, Circular Linked List , applications UNIT II Stacks: Definition, ADT, and Linked representations, Implementations and Applications Queues: Definition, ADT, Array and Linked representations, Circular Queues, Dequeues, Priority Queues, Implementations and Applications. UNIT III Trees: Binary Tree, Definition, Properties, ADT, Array and Linked representations, Implementations and Applications. Binary Search Trees (BST) – Definition, ADT, Operations and Implementations, BST Applications. Threaded Binary Trees, Heap trees. Page 10 of 50
Andhra Pradesh State Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus UNIT – IV: The Transport Layer: The Transport Service, Elements of Transport Protocols, Congestion Control Algorithms, The Internet Transport Protocols, The Internet Transport Protocols: TCP, Delay Tolerant Networks. UNIT – V: The Application Layer: DNS – The Domain Name System, Electronic Mail, The World Wide Web, Real Time Audio & Video, Content Delivery & Peer-to-Peer. Reference Andrew S. Tanenbaum, “Computer Networks”, Fifth Edition, Pearson Education. Bhushan Trivedi, Computer Networks , Oxford University Press James F.Kurose, Keith W.Ross, “Computer Networking”, Third Edition, Pearson Education Behrouz A Forouzan, “Data Communications and Networking”, Fourth Edition, TMH (2007). Kurose & Ross, “COMPUTER NETWORKS” – A Top-down approach featuring the Internet”, Pearson Education – Alberto Leon – Garciak. Student Activity: Study the functioning of network devices available in your organization . Prepare a pictorial chart of LAN connections in your organization Page 24 of 50
Andhra Pradesh State Council of Higher Education B.Sc. Computer Science/Information Technology (IT) Syllabus CBCS w.e.f.2015-2016 (Modified in April 2016) Structure of Computer Science/Information Technology (IT) Syllabus III YEAR VI SEMESTER (Cluster 1) Paper-VIII : Elective –A-2 BIG DATA TECHNOLOGY Course Objective The Objective of this course is to provide practical foundation level training that enables immediate and effective participation in big data projects. The course provides grounding in basic and advanced methods to big data technology and tools, including MapReduce and Hadoop and its ecosystem. Course Outcome Learn tips and tricks for Big Data use cases and solutions. to build and maintain reliable, scalable, distributed systems with Apache Hadoop. Able to apply Hadoop ecosystem components. UNIT I INTRODUCTION TO BIG DATA:Introduction – distributed file system – Big Data and its importance, Four V’s in bigdata, Drivers for Big data, Big data analytics, Big data applications. Algorithms map reduce, Matrix-Vector Multiplication by Map Reduce. UNIT II INTRODUCTION HADOOP : Big Data – Apache Hadoop & Hadoop EcoSystem – Moving Data in and out of Hadoop – Understanding inputs and outputs of MapReduce - Data Serialization. UNIT- III HADOOP ARCHITECTURE: Hadoop Architecture, Hadoop Storage: HDFS, Common Hadoop Shell commands , Anatomy of File Write and Read., NameNode, Secondary NameNode, and DataNode, Hadoop MapReduce paradigm, Map and Reduce tasks, Job, Tasktrackers - Cluster Setup – SSH & Hadoop Configuration – HDFS Administering – Monitoring & Maintenance. Page 34 of 50