B.Sc.

Computer Science
DISTRIBUTION OF DIFFERENT COURSES AND CREDITS IN VARIOUS SEMESTERS

Offered By:

Department of Computer Science

Faculty of Science
Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

1
Course Code: CSC 101
Course Title: Basics of Computer Science
Credits: 2

Unit Topic
KNOWING COMPUTER: What is Computer, Basic Applications of Computer,
I Components of Computer System, Concept of Hardware and Software (Application Software
Systems software), Concept of computing, data and information.

OPERATING COMPUTER USING GUI BASED OPERATING SYSTEM: Basics of

II Operating System, The User Interface (Task Bar, Icons, Menu, Running an Application), File
and Directory Management (Creating and renaming of files and directories), Operating
System Simple Setting (Changing System Date And Time, Changing Display Properties, To
Add Or Remove A Windows Component, Changing Mouse Properties).
III UNDERSTANDING WORD PROCESSING AND SPREAD SHEET: Word Processing
Basics, Opening and closing Documents, Text Creation and manipulation, Formatting the
Text, Elements of Electronic Spread Sheet, Manipulation of Cells

IV WWW AND WEB BROWSER: Internet, World Wide Web (WWW), Popular Web
Browsing Software, Search Engines, Understanding URL.

2
Course Code: CSC 102
Course Title: Problem Solving using Computer
Credits:4
Topic
Unit
Computer Fundamentals: Introduction to Computers: Characteristics of
I Computers, Uses of computers, Types and generations of Computers, Units of a
computer, CPU, ALU, memory hierarchy, registers, I/O devices. Concept of problem
solving, Problem definition, Program design, Debugging.
Techniques of Problem Solving: Flowcharting, decision table, algorithms, Structured
II programming concepts, Programming methodologies viz. top-down and bottom-up
programming.

Introduction to Programming: Compilation, Linking and Loading, Testing and

III Debugging, documentation. Character set, Variables, and Identifiers, Built-in Data Types.
Arithmetic operators and Expressions, Constants and .Literals.

IV Conditional Statements and Loops: Decision making within a program,

Conditions, Relational Operators. If- statements. If-else statement, Switch case
Statement. Loops: while loop, do- while, for loop, Nested loops.

Arrays, Functions, Structures and Pointers::One dimensional arrays: -Array

manipulation; Insertion. Deletion of an element from an array; Prototype of a function:
V formal parameter list; Return Type, Function call, Passing arguments to a Function: call by
reference. call by value. Structure variables, initialization, structure assignment, Address
operators, pointer type declaration, pointer assignment, pointer initialization, Arrays and
Pointers.

3
Course Code: CSC 103

Course Title: Software Lab

Credits:2

Sample Programs
1. Write a menu driven program to convert the given temperature from
Fahrenheit to Celsius and vice versa depending upon user’s choice.
2. WAP to calculate total marks, percentage and grade of a student. Marks
obtained in each of the three subjects are to be input by the user. Assign
grades according to the following criteria:
Grade A: Percentage>=80
Grade B: Percentage>=70 and <80
Grade C: Percentage>=60 and <70
Grade D: Percentage>=40 and <60
Grade E: Percentage<40
3. Write a menu-driven program, using user-defined functions to find
the area of rectangle, square, circle and triangle by accepting
suitable input parameters from user.
4. WAP to display the first n term so Fibonacci series.
5. WAP to find factorial of the given number.
6. WAP to find sum of the following series form terms: 1 – 2/2!+3/3!----------- n/n!
Similar programs like it.

4
Course Code: CSC 104

Course Title: Database Management System

Credits:4
Topic
Unit
Introduction: Database System Concepts, File system vs. database system, Database
system architecture, Data models and their types, Database scheme and instances, Data
I
independence, Database Languages and Interfaces.
Data Modeling Concepts
II ER model concepts: Notations for ER diagram, Extended E-R diagram, Extended E-R
model, E-R model design issues, constraints, and keys: Weak entity set strong entity
set, Relationship as of higher degree.
III Database Design
Functional dependencies, Normal forms, First, second, and third normal forms,
BCNF, Multi-value dependencies and Fourth Normal form, Join Dependencies and
Fifth Normal form.
Transaction, Query Processing and Concurrency Control
Transaction and system concepts: transaction states, ACID properties of transactions,
IV
concurrent execution schedules and Recoverability, Serializability of schedules. Query
Processing and Optimization: Measures of Query cost, Cost, Evaluation of expression.
Optimization: Transformation of relational expression, Choice of evaluation plan,
Concurrency Control Techniques: Two phase Locking Techniques for Concurrency
Control
Introduction to SQL
Basic Structure of SQL Query, Set operators, SELECT, UNION, INTERSECT, and
V EXCEPT, Nested queries, Aggregate function, Null values, Derived Relations,
Modification of the Database, Joined relations and up-dates in SQL.

