admin.manbhummv.inadmin.manbhummv.in/file/dept_syll/12dept_syll.pdf · Sidho-Kanho-Birsha Un iversity 6 B.5c.Computer Science(Hons.) [Q.I(compulsory) contains 15short questions having

SIDHO-KANHO-BIRSHA UNIVERSITYPURULIA

Computer ScienceSyllabus for B.Sc. (Honours)

Kolkata Campus:Paribesh Bhavan, lOA, Block-LA, Sector-IllSalt Lake, Kolkata-700 098Phone: 2335 0092

Purulia Campus:Purulia Zilla Parisad, Old Administrative BuildingJubilee Compound, p.a. & Dist: Purulia-723101Phone: 03252224438

Branch Office:J. K. College, Purulia, p.a. & Dist. : PuruliaPin: 723101

Published bySidho-Kanho-Birsha UniversityPurulia

Printed by:The Saraswati Printing Works2 Guru Prosad Chowdhury Lane, Kolkata-700 006Phone: 23500816,23604879

Price: 15.00

Sidho-Kanho-Birsha University 3 B.5c. Computer Science (Hons.)

Following is the amended syllabus of B.Sc (Honours) coursein Computer Science, Sidhu-Kanu-Birsha University

••

Computer Subject Marks PeriodsScience

(Hons.)

Part I

Paper I Group A: Computer Fundamentals 20 20

Group B: Discrete Mathematics 40 40

Group C: Data Structure 40 40

Paper II Group A: System software & Operating System 50 40

Group B: Programming Language Laboratory 50 60

Part II

Paper III Group A: Basic Electronics & Digital Logic 40 45

Group B: Formal Language 15 20

Group C: Object Oriented Programming 25 20

Group 0: Numerical Methods 20 15

Paper IV Group A: Circuit Design Laboratory 50 40

Group B: oaPs & Shell Programming Lab 50 60

Part III

Paper V Group A: Computer Organization 50 50

Group B: Data Communication & Internet 50 50

Technology

Paper VI Group A: System Analysis & Design 20 20

Group B: Computer Graphics 20 20

Group C: DBMS 60 60

Paper VII Group A: Microprocessor 50 60

Group B: Microprocessor Programming 50 40

Laboratory

Paper VIII GroupA:RDBMSLab 50 50

Group B: Internet Technology Lab 50 50

Sidho-Kanho-Birsha University B.5c. Computer Science (Hons.)4

PART-I

PAPER-I (THEORETICAL): 100 Marks

Croup A : Computer Fundamentals (20 Periods)

Introduction to Computer and Problem Solving : Informatioh andData.Hardware: CPU, Primary and Secondary storage, I/O devices

Software : Systems and Application.Generation of Computers: Super, Mainframe, Mini and PersonalComputer.Introduction to Programming Languages : Machine Language,Assembly Language, High Level Language.

Problem Solving: Flow Charts, Decision Fables and Pseudo codes.Algorithm : concept and writing of simple algorithms throughpseudo code, Complexity: space and time

Number Systems and Codes :Number representation: Weighted Codes, Non-weighted codes.Positional. Binary. Octal, Hexadecimal, Binary Coded Decimal(BCD), Conversion of bases. Complement notions, BinaryArithmetic, Binary Codes: Gray, Alphanumeric, ASCII, EBCDIC;Parity Bits, Single Error-Detecting and Correcting Codes,Hamming Codes, Fixed and Floating Point Arithmetic: Addition,Subtraction, Multiplication and Division.

Group B : Discrete Mathematics (40 periods)

Mathematical Logic: Proposition, Predicates and Quantifiers. Sets,Functions, Growth of Functions, Relation, Equivalence Relation:Big 0 Notation, Big Omega and Big-Theta Notations.

Graphs: Introduction, Finite and Infinite Graphs, Directed andUndirected Graphs, Degree, Isolated vertex, Pendant vertex, Null

Sidho-Kanho-Birsha University 5 B.Sc.Computer Science (Hons.)

graphs. Walks, Paths and Circuits, Connected and Disconnectedgraphs, Euler's graphs, Hamiltonian paths and circuits, Trees:Introduction and basic properties.

Counting theory: Counting, Pigeon Hole Principle, Inclusion and 'Exclusion Principle, Permutations and Combinations, Recurrencerelations and Generating functions.

Group C: Data structure (40 Periods)

Introduction: Concepts of Data types, Elementary structures, Datatypes and their interpretation.

Arrays: Types, Memory Representation, Address Translation,Functions of single and multi-dimensional arrays withexamples.

Linked Structures : Singly and doubly linked list (non-circularand circular), List manipulation with pointers: Searching,Insertion and deletion of elements.

Stacks and Queues: Representation. Uses and Applications, Infix,Prefix &Postfix notations, Infix to postfix : conversion andevaluation; Application of queues.

Recursion: Divide and Conquer, elimination of recursion.

Trees: Representation of graph & tree, Binary Tree, Treetraversals, BST (only definition and objective), Minimal spanningtree algorithms (PRIMS).

Searching : Linear and binary search, performance andcomplexity.

Hashing : Concepts, Advantages and Disadvantages, Differenttypes of hash functions, Application.

Sorting: Terminoiogy, Different Sorting Techniques (Bubble,Insertion, Selection, Quick sort with iterative and recursivedescription). Complexity, advantages and disadvantages.


[Q.I (compulsory) contains 15 short questions having 2 marksinvolving all groups, within these 10 have to be answered. Q2-Q9 will carry 16 marks (may have sub divisions), 2 from groupA, 3 from group B and group C each, within these 5 have to beanswered taking at least one from each group]

PAPER 11

Group A : System software & OS (40 Periods)

System Software Fundamentals: Different System Software: A briefintroduction to Operating Systems, Assemblers, Loaders, Linkers,Interpreters, Compilers, various phases of compilation.

Introduction to Operating Systems: What is OS?Multiprogramming, Multitasking OS, Concepts of processes,Files. Shell, System Calls; Structures: Monolithic, Layered,Virtual, Client Server and Distributed Model.

Concepts of Synchronization : Semaphores. Critical Regions,Monitor Inter Process Communication Mechanism.

Processor Management: Scheduling and its types.

I/O Management: Device and Device Controllers, InterruptHandlers and Device drivers.

Memory Management: Real & Virtual memory, Swapping, Paging,Segmentation, Page Replacement Techniques.

File Systems: Files and Directories, File Servers, Security andProtection, Disk Management. Dead Lock: Introduction,Prevention, Avoidance, Detection, Recovery.

Case Study : UNIX/LINUX, WINDOWS.

[Q.I (compulsory) contains 7 short questions having 2 marksinvolving all groups, within these 4 have to be answered. 2-6

Sidho-Kanho-Birsha University 7 B.Sc. Computer Science (Hons.)

will carry 14 marks (may have sub divisions), within these 3have to be answered]

Croup B: Programming Language Laboratory (60 Periods)Use of Open source software and OS should be encouraged.The necessary theoretical classes are to be arranged for providinga detail idea about problem solving through C language. Theproblems of Data structure are to be included also within theassignmen t.

Introduction: History, Basic Structure, Structured programmingconstructs.

C Programming elements: Character sets, Keywords, Constants,Variables, Data Types, Operators- Arithmetic, Relational, Logicaland Assignment, increment and Decrement and Conditional,Operator Precedence and Associations, Expressions, type casting,Comments, Functions. Storage Classes, Bit manipulation; Inputand output.

C Preprocessor: File inclusion, Macro substitution.Statements: Assignment, Control statements- if. if else, switch,break, continue, goto, Loops-while, do while, for.

Functions: argument passing, return statement, return valuesand their types, recursion

Arrays: String handling with arrays, String handling functions.

Pointers: Definition and initialization. Pointer arithmetic. Pointersand arrays. String functions and manipulation. Dynamic storageallocation.

User defined Data types : Enumerated data types, Structures.Structure arrays, Pointers to Functions and Structures, Unions.File Access: Opening, Closing, I/O operations.

8 B.5c. Computer Science (Hons.)Sidho-Kanho-Birsha University

Duration of Examination : 4 hoursMilrks Allotment: Sessional

Experiment -Viva-voce -

05 marks35 marks10 marks

PAPER III

Group A; Basic Electronics & Digital Logic (50 Periods)

Introduction to Basic Electronics

Elementary circuit theory: Kirchoff's Laws with simpleapplications, Statement and illustration of Thevenin's &Norton'stheorems (without proof) in resistive network only& its simpleapplications.

Elementary Physics of semi-conductors : Intrinsic and Extrinsicsemiconductors, P & N type, Diode & its applications : Typesof diodes, P~N Junction diodes, Biasing of a junction diode,Depletion region & its effect, Diode as a rectifier, LED. BipolarJunction Transistor: Principle of junction transistor, currentcomponents of transistor, modes of a transistor (CB, CE andCC) and their properties, I/O characteristics of a transistor inCE mode. Relation between a & /3-parameters of transistor,biasing of a transistor: Q point, load line, Self-bias, fixed bias &collector to base bias and stability factors. Transistor as anamplifier

Digital System Design

Fundamentals of Boolean Algebra, Switches and inverters,Functionally Complete Gates (AND, OR, NOT), NAND, NOR.Switching function and Boolean function. De Morgan's theorem,Minterm and Maxterm, Truth table and minimization ofswitching function up to four variables, Algebraic and


K-map method of logic circuit synthesis: Two level and Multilevel.

Combinational Circuits : Realization of AND and OR Gatesusing diodes and NOT Gate using transistors, Standard GateAssemblies, IC chips packaging nomenclature, Half and FullAdder(3 bits), Multi-bit adders -Ripple carry and Carry LookAhead Adder, Adder/subtractor, BCD-Adder, Data selectors/. multiplexers -expansions, reductions, function realization,universal function realization, multi-function realization,Decoders/Demultiplexers: function realization. De-multiplexerand function realization, Encoder, Priority Encoder. Parity bitGenerator/checker, Gray Code Generator, Code Converters, I/o features of BCD to 7- segment LED decoder/driver (7447/7448), Seven segment display unit, Comparators.

Sequential Circuits: Model of Sequential computing. Differencebetween Combinational and Sequential circuit, RS-Latch: usingNAND and NOR Gates, RS Latch as a Static RAM Cell, Problemsof Basic Latch circuits. Digital Clock - Duty Cycle, Rising time,Falling time. Clocked Flip Flops - SR, JK, D, T, Level Triggerand Edge Trigger, Excitation Functions of each flip-flops. Flip-(Flops) with Preset and Clear, Application of Flip-flops:Asynchronous Counter, (UP/OOVVN) up to 4 bit counter, Mod-n Counter. Synchronous Counters - different mod counters,Ring counter, Registers: Registers with serial and parallel load,Shift Registers.

Group B : Formal Languages and Automata Theory (15Periods)

Introduction to 'Formal Languages and Grammar, ChomskyClassification of Grammars, Regular Expressions. FiniteAutomata-deterministic and non-deterministic and theirequivalence, state minimization, introduction to TuringMachines.

Sidho-Kanho-Birsha University B.5c. Computer Science (Hons.)10

Group C: Object Oriented Programming (20 Periods)

Difference with procedure oriented programming; DataAbstraction and Information Hiding : Objects, Classes andMethods, Encapsulation, Inheritance, Polymorphism, ObjectOriented Programming through C+: Input/Output, function andOperator Overloading, Constructors and Destructors, CopyConstructors and Assignment Operator, Overloading, Single andMultiple Inheritance, Polymorphism and Virtual Functions,Namespace, Exception Handling, Templates.

Group D: Numerical Methods and Algorithms

(15 Periods)

[For the methods covered in this group, the algorithm designusing pseudo code needs to be done] .

Errors: Introduction, types of errors.

Interpolation: Newton Forward and Backward interpolation,Lagrange interpolation.

Solution of Linear Equation : Solution methods: GaussianElimination, Gauss-Seidel method, convergence and errors.

Solution of Nonlinear Equation : Bisection algorithm, Regula-falsimethod, Secant and Newton-Raphson method,

convergence and its graphical significances.

Solution of Differential Equations: Euler Method, Runge-Kuttasecond and fourth order method for solving differentialequations.

Integration: Trapezoidal and Simpson's 1/3rd Rules and itsComposite forms.

[Q.I (compulsory) contains 15 short questions having 2 marksinvolving all groups, within these 10 have to be answered. Q2-


QlO will carry 16 marks (may have sub divisions). 3 from groupA, 2 from group B, group C and group D each, within these 5have to be answered taking at least one from each group]

PAPER IV

Group A: Circuit Design Laboratory (40 Periods)

Pre-requisites:

Study of IC Data Books - Linear and Digital. Familiarity withbreadboard, LED, 7 segment display etc. Observe the outputwaveform of a function generator in a CRO. Mean Time Period,Peak Voltage, Frequency and comparison with functiongenerator readings, Study of basic logic functions like AND,OR, NOT, NAND etc. Ideas of fan in, fan out, Noise Margin,Threshold Voltage, Transfer Characteristics, Design of a NOTGate(inverter) using transistors. Design of a debouncing switch.Logic probe, Clock (crystal timer). Verification of NAND andNOR gates as universal gates, De Morgan's Theorem.

Analog Circuits

1) Use of Diodes to implement bridge rectifier. Observe thewaveform on CRO, Measure peak values. Use threeterminal regulator (lC 78XX) for voltage regulation.Drawing of load regulation characteristics.

