1 University of Rajshahi Department of Computer Science and Engineering Syllabus for B. Sc. (Hons) Session 2005-2006 B.Sc. (Hons) Part-I Examination 2006 B.Sc. (Hons) Part-II Examination 2007 B. Sc. (Hons) Part-III Examination 2008 B.Sc. (Hons) Part-IV Examination 2009The B. Sc. (Honours) Courses in Computer Science and Engineering shall be offered over the period of 4 academic years, and Degree must be completed within 6 academic years. Courses consist of Theoretical, Practical, Viva-Voce, Tutorial/Terminal/Class test and Attendance, and courses are of 3200 Marks. Marks 75 and 50 represent 1 and 0.5 unit respectively. One unit makes 4 credits. The Examination of one unit theoretical course shall be of four hours duration and half unit shall be of three hours. Practical Examin ation shall be of (i) 6 hours (one day) duration for less than one unit, (ii) 6x2 hours (two days) duration for 1-2 unit and (iii) 6x3 hours (3 days) duration for more than 2 units. 50 marks of Tutorial/Terminal/Class test and attendance will be distributed as: 80% for Tutorial/Terminal/Class test and 20% for class attendance. Practical marks will be distribut ed as follows: continuous assessment shal l be of 30% and practical exper iments shall be of 70%. Year-wise distribution of Courses along with title, Unit , Marks and Credit are as follows: B.Sc. (Hons) Part-I Examination 2006 Honours Course: Unit Marks Credit CSE 101: Computer Fundamentals1 75 4 CSE 102: Introduction to Programming with C and C++ 1 75 4 CSE 103: Electronics and Electrical Circuit Analysis 1 75 4 CSE 104: Digital Systems 1 75 4 CSE 105: English (Optional) 0.5 - 0 Related Course: CSE 110R : Algebra, Trigonometry and Vectors (Math-111) 1 75 4 CSE 111R : Integral and Differential Calculus (Math-112 ) 1 75 4 CSE 112R : Elementary Statistics & Probabilities 1 75 4 Practical Course: CSE 106P: Programming Lab 0.5 50 2 CSE 107P: Digital Systems and Electronics Lab 1 75 4 Sessional and Viva-Voce: CSE 108T: Tutorial, Terminal , Attendance and Class test 0.5 50 2 CSE 109V: Viva-Voce 0.5 50 2 Part-I, Total= 9.5 750 38 B.Sc. (Hons) Part-II Examination 2007 Honours Course:CSE 201: Computer Architectur e and Organizati on 1 75 4 CSE 202: Data Structure and Algorithms 1 75 4 CSE 203: Object Oriented Programming 1 75 4 CSE 204: Communication Engineering 1 75 4 CSE 205: Discrete Mathematics and Numerical Methods 1 75 4 Related Course: CSE 210R : Matrices and Different ial Equations (Math-113) 1 75 4 CSE 211R : Theory of Statistics 1 75 4
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
FET and IC Fabrication Technique; CMOS Technology; Monolithic Diodes; Metal-Semiconductor Contract; IC
Resistor and Capacitor; IC Packaging; Characteristics of IC Components; Micro-Electronic Circuit Layout;
Printed Circuit Board.
Circuit analysis: Concepts of Electrical Networks; Kirchhoff’s law; Thevenin’s Theorems and Norton’sTheorems; Superposition Theorem; Maximum Power Transfer Theorem; Equivalence of Pi, T, Star, Delta
Conversions; Constant K-Type Low Pass, High Pass, Band Pass and Band-Elimination Filters.
Books Recommended
1. Mottershead, A : Electronic Devices and Circuits
Switching Devices: Switching concepts of Diodes, Transistors and FETs.
Flip-Flops and related Devices: Transistor Latch, NAND gate latch, NOR gate latch, D latch. Clock signals and
Clocked F.Fs: Clocked S-C, J-K and D Flip-Flops. F.F timing considerations, Master/Slave F.Fs. F.F T-F.F.
applications, Frequency division and counting. Schmitt Trigger devices, Monostable and Astable Multivibrators.SSI Logic Circuits: BCD to decimal decoders, BCD to 7 segment decoder/drivers. Encoders, Multiplexers and
their applications. Demultiplexers. Trouble shooting case studies.
Analog to digital conversion, digital ramp, successive approximation, flash and tristate ADC. digital to analog
conversion: circuits, specifications, applications, Sample and hold circuits. Analog multiplexers. Data
acquisition, digital voltmeter.
Integrated Circuit Logic Families: DTL & TTL logic family, standard TTL series characteristics, other TTL
series, TTL loading rules, TTL open-collector outputs, tristate TTL. The ECL family. Digital MOSFET circuits,
Introduction to sequential circuits: formal representation of sequential circuits, Moore and Mealy models,
analysis and synthesis of synchronous and asynchronous sequential circuits. Counters and Registers:Asynchronous (Ripple) up and down counters, Synchronous up and down Counters. Counters with MOD
System Organization: Communications: Introduction, bus control; IO Systems: Programmed IO, DMA and
interrupts, IO processors.
Parallel Processing: Basic Concepts: Introduction to parallel processing.
RISC processor, introduction, data dependency, addressing modes, condition codes, register sets, brief study of
standard RISC processor.
Books Recommended
1. V. Hamacher, Z. Vranesic and
S. Zaky
: Computer Organization. 3rd
ed., McGraw-Hill, 1988.
2. J.P. Hayes : Computer Architecture and Organization, 2nd
ed., McGraw-Hill, 1992.
3. K. Hwang and F.A. Briggs : Computer Architecture and Parallel Processing, McGraw-Hill, 1986.4. W. Stallings : Computer Organization and Architecture.
CSE 202: Data Structure and Algorithms
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
The design and analysis of efficient algorithms for important computational problems. Emphasis on the
relationships between algorithms and data structures and on measures of algorithmic efficiency.
Arrays: Maximization, ordered lists, sparse matrices, representation of arrays.
Stacks, Queues and Recursion: Fundamentals of different types of stacks and queues: Circular, dequeues, etc;
evaluation of expressions, multiple stacks and queues; Recursion: Direct and indirect recursion, depth of
recursion; Simulation of Recursion: Removal of recursion; Towers of Hanoi.
Links Lists: singly linked lists, linked stacks and queues, the storage pool, polynomial addition, equivalence
merge sort, How fast can we sort? Sorting on several keys, practical considerations for internal sorting.
External Sorting: General idea; Sorting with Disks: K-way merging, buffer handling for parallel operation, run
generation; sorting with Tapes: Balanced merge sorts, polyphase merge, sorting with fewer than 3 tapes.
Symbol Tables: static tree tables, dynamic tree tables; Hash Tables: Hashing functions, overflow handling,theoretical evaluation of overflow techniques.
1. E. Horowitz and S. Sahni : Fundamentals of Data Structures, Galgotia, 1985.
2. Reingold : Data Structures.
3. Robert L. Kruse : Data Structures and Program Design, 3rd
Edition.
4. Niklaus Wirth : Algorithms-Data Structures-Programs, Prentice Hall of India, 1992.
5. Lipshultz : Data Structures, Schaum's Outline Series, 1987.
6. E. Horowitz and S. Sahni : Computer Algorithms, Galgotia, 1985.7. Goodman and Hedetnie : Introduction to Design and Analysis of Algorithms, McGraw-Hill, 1985
CSE 203: Object Oriented Programming
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
Introduction to object oriented programming, C++ as an object oriented language: Declaration and constants,
expression and statements, data types, operator, Functions. Classes: Base, Derived virtual class, Inheritance,
encapsulation, Operator and function overloading (Run-time and compile time polymorphism), Template,
streams, tiles, C++ binary functions. Exception handling, Function overriding, Virtual function
An Introduction to Java. The Java Programming Environment, Fundamental Programming Structures in Java,
Object and classes, Inheritance. Interfaces and Inner Classes Graphics Programming, User Interface
Components with swing, Applets, Exceptions and Debugging, Streams and Files. Controlling Program Flow,Intitialization & Cleanup, Hiding the implementation. Ressing classes, Polymorphism, Interfaces & Inner
Classes, Holding your objects, error handling with exceptions, The Java I/O system, Run-time type
interfacing with memory, monitor, printers, keyboard; design of computer controlled system using serial and
parallel ports.
Interfacing with real world: Signal conditioning techniques, interfacing with sensors, transducer, measurementof different electrical quantities- voltage current etc., interfacing with ADC and DAC to control real world
devices, stepper motor, motor speed control, smart data acquisition card design, temp control.
Books Recommended
1. Rafiquzzaman : Microprocessor and Microcomputer based system design
2. D. V. Hall : Microprocessors and Interfacing, McGraw-Hill, 1987.
3. Y. Liu and G. A. Gibson : Microcomputer Systems: 8086/8088 Family, Prentice-Hall, 1991.
4. Artwick : Microcomputer Interfacing
5. Ramesh Goanker : Microcomputer Interfacing
6. James E. Powell : Designing User Interfaces
CSE 302: Operating Systems and System ProgrammingLecture: 60, Unit: 1, Marks: 75, Credit: 4
Introduction, evolution, goals and components of OS. Process management, process states and state transition,
process control blocks, job and process scheduling, scheduling levels, objective and criteria, CPU scheduling
algorithms, process co-ordination, critical section problems, semaphores, language constructs classical problems
of process co-ordination, interprocess communication, message and mailbox etc. I/O programming. Device
Introduction: Introduction to Computer Networks, Network Goals and Applications, Network Architectures,
OSI reference model, TCP/IP model and terminology, Connectionless and Connection Oriented services,
Network Topologies, Service primitives, Public Networks, The ARPANET, SNA.
Physical Layer: Circuit switching and Packet switching, X-25 protocol, ISDN, BISDN, Frame relay and Cell
relay.
Medium Access Sublayer: Static and Dynamic channel allocation in LAN and MAN, LAN Cables, Pure and
slotted ALOHA, Persistent and Non persistent CSMA, CSMA with collision detection and collision free
protocols, IEEE standard 802.3 and Ethernet, Token Bus and Token Ring, FDDI, Fibernet II, DATAKIT.
Data Link Layer: Service provided to the network layer, Framing, Flow control, Error detecting and Correcting
Codes, Stop-and-Wait protocol, Sliding Window protocol, Go Back n protocol, Selective Repeat protocol,
Performance of Stop-and Wait and Sliding Window protocol, Data Link layer in Public network and
ARPANET.
Network Layer: Service provided to the Transport layer, Internal organization of Network layer, Routing
algorithms, Internetworking, Router, Bridge, Gateway, Network layer in Public network and ARPANET.
Transport Layer: Services provided to the Session layer, Quality of service, Transmission Controls protocols,
Connection management, Addressing, Establishing and Releasing Connection, Flow control and Buffering,
Multiplexing, Transport layer in Public network and ARPANET.
Session Layer: Services provided to the Presentation layer, Data exchange, Synchronization, Dialog andActivity management, OSI session service primitives.
Presentation Layer: Data Compression techniques, Frequency Dependent Coding, Context Dependent Encoding,
Cryptography, Traditional Cryptography, Data Encryption Standard, Public key cryptography, MIT algorithm.
Application Layer: File transfer Access and management, Electronic Mail, Virtual Terminal, Client Server,
Other applications, OSI service elements.
Internet: Introduction to internet and intranets, internet protocols, Internet services and goals, Domain Name
System (DNS) and Addresses, FTP, Gopher and Telnet, World Wide Web (WWW), Internet Relay Chat (IRC),
variable elemination, reduction in strength, code motion.
Compile time error handling, error detection, error recovery, error repair.
Code generation, object programs, problems in code generation, a machine model, a simple code generator,
register allocation and assignment peephole optimization.
Books Recommended
1. A.J. Holub : Compiler design in C, Prentice-Hall of India, 1993.
2. Trembly and Sorensen : Theory and Practices of Compiler Writing
3. Aho and D. Ullman : Compiler Design.
4. Hopcroft and Ulman : Introduction to Automata Theory, Languages and Computation
5. Adamek : Automata and Algebra
CSE 306: System Analysis and Design
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
Introduction to information systems, general design consideration of information systems.
Overview: system concepts and the information systems environment, information needs, the concepts of MIS,the system development life cycle, the role of the systems analysis.
Systems Analysis: Systems planning and the initial investigation, information gathering, the tools of structured
Systems Design: The process and stages of systems design, input/output and forms design, file organization and
data base design.
System Implementation: system testing and quality assurance, implementation and software maintenance,
hardware/software selection, project scheduling and software, Security, disaster/recovery, and ethics in system
development.
Case studies of various information systems such as: Library management system, inventory system, voteridentity management system, payroll system, etc.
Introduction to selected topics in AI: Game Playing, Planning, Understanding, Natural language processing,
Expert system, Genetic algorithm, robotics and Fuzzy logic.
An Overview on Artificial Intelligence Programming Languages: Prolog, Visual Prolog, LISP etc.
Neural Networks: Basic concept and structure of neural networks, Learning rules, Back propagation rule,
Hopfield network, neural network as an object classifier.
Books Recommended
1. Dan W. Patterson : Introduction to Artificial Intelligence and Expert Systems.
2. E. Rich and K. Knight : Artificial Intelligence, Tata-McGraw-Hill Publication Co. Ltd, 1992.3. H. Schildt : Artificial Intelligence Using C, Osborne-Mc-Graw-Hill, 1987.
4. C.F. Chabris and T. Jackson : An Introduction to Neural Computing, Adam Hilger Pub, 1990.
5. Books on Prolog, Lisp etc.
CSE 308: Computer Graphics and Multimedia System
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
Introduction: A survey of Computer Graphics, Overview on basic components of Computer Graphics, Graphics
Input devices, Architecture of Graphics display devices, Video memory.
Fundamental Graphics Algorithms: Scan Conversion of Points and Lines, Line drawing algorithm, DDA
algorithm, Bresenham’s Line algorithm, Bresenham’s circle drawing algorithm, Loading the frame buffer, circle
generating algorithm, Midpoint circle algorithm, Ellipse generating algorithm, Midpoint Ellipse algorithm, pixeladdressing, Region Filling algorithms.
Clipping Operations: Point clipping, line clipping, polygons clipping, curve clipping, text clipping
Implementation of Computer Graphics: Co-ordinates Transformations, Two and Three dimensional
Transformation, Viewing and Clipping, Projections, 3D object representations, Curves and Surface Design,
mathematics method, Raster graphics systems, Image synthesis methods, Ray tracing, Shadow mapping, color
and shading models.
Multimedia systems – introduction; Coding and compression standards; Architecture issues in multimedia;
Operating systems issues in multimedia – real-time OS issues, synchronization, interrupt handling; Database
issues in multimedia – indexing and storing multimedia data, disk placement, disk scheduling, searching for amultimedia document; Networking issues in multimedia – Quality-of-service guarantees, resource reservation,
thresholding and region oriented segmentation, Morphological image processing. Image processing on remote
sensing data.
Matlab: Introduction, Interactive computing, Programming in MATLAB; Script and functions, Applications.
Matlab toolboxes (User of); Digital Signal Processing and Image Processing.
Books Recommended
1. Defatta : Digital Signal Processing
2. Rafeal C. Gonzalez & Richard E. Woods : Digital Image Processing.
3. Gordon E. Carlson : Signal and Linear System Analysis
4. Rudra Pratap : Getting Started with Matlab V6
CSE 404: Cryptography and Network Security
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
Overview, Terminology, Substitution and Transposition ciphers, One time pads, Symmetric Ciphers, classical
Encryption Technique, Block Ciphers and the Data Encryption Standard, Introduction to Finite Fields,Advanced Encryption Standard, Contemporary, Symmetric Ciphers Confidentiality Using Symmetric
Encryption Public, Key Encryption, One way functions and Hash Functions, Introduction to Number Theory,
Prime number generation, Public-Key Cryptography and RSA, Key Management, Key exchange algorithm;
Other Public-key Cryptosystems, Message Authentication and Hash Functions, Hash Algorithms, MD5, SHA,
Digital Signatures and Authentication Protocols, DSA, Kerberos, Network Security Practice, Authentication
Digital certificates and Public key infrastructure, X.500, Application Electronic Mail Security, IP Security, Web
Security, System Security, Intruders, Malicious Software, Firewalls.
Books Recommended
1. Bruce Schneier : Applied Cryptography, John Wiley & Sons, Inc.
VLSI design methodology: top-down design approach, technology trends, introduction to MOS technology,
operation of MOS transistor as a switch and amplifier, MOS, NMOS, CMOS inverters, pass transistor and pass
gates: DC and transient characteristics. Brief overview of fabrication process: NMOS, CMOS, Bi-CMOS
process. NMOS and CMOS layout, stick diagram, and design rules. CMOS circuit characteristics and performance estimation: resistance and capacitance, rise and fall time, power estimation. Buffer circuit design.
Introduction to Bi-CMOS circuits. Shifter, adder, counter, multipliers. Data Path and memory structures. Design
style: FPGA and PLDs.
Introduction to HDL: basic digital design using VHDL.
Books Recommended
1. Basic VLSI design: System &
Circuit
: K. Eshraghian & D. A. Pucknell - Prentice Hall
2. R. K. Brayton et al. : Logic Minimization Algorithems for VLSI Synthesis.
3. F. Lombardi : Testing and diagnosable Design of VLSI and ULSI.
4. C. A. Mead and L. A. Conway : Introduction to VLSI Systems.
CSE 406: Computer Simulation and Modelling
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
Simulation methods: Introduction to Simulation, Random number generator, analogue simulation of continuous
system, Discrete system simulation, Simulation of a pert network, Statistical analysis of result, Validation and
verification techniques, Application of simulation to problems e.g. business, operation research, operating
system, Computer design, Introduction to simulation packages, Computer animation.
Modelling :- Introduction to modelling techniques, Problems, models and systems, Modelling concepts, Logic
for (conceptual) modelling, Logic programming for conceptual modelling, Concepts of relational modelling and
its practice. Some practical modelling e.g. Relational Database modelling, Different methods for Curves and
surface modelling, Fractals, Polyhedral modelling with Euler’s formula, Advanced modelling, Proceduralmodels. Case Study: Simulation and Modeling software: SimScript.
Books Recommended
1. J. A. Spriet : Computer Aided Modeling & Simulation.
2. R. S. Lehman : Computer Simulation and Modeling.
3. G. Cordon : System Simulation.
4. James D. Foley Andries van Dam : Computer Graphics.
CSE 407: E-Commerce
Lecture: 60, Unit: 1, Marks: 75, Credit: 4
E-Commerce Basics: E-Commerce Definition, Internet History and E-Commerce Development, Business-to-Business E-Commerce, Business-to-Consumer E-Commerce, E-Commerce Stages and Processes, E-Commerce
Challenges, E-Commerce Opportunities .
E-Commerce Options: Internet Access Requirements, Web Hosting Requirements, Entry-Level Options,
Storefront and Template Services, E-Commerce Software Packages, E-Commerce Developers, E-Business
Solutions.
Marketing Issues: Online and Offline Market Research, Data Collection, Domain Names, Advertising Options,
E-Mail Marketing, Search Engines, Web Site Monitoring, Incentives.
Planning and Development: Web Site Goals, International Issues, Planning Stages, Resource Allocation,
Content Development, Site Map Development, Web Site Design Principles, Web Site Design Tools, Web Page
Programming Tools, Data-Processing Tools. E-Commerce Components: Navigation Aids, Web Site SearchTools, Databases, Forms, Shopping Carts, Checkout Procedures, Shipping Options. .