#1
January 12th, 2016, 10:06 AM
| |||
| |||
SRM University B.Sc Computer Science
hello sir I am student of B.Sc Computer Science program of SRM University so please provide me syllabus of this program.
|
#2
January 12th, 2016, 10:09 AM
| |||
| |||
Re: SRM University B.Sc Computer Science
The Course duration of B.Sc Computer Science at SRM University is for three years consisting of six semesters. Syllabus of B.Sc Computer Science SRM University I SEMESTER Language -I (Tamil / Hindi / French) 5 0 5 SHCS102 English -I 5 0 5 SHCS103 Problem Solving Techniques 5 0 5 SHCS104 Computer Organization & Architecture 5 0 5 SHCS105 Allied : Mathematics – I 5 0 5 SHCS106 Computer Organization Lab 0 3 2 SHCS107 Communication Skills (Internal Assessment Only) 2 0 2 II SEMESTER SHCS201 Language -II (Tamil / Hindi / French) 5 0 5 SHCS202 English -II 5 0 5 SHCS203 Structured and Object Oriented Programming 5 0 5 SHCS204 Operating Systems 5 0 5 SHCS205 Allied : Mathematics – II 5 0 5 SHCS206 Structured and Object Oriented Programming Lab 0 3 2 SHCS207 Value Education (Internal Assessment Only) I YEAR – I SEMESTER PROBLEM SOLVING TECHNIQUES Unit – I: PROGRAMMING TECHNIQUES Steps Involved in Computer Programming – Problem Definition – Outlining The Solution – Flow Chart – Developing Algorithms – Efficiency of Algorithms - Analysis of Algorithms Unit – II: FUNDAMENTAL ALGORITHMS Exchanging the Values – Counting – Summation of Set of Number – Factorial Computation – Sine Computation – Fibonacci Sequence – Reversing the Digits of an Integer – Base Conversion – Character to Number Conversion. Unit – III: FACTORING METHODS Finding the Square Root of a Number – Smallest Divisor of an Integer – GCD of Two Integers –Generating Prime Numbers – Computing the Prime Factors of an Integer – Generation of Pseudo-Random Numbers – Raising a Number to a Large Power – Computing the Nth Fibonacci Number. Unit – IV: ARRAY TECHNIQUES Array Order Reversal – Array Counting or Histogramming – Finding the Maximum Number in a Set – Removal of Duplicates from an Ordered Array – Partitioning an Array – Finding the kth Smallest Element – Longest Monotone Subsequence Unit – V: MERGING, SORTING AND SEARCHING Two Way Merge - Sorting by Selection, Exchange, Insertion, and Partitioning - Binary Search –Hash Searching. Now I am providing you pdf file of complete syllabus of syllabus. |
|