2) Using Transistor to construct NOT or Invert Operationand draw the transfer characteristics and measure thethreshold voltage.

DigitaJ Circuits:

Combinational Circuits :

1) Implement Half Adder /Half Subtractor / Full Adder / FullSubtractor using Logic Gates. Realize a logic function using


basic/universal gates in SOP and POS form. Study thefunctionalities of 7483 and design a BCD adder using 7483or equivalent. .

2) Design a 4 bit 2's complement adder - subtractor unit using7483 or equivalent and XOR gates.

3) Design a circuit to convert BCD numbers to correspondinggray codes.

4) Design a 4:1 MUX using NAND gates. Study of 74153 and74151. Design Full Adder / Subtractor using MUX.

5) Design a 2:4 decoder 'using NAND gates. Study of 74155and 74138. Design Full Adder / Subtractor using decoders.

6) Design a parity generator/checker using basic gates.

7) Design magnitude comparator using basic/universal gates.Study of 7485.

8) Design a seven segment display unit.

Sequential Circuits :

1) Realize S-R, D, J-K and T flip-flop using basic gates. (Studythe undefined state in S-R flip-flop).

2) Study the functional characteristic of IC 74194 withemphasis on timing diagram.

3) Design Asynchronous and Synchronous counters. (Mod-8, Mod-10 up counter)

