Ranaghat College
Students Corner
Independent student resource. Not the official website of Ranaghat College.

Computer Science Major · Semester 1

Syllabus content and study suggestions for this semester.

← All Computer Science Major semesters
The verified Computer Science Major papers and original practice suggestions below are based on the linked University of Kalyani PDF. Check your admission record to confirm it applies to your course and batch. This page does not publish exam dates or results.
SYLLABUS SUMMARY · SOURCE CHECKED 29 SEP 2026

Computer Science Major, 1st Semester

The University of Kalyani's UG 4-year Computer Science NEP 2020 PDF states that it applies from academic session 2023-24. This PDF is titled Honours/Honours with Research; Ranaghat College's 2026 notice calls Computer Science a Major. Confirm your own batch and course registration before using these papers.

·

Major papers

CS-MJ-T-1 · Computer Fundamentals and Programming using CMajor theory · 4 credits
  1. Computer hardware, software and problem solving
  2. Programming languages, flowcharts, decision tables and pseudocode
  3. Number systems, codes, binary arithmetic and error correction
  4. Boolean algebra, logic gates and Karnaugh maps
  5. C basics, input/output and preprocessor directives
  6. Operators, expressions and storage types
  7. Functions and recursion
  8. Arrays and strings
  9. Pointers, structures and unions
  10. File handling and access methods

This is a checked summary of the Major paper. The complete unit text and prescribed readings are still being added here.

CS-MJ-P-1 · Programming using C LabMajor practical · 2 credits

Suggested labs cover flowcharts and pseudocode; number conversion and binary arithmetic; C programs for primes, matrices and strings; functions, recursion, pointers, structures, and text/binary file operations. The university says the lab experiment list is suggested and not exhaustive.

Other 1st-semester components in the PDF include Minor theory/practical, a multidisciplinary course, Office Automation Lab and a value-added course. Their selection depends on your registered combination; check your timetable and official PDF.

ORIGINAL PRACTICE · NOT AN OFFICIAL QUESTION PAPER

Study suggestions

These are original practice prompts mapped to CS-MJ-T-1 and CS-MJ-P-1. They are not a prediction of exam questions.

  1. Number systems: Convert decimal 45 to binary and hexadecimal.
    Answer and working

    45 = 32 + 8 + 4 + 1, so binary is 101101. Grouping 0010 1101 gives 2D in hexadecimal.

  2. Boolean algebra: Simplify A + A'B.
    Answer and working

    A + A'B = (A + A')(A + B) = 1(A + B) = A + B.

  3. C functions: Write a function that returns whether a positive integer is prime. Which values can you stop testing at?
    Answer and working

    Return false for n < 2. Check divisors d starting at 2 while d*d <= n; if n%d == 0 return false. Otherwise return true. No divisor above √n is needed unless one below √n also exists.

  4. Arrays: Explain why an array argument in C needs a separate length when passed to a function.
    Answer and working

    The array expression decays to a pointer to its first element in a function call, so the function does not know the element count from the pointer alone. Pass the length explicitly or use a sentinel where suitable.

  5. File handling: Outline how to copy a text file safely.
    Answer and working

    Open the source for reading and destination for writing, check both returned file pointers, read until EOF, write each chunk and check errors, then close both files. Do not assume a successful open or write.