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.
Showing posts with label Computer Science and Information Technology. Show all posts
Showing posts with label Computer Science and Information Technology. Show all posts
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).
Subscribe to:
Posts (Atom)