•4) Study the functional characteristics of RAM IC chip. Study

of open collector and tri-state output. Horizontal expansionof RAM chips by cascading. (Use 74189, 7489, or anyavailable chip).

Moks Allotment: SessionalExperiment -Viva-voce -


Sidho-Kanho-Birsha University 13 B.Sc.Computer Science (Hons.)

Group B: OOPs and Shell Programming Laboratory (60 Periods)

Section I: Object Oriented Programming Language: C++,

Problems: Problem set should cover the basic features of thelanguage and implementation of different algorithms coveredin theoretical papers. .

Section II: UNIX: Files and Directories. Copy, Delete. RenameDirectory, Creation, Navigation, Editor, Pipes and Filters, Patternsearching.

Unix Shell Programming.

Platform: LINUX

Problems: Problem set should cover ihe basic features of Linuxand shell programming.

Moks Allotment: SessionalExperiment -Viva-voce -


PAPER V

Group A : Computer Organization (50 Periods)

Basic Computer Organization -Von Neumann Computer, SystemBus, Instruction Cycle, Data Representation.

Machine instruction and Assembly Language, CPL Organization,Arithmetic and Logic Unit, Control Unit, CPU.

Registers, Instruction Registers, Program Counter, Stack Pointer.

Instruction: Operation Code and Operand. Zero, One, Two andThree address instruction. Instruction types.