5
Course Code: CSC 105

Course Title: Database Management Systems Lab

Credits:2

List of Experiments

1. Creation of data bases and execution of SQL queries.

2. Creation of Tables using MySQL: Data types, Creating Tables (along with Primary and Foreign
keys), Altering Tables and Dropping Tables.
3. Practicing DML commands-Insert, Select, Update, Delete.
4. Practicing Queries using ANY, ALL, IN, EXISTS, NOT, EXISTS, UNION, INTERSECT, and
CONSTRAINTS, etc.
5. Practice Queries using COUNT, SUM, AVG, MAX, MIN, GROUPBY, HAVING, VIEWS
Creation and Dropping.
6. Use of COMMIT, ROLL BACK and SAVE POINT.
7. Practicing on Triggers-creation of trigger, Insertion using trigger, Deletion using trigger, Updating
using trigger.
8. To remove the redundancies and anomalies in the above relational tables,
Normalize up to Third Normal Form.

6
Course Code: CSC 201

Course Title: Operating System

Credits: 4
Topic
Unit
Introduction
I Operating system and functions, Classification of Operating systems:
Batch,Interactive,Timesharing,RealTimeSystem,MultiprocessorSystems,Multiuser
Systems, Multithreaded Systems, Operating System
Structure,SystemComponents,OperatingSystemServices,Kernels,MonolithicandMicrokern
elSystems.
Process Management
II Process Concept, Process States, Process Synchronization, Critical Section, Mutual
Exclusion, Classical Synchronization Problems, Process Scheduling, Process States,
Process Transitions, Scheduling Algorithms Inter-process Communication, Threads
and their management, Security Issues.
CPU Scheduling
III Scheduling Concepts, Techniques of Scheduling, Preemptive and Non-Preemptive
Scheduling: First-Come-First-Serve, Shortest Request Next, Highest Response Ration
Next, Round Robin, Least Complete Next, Shortest Time to Go, Long, Medium, Short
Scheduling, Priority Scheduling. Deadlock: System model, Deadlock characterization,
Prevention, Avoidance and detection, Recovery from deadlock.
Memory Management and Disk Scheduling
IV Memory allocation, Relocation, Protection, Sharing, Paging, Segmentation,
Virtual Memory, Demand Paging, Page Replacement
Algorithms, Thrashing, Disk storage and disk scheduling, RAID.
V File System: File concept, File organization and access mechanism, File directories, and
File sharing, File system implementation issues, File system protection and security.

7
Course Code: CSC 202

Course Title: Operating Systems Lab

Credits:2

Lab on Operating Systems

Note: Following exercises can be performed using Linux or UNIX: Usage of following
commands:
ls, pwd, tty, cat, who, who am I, rm, mkdir, rmdir, touch, cd.Usage of following
commands:
cal, cat(append), cat(concatenate), mv ,cp, man, date.Usage of following
commands: chmod, grep, tput, (clear, highlight), bc. Write a shell script to check
if the number entered at the command line is prime or not.
1. Write a shell script to modify “cal” comm. And to
display calendar of the specified months.
2. Write a shell script to modify “cal” comm. and to
display calendar of the specified range of months.
3. Write a shell script to accept a login name. If not a valid
login name display message– “Entered login name is
invalid”.
4. Write a shell script to display date in the mm/dd/yy format.
5. Write a shell script to display on the screen sorted output of
“who” command along with the total number of users.
6. Write a shell script to display the multiplication table any number,
7. Write as hell script to compare two files and if found equal asks
the user to delete the duplicate file.
8. Write a shell script to check whether the file have all the permissions or not.
9. Simulate FCFS CPU scheduling algorithm.
10. Simulate SJF CPU scheduling algorithm.
11. Simulate Priority CPU scheduling algorithm.
12. Simulate Round Robin CPU scheduling algorithm.
13. Simulate FIFO page replacement algorithm.
14. Simulate LRU page replacement algorithm.

