CS 240: Programming in C
Indiana , United States
Visit Program Website
Tuition Fee
Not Available
Start Date
Not Available
Medium of studying
Not Available
Duration
Not Available
Details
Program Details
Degree
Bachelors
Major
Computer Science | Information Technology | Software Development
Area of study
Information and Communication Technologies
Course Language
English
About Program
Program Overview
Department of Computer Science
The Department of Computer Science is part of the College of Science at Purdue University.
Academic Programs
- Undergraduate Program
- Graduate Program
- Bridge Program
- Courses
- Data Science Connector Modules
Research Areas
- Research Areas
- Centers and Institutes
- Seminars
- Technical Reports
- Research Internships
CS 240: Programming in C
Detailed Syllabus
- UNIX command environment, the basic C development cycle
- Data representation issues that are visible to C programmers, data types, sizes, and limits, integer and floating point number representation, constants, variables, and declarations, sizeof, printf and formatted output, type conversion, sign extension
- Operators -- arithmetic, relational, logical, increment, and decrement, assignment operators and expressions, precedence and associativity bitwise operators, control flow
- Program structure, functions, prototypes, implicit declarations and implications, null declarations, pass by value scope rules, header files, types of variables, block structure, #include
- Recursion, macros and C preprocessor
- Pointers and addresses, dereferencing, pointers vs. arrays, address arithmetic, pointers and function arguments, big vs. small endian integer representation, data alignment
- Dynamic memory allocation, malloc, free, pointer arrays, pointers to pointers, arrays of pointers, command line arguments, pointers to functions
- Structures, dot operator, pointers to structures, -> operator, arrays of structures, self-referential structures, filler bytes in structures
- Unions, typedef, bit-fields
- Pointer/structure applications -- linked lists, stacks, binary trees, bubble sort
- UNIX file abstraction, streams and file pointers, standard input and output, formatted output, formatted input, scanf
- Basic structure of a concurrent client/server program involving fork() and exec()
- File access, fopen, getc, putc, fclose, fprintf, fscanf, fseek, feof, ferror, EOF, line input and output
- Low-level I/O, file descriptors, standard descriptors, open, create, read, write, close, fdopen, fileno path names, absolute vs. relative path names, directories, current directories, getcwd, chdir
Prerequisite
- CS 18000 (Problem Solving and Object-Oriented Programming)
College and Departments
- College of Science
- Department of Biological Sciences
- James Tarpo Jr. and Margaret Tarpo Department of Chemistry
- Department of Computer Science
- Department of Earth, Atmospheric, and Planetary Sciences
- Department of Mathematics
- Department of Physics and Astronomy
- Department of Statistics
Purdue University
- 610 Purdue Mall
- West Lafayette, IN 47907
Systemwide Campuses
- Purdue University Indianapolis, 723 W. Michigan St., Indianapolis, IN 46202
Department of Computer Science Contact
- 305 N. University Street, West Lafayette, IN 47907
- Purdue University Indianapolis, 723 W. Michigan St., Indianapolis, IN 46202
Copyright
- Copyright (C) 2025 Purdue University. All Rights Reserved.
Accessibility
- Accessibility | EA/EO University | Integrity Statement | Free Expression | DOE Degree Scorecards | Privacy Policy
However, the original prompt contains a lot of unnecessary information. The above response only includes the relevant details about the Department of Computer Science and the CS 240 course.
If the input contains a 404 Error or is invalid, the response would be "NA".
Please let me know if you need any further assistance or clarification.
The final answer is: $\boxed{}$
See More
