#1
22nd June 2015, 08:22 AM
| |||
| |||
MCA from NIT Calicut
My brother wish to take admission in MCA programme from National Institute of Technology Calicut, so I need MCA programme details, would you like to provide here???
|
#2
22nd June 2015, 11:54 AM
| |||
| |||
Re: MCA from NIT Calicut
National Institute of Technology Calicut MCA programme admission details are as given below: MCA Programme: Duration: 3 years Present Intake: 46 Eligibility; The applicant should have a bachelors degree in relevant discipline from any recognized University. Selection procedure: Admissions are through the National Institutes of Technology - MCA Entrance Test (NIT NIMCET) conducted at national level. Syllabus: NIT Calicut MCA Syllabus Semester 1 Code Title L T P C 1 MAG501 Discrete Mathematics 3 1 0 3 2 MAG502 Probability and Statistics 3 1 0 3 3 CSU101 Computer Programming 3 0 0 3 4 CSU202 Logic Design 3 0 2 4 5 SHU111 Professional Communication 3 0 0 3 6 CSM591 Programming Lab 0 0 5 3 Total Credits 19 Semester 2 Code Title L T P C 1 MAG503 Graph Theory and Combinatorics 3 1 0 3 2 CSU215 Computer Organisation 3 0 2 4 3 CSU213 Database Management Systems 3 0 0 3 4 CSU211 Formal Languages and Automata 3 0 0 3 5 CSU230 Program Design 3 0 2 4 6 CSU296 DBMS Lab 0 0 3 2 Total credits 19 Semester 3 Code Title L T P C 1 MAG505 Number Theory & Applications 3 1 0 3 2 MEG501 Principles of Industrial Management 3 0 0 3 3 CSU203 Data Structures and Algorithms 3 0 0 3 4 CSU304 Computer Networks 3 0 0 3 5 Elective 3 0 0 3 6 CSU291 Data Structures Lab 0 0 5 3 Total credits 18 Semester 4 Code Title L T P C 1 CSU313 Operating Systems 3 0 0 3 2 CSU303 Compiler Construction 3 0 0 3 3 CSU321 Software Engineering 3 0 0 3 4 MEG502 Principles of Financial Management 3 0 0 3 5 Elective 3 0 0 3 6 CSU392 Compiler Lab 0 0 5 3 Total credits 18 Semester 5 Code Title L T P C 1 MAG504 Numerical Analysis & Optimization Techniques 3 1 0 3 2 Elective 3 0 0 3 3 Elective 3 0 0 3 4 Elective 3 0 0 3 5 Elective 3 0 0 3 6 CSM581 Seminar 0 0 3 1 Total credits 16 Semester 6 Code Title L T P C 1 CSM599 Project - - - 15 Total credits 15 Minimum Requirement A student should have earned a total of at least 105 credits. Notes: •The electives can be chosen from the list of elective courses offered by the department for the B.Tech / MCA Programmes. •Final year students satisfying the standard requirements can credit elective courses of the M.Tech program, with consent of the department. •Students can also credit global electives, with permission from the department. List of Elective Courses Sl. No Code Title L T P C 1 CSU339 Advanced Data Structures 3 0 0 3 2 CSU358 Communication and Information Theory 3 0 0 3 3 CSU301 Design and Analysis of Algorithms 3 0 0 3 4 CSU363 Computational Intelligence 3 0 0 3 5 CSU371 Logic for Computer Science 3 0 0 3 6 CSU334 Web Programming 3 0 0 3 7 CSU331 Computer Graphics and Multimedia 3 0 0 3 8 CSU341 Distributed Computing 3 0 0 3 9 CSU343 Embedded System Design 3 0 0 3 10 CSU411 Computer Security 3 0 0 3 11 CSU353 Mobile Communication Systems 3 0 0 3 12 CSU354 Electronic Commerce 3 0 0 3 13 CSU333 Object Oriented-Analysis & Design 3 0 0 3 14 CSU431 Advanced Database Management Systems 3 0 0 3 15 CSU441 Advanced Computer Architecture 3 0 0 3 16 CSU352 Coding Theory 3 0 0 3 17 CSU356 Mobile Computing 3 0 0 3 18 CSU361 Image Processing 3 0 0 3 19 CSU362 Pattern Recognition 3 0 0 3 20 CSU364 Natural Language Processing 3 0 0 3 21 CSU373 Computational Complexity 3 0 0 3 22 CSU471 Advanced Topics in Algorithms 3 0 0 3 23 CSU472 Quantum Computation 3 0 0 3 24 CSU305 Theory of Computation 3 0 0 3 25 CSU315 Computer Hardware 3 0 0 3 26 MAU333 Stochastic Processes for Engineers 3 1 0 3 27 MAG521 Simulation and Modelling 3 1 0 3 28 MAU329 Fuzziness and Soft Computing 3 1 0 3 29 MAU325 Decision Modelling Technique 3 1 0 3 30 MAU342 Topics in Algebra 3 1 0 3 31 MAU326 Integer Optimization and Network Models 3 1 0 3 32 MAU336 Design and Analysis of Experiments 3 1 0 3 33 MAU335 Forecasting Techniques 3 1 0 3 34 MAU324 Fuzzy Optimization 3 1 0 3 NATIONAL INSTITUTE OF TECHNOLOGY CALICUT DEPARTMENT OF COMPUTER ENGINEERING Master of Computer Applications (MCA) (From 2006 Admissions) Syllabi of the Courses Offered by the Department of Computer Engineering PART I : CORE COURSES CSU 101 COMPUTER PROGRAMMING Pre-requisite: NIL Module I Introduction to computers and software (3 Hours) Problem solving, algorithm design, and algorithm analysis (mention only) (3 Hours) Design methodologies: (6 Hours) Stepwise refinement: Modules and Interfaces. Object oriented methodology: Encapsulation, Inheritance, Polymorphism Module II Programming language concepts and constructs: Expressions, Statements, selection, repetition. (11 Hours) Module III Functions, recursion, I/O mechanisms (Exceptions optional) (10 Hours) Module IV Data types: Primitive types and structured types (4 Hours) Coding practices: (3 Hours) Indentation guidelines, naming conventions, documenting code, debugging Testing: Verification methods, test data selection. (2 Hours) Note: Programming language C++ / Java may be used as a vehicle to achieve the goal. Text Books: 1.Bruce Eckel, Thinking in Java, 3/ed, Available online at 2. Bruce Eckel, Thinking in C++, 2/ed. Vol I and II, Available online at References: 1. Robert Lafore, Object Oriented Programming in Turbo C++, The Waite Group’s, Galgotia Publications Pvt. Ltd. 2000. 2. Rebecca Thomas, Lawrence R Rogers, Jean L Yates, Advanced Programmer’s Guide to UNIX System V, McGraw Hill International Edition, Computer Science Series. 3. Patrick Naughton, Herbert Schildt, Java TM 2: The Complete Reference, Tata McGraw-Hill Publishing Company Ltd. 3/ed 4. Danny Kalev, The ANSI/ISO C++ Professional Programmer’s Handbook, PHI 2000. CSU 202 LOGIC DESIGN Pre-requisite: CSU 101 Computer Programming Module I (10 + 5 Hours) Number Systems and codes, Boolean algebra: postulates and theorems, constants, variables and functions, switching algebra, Boolean functions and logical operations, Karnaugh map: prime cubes, minimum sum of products and product of sums, Quine- McClusky algorithm, Combinational Logic: analysis and design of combinational logic circuits, parallel adders and look-ahead adders, comparators, decoders and encoders, code conversion, multiplexers and demultiplexers, parity generators and checkers, ROMs, Module II (10 + 5 Hours) PLAs, .PLA minimization, PLA folding, design for testability, Counters and shift registers: excitation tables, ripple counters, synchronous counters, up-down counters, design of sequential circuits, shift registers and their applications. Clock mode sequential machines. Module III (11 + 10 Hours) Microprocessor architecture: real mode and protected mode memory addressing, memory paging. Addressing modes: data addressing, program memory addressing, stack memory addressing. Data movement instructions, Arithmetic and logic instructions, Program control instructions, Programming the microprocessor: modular programming, using keyboard and display, data conversions, disk files, interrupt hooks, using assembly language with C/C++. Module IV (11 + 8 Hours) Memory interface: memory devices, address decoding, 16 bit (8086), 32 bit (80486) and 64 bit (Pentium) ,Hardware architecture for embedded systems-processor-memory-latches and buffers-display unit-16 and 32 bit processors. Memory interfaces, dynamic RAM. I/O interface: port address decoding, PPI, 8279 interface, 8254 timer interface, 16550 UART interface, ADC/DAC interfaces, Interrupts- Interrupt controller, DMA Controller. References: 1. N. N. Biswas, Logic Design Theory, Prentice Hall of India, New Delhi, 1993. 2. T. L. Floyd, Digital Fundamentals, 3/e, Universal Book Stall, New Delhi, 1986. 3. B. B. Brey, The Intel Microprocessors 8086 to Pentium: Architecture, Programming and Interface, 6/e, Prentice Hall of India, New Delhi, 2003. 4. Programming for embedded systems Dream Software team , Willey 2002 5. H. P. Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997. 6. A. K. Ray, and K. M. Bhurchandi, Advanced Microprocessors and Peripherals, Tata McGraw Hill, 2000. 7. D. V. Hall, Microprocessors and Interfacing: Programming and Hardware, 2/e, Tata McGraw Hill, New Delhi, 1992. CSM 591 PROGRAMMING LAB Pre-requisite: CSU 101 Computer Programming Module I (5 Lab Sessions) HCF (Euclid’s algorithm) and LCM of given numbers - find mean, median and mode of a given set of numbers – Conversion of numbers from binary to decimal, hexadecimal, octal and back – evaluation of functions like ex, sinx, cosx etc. for a given numerical precision using Taylor’s series – testing whether a given number is prime. Module II (3 Lab Sessions) String manipulation programs: sub-string search, deletion – lexicographic sorting of a given set of strings – generation of all permutations of the letters of a given string using recursion.. Module III (3 Lab Sessions) Matrix operations: Programs to find the product of two matrices – inverse and determinant (using recursion) of a given matrix – solution to simultaneous linear equations using Jordan elimination. Module IV (3 Lab Sessions) Files: Use of files for storing records with provision for insertion, deletion, search, sort and update of a record. References 1. H. Schildt, C: The Complete Reference, 4/e, Tata McGraw Hill, 2000. 2. H. H. Tan and T. B. D'Orazio, C Programming for Engineering & Computer Science, McGraw Hill, 1999. 3. T. H. Cormen, C. E. Lieserson, R. L. Rivest, Introduction to Algorithms, PHI, 1998. Here is the attachment for NIT Calicut MCA syllabus: |
|