8
Course Code: CSC 203

Course Title: Computer System Architecture

Credits: 4
Unit Topic

Data Representation and basic Computer Arithmetic: Number systems,

I complements, fixed and floating point representation, character representation,
addition, subtraction, magnitude comparison.

II Logic gates and circuits: logic gates, Boolean algebra, combinational circuits,
circuit simplification, introduction to flip-flops and sequential circuits, decoders,
multiplexers, registers, counters.
Basic Computer Organization and Design: Computer registers, bus
III system, instruction set, timing and control, instruction cycle, memory
reference, input-output and interrupt.
Central Processing Unit: Register organization, arithmetic and logical micro-
IV operations, stack organization, Hardwired vs. micro programmed control. Pipeline
control: Instruction pipelines, pipeline performance, super scalar processing,
Pipelining, RISC &CISC

V Memory Organization: Memory device characteristics, random access memories,

serial access memories, Multi level memories, address translation, memory
allocation, Main features, address mapping, structure versus performance.

9
 Course Code: CSC 204

Course Title: Computer System Architecture Lab

Credits:2

Practical:

Memory Instruction format

4096 words 0 34 15
16 bits per Opcode Address
word

Basic Computer Instructions

Memory Reference Register Reference Input-Output

1. Create a machine based on the following architecture:

Register Set
IR DR AC AR PC FGI FGO S I E

0 15 0 15 0 15 011 011 1Bit 1Bit 1Bit 1 bit

1Bit

Symbol Hex Symbol Hex Symbol Hex

F80
AND 0xxx CLA E800 INP 0
F40
ADD 2xxx CLE E400 OUT 0
ISZ Cxxx INC E020
AND_I 1xxx SPA E010
ADD_I 3xxx SNA E008
LDA_I 5xxx Indirect SZA E004
STA_I 7xxx Addressing SZE E002
BUN_I 9xxx HLT E001
BSA_I Bxxx
ISZ_I Dxxx
Refer to Chapter-5 of Morris Man of or description of instructions.

10
ii) Create the micro operations and associate with instructions as given in the
chapter (except interrupts). Design the register set, memory and the instruction
set. Use this machine for the assignments of this section.

iii) Create a Fetch routine of the instruction cycle.

iv) Simulate the machine to determine the contents of AC, E, PC, AR and IR
registers in hexadecimal after the execution of each of following register
reference instructions:

a.CLA e.CIR i. SNA

b.CLE f.CIL j.SZA
c.CMA g.INC k.SZE
d.CME h.SPA l.HLT

Initialize the contents of AC to (A937)16, that of PC to (022)16 and E to 1.

5. Simulate the machine for the following memory-reference instructions with I = 0

and address part = 082. The instruction to be stored at address 022 in RAM.
Initialize the memory word at address 082 with the operand B8F2 and AC
withA937. Determine the contents of AC, DR, PC, AR and IR in hexadecimal
after the execution.

a. ADD f. BSA
b. AND g. ISZ
c. LDA
d. STA
e. BUN
6. Simulatethemachineforthememory-referenceinstructionsreferredinabovequestion
with I = 1 and address part = 082. The instruction to be stored at address 026 in
RAM. Initialize the memory word at address 082 with the value 298. Initialize the
memory word at address 298 with operand B8F2 and AC with A937. Determine the
contents of AC, DR, PC, AR and IR in hexadecimal after the execution.

7. Modify the machine created in Practical 1 according to the following instruction format:
Instruction format

0 23 4 15
Opcode I Address

a. The instruction format contains a 3-bit opcode, a 1-bit addressing mode and
a12-bit address. There are only two addressing modes, I = 0 (direct
addressing) and I=1 (indirect addressing).
b. Create a new register Iof1bit.
c. Create two new micro instructions as follows:
i. Check the opcode of instruction to determine type of instruction (Memory
Reference/Register Reference/Input-Output) and then jump accordingly.
ii. Check the I bit to determine the addressing mode and then jump accordingly.
11
Course Code: CSC 301

Course Title: Analysis of Algorithm and Data Structures

Credits: 4
Unit Topic

Introduction: Basic Design and Analysis techniques of Algorithms, time and