Addressing modes. Stack organization.

Memory: Types of Memory, RAM, ROM, EPROM, EEPROM,

--

~

Sidho-Kanho-Birsha University 14 BSc. Computer Science (Hons.)

Memory Hierarchy: CPU Register, Cache Memory, PrimaryMemory (DRAM, SRAM, SAM, PAL, PLA),

Secondary Memory and Virtual Memory, Associative memory.

ALV- Combinational ALU, 2's Complement Addition,Subtraction Unit, Booth's Algorithm for multiplication

and division.

Control Unit: Control Structure and Behaviour, HardwiredConrol and Micro programmed control: Basic Concept

I/O: Polling. Interrupts and subroutines. Memory mapped I/Oand I/O mapped I/O, DMA

Computer Peripherals: VDU, Keyboard, Mouse, Printer, Scanneretc.

CISC and RISC processors: Introduction, relative merits anddemerits

Group B : Data Communication & Internet Technology (50Periods)

Data Communication Concepts: Analog & Digital Signals,Periodic & Non-periodic signals, Time and Frequency Domain;Bandwidth and Data rate; Signal rate, Serial & Paralleltransmission, Various modes of transmission: Simplex. HalfDuplex, Duplex, Features of guided and non- guidedtransmission media, Impairments.

Purpose of Modulation & Encoding; AM, FM, PM Multiplexing:Purpose & Definition of FM & TDM.

