BCA Computer Science Syllabus
Computer Science Syllabus
Syllabus

# Computer Science Syllabus

## Computer Science Syllabus

Hello friends, welcome to the latest blog of**king of developers**. Today in this blog post i share the

**syllabus**of

**COMPUTER SCIENCE**.

## BSC Computer Science(Hons.) Syllabus

## CHOICE BASED CREDIT SYSTEM (CBCS)

## Comp. Sc.(Hons.): Semester - I

**Paper C-1: PROGRAMMING USING C**

**[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]**

**Lectures: 40 ( 60 Minutes duration)**

**(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)**

**UNIT- I**

**Introduction to Programming Language:**Introduction to C Programming , Character Set, C Tokens, Keywords & Identifiers, Constants, Variables, Data Types, Variables , Storage Classes, Operators (Arithmetic, Relational, Logical , Assignment, Increment & Decrement, Conditional , Bitwise), Expressions , Input and Output Operations.

**UNIT- II**

**Decision Making and Branching:**Simple IF Statement, IF ….. ELSE Statement, Nesting IF …. ELSE Statement, ELSE IF Ladder, Switch Statement, ? Operator, GOTO Statement.

**Decision**

**Making and Looping:**The WHILE Statement, The DO Statement, The FOR Statement, Jumps in LOOPS. Arrays, Character Arrays and Strings.

**UNIT- III**

**User-defined Functions:**Need, Elements & Definition, Function Calls, Function Definition, Category of Functions, Recursion. Structures and Unions: Defining, Declaring, Accessing, Initialization Structure, Arrays of Structures, Arrays within Structures, Structures and Functions, Unions.

**UNIT- IV**

**Pointers:**Accessing the Address of a Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a Variable through its Pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays,, Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers to Structures, Troubles with Pointers.

**UNIT- V**

**File Management in C:**Defining and Opening a File, Closing a File, Input/ Output Operations on Files, Error Handling During I/O Operations, Random Access to Files, Command Line Arguments, Dynamic Memory Allocation.

**Also read : C programming Hand Written Notes Download**

**Text Books:**

**1)**Programming in ANSI C by E.Balguruswamy.

**2)**Programming in C by Soumya S Patnaik.

**3)**Simply Start with C to C++ by Soumya S Patnaik.

**4)**Let us C by Yashwant Kanetkar.

**Reference Books:**

**1)**Programming in ANSI C by Ashok Nath Kamthane.

**2)**P. Dey & M. Ghosh, “Computer Fundamental & Programming in C”- Oxford University

Press

**3)**Deitel -“C How to programme” PHI publication/ Pearson Publication

**4)**H. Schildt – “C the complete Reference” McGraw-Hill

**5)**Schaum Series- “C Programming” - Gotterfried

**Paper C-2: COMPUTER ORGANIZATION**

**[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]**

**Lectures: 40 (60 Minutes duration)**

**(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)**

**UNIT-I**

Character Codes, Decimal System, Binary System, Decimal to Binary Conversion, Hexadecimal Notation, Boolean Algebra, Basic Logic Functions: Electronic Logic Gates, Synthesis of Logic Functions, Minimization of Logic Expressions, Minimization using Karnaugh Maps, Synthesis with NAND and NOR Gates.

**UNIT-II**

Flip-Flops, Gated Latches, Master-Slave Flip-Flops, Edge-Triggering, T Flip-Flops, JK Flip-Flops. Registers and Shift Registers, Counters, Decoders, Multiplexers, Programmable Logic Devices (PLDs), Programmable Array Logic (PAL).

**UNIT-III**

Basic Structure of Computers: Computer Types, Functional Units, Input Unit, Memory Unit, Arithmetic and Logic Unit, Output Unit, Control Unit, Basic Operational Concepts, Bus Structures, Software. Machine Instructions and Programs: Numbers, Arithmetic Operations, and Characters: Number Representation, Addition of Positive Numbers, Addition and Subtraction of Signed Numbers, Overflow of Integer Arithmetic, Generating Memory Addresses, Addressing Modes.

**UNIT-IV**

THE ARM EXAMPLE: Registers, Memory Access, and Data Transfer, Register Structure, Memory Access Instructions and Addressing Modes, Register Move Instructions, Arithmetic and Logic Instructions: Arithmetic Instructions, Logic Instructions. PowerPC Example: Basic PowerPC Processor Organization, Load and Store Instructions, Arithmetic and Logic Instructions, Flow Control Instructions, Compare Instructions, Logic Instructions.