I space complexity, Correctness of Algorithm, Algorithm Design Techniques:
Iterative techniques, Divide and Conquer, Dynamic Programming, Greedy
Algorithms.
II Sorting Techniques: Elementary sorting techniques-Bubble Sort, Insertion Sort,
Merge Sort, Advanced Sorting techniques-Heap Sort, Quick Sort.
III Arrays, Stacks and Queues: Arrays: Single and Multi-dimensional Arrays,
Prefix, Infix and Postfix expressions, Array and Linked representation of Queue, De-
queue, Priority Queues.

IV Linked Lists: Singly, Doubly and Circular Lists, representation of Stack and Queue
as Linked Lists.

V Trees: Introduction to Tree as a data structure; Binary Trees, Binary Search Tree,
(Creation and Traversals of Binary Search Trees)

Course Code: CSC 302

Course Title: Soft Computing
Credits: 4
Unit Topic

Introduction To Neural Networks: Neural Networks Neuron, Nerve Structure And

I Synapse, Artificial Neuron And Its Model, Activation Functions.
II Neural Network Architecture: Single Layer And Multilayer Feed Forward
Networks, Recurrent Networks. Perception And Convergence Rule. Supervised
Learning Network &Unsupervised Learning Network.
Back Propagation Networks: Perceptron Model, Solution, Single Layer,
III Multilayer Perception Model, Back Propagation Learning Methods, Effect Of
Learning Rule Co-Efficient ;Back Propagation Algorithm, Applications.
IV Fuzzy Logic Introduction: Basic Concepts Of Fuzzy Logic, Fuzzy Sets And
Crisp Sets, Fuzzy Set Theory and Operations, Properties of Fuzzy Sets, Fuzzy
and Crisp Relations, Fuzzy to Crisp Conversion, Membership Functions,
Interference In Fuzzy Logic, Fuzzy If-Then Rules,
Fuzzyfications&Defuzzificataions.
Genetic Algorithm: Basic Concepts, Working Principle, Procedures of GA,
V Flow Chart of GA, Genetic Representations, (Encoding), Genetic Operators,
Mutation, Generational Cycle.

12
Course Code: CSC 303

Course Title: Lab on Algorithm and Data Structures

Credits:2
Practical List on Analysis of Algorithms and Data Structures:

1. Write a program that uses functions to perform the following:

a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
2. Write a program that uses functions to perform the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion.
3. Write a program that uses stack operations to convert a given infix expression into
its postfix Equivalent, implement the stack using an array.
4. Write program to implement a double ended queue using
i) Array. ii) Doubly linked list.
5. Write a program that uses functions to perform the following:
a) Create a binary search tree of characters.
b) Traverse the above Binary search tree recursively in Post order.
6. Write a program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in in order.
7. Write program for implementing the following sorting methods to arrange a list
of integers in ascending order:
a) Insertion sort b) Merge sort
8. Write program for implementing the following sorting methods to arrange a list
of integers in ascending order:
a) Quick sort
b) Selection sort
9. Write program to implement Insertion Sort (The program should report the number
of comparisons)
10. Write program implement Merge Sort (The program should report the
number of comparisons)
11. Write program implement Heap Sort (The program should report the
number of comparisons)
12. Write program implement Randomized Quick sort (The program should
report the number of comparisons)
13. Write program for creation and traversal of Binary Search Tree.

13
Course Code: CSC304

Course Title: Data Communication and Computer Network

Credits: 4
Topic
Unit
Introduction to Signals
I Data and Information, Data communication, Characteristics of data communication,
Components of data communication, Data Representation, Data Flow, Simplex,
Half Duplex, Full Duplex, Analog and Digital Signals, Periodic and A periodic
signals, Time and Frequency Domain, Composite Signals.
II Basic Concepts of Networks: Components of data communication, standards and
organizations, Network Classification, Network Topologies; network protocol; layered
network architecture; overview of OSI reference model; overview of TCP/IP protocol suite.