Goals of Computer Network, LAN, MAN and WAN. OSI &TCP lIP Architecture.

Intranet and Internet; Servers and Clients; Ports; Domain Name

_...:)


Server (DNS), Accounts, Internet Service Providers; Connections:Dial Up, ISDN, ADSDN; Cable, Modem; E-Mail: Account,Sending, Receiving, Mailing List, IRe, Voice and VideoConferencing, WWW, Browsers.

Web page Design: Simple web page design through HTML,Use of CSS, Brief idea about a content Management system likeDrupal. Zoomla or it's equivalent. A brief idea about scriptinglanguage php

[Q. 1 (compulsory)contains 15 short questions having 2 marksinvolving all groups, within these 10 have to be answered. 02-Q=J will carry 16 marks (may have sub divisions), 4 from groupA, 4 from group B , within these 5 have to be answered takingat least two from each group]

PAPER VIGroup A: SAD (20 Periods)

Software Life Cycle, Different Models: Waterfall, Spiral; SoftwareRequirement Analysis & Specification, Structured Analysis, DFD,Data Dictionary, Structured Design. Structure Charts, SoftwareTesting : White Box and Black Box Testing, Software costestimation model : COCOMO

Group B: Computer Graphics (30 periods)

Introduction : Co-ordinate System, Information HandlingSoftware, Graphics Software, Area of Application, Translation,Rotation, Scaling. Matrix Representation, HomogeneousCo-ordinate System. Composite Transformation,Inverse Transformation, Computer Art, Animation,Morphing, Clipping, (only purpose). Lines, Curves and theirpresentations.

~

•r.,,--

I

Sidho-Kanho-Birsha University B.Sc. Computer Science (Hons.)16

Group C: Data Base Management System (50 Periods)

Basic concept, File Management Systems, Advantages of DBMS,ANSI/SP ARC Architecture, Physical, Conceptual and ExternalModels, ER Diagram, Data Models : Relational, Hierarchical,Network; File Organization: Sequential, Indexed Sequential,Random, Inverted; Query Languages, Relational Algebra,Relational Calculus, Functional Dependencies, Normal Forms :INF, 2NF, 3NF and BCNF; Structured Query Languages (SQL),elementary concepts of Security, Integrity.

[Q.I (compulsory) contains 15 short questions having 2 marksinvolving all groups, within these 10 have to be answered. Q2-Q9 will carry 16 marks (may have sub divisions), 2 from groupA, 2 from group B and 4 from group C, within these 5 have tobe answered taking at least one from each group]

PAPER VII

Group- A : Microprocessor (50 Periods)