**UNIT-V**

Memory System: Semiconductor RAM Memories, Internal Organization of Memory Chips, Static Memories, Asynchronous DRAMS, Synchronous DRAMS. Read-Only Memories: ROM, PROM, EPROM, EEPROM, Flash Memory, Speed, Size, and Cost of Memory. Secondary Storage: Magnetic Hard Disks, Optical Disks, Magnetic Tape Systems.

**Text Books:**

1)Carl Hamacher, Z. Vranesic, S. Zaky: Computer Organization, 5/e (TMH)

**Reference Book:**

1)William Stallings: Computer Organization and Architecture (Design for Performance),9/e

## Comp. Sc.(Hons.): Semester - II

Paper C-3: PROGRAMMING USING C++

[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]

Lectures: 40 (60 Minutes duration)

(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)

**UNIT- I**

**Principles of Object-Oriented Programming:**Object-Oriented Programming (OOP) Paradigm, Basic Concepts of OOP, Benefits of OOP, Object Oriented Languages, Applications of OOP. Beginning with C++: Applications of C++, C++ statements, Example with Class, Structure of C++ Program, Creating the Source File, Compiling and Linking. Tokens, Expressions and Control Structures: Tokens, Keywords, Identifiers & Constants, Basic Data Types, User-Defined Data Types, Derived Data Types, Symbolic Constants, Type Compatibility, Declaration of Variables, Dynamic Initialization of Variables, Reference Variables, Operators in C++, Scope Resolution Operator, Member Deferencing Operators, Memory Management Operators, Manipulators, Type Cast Operators, Expressions and their Types, Special Assignment Expressions, Implicit Conversions, Operator Overloading, Operator Precedence, Control Structures.

**UNIT- II**

**Functions in C++:**The Main Function, Function Prototyping, Call By Reference, Return by Reference, Inline Functions, Default Arguments, Const. Arguments, Function Overloading, Friend & Virtual Functions, Math. Library Functions. Classes and Objects: Specifying a Class, Defining Member Functions, Making an outside Function Inline, Nested Member Functions, Private Member Functions, Arrays within a Class, Memory Allocation for Objects, Static Data Members, Static Member Functions, Arrays of Objects, Objects as Function Arguments, Friendly Functions, Returning Objects, Cons. Member Functions, Pointer to Members, Local Classes.

**UNIT- III**

**Constructors & Destructors:**Constructors, Parameterized Constructors, Multiple Constructors in a Class, Constructors with Default Arguments, Dynamic Initialization of Objects, Copy Constructor, Dynamic Constructors, Constructing Two-Dimensional Arrays, Const. Objects, Destructors. Operator Overloading and Type Conversions: Defining Operator Overloading,Overloading Unary Operators, Overloading Binary Operators, Overloading Binary Operators using Friends, Manipulation of Strings using Operators, Rules for Overloading Operators, Type Conversions.

**UNIT- IV**

**Inheritance :**Defining Derived Classes, Single Inheritance, Making a Private Member Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid Inheritance, Virtual Base Classes, Abstract Classes, Constructors in Derived Classes, Member Classes, Nesting of Classes. Pointers, Virtual Functions and Polymorphism: Pointers, Pointers to Objects, this Pointer, Pointers to Derived Classes, Virtual Functions, Pure Virtual Functions.

**UNIT- V**

**Managing Console I/O Operations:**C++ Streams, C++ Stream Classes, Unformatted I/O Operations, Formatted Console I/O Operations, Managing Output with Manipulators. Files: Classes for File Stream Operations, Opening and Closing a File, Detecting end-of-file, File Modes, File Pointers and their Manipulations, Sequential Input and Output Operations, Updating a File: Random Access, Error Handling During File Operations, Command-line Arguments.

**Text Books:**

**1)**Object Oriented Programming with C++ by E. Balgurusamy.

**2)**Simply Start with C to C++ by Soumya S Patnaik.

**3)**Object Oriented Programming with C++ by Soumya S Patnaik.

**Reference Books:**

**1)**C++: The Complete Reference- Schildt, McGraw-Hill Education.