III Physical Layer and Data Link Layer: Cabling, Network Interface Card, Transmission
Media Devices-Repeater, Hub, Bridge, Switch, Router, Gateway, Designing issues,
Framing and Data Link Control, Error detection schemes (parity, checksums,
CRCs), Error correction schemes (Hamming codes, binary convolution codes),
Data link layer protocols (Simplest, Stop & Wait ARQ, Go-Back-N ARQ, Selective
Repeat ARQ, Sliding Window), MAC sub layer (Ethernet, ALOHA, CSMA family,
Contention-free access / Token Ring).
Network Layer and Transport Layer
IV Design issues, Switching, Routing algorithms (Shortest path, Link state, Flooding,
Broadcast, Multicast), Packet Scheduling, Internetworking, Internet Protocol (IPv4,
IPv6), IP addressing, Internet Control Protocols (IMCP, ARP, DHCP), Mobile IP,
Transport layer services, Connection establishment and teardown, TCP, UDP,
Congestion Control, Quality of Service, Domain Name System, World Wide Web.
Network Security: Common Terms, Firewalls, Virtual Private Networks
V

14
Course Code: CSC 305

Course Title: Data Communication and Computer Network

Credits: 4

Unit Topic
Introduction to Signals
I Data and Information, Data communication, Characteristics of data communication,
Components of data communication, Data Representation, Data Flow, Simplex,
Half Duplex, Full Duplex, Analog and Digital Signals, Periodic and A periodic
signals, Time and Frequency Domain, Composite Signals.
II Basic Concepts of Networks: Components of data communication, standards and
organizations, Network Classification, Network Topologies; network protocol; layered
network architecture; overview of OSI reference model; overview of TCP/IP protocol suite.

III Physical Layer and Data Link Layer: Cabling, Network Interface Card, Transmission
Media Devices-Repeater, Hub, Bridge, Switch, Router, Gateway, Designing issues,
Framing and Data Link Control, Error detection schemes (parity, checksums,
CRCs), Error correction schemes (Hamming codes, binary convolution codes),
Data link layer protocols (Simplest, Stop & Wait ARQ, Go-Back-N ARQ, Selective
Repeat ARQ, Sliding Window), MAC sub layer (Ethernet, ALOHA, CSMA family,
Contention-free access / Token Ring).
Network Layer and Transport Layer
IV Design issues, Switching, Routing algorithms (Shortest path, Link state, Flooding,
Broadcast, Multicast), Packet Scheduling, Internetworking, Internet Protocol (IPv4,
IPv6), IP addressing, Internet Control Protocols (IMCP, ARP, DHCP), Mobile IP,
Transport layer services, Connection establishment and teardown, TCP, UDP,
Congestion Control, Quality of Service, Domain Name System, World Wide Web.
V Network Security: Common Terms, Firewalls, Virtual Private Networks

15
Course Code: CSC 306

Course Title: Cyber Security & Cyber Laws

Credits: 4

Unit Topic

Introduction: Introduction to Information System, Type of information

I system, Development of information system, CIA model of Information
Characteristics, Introduction to Information Security, Need of Information
Security, Cyber Security, Business need, Ethical and Professional issues of
Security.
Information Security Techniques, Introduction to Cryptography:
II Terminology, Cryptanalysis, Security of Algorithms, Substitution Cipher and
Transposition Cipher, Single XOR, One-way Pad.

Cryptographic Protocols: Arbitrated and Adjudicated Protocol, One-Way Hash

III function, Public key cryptography, Digital Signature, Digital Watermarking
Technique: Characteristics and Types.

IV Security Policies, Why Policies should be developed, WWW policies, Email

Security policies and Policy Review Process-Corporate policies - Sample
Security Policies.
V Cyber Laws: Information Security Standards, IT Act 2000 Provisions,
Introduction to digital laws, cyber laws, intellectual property rights, copyright
laws, patent laws, software license.

Course Code: CSC 307

Course Title: Lab on Computer Networks

Credits: 2

Lab based on Computer Networks:

Implement the concepts of Computer Networks such as:

1. Simulate Checksum Algorithm.

2. Simulate CRC Algorithm
3. Simulate Stop& Wait Protocol.
4. Simulate Go-Back-N Protocol.
5. Simulate Selective Repeat Protocol.

16
 Research Project Guidelines for V
and VI Semester

1. Objectives of the Project

• To facilitate the student to independently formulate and solve a
social, philosophical,commercial, or technological problem and
present the results in written and oral form.
• To render students to the real life problems.
• To provide opportunities to students to interact with people and
present themconfidently.
• A student can work on given project in group as well as
independently.

2. Types of Project
The students are expected to work on:

(1) Application Oriented Project or

(2) Research Oriented Project.

#The rules for examinations for programme and courses will be according
to the University Guidelines decided by time to time.

17