Evolution of Microprocessor: Architecture of 8 bit and 16 bitmicroprocessor Machine Language Instructions, AddressingModes, Instruction Formats, Instruction Sets, instruction Cycle,Clock Cycles, Timing Diagrams, Programming a Microprocessor,Interrupts, Interfacing concepts-Memory Interfacing, I/OInterfacing and Ports? PPI 8255 Keyboard Interfacing, DisplayInterfacing, Interrupt and subroutine handling, Methods ofInterrupts, Priority and Management Case Studies : 8085 and8086 microprocessor.

[Q.I contains 7 short questions having 2 marks involving allgroups, within these 4 have to be answered. Q2- Q6 will carry14 marks (may have sub divisions), within these 3 have to beanswered]


Group B : Microprocessor Programming Laboratory : (50Periods)

Experiment with 8085A based micro computing ldts• Data movement between register - register, register-

memory, memory-memory.• Arithmetic operations on single byte, word and mufti-

byte integer, signed and hexadecimal operands.

• Ordered arrangement of a set of operands.

• Bubble Sorting. Sequential and Binary Search.

• Block Replacement and transfer.

• Parity Generator.

• Delay Routines.

Interfacing:• Display of Alphanumeric Characters on 7 segment

displays.• Matrix Keyboard Interfacing and Identification of the

keys.

Duration of Examination : 4 hours

Marks Allotment; Sessional: 05 marks, Viva-voce:l0 marks,Experiment 35 marks

PAPER VIII

Group A: RDBMS Laboratory (50 Periods)

The topics like Table creation, Data insertion, Form creationthrough front end tool are to be solve by the students througha standard DBMS package and a front-end tool. (Use of Opensource DBMS like My SQL should be encouraged)

~

~

'-' ----

Sidho-Kanho-Birsha University 18 BSc. Computer Science (Hons.)

Group B: Internet Laboratory (50 Periods)

Web Page design through HTML, Use of CSS, Web enabledsoftware design through PHP and any DBMS package, Use ofcontent management system like Drupal or Zoomla

Duration of Examination : 6 hours

Marks Allotment: Sessional: 05+05marks, Viva-voce: 20 marks,Experiment: 70 marks, one question from each group having35 marks)

Text Books:

• Introduction to Computer Science by P.K.Sinha, P. Sinha,(PHI)

• Computer Fundamentals by Anita Goel, Pearson

• Principles of Electronics by V.K, Mehta, S. Chand &Company Ltd.

• Electronics Fundamentals and Applications byD.Chattopadhay and P.CRakshit., New Age Intl (P)

• Digital Circuits, Combinational Circuit, Vol 1 by D. RoyChoudhuri, Pia tin am Publication.

• Digital Circuits, Sequential Circuit, Vol 2 by D. RoyChoudhuri, Platinam Publication.

• Digital Logic and Computer Design by M.Morris Mano,PHI

• Digital Principle and Applications by Malvino & Leach,TMH

• Digital Systems Principles and Applications by Ronal J.Tocci and Neal S. Wildmer, PHI

• Digital Fundamentals by FIoyd, Pearson Education

• Computer Architecture and Organizations, J. P. Hayes.TMH


i • Computer System Architecture by M. Morris Mano

• Computer Organization and Architecture by WilliamStallings, Pearson Education

• Electronics Devices and Circuit Theory by Boylestad,Nashelsky, PHI

• Integrated Electronics: Analog and Digital Circuits andSystems, J. Millman & CC Halkias, McGRAW Hill.

• Electronics Principles, by A.P. Malvino, TMH.

• Digital circuits by Suliivanan, Vikas Publication.

• System Programming by John J. Donovan, TMH

• Compilers Principles, Techniques and Tools, by Alfred V.Aho, Ravi Sethi and Jeffrey D. Ullman, PearsonEducation

• System Software - An Introduction to SystemProgramming by Leland L, Beck, Pearson Ed., 3rd Ed.

• Data Structure by Liptsuitz, S. Outline Series

• Data Structure by Ellis Horowitz, Sartaz Sahani,Galgotia