**2)**ANSI and Turbo C++ by Ashok Nath Kamthane.

**3)**Object Oriented Programming with C++ by Rajiv Sahay-Oxford press.

**4)**Mastering C++ - Venugopal, McGraw-Hill Education (India).

**5)**Big C++ - Wiley India

**Paper C-4: DATA STRUCTURE**

**[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]**

**Lectures: 40 (60 Minutes duration)**

**(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)**

**UNIT-I**

**Introduction and Overview:**Definitions, Concept of Data Structures, Overview of Data Structures, Implementation of Data Structures. Arrays: Terminology, One-Dimensional Array, Multi-Dimensional Arrays, Pointer Arrays.

**UNIT-II**

**Linked Lists:**Single Linked List, Circular Linked List, Double Linked List, Circular Double Linked List, Application of Linked Lists, Memory Representation, Boundary Tag System, Deallocation Strategy, Buddy System, Compaction.

**UNIT-III**

**Stacks:**Definition, Representation of Stack (Array, Linked List), Operations on Stacks, Applications of Stack (Evaluation of Arithmetic Expressions, Quick Sort, Tower of Hanoi).

**UNIT – IV**

**Queues:**Definition, Representation of Queues (Array, Linked List), Circular Queue, Deque, Priority Queue, Application of Queues .

**UNIT –V**

**Tree:**Binary Trees, Properties of Binary Tree, Linear Representation of Binary a Binary Tree, Linked Representation of a Binary Tree, Physical Implementation of Binary Tree in Memory, Operations on Binary Tree (Insertion, Deletion, Traversal), Types of Binary Trees (Binary Search Tree, Height Balanced Binary Tree).

**Text Books:**

Classic Data Structures: D. SAMANTA (PHI)

## Comp. Sc.(Hons.): Semester - III

Paper C-5: OPERATING SYSTEM

[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]

Lectures: 40 (60 Minutes duration)

(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam)

**UNIT- I**

Operating System, Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage Management, Protection and Security, Distributed Systems, Special Purpose Systems, Computing Environments, Open-Source Operating Systems. Operating System Services, User Operating System Interface, System Calls, Types of System Calls, System Programs, Operating- System Design and Implementation, Operating System Structure, Virtual Machines, Operating System Debugging, Operating System Generations. System Boot.

**UNIT- II**

**Process:**Process Concept, Process Scheduling, Operations on Processes, Inter-Process Communication, Examples of IPC Systems, Communication in Client-Server Systems.

**Multithreaded Programming:**Multithreading Models, Thread Libraries, Threading Issues, Operating-System Examples.

**UNIT- III**

**Process Scheduling:**Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling. Multiple-Process Scheduling.

**Synchronization:**The Critical Section Problem, Peterson‟s Solution, Synchronization Hardware, Semaphores, Classical Problems of Synchronization, Monitors, Synchronization Examples, Atomic Transactions.

**UNIT- IV**

**Deadlocks:**System Model, Deadlock Characterization, Methods of Handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, Recovery from Deadlock.

**Memory Management Strategies:**Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, Example: The Intel Pentium.

**UNIT- V**

**Virtual-Memory Management:**Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files, Allocating Kernel Memory. File System: File Concept, Access Methods, Directory and Disk Structure, File-System Mounting, File Sharing, Protection.

**Text Books:**

**1)**Operating System Concepts – Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 8th

edition, Wiley-India, 2009.

**2)**Mordern Operating Systems – Andrew S. Tanenbaum, 3rd Edition, PHI.

**3)**Operating Systems: A Spiral Approach – Elmasri, Carrick, Levine, TMH Edition.

**Reference Books:**

**1)**Operating Systems – Flynn, McHoes, Cengage Learning.

**2)**Operating Systems – Pabitra Pal Choudhury, PHI.

**3)**Operating Systems – William Stallings, Prentice Hall.

**4)**Operating Systems – H.M. Deitel, P. J. Deitel, D. R. Choffnes, 3rd Edition, Pearson.

**Paper C-6: DATABASE MANAGEMENT SYSTEM**

**[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]**

**Lectures: 40 (60 Minutes duration)**

**(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)**

**UNIT-I**

Databases and Database Users, Database System Concepts and Architecture, Data Modelling using the Entity-Relationship(ER) Model, The Enhanced Entity-Relationship (EER) Model.

