#1
26th November 2014, 02:54 PM
| |||
| |||
Amravati University MSc Admission
I want to take admission in Amravati University for M.Sc computer science, please provide me information about it ?
|
#2
26th November 2014, 03:17 PM
| |||
| |||
Re: Amravati University MSc Admission
Amravati University full name is Sant Gadge Baba Amravati University. It was founded in 1983. It is a Public University. It located in Amravati, Maharashtra, India. It is affiliated to UGC. As you want to do M.Sc computer science so yes you can do this course from Amravati University. Eligibility: Candidate must have graduate degree in same relevant subject or other degree which is related to computers. I am giving you subjects of M.Sc computer science: SEM-I (CBCS) 1MCS1 Digital System and Microprocessor 1MCS2 .Net Technologies and C# 1MCS3 Operating System 1MCS4 Computer Networks 1MCS5 Lab I - Based on 1MCS1 and 1MCS3 1MCS6 Lab II – Based on 1MCS2 SEM-II (CBCS) 2MCS1 Java Programming 2MCS2 Data Structures 2MCS3 Software Engineering 2MCS4 (1) Discrete Mathematical Structures (2) Compiler Construction (GIC) 2MCS5: Lab III - Based on 2MCS1 2MCS6: Lab IV - Based on 2MCS2 and 2MCS3 SEM-III (CBCS) 3MCS1 Data Mining and Data Warehousing 3MCS2 Computer Graphics 3MCS3 Client-Server Computing 3MCS4 (1) Distributed Database System (GIC) (2) Theory of Computation 3MCS5 Lab V - Based on 3MCS1 and 3MCS2 3MCS6 Lab VI - Based on 3MCS3 SEM-IV (CBCS) 4MCS1 Artificial Intelligence and Expert Systems 4MCS2 Design and Analysis of Algorithms 4MCS3 Network Security 4MCS4 (1) Mobile Communications (2) Digital Image Processing (3) Software Testing (GIC) 4MCS5 Lab VII - Based on 4MCS1 and 4MCS2 4MCS6 Project Syllabus prescribed for M.Sc.Part-I Semester I and II (Computer Science) SEMESTER-I 1MCS1: Digital Systems and Microprocessor Unit I : Representation of integers and floating point nos., Boolean Algebra: laws, simplification of logic equations using Boolean laws, SOP and POS, standard forms of SOP and POS, Karnaugh Maps don’t care conditions in K-map, Unit II : Logic families: classification and characteristics, TTL, ECL, MOS, CMOS, their comparison, Combinational logic design using MSI chips: Multiplexers, De-multiplexers/ Decoders, Digital comparator; parity generator/checker; code converters: BCD to Binary, Binary to BCD, Priority encoder: Decimal to BCD, Octal to Binary. Unit III : Design of Arithmetic circuits: Half Adder, half subtractor, full adder, full subtractor, parallel binary adder, subtraction using 1’s and 2’s compliment schemes, use of adder as subtractor, controlled parallel adder, ALU IC 74181. Unit IV: Flip Flops: construction and working of RS, JK, MS-JK, D and T Flip flops. Shift registers and Counters: Buffer register, controlled buffer register, shift registers: SISO, SIPO, PISO, PIPO, bidirectional shift register, ring counter, twisted ring counter, applications of shift registers; Counters: asynchronous counter designs, synchronous counter, UP/ DOWN counters, lock out in counters. Unit V : Overview of microcomputer system, evolution of microprocessors, architecture of 8086 microprocessor, pin diagram, signal description, register organisation, concept of pipelining, memory segmentation, memory address generation, modes of operation of 8086 (minimum and maximum). Unit VI : Stack structure, interrupts in 8086 microprocessor, interrupt responses, Interrupt Vector Table, H/W and S/W interrupt processing; Interfacing: absolute and linear decoding, I/O mapped I/O and Memory Mapped I/O, memory interfacing ( Even and Odd Banks), interfacing of keyboards, interfacing of displays, interfacing if ADC and DAC, address mapping. Books: 1. Digital Integrated Electronics: Taub and Schilling (McHill) 2. Digital Principles and Applications: Malvino and Leach (TMH) 3. Modern digital Electronics: R. P. Jain (TMH) 4. Microprocessor and Interfacing: D. V. Hall (TMH) 5. The Intel Microprocessors: Barry B. Bray (PHI) 1MCS2: .Net Technologies and C# Unit I : Understanding .net: The C# environment: origins of .net technology, .net framework, the common language runtime, framework base classes, user and program interfaces, visual studio .net, .net languages, benefits, c# and .net Unit II : Overview of C#: namespaces, comments, aliases for namespaces, command-line arguments, program structure; Literals, variables and data types, operators, expressions, Decision making and branching, looping, methods in c#, Array handling, string manipulation, structures and enumerations, Unit III : Classes and objects: Principle of OOP, Access modifiers, constructors, destructors, Nesting of classes; Inheritance and Polymorphism: multilevel inheritance, hierarchical inheritance, overriding, hiding methods, abstract methods and classes, sealed classes and methods; Interfaces: defining, extending and implementing interfaces, interfaces and inheritance, explicit interface implementation, abstract class and interfaces. Unit IV : Operator overloading: unary, binary, comparison, Delegates and events; Console I/O operations: console class, console input-output, formatted output. Errors and Exceptions: types of errors, exceptions, exception handling codes, multiple catch statements, exception hierarchy, catch handler, finally statement, nested try blocks. Unit V : Multithreading in c#: Introduction, System. Threading namespace, scheduling, synchronizing threads, thread pooling. File Manipulation: Managing File System, Moving, copying, deleting files, Reading, writing to files, Reading Drive information, File Security. Unit VI : Data Access with .Net: ADO.net overview, Database connections, commands, the Data Reader, the DataSet class, populating a DataSet, persisting a DataSet. Books: 1. Programming in C# -E. Balagurusamy, Tata McGraw-Hill Publications 2. Professional C# 2005 with .NET 3.0 - Christian Nagel, Bill Evjen, Jay Glynn, Morgan Skinner and Karli Watson Wrox Press 3. Programming C# - J. Liberty, O’Reilly Publications 4. The Complete Reference: C# - Herbert Schildt, Tata McGraw-Hill Publications 5. C# and the .NET Platform -Andrew Troelsen, A! Press 1MCS3 : Operating System UNIT–I : Introduction: Services, Types, User-O.S. Interface: Command Interpreter, Graphical User Interface; System Calls; System Programs; Operating System Structure: Simple, Layered Approach; Micro-kernels, Modules; Virtual Machine; System Boot. UNIT–II: Process Management: Process Concept, Process States, Process Control Block, Process Scheduling: Schedulers, Context Switch; Operations on Process: Creation, Termination, Inter Process Communication; Threads: Concept, Benefits; CPU Scheduling: Burst Cycle, Types of Scheduling, Scheduler, Dispatcher, Scheduling Criteria, Scheduling Algorithms: FCFS, SJF, Priority Scheduling, Round-Robin, [multiple processor scheduling] UNIT–III: Process Synchronization and Deadlocks: Critical Section Problem, Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors. Deadlock: System Model, Deadlock Characterization, Resource Allocation Grpah, Methods for handling Deadlock: Prevention, Avoidance and Detection; Recovery from Deadlock: Process Termination, Resource Preemption. UNIT–IV: Memory Management: [Basic Hardware, Address Binding]; Logical and Physical Address Space, Swapping, Contiguous Allocation, Dynamic Storage Allocation: First-fit, Best-Fit, Worst-fit; Fragmentation; Paging; Segmentation. Virtual Memory: Introduction, Virtual Address Space, Demand Paging, Copy-on-write, Page Replacement: Concept, Page Replacement Algorithms: FIFO, Optimal Page Replacement, LRU, Second-Chance Page Replacement; Thrashing, I/O Interlock. UNIT-V : File System: File: Concept, Attributes, Operations; File Organization and Access: Sequential, Index Sequential, Indexed, Direct or Hash File. Directory: Operations, Structures. Protection: Access Control and Permissions. File System Structure, Allocation Methods, Free Space Management. Disk Structure, Disk Scheduling Algorithms: FCFS, SSTF, SCAN, C-SCAN, LOOK. [Disk Management, Swap Space Management], RAID: Concept. I/O Systems: I/O Hardware, Interrupts, DMA, Application I/O Interface, Kernel I/O Subsystem. UNIT-VI: Distributed File System: Concept, Naming and Transparency, Remote File Access, Stateful Vs Stateless Service, File Replication, Remote Login, Remote File Transfer, Data Migration, Computation Migration, Process Migration. Embedded Operating Systems: Embedded Systems: Definition, Requirements and Constraints, Organization of Embedded System; Characteristics of Embedded Operating Systems. Case Studies: Linux and Mobile Operating Systems Books: 1. Operating System Concepts – Seventh Edition : Abraham Silberschatz, Peter Galvin, Greg Gagne (John Wiley & Sons) 2. Operating Systems : William Stallings (Pearson) 3. Modern Operating System : Andrew S. Tanenbaum 1MCS4: Computer Networks UNIT–I : Digital Communication: Advantages; Data Transmission: Modes: Parallel, Serial: Asynchronous, Synchronous, Isochronous; Transmission Media: Guided and unguided; Modulation: Amplitude, Phase Shift, Frequency, QAM; Multiplexing: FDM, WDM, TDM, STDM, CDM; Switching: Circuit, Message, Packet; Delays in Packet Switched Network, Packet Loss; Network Reference Models: OSI: Layered Architecture and Services, TCP/IP: Layered Architecture and Services UNIT-II : Application Layer: Principles of Application Layer Protocols; Processes: Client-Server Model, Socket Interface; Services required by Application Layer; HTTP: Introduction, RTT, HTTP Handshake, types of HTTP Connections, HTTP Messages, Authentication and Cookies; FTP: Service Model, FTP Commands; Electronic Mail; SMTP; DNS: Services and Working UNIT-III: Transport Layer: Transport-Layer Services and Principles; Multiplexing and Demultiplexing Applications; Connectionless Transport – UDP; Principles of Reliable of Data Transfer (RDT); Stop-and-wait and Pipelined protocols; GBN protocol; Connection-Oriented Transport: TCP; Flow Control; Principles of Congestion Control; Approaches towards Congestion Control; TCP Congestion Control UNIT-IV: Network Layer: Introduction; Network Service Model: Datagram, Virtual Circuit; Routing Principles; Routing Algorithms: Classifications; Hierarchical Routing; Internet Protocol: IP Addressing, IPv4: Classes and Packet format, DHCP; ICMP; Routing in the Internet: RIP, OSPF, BGP; Router; IPv6; Multicast Routing UNIT-V: Data Link Layer: Introduction; Services; Error Detection and Correction; Multiple Access Protocols and LANs; LAN Addresses and ARP; Ethernet; Hubs, Bridges and Switches; Wireless LANs: IEEE 802.11; The Point-to-Point Protocol; ATM, X.25 and Frame Relay. UNIT-VI: Network Security and Management: Secured Communication: Threats and Characteristics; Cryptography: Principles of Cryptography, Symmetric Key Cryptography, Public Key Cryptography; Privacy, Authentication, Integrity, Nonrepudiation; Digital Signature; Key Distribution and Certification. Areas of Network Management; Network Management Architecture; Internet Network Management Framework; SMI, MIB, SNMP. Books: 1) Computer Networking – James F. Kurose and Keith W. Ross (Addison-Wesley) 2) Data Communication and Networking – Behrouz A. Forouzan (McGraw Hill) 3) Computer Network & Internet - Douglas E. Comer (Pearson) 4) Data and Computer Communication – William Stallings (Pearson) 5) Computer Networks - Andrew S. Tanenbaum (PHI) 1MCS 5 : Lab I - Based on 1MCS1 and 1MCS3 1MCS6 : Lab II - Based on 1MCS2 “Distribution of marks for Computer Lab-I and Lab-II” A) Each student shall perform two practicals. B) Question slip for each examinee shall be attached to the answer book. C) Marks should be given on the basis of following criteria: I) Practical-I : 30 marks II) Practical-II : 30 marks III) Viva-Voce (Each practical 15 marks) : 30 marks IV) Record : 10 marks ———————————————— Total : 100 marks SEMESTER-II 2MCS1: Java Programming Unit I : Introduction to java, Java development tools, Java and WWW, Java applications, java building elements: Identifiers, Keywords, variables, constants, operators. Data types and type casting and type conversion. Control Structures: Simple if, If..else, switch statement, Loop structure : For , Do..while, while , loop control using break and continue. Unit II : Objects and classes: class variable, instance variable, class methods, Access specifier, access modifiers. Methods: main method, creating methods, calling methods, overloading methods, abstraction, recursion. Object: Initialization of object using constructors, parameterized constructor, Dynamic Memory allocation, Garbage collection. Passing objects to methods. Unit III : Packages: creating and importing packages, Arrays : Declaration, initialization, sorting searching, array of objects. String: String class, StringBuffer, StringTokenizer. Command line arguments. Inheritance: super class, subclass , super keyword, this keyword, final modifier, abstract class, Method overriding. Interface: implementing interfaces. Unit IV : Applet: Life cycle of an applet, APPLET tag, passing arguments to an applet, paint, repaint, update methods. Graphics class, AWT class hierarchy, Frames, Layout managers, components, containers. Color class, Font class. Unit V : Exception Handling : Error and Exception class, Error handling routine, try , catch , throw, throws, finally, uncaught exceptions, built-in exception, nested try-catch, user defined exception. Thread: Thread class, Runnable interface, states, priority and synchronization. Java I/O classes, File handling. Unit VI : User Interface: Button, Label, TextField, TeatArea, Choice, List, CheckBox, CheckBox Group, Dialog Boxes, Menu, Multiple Windows, Event handling: Event Delegation model, Adapter classes, Event classes, Event Listener Interfaces, Handling Mouse and Keyboard events. Books: 1. The complete Reference Java- 5th edition – Herbert Schildt and Patrick Naughton- Tata McGraw Hill 2. JAVA2 : Unleashed Techmedia 3. Learning Java- Rich Raposa, Willey, dreamTech Publication 4. Java in a nutshell desktop quick reference Flanagan-SPD, O’reilly 5. Programming in Java 2 – Rajaram, -Scitech Pub. India pvt Ltd. 2MCS2 : Data Structures Unit I : Introduction, Types of Data Structures, Linear & Nonlinear data structures, Arrays: Arrays as ADT, 1D, 2D, Multidimensional Arrays, Memory Representation and Applications. Linked List : Concept , Operations : Insert, Delete, Traversal, Static implementation using arrays,Dynamic implementation , Doubly Linked list, Circular list,Linked list applications : Merging of two linked lists. Unit II : Stacks: Introduction, Push and Pop operations, Stack implementation using array, Stack applications, Infix to Postfix conversion of expression, Expression evaluation, Recursion. Queues: Introduction, Insert and Delete operations, Queue implementation using array, Types –Priority Queue, Circular queue, Dequeue, Queue applications: CPU Scheduling Algorithms FCFS , Round Robin algorithm, Stacks and Queues as Linked Lists Unit III : Trees:Terminology and Concepts , Binary Tree Representation, Static implementation using arrays , Linked representation, Binary Search Tree, Operations on Binary search tree - Insert, Delete, Tree Traversals, Representing, Threaded binary trees, Height-balanced trees, AVL Rotations. Searching: Sequential binary tree searches. Unit IV : Searching and Sorting :Searching, Concept and need, Techniques, Linear search, Binary search, Indexed sequential search, Sorting, Concept and Need, Performance criteria, Bubble sort, Insertion Sort, Selection Sort, Shell Sort, Quick Sort, Heap Sort, Merge Sort. Unit V : Graphs :Terminology and concepts, Graph Representation: Adjacency matrix, Adjacency list, Adjacency multi-list, Traversals: Depth first and Breadth first. Minimum spanning tree, shortest path algorithm, topological ordering, sparse matrices, linked list implementation of graph and graph traversal. Unit VI1: Indexing: B-tree indexing, Multilevel indexing, B+ tree, Hashing, Collision processing, Bucket hashing, Dynamic hashing, Linear hashing, Extendible hashing, Tries. For full syllabus of M.Sc computer science Amravati University I am attaching a PDF file which is free to download: Address: Sant Gadge Baba Amravati University Amravati, Maharashtra 444602 0721 266 2173 Map location: [MAP]https://www.google.co.in/maps?q=+Sant+Gadge+Baba+Amravati+University&hl=en& ll=20.941982,77.794275&spn=0.010421,0.01869&sll=21 .125498,81.914063&sspn=21.211705,38.276367&t=m&z=1 6&iwloc=A[/MAP] |