• Data Structure Using C by S. K. Bandyopadhyay and K.N. Dey, Pearson Education

• Data Structures and Algorithm Analysis in C by MarkAlien Weiss, 2nd Edition, Pearson Education

• Data Structure and Program Design in C by R. L. Kruse,C L. Tondo and B. P. Luing, Pears on Educa ion.

• Operating Systems by H. M. Deitel, PearsonEducation

• Operating System Concepts by A. Silberschatz, P. B.Galvin, G. Gagne, John Wiley & Sons, Inc.

• Digital Electronics Practice using IC by R. P. [ain and m.M. S. Anand, TMH

I

I,

I

i-

~

*'


• Up to TTL 7400, BPB Publication.

• Graph Theory by N. Deo, PHI

• Introduction to Graph Theory by D. B. West, PearsonEducation

• Discrete Mathematics and its Applications by Rosen,TMH

• Discrete Mathematics by C.L.Liu, TMH

• Numerical Methods for Scientific and EngineeringComputation by M.K.Jain, S.R.K.Iyengar, R.K.Jain, NewAge International Publishers

• Computer Oriented Numerical Methods by V. Rajaraman,PHI

• Introductory Methods of Numerical Analysis by S.S.Sastri,PHI

• Switching and Finite Automata Theory by Z. Kohavi,TMH

• Theory of Computer Science(Automata, Languages &Computation) by K. L. P. Misra & N. Chandrasekharan,PHI.

• The C Programming Language by B. W. Kernighan, D.M. Ritchie, PHI

• Programming through C by Richard Johnsonbaugh andMartin Kalin, Pearson Education

• C Programming Essentials by K. N. Dey, S. Bandopadhyay,Pearson Education

• A Book on C by Kelley and Pohl, Pears on Education

• Understanding C by Y.Kanetkar, BPB

• Programming in Ansi C by £. Balagurusamy, TMH.

• Computer Architecture and Organizations by J. P. Hayes,TMH.

• Computer System Architecture by M. MorrisMano.

_.\


• Computer Organization and Architecture by WiliiamStallings, Pearson Education,

• Introduction to Microprocessor by Gaonkar, PenrumPublishers.

• Microprocessor and Peripherals by Choudhury etal,Scitech Publishers.

• Introduction to Microprocessors by A. P. Mathur,TMH.

• Fundamentals of Microprocessors & Microcomputers byB. Ram, Dhanpat Rai Publications.

• Data Communications and Networking by Behrour A.Forouzan,TMH.

• Data and Computer Communication by William Stallings,Pearson Education.

• Computer Networks by Tanenbaum, PearsonEducation.

• Object Oriented Programming with C++ by Balagurusamy,TMH

• Object Oriented Programming with C++ by Robert Lafore,PHI

• An Integrated Approach to Software Engineering byPankaj Jafote, Narosa Publishing House

• Fundamentals of Software Engineering, Rajib Mall,PHI

. • Software Engineering by Pressman

• Introduction to System Analysis and Design by IgorHawryszkiewycz, PHI

• Fundamental of Computer Graphics and Multimedia byD. P. Mukherjee, PHI

• Computer Graphics by Heam and Baker, PHI• Database System Design by Elmasri, Navathe, Somayajulu,

Gupta, Pearson Education

~

~

.~.~.~


• Database Systems; Concept, Design and Application by S.K. Singh, Pears on Education, 1st Edition

• An introduction to Database Systems by Ci]. Date,A.Kannan, S.Swamynathan, Pearson Education

• Relational Database Design by [an L. Harrington, AnImprint of Elsevier

• SQL / PL / SQL The Programming language of Oracleby Ivan Bayross, BPB.

• Unix Shell Programming by Y. Kanetkar, BPB.

• Your UNIX: The Ultimate ·Guide by Surnitava Das.

-

Documents

admin.manbhummv.inadmin.manbhummv.in/file/dept_syll/12dept_syll.pdf · Sidho-Kanho-Birsha Un iversity 6 B.5c.Computer Science(Hons.) [Q.I(compulsory) contains 15short questions having