**UNIT-II**

**Relational Model:**The Relational Data Model and Relational Database Constraints, The Relational Algebra and Relational Calculus.

**UNIT-III**

Relational Database Design by ER- and EER-to-Relational Mapping, SQL-99: Schema Definition, Constraints, Queries, and Views, Introduction to SQL Programming Techniques.

**UNIT-IV**

Functional Dependencies and Normalization for Relational Databases, Relational Database Algorithms and Further Dependencies, Practical Database Design Methodology and use of UML

Diagrams.

**UNIT-V**

Disk Storage, Basic File Structures and Hashing, Indexing Structures for Files, Algorithms for Query Processing and Optimization, Physical Database Design and Tuning.

**Text Books:**

**1)**Database System Concepts by Sudarshan, Korth (McGraw-Hill Education).

**2)**Fundamentals of Database System By Elmasari &Navathe- Pearson Education.

**References Books:**

**1)**An introduction to Database System – Bipin Desai, Galgotia Publications.

**2)**Database System: concept, Design & Application by S.K.Singh (Pearson Education).

**3)**Database management system by leon &leon (Vikas publishing House).

**4)**Database Modeling and Design: Logical Design by Toby J. Teorey, Sam S. Lightstone,

and Tom Nadeau, “”, 4th Edition, 2005, Elsevier India Publications, New Delhi.

**5)**Fundamentals of Database Management System – Gillenson, Wiley India.

**Paper C-7: DISCRETE STRUCTURE**

**[Total Marks: 100 (Mid Term-15, Practical-25, End Term-60); Duration: 3hrs]**

**Lectures: 40 (60 Minutes duration)**

**(Unit-I will be examined for Mid-Term only and from Unit-II to Unit V for Term End Exam.)**

**UNIT-I**

**Logic and Proofs:**Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Normal Forms, Proof Methods and Strategy, Mathematical Induction, Strong Induction and Well-Ordering, Recursive

Definitions and Structural Induction, Recursive Algorithms.

**UNIT-II**

**Basic Structures:**Sets, Set Operations, Functions, Recursive Functions, Sequences and Summations.

**Relations:**Relations and their Properties, n-ary Relations and their Applications,Representing Relations, Closures of Relations, Equivalence Relations, Partial Ordering.

**UNIT-III**

**Algebra:**Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits. Algebraic Structures & Coding Theory: The Structure of Algebras, Semi-groups, Monoids and Groups, Homomorphism, Normal Subgroups, and Congruence Relations, Rings, Integral Domains and Fields, Quotient and Product Algebras, Coding Theory. Polynomial Rings and Polynomial Codes.

**UNIT-IV**

**Counting:**Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Generalized Permutations and Combinations, Generating Permutations and Combinations. Advanced Counting Techniques, Applications of Inclusion-Exclusion, Discrete probability, Conditional probability, Bayes‟ Theorem.

**UNIT-V**

**Graphs:**Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Havel- Hakimi Theorem, Representing Graphs and Graph Isomorphism, Connectivity, Cut-Sets, Euler and Hamiltonian Paths, Shortest-Path Problem, Planar Graphs, Graph Coloring, Network Flows.

**Text Books:**

**1)**Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Tata McGraw Hill Education , New Delhi.

**2)**C. L. Liu and D. Mohaptra, “Elements of Discrete Mathematics”, Tata McGraw Hill Education, New Delhi.

**Reference Books:**

**1)**Ralph P. Grimaldi, ”Discrete and Combinatorial Mathematics”, Fifth Edition, 2005, Pearon Education, New Delhi.

**2)**Kolman, Busby, Ross, “Discrete Mathematics”, Fifth Edition, PHI Publication.

**3)**J.L. Gersting, “ Mathematical Structure for Computer Science: A modern treatment to Discrete Mathematics‟ by W. H. Freeman and Macmillan (India).

**4)**Eric Gossett, „ Discrete Mathematics with Proof, Second Edition, Wiley India Pvt Ltd

**5)**Thomas Koshy, “ Discrete Mathematics and Applications:, Second Edition, Elsevier Publication (India), New Delhi.

**6)**J.L. Mott, A.Candell & I. Bekar, Discrete Mathematics for Computer Scientists and Mathematicians, PHI.

Previous article

This Is The Newest Post

Next article

## Leave Comments

## Post a comment