10: Computer Networks
Concept of layering
. LAN technologies (Ethernet)
. Flow and error control techniques,
switching
. IPv4/IPv6, routers and routing algorithms (distance vector, link state)
. TCP/UDP
and sockets, congestion control
. Application layer protocols (DNS, SMTP, POP, FTP, HTTP)
.
Basics of Wi-Fi. Network security: authentication, basics of public key and private key
cryptography, digital signatures and certificates, firewalls.
Information of Early childhood education degree online, Education degree levels, Degrees in college, Education degree online, Computer Engineering, Computer Science Engineering, Private University Information, Private University Tuition Fee, Business and Science Faculty Information, Software Engineering, Programming, Computer Science Course Schedule, Course Tutorial, Suggestions, University Tuition Fee, Study Guidelines and More
CSE
Welcome To Computer Science & Engineering. This Site Contains Complete Information of Computer Engineering, Computer Science & Engineering, Computer Information System, Software Engineering, Computer Science Course Schedule, Course Tutorial, Suggestions, University Tuition Fees, Study Guideline & More.
Computer Science and Information Technology
9: Databases
ER‐model
. Relational model: relational algebra, tuple calculus, SQL
. Integrity constraints, normal forms
. File organization, indexing (e.g., B and B+ trees)
. Transactions and concurrency control.
. Relational model: relational algebra, tuple calculus, SQL
. Integrity constraints, normal forms
. File organization, indexing (e.g., B and B+ trees)
. Transactions and concurrency control.
Computer Science and Information Technology
8: Operating System
Processes, threads, inter‐process communication, concurrency and synchronization
. Deadlock. CPU scheduling
. Memory management and virtual memory. File systems.
. Deadlock. CPU scheduling
. Memory management and virtual memory. File systems.
Computer Science and Information Technology
7: Compiler Design
Lexical analysis, parsing, syntax-directed translation
. Runtime environments. Intermediate code generation.
. Runtime environments. Intermediate code generation.
Computer Science and Information Technology
6: Theory of Computation
Regular expressions and finite automata
. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma
. Turing machines and undecidability.
. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma
. Turing machines and undecidability.
Computer Science and Information Technology
5: Algorithms
Searching, sorting, hashing
. Asymptotic worst case time and space complexity
. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer
. Graph search, minimum spanning trees, shortest paths.
. Asymptotic worst case time and space complexity
. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer
. Graph search, minimum spanning trees, shortest paths.
Computer Science and Information Technology
4: Programming and Data Structures
Programming in C
. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Computer Science and Information Technology
3: Computer Organization and Architecture
Machine instructions and addressing modes
. ALU, data‐path and control unit. Instruction pipelining
. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
. ALU, data‐path and control unit. Instruction pipelining
. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
CS Computer Science and Information Technology
CS Computer Science and Information Technology
Section1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic
. Sets, relations, functions, partial
orders and lattices
. Groups. Graphs: connectivity, matching, coloring
. Combinatorics:
counting, recurrence relations, generating functions
.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and
eigenvectors, LU decomposition
.
Calculus: Limits, continuity and differentiability
. Maxima and minima. Mean value
theorem. Integration
.
Probability: Random variables
. Uniform, normal, exponential, poisson and binomial
distributions
. Mean, median, mode and standard deviation. Conditional probability and
Bayes theorem.
Digital Logic Boolean algebra
Digital Logic
Boolean algebra
. Combinational and sequential circuits. Minimization
. Number representations and computer arithmetic (fixed and floating point)
. Combinational and sequential circuits. Minimization
. Number representations and computer arithmetic (fixed and floating point)
CS Computer Science and Information Technology Section1
CS Computer Science and Information Technology
Section1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic
. Sets, relations, functions, partial
orders and lattices
. Groups. Graphs: connectivity, matching, coloring
. Combinatorics:
counting, recurrence relations, generating functions
.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and
eigenvectors, LU decomposition
.
Calculus: Limits, continuity and differentiability
. Maxima and minima. Mean value
theorem. Integration
.
Probability: Random variables
. Uniform, normal, exponential, poisson and binomial
distributions
. Mean, median, mode and standard deviation. Conditional probability and
Bayes theorem.
Hello World Example
Hello World Example
A C program basically consists of the following parts:
Preprocessor Commands
Functions
Variables
Statements & Expressions
Comments
Let us look at a simple code that would print the words "Hello World":
#include
int main()
{
/* my first program in C */
printf("Hello, World! \n");
return 0;
}
Let us take a look at the various parts of the above program:
3. The next line /*...*/ will be ignored by the compiler and it has been put to add additional comments in the program. So such lines are called comments in the program.
Installation on Windows
Installation on Windows
To install GCC on Windows, you need to install MinGW
. To install MinGW, go to the MinGW
homepage, www.mingw.org, and follow the link to the MinGW download page
. Download the
latest version of the MinGW installation program, which should be named MinGW-
.exe
Installation on Mac OS
Installation on Mac OS
Installation on Mac OS
If you use Mac OS X, the easiest way to obtain GCC is to download the Xcode development
environment from Apple's web site and follow the simple installation instructions. Once you
have Xcode setup, you will be able to use GNU compiler for C/C++.
Xcode is currently available at developer.apple.com/technologies/tools/.
Subscribe to:
Posts (Atom)