New BCSE Syllabus suggested
Guys this is the newly suggested syllabus for BCSE,JU. Your comments and thoughts are welcome.
BCSE Syllabus Proposal
Arun Saha, Amit Duttasaha,
Graduate Student
University of California, Riverside
The current syllabus is available at http://groups.yahoo.com/group/jualumni_syllabus/files/Computer%20Science/bcse_current%20_syllabus.doc
Highlights
There are no separate theory and sessional courses. The labs are integral part of the theory course. There is no necessity of the following courses:
Workshop lab
Technical Arts lab
Engg. Drawing labs
Manufacturing lab
Engg. Mech
Electrical Tech
Extensive Electronics theory and labs
Material Science
There should be more emphasis on Computer Science theory and programming skills.
Acknowledgement
This is based upon Sandip Ray’s proposal at http://groups.yahoo.com/group/jualumni_syllabus/files/Computer%20Science/bcse-syllabus.txt
First, we give an overview of the course organization. The contents of individual courses and texts are suggested next.
1st Year1st Sem
1st Year 2nd Sem
Math 1
Physics 1
Math 2
Introduction to Programming in C
Math 3
Digital Logic
Numerical Methods
Data Structures
2nd Year1st Sem
2nd Year 2nd Sem
Digital Design
Graph Theory and Combinatorics
Communication Systems
Formal Language and Automata
Programming Languages
Computer Organization and Design
Computer Graphics
Integrated Circuits, VLSI
3rd Year1st Sem
3rd Year 2nd Sem
Computer Architecture
Databases
Systems Programming
Computer Networks
Operating Systems
Artificial Intelligence
4th Year1st Sem
4th Year 2nd Sem
Logic and Functional Programming
Compilers
Design and Analysis of Algorithms
B. Tech Project
One advanced course, preferably involving reading technical papers. Can be chosen but not limited to:
Satellite and Wireless networks
Theory of Computation
Data Mining
Course Name
Math 1
Contents
Topics from integral calculus, improper integrals, infinite series, Taylor's series, and Taylor's theorem, matrices and linear functions, determinants, partial derivatives, Rolle's Theorem, Mean value theorem
Text
Comments
Course Name
Math 2
Contents
Sets, Relations, functions, Partial Orders. Lattices. Groups. Matrices and Determinants. Basic (axiomatic) probability, random variables, Methods of proof, mathematical induction, recursive definitions and algorithms, program correctness. Basics of counting, Pigeonhole principle, inclusion-exclusion techniques
Text
Comments
Course Name
Math 3
Contents
Theory of matrices and systems of linear equations, Gaussian elimination and pivoting, vector spaces, linear independence and linear transformation, orthogonality, eigenvalues, and eigenvectors.
Text
Comments
Course Name
Physics 1
Contents
Basic Quantum mechanics: Wave-particle duality; the Schrödinger equation; superposition, the uncertainty principle; and one-dimensional harmonic oscillator, Tunneling effect. Excitation levels and importance of Solid State Physics. Quantum mechanics as Unitary transformations. Basic Electronics. Electrons and Holes. Basic Semi-conductor Physics. Partial Differential Equations characterizing transistors. BJT's, FET's, MOS: an overview.
Text
Ben Streetman: Solid State Physics
Comments
Course Name
Data Structures
Contents
Idea of Data types and Abstractions. Basic Structures like arrays,
linked-lists, stacks, queues. Hashing, Heaps. Elementary ideas of recursion. Simple sorting algorithms. Trees and Tree traversals. Binary search tree,
Text
Data Structures and Program Design In C (2nd Edition) by Robert L. Kruse, et al
Weiss: Data Structures and Algorithms in C++ (May be replaced by Java book if deemed appropriate).
Cormen Leiserson, Rivest: Introduction to Algorithms
Comments
Implementation of different sorting algorithms
Implementation of simple stacks, queue, trees
Course Name
Digital Logic
Contents
Boolean Logic and importance in computer design. Basic gates, And, or, NOT. NAND and NOR as (only) universal gates. Representation of numbers, viz., binary, octal, hexadecimal. Arithmetic with these representations. Signed and Unsigned arithmetic. Boolean functions from Truth Tables. Karnaugh maps and minimization. Simple combinatorial circuit designs like adder, subtractor, parity circuits, encoders, decoders etc. Quine McKluskey's method. Storage elements, e.g., multiplexors, decoders, comparators, multipliers, flip-flops, registers etc. Parallel and Shift registers.
Text
Mano
Comments
If there is some hardware modeling tools available that will be great. Active HDL is a good tool for modeling in VHDL. Look at http://www.aldec.com/ActiveHDL/university_Studentedition.htm
Course Name
Digital Design
Contents
State-machine design, Design of sequential circuits. Asynchronous and synchronous counters as generalized sequential circuits. Datapath design using different components like MUX, ALU, RegisterFile. Introduction to FSM+D design. Simple CPU design.
Text
Comments
Course Name
Introduction to Programming in C
Contents
Text
The C Programming Language. Kernighan, Ritchie
Comments
Course Name
Numerical Methods
Contents
A study of numerical methods for determining solutions to nonlinear equations and simultaneous linear equations. Topics also include interpolation, techniques of error analysis, and computer applications. Numerical integration, and the numerical solution of ordinary differential equations. Integrates numerical linear algebra and extensive computer use with these topics.
Text
Comments
Numerical Recipes in C : The Art of Scientific Computingby William H. Press (Author), Brian P. Flannery (Author), Saul A. Teukolsky (Author), William T. Vetterling (Author)
Course Name
Graph Theory and Combinatorics
Contents
Text
Comments
Course Name
Communication Systems
Contents
Text
Comments
Course Name
Formal Language and Automata
Contents
Formal grammars, finite-state automata, push-down automata
Text
Comments
Course Name
Programming Languages
Contents
Text
Comments
Course Name
Computer Organization and Design
Contents
Computer instructions and addressing modes; memory organization; interrupt and trap processing; input/output (I/O) and communications; assembly language programming;
Text
Comments
Course Name
Computer Graphics
Contents
A study of the fundamentals of computer graphics necessary to design and build graphics applications. Examines raster graphics algorithms including scan-converting graphics primitives, anti-aliasing, and clipping. Also covers geometric transformations, viewing, solid modeling techniques.
Text
Comments
Course Name
Integrated Circuits, VLSI
Contents
Text
Comments
posted by Sayan @ 2:23 AM
0 Comments:
Post a Comment
<< Home