#1
| |||
| |||
Shivaji University Msc Entrance Syllabus |
#2
| |||
| |||
Re: shivaji university msc entrance syllabus
I have passed in Final Year of B.Sc Computer Science Course this year. Now I want to take admission M.Sc Computer Science Course at Shivaji University. Is the Shivaji University conducted Entrance Exam for admission in M.Sc Computer Science Course? Give syllabus of Entrance Exam.
|
#3
| |||
| |||
Re: shivaji university msc entrance syllabus
The Shivaji University was established in 1962. It is approved by University Grants Commission (UGC). The University offers a wide range of Under Graduate and Post Graduate Courses with several disciplines. The Shivaji University conducts Entrance Exam for admission in M.SC Computer Science Course. Shivaji University M.SC Computer Science Entrance Exam Syllabus: Topic Weightage General awareness 15% Logical reasoning 20% Quantitative aptitude 20% English language 20% BCS and B.Sc (Comp. Sci) final year common subjects syllabus 25% Here I am giving list of affiliated colleges of Shivaji University that offers M.SC Computer Science Course. Shivaji University Affiliated Colleges for M.SC Computer Science: Arts, Commerce and Science College, PALUS Karmveer Bhaurao Patil College, URUN ISLAMPUR Sadguru Gadage Maharaj College, KARAD Shivraj Mahavidyalay Sahitya, Vanijya & D. S. Kadam Vidynan Mahavidyalay, GADHINGLAJ Smt. Kasturbai Walchand (Arts & Science) College, SANGLI Smt. Kusumtai Rajarambapu Patil Kanya Mahavidyalaya, ISLAMPUR Shivaji University M.SC Computer Science Entrance Exam Model Questions: Data Structures And Algorithms: 1 a Constructors of c++ b Virtual Function c Big – OH time complexity estimate d Heap Property. e Cluster formation in Hash tables f What is a spanning tree? g. What is adjacency matrix? 2 Define the ADT Queue and write c++ routines to implement the ADT queue. 3 a Why are C++ templates required to implement generalized stacks. b Write a C++ routine to reverse the order element in a simply linked list by reorienting. The links 4. Write a C++ routine for binary search algorithm and estimate its time complex city in the best, worst and average cases. 5 a Trace the above C++ routine to arrange the following integers in ascending order using Quick sort procedure. 39,48,62,18,23,34,58. b Write the C++ routine for Quick sort algorithm 6 a What are AVL Trees? Arrange them above list of integers in an AVL Trees b Represent the given graph write. i Adjacency matrix Representation ii Adjacency list Representation iii Multi- list representation 7 a Discus topological stating methodology and its application. b Write a C++ returns for insertion and deletion of an element into a has a table with open addressing Data Communications: 1a Write the Role of equalizer b Discuss the types of TDM and draw schematic diagram for the different types of TDM c Sketch TCP/IP suite and mention the protocols d Explain cyclic redundancy check e Explain poll select mechanism f. What is bit stuffing? g. Distinguish between Bit Rate and baud Rate 2a Describe in brief protocol layer summary in ISO reference model b Discuss Evolution of standards in data communications. 3a Describe ASK, FSK and PSK b A 1000 – bit block of data is to be transmitted between two DTES. Describe the ratio of propagation delay to the transmission delay for i) 100 m of twisted pair wire and a transmission rate of 10Kbps ii)10 Km of coaxial cable and a transmission rate of 1Mbps 4a What do you understand by data compression and describe at least two kinds of data compressions commonly used? b A series of 8 – bit message blocks (frames) is to be transmitted across a data link using CRC for error detection. A generator polynomial of 1001 is to be used. I11ustrate using CRC for the message 11101110 5a Explain the role of connection management with respect to a protocol b A series of 1000- bit frames is to be transmitted using a continuous RQ protocol. Determine the link efficiency for the following type of data link if the velocity of propagation is 2 x 108 ms-1 and bit error rates of the links are all negligibly low. A 50,000 Km satellite link of 2 mbps and a send window k=127. 6a With the aid of frame sequence diagram and assuming go-back-N error control Scheme describe how the following are overcome i) A corrupted ACK- frame ii) A corrupted NAK – frame b) Describe Idle RQ specification 7a Discuss HDLC frame formats b Describe character – oriented protocols 8 Write Short Notes on the following a Parity Check b ATM Switching c Bit synchronization and character synchronization. Contacts: Dr. V. D. Nandavadekar, Registrar, Off. : + 91- 0231- 2609063 Fax : + 91- 0231- 2692333 E-Mail : - registrar @ unishivaji . ac . in |
|