What would you like to do?
What is the syllabus for MSc Computer science in MG university in2011?
rtm nagpur university mathematics sillybus
bsc computer science 6th sem syllabus in theruvalluvar university
MSc Computer Science and MCA are Post Graduation in Computing.Computer Application given preference to Software Applications whereas Computer Science gives Preference in Devel…opment of Computer Architecture,Computer System Development,Algorithm and Flow Charts.Simply we can say that Computer Science is the study about theoretical aspect of computers. Both the Courses syllabus are same.But we can say that MCA is more professional and new generation course.One who would aims at Industry can better to take MCA and who are interested in Teaching/Research can go for MSc-Computer Science. Eligibility and Duration are different for both courses.MCA is 3 Years(6 Semester) couse.But the Duration of MSc-C.S is 2 Years/4 Semesters. Eligibility(MCA):Graduates in any Sream with Maths at Grduate/12th Leve are eligible for MCA Eligibilty(MSc-C.S): BSc-C.S/IT/BCA OR BSc in Electronics,Physics,Maths & Applied Science are eligible for MSc(CS). Job Profile(MCA) : Software Engineer,Application Developer,Database Administrator ,Teachers etc.. Job Profile(MSc-CS): Computer Architects/Scientist,System Engineer/Network Engineer,System Analyst etc..
Subject-wise: C, C++, DBMS, Networking, Number Systems, Boolean Algebra, Logic Gates.
please known me that " is burdwan universiry Msc computer science distance education is applicable foe Gate examonition ?
advanced computer architecture
ba ecnomices syllabus in MG ?
Msc. IT is better in some cases.....
FOURTH SEMESTER SUBJECTS Credits Exam Hrs. MAX.MARKS / Ext. Marks | Int. Marks | Total / PART I | LANG.PAPER-IV | 3 | 3 | 75 | 25 | 100 / PART II | ENGLISH …PAPER -IV | 3 | 3 | 75 | 25 | 100 / PART III - | Paper - VII Programming in JAVA | 4 | 3 | 75 | 25 | 100 / PART III - | Paper - VIII - Practical - IV Java Programming Lab | 4 | 3 | 60 | 40 | 100 / Allied-II Paper - II | 5 | 3 | 75 | 25 | 100 / PART IV 2.Soft Skill-IV | 3 | 3 | 60 | 40 | 100 / 3. Environmental Studies | 2 | 3 | 75 | 25 | 100 Title of the Course/ Paper -V PROGRAMMING IN C++ AND DATA STRUCTURES / Core | II Year & Third Semester | Credit: 4 / Objective of the course This course introduces the basic concepts of programming in C++ and Data Structures / Course outline Unit 1: Introduction to C++; Tokens, Keywords, Identifiers, Variables, Operators, Manipulators, Expressions and Control Structures in C++; Pointers - Functions in C++ ‑ Main Function ‑ Function Prototyping ‑ Parameters Passing in Functions - Values Return by Functions - Inline Functions - Friend and Virtual Functions / Unit-2: Classes and Objects; Constructors and Destructors; and Operator Overloading and Type Conversions - Type of Constructors - Function overloading. Inheritance : Single Inheritance ‑ Multilevel Inheritance ‑ Multiple Inheritance ‑ Hierarchical Inheritance ‑ Hybrid Inheritance. Pointers, Virtual Functions and Polymorphism; Managing Console I/O operations. / Unit 3: Working with Files: Classes for File Stream Operations ‑ Opening and Closing a File ‑ End‑of‑File Deduction ‑ File Pointers ‑ Updating a File ‑ Error Handling during File Operations ‑ Command‑line Arguments. Data Structures: Definition of a Data structure ‑ primitive and composite Data Types, Asymptotic notations, Arrays, Operations on Arrays, Order lists. / Unit-4: Stacks - Applications of Stack ‑ Infix to Postfix Conversion, Recursion, Maze Problems - Queues ‑ Operations on Queues, Queue Applications, Circular Queue. Singly Linked List ‑ Operations, Application ‑ Representation of a Polynomial, Polynomial Addition; Doubly Linked List ‑ Operations, Applications. / Unit-5 : Trees and Graphs: Binary Trees ‑ Conversion of Forest to Binary Tree, Operations ‑ Tree Traversals; Graph ‑ Definition, Types of Graphs, Hashing Tables and Hashing Functions, Traversal ‑ Shortest Path; Dijkstra's Algorithm. 1. Recommended Texts i. E. Balagurusamy,1995,Object Oriented Programming with C++, Tata McGraw‑Hill Publishing Company Ltd. ii..E.Horowitz and S.Shani,1999,Fundamentals of Data Structures in C++ , Galgotia Pub. 2.Reference Books i. Robert Lafore, Object Oriented Programming in Microsoft C++, Galgotia publication. ii.. H.Schildt, C++,1998,The Complete Reference-1998-TMH Edition, 1998 iii.R. Kruse C.L. Tondo and B. Leung ,1997, Data Structures and Program design in C, PHI. iii.Cangsam,Auguenstein,Tenenbaum,Data Structures using C & C++,PHI iv.D.Samantha,2005, Classic Data Structures, PHI,New Delhi. Title of the Course/ Paper VI PRACTICAL - III DATA STRUCTURES USING C++ / Core | II Year & Third Semester | Credit: 4 / Objective of the course This course deals with practical implementation of Data Structure using C++. / Course outline 1. Implement PUSH, POP operations of stack using Arrays. 2. Implement PUSH, POP operations of stack using Pointers. 3. Implement add, delete operations of a queue using Arrays. 4. Implement add, delete operations of a queue using Pointers. 5. Conversion of infix to postfix using stack operations 6. Postfix Expression Evaluation. 7. Addition of two polynomials using Arrays and Pointers. 8. Creation, insertion, and deletion in doubly linked list. 9. Binary tree traversals (in-order, pre-order, and post-order) using linked list. 10.Depth First Search and Breadth first Search for Graphs using Recursion. Title of the Course/ Paper -VII - PROGRAMMING IN JAVA / Core | II Year & Fourth Semester | Credit: 4 / Objective of the course This course introduces the basic concepts of programming in JAVA / Course outline Unit 1: Introduction to Java-Features of Java-Basic Concepts of Object Oriented Programming-Java Tokens-Java Statements-Constants-Variables-Data Types- Type Casting-Operators-Expressions-Control Statements: Branching and Looping Statements. / Unit-2: Classes, Objects and Methods-Constructors-Methods Overloading-Inheritance-Overriding Methods-Finalizer and Abstract Methods-Visibility Control -Arrays, Strings and Vectors-String Buffer Class-Wrapper Classes. / Unit 3: Interfaces-Packages-Creating Packages-Accessing a Package-Multithreaded Programming-Creating Threads-Stopping and Blocking a Thread-Life Cycle of a Thread-Using Thread Methods-Thread Priority-Synchronization-Implementing the Runnable Interface . / Unit-4: Managing Errors and Exceptions-Syntax of Exception Handling Code-Using Finally Statement-Throwing Our Own Exceptions-Applet Programming-Applet Life Cycle-Graphics Programming-Managing Input/Output Files: Concept of Streams-Stream Classes-Byte Stream Classes-Character Stream Classes - Using Streams-Using the File Class-Creation of Files-Random Access Files-Other Stream Classes. / Unit-5: : Network basics -socket programming - proxy servers - TCP/IP - Net Address - URL - Datagrams -Java Utility Classes-Introducing the AWT: Working with Windows, Graphics and Text- AWT Classes- Working with Frames-Working with Graphics-Working with Color-Working with Fonts-Using AWT Controls, Layout Managers and Menus. 1. Recommended Texts i.E. Balagurusamy,2004,Programming with JAVA, 2nd Edition,Tata McGraw-Hill Publishing Co.Ltd. ii.Herbert Schildt,2005,The Complete Reference JavaTM 2, 5th Edition,Tata McGraw-Hill Publishing Co. Ltd. 2. Reference Books i. Y. Daniel Liang ,2003, An Introduction to JAVA Programming, Prentice-Hall of India Pvt. Ltd. ii. Cay S. Horstmann and Gary Cornell,2005, Core JavaTM2 Volume I-Fundamentals, 7th Edition- Pearson Education. iii. Ken Arnold, James Gosling and David Holmes,2003, The JavaTM Programming Language, 3rd Edition, Pearson Education. Title of the Course/ Paper -VIII PRACTICAL - IV: JAVA PROGRAMMING LAB / Core | II Year & Fourth Semester | Credit: 4 / Objective of the course This course gives the practical training in JAVA programming / Course outline APPLICATIONS: 1. Substring Removal from a String. Use String Buffer Class. 2. Determining the Perimeter and Area of a Triangle. Use Stream Class. 3. Determining the Order of Numbers Generated randomly using Random Class. 4. Usage of Calendar Class and Manipulation. 5. Implementation of Point Class for Image Manipulation. 6. String Manipulation Using Char Array. 7. Database Creation for Storing E-mail Addresses and Manipulation. 8. Usage of Vector Classes. 9. Interfaces and Packages 10. Implementing Thread based Applications and Exception Handling. 11. Application using Synchronization such as Thread based, Class based and Synchronized Statements. 12. Textfiles (copy, display, counting characters, words and lines) 13. Data file creating and processing for electricity billing. 14. Data file creating and processing for telephone billing APPLETS: 15. Working with Frames and Various Controls. 16. Working with Dialog Box and Menus. 17. Working with Colors and Fonts. 18. Drawing various shapes using Graphical statements. 19. Working with panel and all types of Layout. 20. Design a simple calculator with minimal of 10 operations 21. Usage of buttons, labels, text components in suitable application 22. Usage of Radio buttons, check box ,choice list in suitable application.
theory of computation discrete mathematics ,operating system,computer network,digital logic
In West Bengal