74 - B.SC Syllabus..
74 - B.SC Syllabus..
74 - B.SC Syllabus..
WARANGAL-506009
Under the
1. Each of first four Semesters (i.e. I, II III and IV) contains one theory core
paper (20 marks for Internal Assessment and 80 marks for Semester End
Exam equivalent to 4 credits) as Discipline Specific Course (DSC) and
one practical paper (50 marks equivalent to 02 credits), whereas each of
last two semesters (i.e. V and VI) contains one theory core paper as DSC
(15 marks for Internal Assessment and 60 marks for Semester End Exam
equivalent to 3 credits), one theory elective paper as Discipline Specific
Elective (DSE) (15 marks for Internal Assessment and 60 marks for
Semester End Exam equivalent to 3 credits) and two practical papers (25
marks in each paper equivalent to 01 credit). For total six semesters in
Computer Science courses, the total marks are 1000 and credits are 40
for each.
2. Internal Assessment examination will be conducted twice in every
Semester. Marks will be awarded from the average of the two Internal
Assessment Exams in each Semester.
3. Scheme for CBCS, work-load for each paper, distribution of marks and
credits; and scheme of question paper are attached herewith.
4. The syllabi of B.Sc. (Computer Science) theory and practical papers of I,
II, III, IV, V and VI semesters are enclosed.
5. The practical examination will be conducted at the end of each semester.
A minimum of 40% marks should be obtained by the student to pass the
practical examinations in all semesters.
6. All the theory papers and practical papers of B.Sc. (Computer Science) in
I, II, III and IV semesters are common to all students. But, elective theory
(DSE) papers of B.Sc. (Computer Science) in V and VI Semesters are to
be chosen by the student from the available options.
7. Elective (DSE) papers of B.Sc. (Computer Science) enclosed here with.
Every student has to choose one elective from the Electives being offered.
B.Sc. (Computer Science)
CBCS pattern in Semester System (w. e. from 2016-2017)
Max. Marks
Semes Course No. of Total
Code Title of the Paper HPW End
ter category Credits I.A Total Marks
Exam
FIRST YEAR
DSC-1A
4 4 20 80 100
(Theory) Object Oriented
BS106 I 125
DSC-1A Programming with C++
1 2 - 25 25
(Practical)
DSC-1B
4 4 20 80 100
(Theory) Data Structures and File
BS206 II 125
DSC-1B Processing
1 2 - 25 25
(Practical)
SECOND YEAR
DSC-1C
4 4 20 80 100
(Theory) Database Management
BS306 III 125
System
DSC-1C
1 2 - 25 25
(Practical)
DSC-1D
4 4 20 80 100
(Theory) Design and Analysis of
BS406 IV 125
Algorithms
DSC-1D
1 2 - 25 25
(Practical)
THRID YEAR
DSC-1E
3 3 15 60 75
(Theory)
BS505 Web programming 100
DSC-1E
1 2 - 25 25
(Practical)
V
DSC-1E Elective 1 (A/B/C)
3 3 15 60 75
(Theory) A) Operating Systems
BS508 100
DSC-1E B) Data Mining
C) Cryptography 1 2 - 25 25
(Practical)
DSC-1F
3 3 15 60 75
(Theory)
BS605 Visual Programming 100
DSC-1F
1 2 - 25 25
(Practical)
VI
DSC-1F Elective 2 (A/B/C)
A) Multimedia Systems & 3 3 15 60 75
(Theory)
BS608 Applications 100
DSC-1F B) Computer Graphics
C) Computer Networks 1 2 - 25 25
(Practical)
Unit I
Basics of C++ Programming: Introduction, History, Structure, Writing the First C++
Program, Files used in a C++ Program, Compiling and Executing, Using Comments,
Tokens, Characters Set, Keywords, Identifier, Data Types, Variables, Constants, Input
and Output, Statements , Operators, Type Conversion and Type Casting,
Unit II
Unit III
Unit IV
Text Book:
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1) Write a program to test Arithmetic operators.
2 3
4 5 6
7 8 9 10
25) Write a c++ program for Member Function overloading within a class
Unit I
Unit II
Linked Lists: Introduction, Linked List, Linked List Abstract Data Type,
Linked List Variants, Doubly Linked List, Circular Linked List,
Representation of Sparse Matrix Using Linked List, Linked Stack, Linked
Queue, Generalized Linked List, More on Linked Lists.
Unit III
Trees: Introduction, Types of Trees, Binary Tree, Binary Tree Abstract Data
Type, Realization of a Binary Tree, Insertion of a Node in Binary Tree, Binary
Tree Traversal, Other Tree Operations, Binary Search Tree, Threaded
Binary Tree, Applications of Binary Trees.
Text books:
Recommended Books
3. Robert L. Kruse and A.J. Ryba, Data Structures and Program Design in
C++, Prentice Hall, Inc., NJ, 1998.
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Write C++ programs to implement the following using an array
a) Stack ADT
b) Queue ADT
3. Write C++ programs to implement the following using a single linked list.
a) Stack ADT
b) Queue ADT
4. Write a C++ program to implement Circular queue using Single linked list.
5. Write a C++ program to implement the double ended queue ADT using
double linked list.
b)In-order
c)Post-order
13. Write C++ programs to perform the following operations on B-Trees and
AVL Trees.
a)Insertion
b)Deletion
14 Write C++ programs for sorting a given list of elements in ascending order
using the following sorting methods.
a)Quick sort
b)Merge sort
16. Write a C++ program that uses dynamic programming algorithm to solve
the optimal binary search tree problem
a)Build Heap
b)Insertion
c)Deletion
a)Insertion
b)Deletion
Unit I
Unit II
Database Design and the E-R Model: Overview of the Design Process, The
Entity-Relationship Model, Constraints, Removing Redundant Attributes in
Entity Sets, Entity-Relationship Diagrams, Reduction to Relational
Schemas, Entity-Relationship Design Issues, Extended E-R Features,
Alternative Notations for Modeling Data, Other Aspects of Database Design.
Unit III
Unit IV
References:
2. Loney and Koch, Oracle 10g: The Complete Reference, Tata McGraw Hill,
2006.
3. David Flanagan, Java Script, The Definitive Guide, O’Reilly Media, 2006.
4. Marty Hall, Larry Brown, and Yaakov Chaikin, Core Servlets and Java
Server Pages: Core Technologies (Vol. II), 2nd Ed., Sun Microsystems
Press, 2006.
3. Create the following tables and answer the queries given below:
Customer (CustID, email, Name, Phone, ReferrerID)
Bicycle (BicycleID, DatePurchased, Color, CustID, ModelNo)
BicycleModel (ModelNo, Manufacturer, Style)
Service (StartDate, BicycleID, EndDate)
a) Identify primary and foreign keys. Create the tables and insert at least 5
records in each table.
b) List all the customers who have the bicycles manufactured by manufacturer
“Honda”.
c) List the bicycles purchased by the customers who have been referred by
customer “C1”.
d) List the manufacturer of red colored bicycles.
e) List the models of the bicycles given for service.
4. Create the following tables, enter at least 5 records in each table and answer
the queries given below.
5. Create the following tables, enter at least 5 records in each table and answer
the queries given below.
Unit I
Unit II
Polynomials and the FFT: Representing polynomials, The DFT and FFT,
Efficient FFT implementations.
Unit III
Unit IV
Text book:
References:
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
Sorting Algorithm:
Dynamic Algorithm:
Dynamic Programming:
Graphs:
Spanning Trees:
Unit – I
HTML- Basic HML, The document body, Text, Hyperlinks, Adding More
Formatting, Lists, Using Color and Images, Images, Tables, Frames, Forms-
Toward Interactivity . Cascading Stylesheets - Introduction, Inline Styles,
Embedded Style Sheets, Linking external sheets, Backgrounds, text flow and
box model.
Unit - II
Unit - III
Text Book:
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
Practical exercises based on concepts listed in theory using HTML.
4. Create Form with Input Type, Select and Text Area in HTML.
About department
Department1 This frame would show the
Department1 contents according to the link
Department1 clicked by the user on the left
Frame.
7. Create an HTML document containing horizontal frames as follows:
Department Names (could be along with Logos)
rame1
ame2
Frame1
Frame 2 Frame 3
10. Create a form using HTML which has the following types of
controls:
I. Text Box
II. Option/radio buttons
III. Check boxes
IV. Reset and Submit buttons
11. Create a student Bio-Data, using forms.
i. Inline style sheets. ii. Embedded style sheets. iii. External style sheets
13. Create a web page using “class” style sheets with different “border-
width” property values like thick, medium, thin, grove, inset, and outset,
red & blue.
JavaScript:
1. Print a table of numbers from 5 to 15 and their squares and cubes using
alert.
4. Enter a list of positive numbers terminated by Zero. Find the sum and
average of these numbers.
7. Write a JavaScript program to accept two values from form and apply
any 5 mathematical functions.
8. Display the current date and time in both GMT and local form.
Unit – I
Unit – II
Problem Solving and Control Statements: Introduction, For ... Next Repetition
Statement, Examples Using the For ... Next Statement, Nested Repetition Statements,
Select ... Case Multiple-Selection Statement, Do ... Loop While and Do ... Loop Until
Repetition Statements, Using Exit to Terminate Repetition Statements, Using Continue
in Repetition Statements, Logical Operators,
Arrays: Introduction, Arrays, Declaring and Allocating Arrays, Initializing the Values in
an Array, Summing the Elements of an Array, Passing an Array to a Method, For Each
... Next Repetition Statement, Rectangular Arrays, Resizing an Array with the ReDim
Statement.
Unit – III
Text Books:
1. Paul Detel, Harvey Detel, Abbey Detel - Visual Basic 2012: How to Program
Sixth Edition, 2014.
Practical: Visual Basic Programming
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Print a table of numbers from 5 to 15 and their squares and Cubes.
4. Enter a list of positive numbers terminated by zero. Find the sum and
average of these numbers.
8. Read a single dimension array. Find the sum and average of these
numbers.
10. Create a database Employee and Make a form to allow data entry
to Employee Form with the following command buttons:
Employee Form
Employee Name:
Employee Id:
Date of Joining:
Designation:
Department:
Address:
Basic Pay:
Unit I
Unit II
Unit III
Text book:
1. A.S. Tanenbaum, and Herbert Bos, “Modern Operating Systems”, 4th Ed.,
Prentice-Hall of India, 2015.
Recommended Books
1. William Stallings, Operating Systems: Internals and Design Principles, 5th
Ed., Prentice-Hall of India, 2006.
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Simulate the following CPU Scheduling algorithms a) Round Robin b)
SJF c) FCFS d) Priority
2. Simulate all file allocation strategies. a) Sequential b) Indexed c) Linked
3. Simulate MVT and MFT
4. Simulate all File organization techniques. a) Single level directory b) Two
level c) Hierarchical d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance 6. Simulate
Bankers Algorithm Dead Lock Prevention.
6. Simulate all Page replacement algorithms. a) FIFO b) LRU c) LFU d)
Etc….
7. Simulate Paging Techniques of memory management.
Elective1.B: Data mining
Unit I
Data Mining and Knowledge Discovery Process: data mining, Data Mining Differ
from Other Approaches - The Knowledge Discovery Process-Introduction,
Knowledge Discovery Process, Knowledge Discovery Process Models.
Unit II
Unit III
Data Security, Privacy and Data Mining: Privacy in Data Mining, Privacy Versus
Levels of Information Granularity, Distributed Data Mining, Collaborative
Clustering.
Text Books:
References:
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Demonstration of preprocessing on dataset student.arff
Unit I
Unit II
Unit III
Text book:
Book Recommended
2. M.Y. Rhee, Network Security, John Wiley and Sons, NY, 2002.
Practical: Cryptography
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Study various cryptography techniques.
2. Implement the Pure Transposition Cipher
3. Implement Additive cipher
4. Implement DES Encryption and Decryption
5. implement double transposition cipher
6. Implement RSA Encryption Algorithm
7. Implement RSA algorithm to achieve confidentiality
8. Implement RSA algorithm to create Digital Signatures
9. Implementation of Hash Functions
10. Implement Diffie Hellman Key Exchange.
Elective2.A: Multimedia Systems and Applications
Unit I
Text: Meaning, Fonts and Faces, Using Text in Multimedia, Computers and
Text, Font Editing and Design Tools, Hypermedia and Hypertext.
Sound: The Power of Sound, Digital Audio, MIDI Audio, MIDI vs. Digital
Audio, Multimedia System Sounds, Audio File Formats. Adding Sound to
Your Multimedia Project.
Unit II
Video: Using Video, How Video Works and Is Displayed, Digital Video
Containers, Obtaining Video Clips, Shooting and Editing Video.
Unit III
Designing for the World Wide Web: Developing for the Web, Text for the
Web, Images for the Web, Sound for the Web, Animation for the Web, Video
for the Web.
Text book:
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
Practical exercises based on concepts listed in theory using Presentation tools
in office automation tool/ GIMP/Blender / Audacity/ Animation Tools/ Image
Editors/ Video Editors.
1. Create an animation using the tools panel and the properties panel to
draw the following – Line, pe , oval, circle, rectangle , square, pencil ,
brush , lasso tool
2. Create an animation using text tool to set the font , size , color etc.
Move Objects
Skew Objects
Stretch Objects
Rotate Objects
Hand tool
Zoom tool
Eyedropper tool
6. Create an animation for bus car race in which both starts from the
same point and car wins the race.
9. Create an scene to show the sunrise (using multiple layers and motion
tweening)
11. Create an animation (using Shape tweening and shape hints) for
transforming one shape into another.
12. Create an animation for bouncing ball (you may use motion guide
layer).
Elective2.B: Computer Graphics
Unit I
Unit II
Unit III
Text Book:
References:
1. J.D. Foley, A van Dam, S.K. Feiner and J.F. Hughes, Computer Graphics:
Principals and Practices, 2nd Ed., Addison-Wesley, MA, 1990.
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
1. Program to recursively subdivide a tetrahedron to from 3D Sierpinski
gasket. The number of recursive steps is to be specified by the user.
4. Program to create a house like figure and rotate it about a given fixed
point using OpenGL functions.
8. Program to draw a color cube and allow the user to move the camera
suitably to experiment with perspective viewing. Use OpenGL functions.
9. Program to fill any given polygon using scan-line area filling algorithm.
(Use appropriate data structures.)
Unit I
Introduction: data communication- components, Networks, Protocols and
Standards, Line configuration, topology, transmission mode, categories of
networks.
OSI and TCP/IP Models: Layers and their functions, comparison of models.
Unit II
Error Detection and Correction: Types of Errors, Detection, Vertical
Redundancy Check (VRC), Longitudinal Redundancy Check (LRC), Cyclic
Redundancy Check (CRC), Checksum, Error Correction.
Data Link Control: Line Discipline, Flow Control, Error Control, Asynchronous
Protocols, Synchronous Protocols, Character-Oriented Protocols, Bit-Oriented
Protocols, Link Access Procedures
Switching: Circuit Switching, Packet Switching, Message Switching.
Unit III
Transport Layer: Duties of the Transport Layer, Connection, the OSI Transport
Protocol.
Upper OSI Layers: Session Layer, Presentation Layer, Application Layer.
TCP/IP Protocol Suite: Overview of TCP/IP, Network Layer, Addressing,
Subnetting, Other Protocols In The Network Layer, Transport Layer
Text Book:
Books Recommended
NOTE:
All the concepts of programs from Text Book including exercises must
be practice, execute and write down in the practical record book.
Faculty must take care about UG standard programs it should be
minimum 25 – 30.
In the external lab examination student has to execute at least three
programs with compilation and deployment steps are necessary.
External Viva-voce is compulsory.
Example programs:
Simulation Exercises: The following experiments shall be conducted
using either NS3/OPNET or any other simulators.