You are on page 1of 2

Analysis

Paper1 Paper 2
Intro to computing Computer organization and architecture
Type of computers (supercomputers, mainframe) Difference between RISC and CISC arch. (2 times)
Architectures of computers (e.g. Von-Neuman) How digital evidences preserved from crime scene
Virtual and physical memory functioning (digital devices used these days) (2 times)
Secure from cybercrimes Storage system methods
Conversions (binary, decimal etc.) Diagrams (instruction execution state with interrupt)
Numericals
Registers (functions, purpose, diagram)
Physical drives
Basic instruction cycle
Why modern processors use more power when clock
frequency is increased
CPU registers and functionality
Difference between address, data and control bus
Function of buses in computer arch.
Programming fundamentals & Object Oriented Computer comm. And networks
Programming Network Protocols (HTTP, TCP)
Virtual and physical memory functioning Short notes
Coding Programs (inheritance, loops, conditions, data Numericals
type, logic) Topologies and scenarios
Volatile and non-volatile memory difference, examples Ethernet LAN and types (function)
Designing a program for medical store (inheritance, Layers of TCP/IP stack
classes and attributes Difference between hub, bridge, switch and router
Dry run of programs Network address translation
Preprocessor directives Working of multiplexing at transport layer
Tree Scenario (private, protected members, virtual Difference between IPv4 and IPv6 protocols
function accessibility) Routing techniques
Table (define is-a ,has-a relationship) Error detection techinques
Switching Techniques
Multiplexing techniques
Impairments in transmission medium
Software Engineering Operating systems
Software Models and design methods(Agile, Waterfall Page Replacement Policies (differences)
etc.) Deadlock conditions
Agile dev. And issues Process scheduling (Pros and cons of queue
Incremental methods scheduling)
Importance of design patterns in agile dev. Numericals
Software development life cycle Time and paged memory systems
difference b/w validation and verification (2 times) Algorithms for deadlock avoidance
Importance of requirement engineering Process control block
Process of requirement sign off Resp of operating system kernel
Difference between SRS doc and design doc4r Paging
Difference between white box and black box I/O management (difference pooling and interrupts)
Unit testing process for verification Swapping between main and secondary memory
Software testing and methodologies Flowchart for process scheduling mechanism
Design issues in distributed software engineering (task Sequential access
allocation and partitioning)

Algorithms and data structures Database Systems


Sorting algos (theory and sort sequence) Types of database (difference)
Hashing process Normalization
Build tree Short notes (data, database)
Type of trees (binary etc.) Difference between operators
Type of nodes DML and DDL differencce
Time complexities Explain pattern matching
Difference between graph and trees Dependencies
Heuristic search Triggers note
Genetic algo and problem solved by it ACID in DML transaction
Dangling pointer Keys (super, candidate)
Difference between logical and physical data
independence
Difference between top down and bottom up distributed
DB design
ER model In DB design
Scenarios
Compiler construction Web
Modules of compiler DIP
Parser and lexical analyzer
Compare with e.g. (top down parser based compiler
and bottom up parser based compiler)
Explain code optimization methods (loop and peephole)
DFD and ERD purpose, diagram, example
Lexical analysis
Regular expressions convert to finite automation
Explain Context free grammar with examples
Difference between lexers and parsers
BNF grammar
Deterministic finite automation (convert DFA to RE)
Modules of compiler
Parser and lexical analyzer
Compare with e.g. (top down parser based compiler
and bottom up parser based compiler)
Explain code optimization methods (loop and peephole)
DFD and ERD purpose, diagram, example
Lexical analysis
Regular expressions convert to finite automation
Explain Context free grammar with examples
Difference between lexers and parsers
BNF grammar
Deterministic finite automation (convert DFA to RE)

You might also like