# Computer Geek

> Computer Science Notes (Hindi & English), Assignments, University syllabus, Subjective Question Answer, Objective question Answer with Explanation, and tricky Tests are available.


## Posts

- [Logic Loop](https://compgeek.co.in/logic-loop/): QuizNLogic Maths Quizzes Mental Maths Quiz Operations: Addition, Subtraction, Multiplication, Divison Level: Easy Medium Hard Timer: 30 Sec, 60 Sec, 120 Sec, 180 Sec BODMAS Questions Quiz Operations: Bracket, Order, Divide, Multiply, Addition, Subtraction Level: Easy, Hard Timer: 30 Sec, 60 Sec, 120 Sec, 180 Sec GATE Study Material Subject-wise Solved Papers with Explanation
- [BODMAS Questions](https://compgeek.co.in/bodmas-questions/): BODMAS Questions Quiz BODMAS Quiz Challenge BODMAS Quiz Challenge Test your math skills with BODMAS rules! Presented by COMPGEEK.CO.IN How to Play (PLAY IN FULLSCREEN MODE) Solve mathematical expressions following BODMAS rules BODMAS stands for: Brackets, Orders, Division, Multiplication, Addition, Subtraction Enter your answer in the input field Your answer will be checked automatically as you type Try to solve as many questions as possible before time runs out! Note: Copying questions is disabled to ensure fair play. Please solve problems yourself! Select Timer Duration 120 Seconds 180 Seconds 240 Seconds Select Difficulty Level Easy Hard Start Quiz Full Screen […]
- [Test Elementor](https://compgeek.co.in/test-elementor/): Mental Math Quiz Math Quiz with Audio 🧠 Math Quiz Challenge 🔊 50% 🔊 Audio On Operations: ➕ Add ➖ Sub ✖️ Mult ➗ Div Time: 30s 60s 120s 180s Level: Easy Medium Hard 0 SCORE 60 TIME LEFT Easy LEVEL Click Start to Begin! Select options and click Start! Start Game Score: 0 Easy Level Time Taken: 0s Time Per Question 🔄 Play Again
- [Mental Maths Quiz](https://compgeek.co.in/mental-math-quiz/): Mental Maths Quiz Math Quiz with Audio 🧠 Math Quiz Challenge 🔊 50% 🔊 Audio On Operations: ➕ Add ➖ Sub ✖️ Mult ➗ Div Time: 30s 60s 120s 180s Level: Easy Medium Hard 0 SCORE 60 TIME LEFT Easy LEVEL Click Start to Begin! Select options and click Start! Start Game Score: 0 Easy Level Time Taken: 0s Time Per Question 🔄 Play Again Test Your Speed with Timed Addition, Subtraction, Multiplication & Divison Imagine this: You are buying vegetables. The seller says, “It cost ₹70 for 1 kg.” and you just want 250 gms. You try to calculate […]
- [Computer Organization and Architecture Book](https://compgeek.co.in/computer-organization-and-architecture-book/): Computer Organization and Architecture Book PREV Next Menu COMPUTER SCIENCE ————————————- ->Algorithm ->Computer Network ->Data Structure ->Digital Circuits & Design ->Computer Orgn. & Arch. ->Theory of Computation ->Compiler Design ->DBMS ->Operating System GATE DA&AI When you first hear Computer Organization and Architecture, it sounds like a subject designed to break spirits. Words like “pipeline,” “control unit,” and “cache memory” appear, and suddenly you start missing your first-year digital circuits class. Computer organization is basically the story of how your computer thinks, plans, and performs tricks fast. When I was in my second year, this subject felt like a foreign language. […]
- [Algorithm Intro MCQ Part 4](https://compgeek.co.in/algorithm-intro-mcq-part-4/): Algorithm MCQs Part 4 PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 ——————————– UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 ——————————– UNIT 3 -> MCQs Part 1 -> MCQs Part 2 ——————————– UNIT 4 -> MCQs Part 1 Unit 1 Father of Algorithm, What is Algorithm, Need of an algorithm, Algorithm Vs Program, Good Algorithm, Analysis of Algorithm, Comparison of running time, Asymptotic notation, Recurrence relation, Substitution method, Iterative method, Recurrence Tree Method, Master Theorem, Extended Master Theorem. Q61 – […]
- [GATE 2025 CS1](https://compgeek.co.in/gate-2025-cs1/)
- [GATE Computer Network](https://compgeek.co.in/gate-computer-network/): GATE Computer Network PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet,circuit and virtual circuitswitching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email Q1 – A user starts browsing a […]
- [GATE Operating System](https://compgeek.co.in/gate-operating-system/): GATE Operating System PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems. Q1 – Which of the following statements about threads is/are TRUE?(A) Threads can only be implemented in kernel space(B) Each thread has its own file descriptor table for open files(C) All the threads belonging to a process share a common stack(D) Threads belonging to a process are by default not protected from each other Answer Ans – (D) Explanation – […]
- [GATE Database Management System](https://compgeek.co.in/gate-database-management-system/): GATE DBMS PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS 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. Q1 – Let S be the specification: “Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students.” Which one of the following ER diagrams CORRECTLY represents S?(A) (i)(B) (ii)(C) (iii)(D) (iv) Answer Ans – (D) Explanation – Four relationships are there Instructor(Rectangle) —– Teaches(diamond) —- Course(Rectangle)  – Absent in None Student(Rectangle) —- Registers(Diamond) —- Course(Rectangle) – Absent […]
- [GATE Digital Logic](https://compgeek.co.in/gate-digital-logic/): GATE Digital Logic PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point). Q1 – Consider a system that uses 5 bits for representing signed integers in 2’s complement format. In this system, two integers 𝐴 and 𝐵 are represented as 𝐴=01010 and 𝐵=11010.   Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow? (A) 𝐴+𝐵 (B) 𝐴−𝐵 (C) 𝐵−𝐴 (D) 2∗𝐵 Answer Ans – (B) Explanation – In a 5-bit […]
- [GATE Computer Organization & Architecture](https://compgeek.co.in/gate-computer-organization-architecture/): GATE Computer Organization & Architecture PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode) Q1 – Which one of the following statements is FALSE?(A) In the cycle stealing mode of DMA, one word of data is transferred between an I/O device and main memory in a stolen cycle(B) For bulk data transfer, the burst mode of DMA has a higher throughput than the cycle […]
- [GATE Compiler Design](https://compgeek.co.in/gate-compiler-design/): GATE Compiler Design PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination. Q1 – Which of the following is/are Bottom-Up Parser(s)?(A) Shift-reduce Parser(B) Predictive Parser(C) LL(1) Parser(D) LR Parser Answer Ans – (A, D) Explanation – Option (A) – The Shift-Reduce Parser can be classified as a Bottom-Up Parser. The parser initiates at the input symbols and attempts to reduce it to the start symbol of the grammar. The parser will use operations […]
- [GATE Theory of Computation](https://compgeek.co.in/gate-theory-of-computation/): GATE Theory of Computation PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Regular expressions and finite automata. Context-free grammars and push-down automata.Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Q1 – Let 𝐿1, 𝐿2 be two regular languages and 𝐿3 a language which is not regular. Which of the following statements is/are always TRUE?(A) 𝐿1 = 𝐿2 if and only if 𝐿1∩ 𝐿2̅ =𝜙(B) 𝐿1 ∪ 𝐿3 is not regular(C) 𝐿3̅ is not regular(D) 𝐿1̅ ∪ 𝐿2̅ is regular Answer Ans – (C, D) Explanation – Let L1 and L2 […]
- [GATE Programming Language & DS](https://compgeek.co.in/gate-programming-language-ds/): GATE Prog. Language & DS PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Q1 – Consider the following C program:#include <stdio.h>int main(){      int a = 6;      int b = 0; while(a < 10) {      a = a / 12 + 1;      a += b;}      printf(”%d”, a);      return 0;} Which one of the following statements is CORRECT?(A) The program prints 9 as output(B) The […]
- [GATE Algorithm](https://compgeek.co.in/gate-algorithm/): GATE Algorithm PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths Q1 – Given an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm […]
- [GATE Engineering Mathematics](https://compgeek.co.in/gate_cse-subject_wise-engineering_mathematics/): GATE Engineering Mathematics PREV NEXT Menu -> GATE 2024 CS1 SYLLABUS Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, 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 and Statistics: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem Q1 – Let 𝑓:ℝ → ℝ be a function such that 𝑓(𝑥) = max{𝑥, 𝑥3}, […]
- [GATE Artificial Intelligence](https://compgeek.co.in/gate-artificial-intelligence/): GATE Artificial Intelligence PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS Search: informed, uninformed, adversarial; logic, propositional, predicate; reasoning under uncertainty topics — conditional independence representation, exact inference through variable elimination, and approximate inference through sampling. Q1 – Let ℎ1 and ℎ2 be two admissible heuristics used in 𝐴∗ search. Which ONE of the following expressions is always an admissible heuristic? (A) ℎ1 + ℎ2 (B) ℎ1 × ℎ2 (C) ℎ1/ℎ2, (ℎ2 ≠ 0) (D) |ℎ1 − ℎ2| (GATE DS&AI 2024) Answer Ans – (D) Explanation – The heuristic function h(n) refers to a logical estimation of the cost of the shortest path to […]
- [GATE Machine Learning](https://compgeek.co.in/gate-machine-learning/): GATE Machine Learning PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS (i) Supervised Learning: regression and classification problems, simple linear regression, multiple linear regression, ridge regression, logistic regression, k-nearest neighbour, naive Bayes classifier, linear discriminant analysis, support vector machine, decision trees, biasvariance trade-off, cross-validation methods such as leave-one-out (LOO) cross-validation, k-folds cross-validation, multi-layer perceptron, feed-forward neural network; (ii) Unsupervised Learning: clustering algorithms, k-means/k-medoid, hierarchical clustering, top-down, bottom-up: singlelinkage, multiple-linkage, dimensionality reduction, principal component analysis. Q1 – Consider the dataset with six datapoints: {(𝒙𝟏, 𝒚𝟏), (𝒙𝟐, 𝒚𝟐), … ,(𝒙𝟔, 𝒚𝟔)}, where and the labels are given by 𝒚𝟏 = 𝒚𝟐 = […]
- [GATE DBMS & Warehousing](https://compgeek.co.in/gate-dbms-warehousing/): GATE DBMS & Warehousing PREV NEXT Menu ->GATE DS&AI 2024 SYLLABUS ER-model, relational model: relational algebra, tuple calculus, SQL, integrity constraints, normal form, file organization, indexing, data types, data transformation such as normalization, discretization, sampling, compression; data warehouse modelling: schema for multidimensional data models, concept hierarchies, measures: categorization and computations. Q1 – Consider a database that includes the following relations: Defender(name, rating, side, goals) Forward(name, rating, assists, goals) Team(name, club, price) Which ONE of the following relational algebra expressions checks that every name occurring in Team appears in either Defender or Forward, where 𝜙 denotes the empty set? (A) Π𝑛𝑎𝑚𝑒(Team)∖(Π𝑛𝑎𝑚𝑒(Defender)∩Π𝑛𝑎𝑚𝑒(Forward)) […]
- [GATE Programming DS Algorithm](https://compgeek.co.in/gate-programming-ds-algorithm/): GATE Programming, Data Structures & Algorithm PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS Programming in Python, basic data structures: stacks, queues, linked lists, trees, hash tables; Search algorithms: linear search and binary search, basic sorting algorithms: selection sort, bubble sort and insertion sort; divide and conquer: mergesort, quicksort; introduction to graph theory; basic graph algorithms: traversals and shortest path. Q1 – Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex 𝑠. For any vertex 𝑢 in G, 𝑑[𝑢] is the length of the shortest path from 𝑠 to 𝑢. Let (𝑢,𝑣) be an […]
- [GATE Calculus & Optimization](https://compgeek.co.in/gate-calculus-optimization/): GATE Calculus & Optimization PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS Functions of a single variable, limit, continuity and differentiability, Taylor series, maxima and minima, optimization involving a single variable. Q1 – For any twice differentiable function 𝑓:ℝ→ℝ, if at some 𝑥* ∈ ℝ, 𝑓′(𝑥*) = 0 and 𝑓′′(𝑥*) > 0, then the function 𝑓 necessarily has a ______ at 𝑥 = 𝑥*.Note: ℝ denotes the set of real numbers. (A) local minimum(B) global minimum(C) local maximum(D) global maximum (GATE DS&AI 2024) Answer Ans – (A) Explanation – For a function f, if we have an f that is […]
- [GATE Linear Algebra](https://compgeek.co.in/gate-linear-algebra/): GATE Linear Algebra PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS Vector space, subspaces, linear dependence and independence of vectors, matrices, projection matrix, orthogonal matrix, idempotent matrix, partition matrix and their properties, quadratic forms, systems of linear equations and solutions; Gaussian elimination, eigenvalues and eigenvectors, determinant, rank, nullity, projections, LU decomposition, singular value decomposition, Q1 – Consider the matrixWhich ONE of the following statements is TRUE? (A) The eigenvalues of 𝑴 are non-negative and real.(B) The eigenvalues of 𝑴 are complex conjugate pairs.(C) One eigenvalue of 𝑴 is positive and real, and another eigenvalue of 𝑴 is zero.(D) One eigenvalue […]
- [Probability & Statistics from GATE 2024](https://compgeek.co.in/probability-statistics-from-gate-2024/): GATE Probability & Statistics PREV NEXT Menu -> GATE DS&AI 2024 SYLLABUS Counting (permutation and combinations), probability axioms, Sample space, events, independent events, mutually exclusive events, marginal, conditional and joint probability, Bayes Theorem, conditional expectation and variance, mean, median, mode and standard deviation, correlation, and covariance, random variables, discrete random variables and probability mass functions, uniform, Bernoulli, binomial distribution, Continuous random variables and probability distribution function, uniform, exponential, Poisson, normal, standard normal, t-distribution, chi-squared distributions, cumulative distribution function, Conditional PDF, Central limit theorem, confidence interval, z-test, t-test, chi-squared test Q1 – Consider the following statements:(i) The mean and variance of […]
- [GATE Data Science Artificial Intelligence 2024](https://compgeek.co.in/gate-data-science-artificial-intelligence-2024/): GATE DS&AI 2024 PREV NEXT Menu -> GATE 2024 Aptitude Test Q1 to Q10 Q 1 to 5 are of 1 mark Q 6 to 10 are of 2 marks Q1 – If ‘→’ denotes increasing order of intensity, then the meaning of the words [sick → infirm → moribund] is analogous to [silly → _______ → daft]. Which one of the given options is appropriate to fill the blank?   (A) frown (B) fawn (C) vein (D) vain Answer Ans – (D) Explanation – Sick (a little weak) → infirm (weaker) → moribund (dying) is the increasing order of […]
- [GATE DS&AI Previous Year Papers](https://compgeek.co.in/gate-dsai-previous-year-papers/): GATE DS & AI Previous Year Paper YEAR Papers Answer Keys 2025 2025 Paper Answer Key 2025 2024 2024 Paper Answer Key 2024 Standard Books University Exams MCQs Notes
- [GATE Data Science-Artificial Intelligence Syllabus](https://compgeek.co.in/gate-data-science-artificial-intelligence-syllabus/): GATE DS&AI Syllabus Subjects Syllabus Probability and Statistics Counting (permutation and combinations), probability axioms, Sample space, events, independent events, mutually exclusive events, marginal, conditional and joint probability, Bayes Theorem, conditional expectation and variance, mean, median, mode and standard deviation, correlation, and covariance, random variables, discrete random variables and probability mass functions, uniform, Bernoulli, binomial distribution, Continuous random variables and probability distribution function, uniform, exponential, Poisson, normal, standard normal, t-distribution, chi-squared distributions, cumulative distribution function, Conditional PDF, Central limit theorem, confidence interval, z-test, t-test, chi-squared test. Linear Algebra Vector space, subspaces, linear dependence and independence of vectors, matrices, projection matrix, orthogonal […]
- [GATE Data Science-Artificial Intelligence Study Material](https://compgeek.co.in/gate-data-science-artificial-intelligence-study-material/): GATE DS&AI Study Material GATE 2025 Exam Pattern GATE Syllabus for DS&AI 2026 PREVIOUS YEAR EXAMS with Answer key Year-wise Solved Papers with Explanation – GATE 2024 – Subject-wise Solved Papers with Explanation – Probability and Statistics – Linear Algebra – Calculus & Optimization – Programming, DS and Algorithm – DBMS & Warehousing – Machine Learning – Artificial Intelligence
- [GATE DS&AI Study Material](https://compgeek.co.in/gate-dsai-study-material/)
- [GATE 2024 CS1](https://compgeek.co.in/gate-2024-cs1/): GATE 2024 CS1 PREV NEXT Menu -> GATE 2024 CS1 Aptitude Test Q1 to Q10 Q 1 to 5 are of 1 mark Q 6 to 10 are of 2 marks Q1 – If ‘→’ denotes increasing order of intensity, then the meaning of the words [dry → arid → parched] is analogous to [diet → fast → ________ ]. Which one of the given options is appropriate to fill the blank? (A) starve (B) reject (C) feast (D) Deny Answer Ans – (A) Explanation – The series of words [dry→ arid→ parched] illustrates an intensification of dryness, or a […]
- [UGC NET CSE Pattern & Syllabus](https://compgeek.co.in/ugc-net-cse-pattern-syllabus/): UGC-NET Exam Pattern & Syllabus UGC NET COMPUTER SCIENCE EXAM PATTERN The National Testing Agency conducts the University Grants Commission National Eligibility Test each six months. Ugc Net exam pattern consists of two papers – Paper 1 and Paper 2. In Paper 1, there are about 50 questions, each question carries two marks and the time for this exam is three hours max. UGC NET computer science Test UGC NET Paper-I No. of Questions Marks / Subject Teaching Aptitude 5 10 Research Aptitude 5 10 Reading Comprehension 5 10 Communication 5 10 Reasoning (including Maths) 5 10 Logical Reasoning 5 […]
- [UGC NET Artificial Intelligence (2021-2025)](https://compgeek.co.in/ugc-net-artificial-intelligence-2021-2025/): Artificial Intelligence (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – In the content of Alpha Beta pruning in game trees which of the following statements are correct regarding cut off procedures?   (a) Alpha Beta pruning can eliminate subtrees with certainly when the value of a node exceeds both the alpha and beta bonds. (b) The primarily purpose of Alpha-Beta pruning is to save computation time by searching fewer nodes in the same tree. (c) Alpha Beta pruning guarantees the optimal solution in all cases by exploring the entire game tree. (d) Alpha and Beta bonds are initialized to negative […]
- [UGC NET Computer Network (2021-2025)](https://compgeek.co.in/ugc-net-computer-network-2021-2025/): Computer Network (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Match List-1 with List-2 List – 1 List – 2 (a)Monoalphabetic Cipher (I)Round Key (b)DES (II)One-to-many relationship (c)Stream Cipher (III)One-to-one relationship (d)Polyalphabetic Cipher (IV)Feedback mechanism   Choose the correct answer from the options given below: (a)-III, (b)-I, (c)-IV, (d)-II (a)-III, (b)-IV, (c)-II, (d)-I (a)-I, (b)-III, (c)-IV, (d)-II (a)-II, (b)-I, (c)-IV, (d)-III (UGC NET DEC 2023) Answer Ans – (1) Explanation – A monoalphabetic cipher is the type of encryption where the ciphertext letter corresponding to each letter of the plaintext has always been a fixed letter, therefore, a one-to-one relationship between original and encrypted letters […]
- [UGC NET Software Engineering (2021-2025)](https://compgeek.co.in/ugc-net-software-engineering-2021-2025/): Software Engineering (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – The Selection of spiral model based on characteristics of requirements (a) Are requirements easily understandable and defined? (b) Do we change requirements quite often? (c) Can we define requirements early in the cycle? (d) Requirements are indicating a complex to be built   Choose the correct answer from the given options (c) only (b) only (b) and (d) only (a) and (c) only   (UGC NET DEC 2023) Answer Ans – (3) Explanation – The Spiral Model is the recommended option in software development when projects face high levels of risk and complexity. Further, […]
- [UGC NET Operating System (2021-2025)](https://compgeek.co.in/ugc-net-operating-system-2021-2025/): Operating System (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Indexed/Grouped allocation is useful as (a) It supports both sequential and direct access. (b) Entire block is available for data. (c) It does not require lots of space for keeping pointers. (d) No external fragmentation.   Choose the correct answer from the options given below: (a) only (b) and (c) only (b) only (a), (b) and (d) only (UGC NET DEC 2023) Answer Ans – (4) Explanation – Indexed allocation stores files in such a way that an index block keeps track of all disk blocks allocated for the file. This prevents fragmentation […]
- [UGC NET DBMS (2021-2025)](https://compgeek.co.in/ugc-net-dbms-2021-2025/): DBMS (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Match List 1 with List 2 List 1 List 2 (a)  BCNF iff I. Every JD is implied by the candidate key (b)  5NF iff II. All underlying domains contain scalar values only (c)  1NF iff III. Every MVD is implied by the candidate key (d)  4NF iff IV. Every FD is implied by the candidate key Choose the correct answer from the options given below: (a)-III, (b)-II, (c)-I, (d)-IV (a)-IV, (b)-I, (c)-II, (d)-III (a)-II, (b)-III, (c)-IV, (d)-I (a)-IV, (b)-I, (c)-III, (d)-II (UGC NET DEC 2023) Answer Ans – (2) Explanation – BCNF […]
- [UGC NET Computer Graphics (2021-2025)](https://compgeek.co.in/ugc-net-computer-graphics-2021-2025/): Computer Graphics (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Consider a triangle PQR with coordinates as P(0, 0), Q(2, 2) and R(10, 4). If this triangle is to be magnified to four times its size while keeping R(10, 4) fixed, then the coordinates of the magnified triangle are (-20, -12), Q(-20, -4) and R(10, 4) (-30, -12), Q(-22, -4) and R(10, 4) (-25, -10), Q(22, -4) and R(10, 4) (30, -12), Q(-22, 4) and R(10, 4) (UGC NET DEC 2023) Answer Ans – (2) Explanation – In this question, we will use vectors to simplify the points. Vector P = (0, 0) Vector […]
- [UGC NET Algorithm (2021-2025)](https://compgeek.co.in/ugc-net-algorithm-2021-2025/): Algorithm (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Consider the following functions: f(n) = 3n√n g(n) = 2Гn log2n h(n) = n! Which of the following is true? h(n) is O(f(n)) h(n) is O(g(n)) g(n) is not O(f(n)) f(n) is O(g(n)) (UGC NET DEC 2023) Answer Ans – (2, 3, 4) Explanation – In g(n), there is gamma function (Гn). Гn = ∫0infinity xn-1 e-x dx = (n-1)! Then f(n) = 3*n√n, So, its complexity will be n√n. g(n) = 2Гn  log2n, So, its complexity will be 2(n-1)! log2n. h(n) = n! we know that n! > n√n, because if n = 1, n! > n√n à 1 = 1 If n = 16, then 16! > 164 => […]
- [UGC NET Data Structure (2021-2025)](https://compgeek.co.in/ugc-net-data-structure-2021-2025/): Data Structure (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – What is the result of evaluating the postfix expression “43*25*+b-“ ? 8 14 10 5 (UGC NET DEC 2023) Answer Ans – (Can’t tell) Explanation – Expression Stack (after operation) 4 4 3 4, 3 * 4*3 = 12 2 12, 2 5 12, 2, 5 * 12, 2*5 = 10 + 12 + 10 = 22 b 22, b – 22 – b So, this postfix expression answer is 22 – b, which is not an option. Q2 – Which collision resolution technique involves maintaining a linked list of collided keys? Linear probing […]
- [UGC NET Programming Language (2021-2025)](https://compgeek.co.in/ugc-net-programming-language-2021-2025/): Programming Language (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Consider the following code segmentint arr[] = {0, 1, 2, 3, 4}; int i = 1, *ptr; ptr = arr + 2;   Arrange the following printf statements in the increasing order of their output. (a) printf(“%d”, ptr[i]); (b) printf(“%d”, ptr[i+1]); (c) printf(“%d”, ptr[-i]); (d) printf(“%d”, ptr[-i+1]);   Choose the correct answer from the options given below (c), (a), (b), (d) (c), (d), (a), (b) (d), (a), (b), (c) (a), (b), (d), (c) (UGC NET DEC 2023) Answer Ans – (2) Explanation – (a) print ptr[i], it means *(ptr + i) […]
- [UGC NET Computer System Arithmetic (2021-2025)](https://compgeek.co.in/ugc-net-computer-system-arithmetic-2021-2025/): Computer System Arithmetic (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Which of the following statements is/are NOT CORRECT about NUMA? (a) LOAD and STORE instructions are used to access remote memory. (b) There is a single address space visible to all CPU. (c) Access to local memory is slower than access to remote memory. (d) When the access time to remote memory is hidden, the system is called NC-NUMA. (e) IN CC-NUMA, coherent caches are present.   Choose the correct answer from the options given below: (a) and (c) only (b) and (d) only (a) and (e) only (c) […]
- [UGC NET Compiler Design (2021-2025)](https://compgeek.co.in/ugc-net-compiler-design-2021-2025/): Compiler Design (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Match List-1 and List-2 according to input to the compiler phase that process it List – 1 List – 2 (a)Syntax tree I. Code Generator (b)Intermediate Representation II. Semantic Analyzer (c)Token Stream III. Lexical Analyze (d)Character Stream IV. Syntax Analyzer Choose the correct answer from the option given below: (a)-IV, (b)-III, (c)-I, (d)-II (a)-II, (b)-I, (c)-IV, (d)-III (a)-II, (b)-IV, (c)-I, (d)-III (a)-IV, (b)-I, (c)-II, (d)-III (UGC NET DEC 2023) Answer Ans – (2) Explanation – The compiler helps in the various stages of translating human-readable code into machine-executable code. In the first stage, […]
- [UGC NET Theory of Computation (2021-2025)](https://compgeek.co.in/ugc-net-theory-of-computation-2021-2025/): Automata Theory (2021-2025) Prev NEXT Menu -> (2021-2025) Q1 – Let L = {ab, aa, baa}. Which of the following strings are not in L*. abaabaaabaa aaaabaaaa baaaaabaaaab baaaaabaa (UGC NET DEC 2023) Answer Ans – (3) Explanation – L* means that all the strings which are formed by concatenating ab, aa and baa. Option 1 – ab| aa| baa| ab| aa. It belongs to L*. Option 2 – aa| aa| baa| aa. It belongs to L*. Option 3 – baa| aa| ab| aa| aa| b. It does not belong to L*. Option 4 – baa| aa| ab| aa So, option 3 […]
- [UGC NET DISCRETE STRUCTURE (2021-2025)](https://compgeek.co.in/ugc-net-discrete-structure-2021-2023/): Discrete Structure (2021-2025) PREV NEXT Menu -> 2021-2025 Q1 – Which of the following are tautology? A. (P → (P Λ Q)) → (P → Q) B. ((P → Q) → Q) → (P V Q) C. ((P V ¬P) → Q) → (P V ¬P) → R) D. (Q → (P Λ ¬P)) → (R → (P Λ ¬P)) A only B only A and B only C and D only Answer Ans – (3) Explanation – A. (P → (P Λ Q)) → (P → Q) (¬ P v (P ∧ Q)) → (P → Q) (¬ P […]
- [UGC NET DECEMBER 2023](https://compgeek.co.in/ugc-net-december-2023/): UGC-NET DECEMBER 2023 PREV NEXT Menu PREV. YEAR EXAMS ——————————– -> UGC NET DEC 2023 Q1 – What is the probability that a positive integer selected at random from the set of positive integer not exceeding 100 is divisible by either 2 or 5? 10/5 3/5 2/5 1/5 Answer Ans – (2) Explanation – We count numbers divisible by 2, 5, and both 2 and 5. Numbers divisible by 2 is, 100/2 = 50Numbers divisible by 5 is, 100/5 = 20Numbers divisible by 2 and 5 means 10 is, 100/10 = 10 Apply the inclusion – exclusion formula, we get […]
- [UGC NET Computer Science](https://compgeek.co.in/ugc-net-computer-science/): UGC NET CSE Study Material UGC NET CSE Pattern & Syllabus Year-wise Solved Papers with Explanation – UGC NET EXAM DECEMBER 2023 – Subject-wise Solved Papers with Explanation – Discrete Structure – Automata Theory – Compiler Design – Computer System Arithmetic – Programming Language – Data Structure – Design & Analysis of Algorithm – Computer Graphics – Database Management System – Operating System – Software Engineering – Computer Network – Artificial Intelligence
- [OS Introduction MCQs 7](https://compgeek.co.in/os-introduction-mcqs-7/): OS Unit 1 Part 7 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q121 – A privileged instruction may be executed only while hardware is in kernel mode. Which of the following is least […]
- [OS Introduction MCQs 6](https://compgeek.co.in/os-introduction-mcqs-6/): OS Unit 1 Part 6 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q101 – Which of the following is/are not a valid reason for process creation? (i) Created by OS (ii) Interactive logon (iii) Privileged instruction (i), […]
- [OS Introduction MCQs 5](https://compgeek.co.in/os-introduction-mcqs-5/): OS Unit 1 Part 5 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q81 – Which of the following is not true about documentation? Documentation, of a system, should be as clear and direct […]
- [OS Introduction MCQs 4](https://compgeek.co.in/os-introduction-mcqs-4/): OS Unit 1 Part 4 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q61 – Supervisor state is never used entered by programs when they enter the processor required to perform any I/O only […]
- [OS Introduction MCQs 3](https://compgeek.co.in/os-introduction-mcqs-3/): OS Unit 1 Part 3 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q41 – Shell is the exclusive feature of which software? UNIX DOS System software Application software Answer Ans – (1) Explanation […]
- [OS Introduction MCQs 2](https://compgeek.co.in/os-introduction-mcqs-2/): OS Unit 1 Part 2 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q21 – What is the name of the software which deals with the running of the actual computer and not with […]
- [OS Introduction MCQs 1](https://compgeek.co.in/os-introduction-mcqs-1/): OS Unit 1 Part 1 MCQs NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 Unit 1 Operating system and functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multi-process Systems, Multithreaded Systems, Operating System Structure: Layered structure, System Components, Operating System services, Re-entrant Kernels, Monolithic and Microkernel Systems. Q1 – What is operating system? collection of programs that manages hardware resources system service provider to the application programs link to […]
- [Quick Sort](https://compgeek.co.in/quick-sort/): in Hindi Quick Sort PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Vertex Cover Problem](https://compgeek.co.in/vertex-cover-problem-2/): in Hindi Vertex Cover Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Subset Sum Problem](https://compgeek.co.in/subset-sum-problem-2/): in Hindi Subset Sum Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Hamiltonian Cycle Problem](https://compgeek.co.in/hamiltonian-cycle-problem/): in Hindi Hamiltonian Cycle Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Vertex Cover Problem](https://compgeek.co.in/vertex-cover-problem/): in Hindi Vertex Cover Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Clique Problem](https://compgeek.co.in/clique-problem/): in Hindi Clique Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Boolean Satisfiability Problem (SAT)](https://compgeek.co.in/boolean-satisfiability-problem-sat/): in Hindi Boolean Satisfiability Problem (SAT) PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree […]
- [P vs NP problem](https://compgeek.co.in/p-vs-np-problem/): in Hindi P vs NP problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree […]
- [Complexity Classes](https://compgeek.co.in/complexity-classes/): in Hindi Complexity Classes PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Types of problems](https://compgeek.co.in/types-of-problems/): in Hindi Types of Problems PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Approximation Algorithms](https://compgeek.co.in/approximation-algorithms/): in Hindi Approximation Algorithms PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Christofides Algorithm](https://compgeek.co.in/christofides-algorithm/): in Hindi Christofides Algorithm (TSP) PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Travelling Salesman Problem](https://compgeek.co.in/travelling-salesman-problem/): in Hindi Traveling Salesman Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Branch and Bound Algorithm](https://compgeek.co.in/branch-and-bound-algorithm/): in Hindi Branch and Bound Algorithm PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree […]
- [Held-Karp Algorithm for TSP](https://compgeek.co.in/held-karp-algorithm-for-tsp/): in Hindi Held-Karp Algorithm for TSP PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree […]
- [Nearest Neighbour Problem](https://compgeek.co.in/nearest-neighbour-problem/): in Hindi Nearest-Neighbour Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Hamiltonian Cycles Problem](https://compgeek.co.in/hamiltonian-cycles-problem/): in Hindi Hamiltonian Cycles Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Rat in a Maze Problem](https://compgeek.co.in/rat-in-a-maze-problem/): in Hindi Rat in a Maze Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL […]
- [Graph Coloring Problem](https://compgeek.co.in/graph-coloring-problem/): in Hindi Graph Colouring Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Four-Colour Problem by DSATUR](https://compgeek.co.in/four-colour-problem-by-dsatur/): in Hindi Four-Colour Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [N-Queen Problem by Backtracking](https://compgeek.co.in/n-queen-problem-by-backtracking/): in Hindi N-Queen Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black Tree […]
- [Egg Dropping Problem](https://compgeek.co.in/egg-dropping-problem/): in Hindi Egg Dropping Problem PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Catalan Number in Matrix Chain Multiplication](https://compgeek.co.in/catalan-number-in-matrix-chain-multiplication/): in Hindi Catalan Number in Matrix Chain Multiplication PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree […]
- [Matrix Chain Multiplication](https://compgeek.co.in/matrix-chain-multiplication/): in Hindi Matrix Chain Multiplication PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree ->Red-Black […]
- [Longest Common Subsequence (LCS)](https://compgeek.co.in/longest-common-subsequence-lcs/): in Hindi Longest Common Subsequence (LCS) PREV NEXT Menu ————————————- INTRODUCTION ->Pre-requisite of Algorithm ->Father of Al-gorithm ->What is Algorithm ->Need of an Algorithm ->Algorithm Vs Program ->Good Algorithm ->Analysis of Algorithm ->Comparison of Running Time ->Asymptotic Notation ————————————- RECURRENCE RELATION ->Recurrence Relation ->Solving Recurrence Relation ->Substitution Method ->Iterative Method ->Recurrence Tree Method ->Master’s Theorem ->Extended Master’s Theorem ————————————- SORTING ->Types of Sorting ->Bubble Sort ->Selection Sort ->Insertion Sort ->Binary Insertion Sort ->Shell Sort ->Merge Sort ->Heap ->Heap Sort ————————————- SORTING IN LINEAR TIME ->Counting Sort ->Radix Sort ->Bucket Sort ————————————- TREES ->Types of Trees ->Binary Search Tree ->AVL Tree […]
- [CN Physical Layer MCQs8](https://compgeek.co.in/cn-physical-layer-mcqs8/): CN Unit 2 Part 8 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 ——————————- UNIT 3 -> MCQs Part […]
- [CN Physical Layer MCQs7](https://compgeek.co.in/cn-physical-layer-mcqs7/): CN Unit 2 Part 7 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part […]
- [CN Physical Layer MCQs6](https://compgeek.co.in/cn-physical-layer-mcqs6/): CN Unit 2 Part 6 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part […]
- [CN Physical Layer MCQs5](https://compgeek.co.in/cn-physical-layer-mcqs5/): CN Unit 2 Part 5 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 UNIT 2: Physical […]
- [CN DataLink Layer MCQs3](https://compgeek.co.in/cn-datalink-layer-mcqs3/): CN Unit 3 Part 3 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 Unit 3 Data Link Layer: Introduction, Framing, […]
- [CN DataLink Layer MCQs2](https://compgeek.co.in/cn-datalink-layer-mcqs2/): CN Unit 3 Part 2 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part 2 Unit 3 Data Link Layer: Introduction, Framing, Error Detection and Correction, Flow control (Elementary Data […]
- [CN DataLink Layer MCQs1](https://compgeek.co.in/cn-datalink-layer-mcqs1/): CN Unit 3 Part 1 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 ——————————- UNIT 3 -> MCQs Part 1 Unit 3 Data Link Layer: Introduction, Framing, Error Detection and Correction, Flow control (Elementary Data Link Protocols, Sliding Window […]
- [Introduction Computer Network MCQs12](https://compgeek.co.in/introduction-computer-network-mcqs12/): CN Unit 1 Part 12 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of […]
- [CN Physical Layer MCQs4](https://compgeek.co.in/cn-physical-layer-mcqs4/): CN Unit 2 Part 4 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 ——————————- UNIT 3 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 UNIT 2: Physical […]
- [CN Physical Layer MCQs3](https://compgeek.co.in/cn-physical-layer-mcqs3/): CN Unit 2 Part 3 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 UNIT 2: Physical Layer Physical Layer: Transmission media, Signal transmission and encoding, Network performance and transmission impairments, Switching techniques and multiplexing, Overview of PSTN, ISDN, and ATM Q41 – Which […]
- [CN Physical Layer MCQs2](https://compgeek.co.in/cn-physical-layer-mcqs2/): CN Unit 2 Part 2 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 UNIT 2: Physical Layer Physical Layer: Transmission media, Signal transmission and encoding, Network performance and transmission impairments, Switching techniques and multiplexing, Overview of PSTN, ISDN, and ATM Q21 – If […]
- [CN Physical Layer MCQs1](https://compgeek.co.in/cn-physical-layer-mcqs1/): CN Unit 2 Part 1 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 UNIT 2: Physical Layer Physical Layer: Transmission media, Signal transmission and encoding, Network performance and transmission impairments, Switching techniques and multiplexing, Overview of PSTN, ISDN, and […]
- [Introduction Computer Network MCQs11](https://compgeek.co.in/introduction-computer-network-mcqs11/): CN Unit 1 Part 11 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of […]
- [Introduction Computer Network MCQs10](https://compgeek.co.in/introduction-computer-network-mcqs10/): CN Unit 1 Part 10 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. […]
- [Introduction Computer Network MCQs9](https://compgeek.co.in/introduction-computer-network-mcqs9/): CN Unit 1 Part 9 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q161 – In fiber […]
- [Introduction Computer Network MCQs8](https://compgeek.co.in/introduction-computer-network-mcqs8/): CN Unit 1 Part 8 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q141 – A central computer surrounded by one […]
- [Introduction Computer Network MCQs7](https://compgeek.co.in/introduction-computer-network-mcqs7/): CN Unit 1 Part 7 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q121 – In a broader sense, a railway […]
- [Introduction Computer Network MCQs6](https://compgeek.co.in/introduction-computer-network-mcqs6/): CN Unit 1 Part 6 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 -> MCQs Part 9 -> MCQs Part 10 -> MCQs Part 11 -> MCQs Part 12 ——————————- UNIT 2 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 -> MCQs Part 5 -> MCQs Part 6 -> MCQs Part 7 -> MCQs Part 8 ——————————- UNIT 3 -> MCQs Part […]
- [Introduction Computer Network MCQs5](https://compgeek.co.in/introduction-computer-network-mcqs5/): CN Unit 1 Part 5 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 -> MCQs Part 4 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q81 – Presentation Layer is concerned with ……………. Synchronization Flow Control Syntax and Semantics File Transfer Answer Ans – (3) Explanation – The Presentation […]
- [Introduction Computer Network MCQs4](https://compgeek.co.in/introduction-computer-network-mcqs4/): CN Unit 1 Part 4 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q1 – The ____ created a model called the Open Systems Interconnection, which allows diverse systems to communicate. OSI ISO IEEE none of the above Answer Ans – […]
- [Introduction Computer Network MCQs3](https://compgeek.co.in/introduction-computer-network-mcqs3/): CN Unit 1 Part 3 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q41 – Protocols are Agreements on how communication components and DTE’s are to communicate Logical communication channels used for transferring data. Physical communication channels used for transferring data […]
- [Introduction Computer Network MCQs2](https://compgeek.co.in/introduction-computer-network-mcqs2/): CN Unit 1 Part 2 MCQs PREV NEXT Menu UNIT 1 -> MCQs Part 1 -> MCQs Part 2 -> MCQs Part 3 Unit 1 Introduction to Data Communication Definition: Effectiveness, Basic Communication Components. Network Architecture Definition, History, Criteria, Goals and Applications of Networks, Categories of networks, Organization of the Internet, ISP, Protocols and standards, The OSI reference model, TCP/IP protocol suite, Network devices and components. Network topology design, Types of connections. Q21 – What is the primary goal of data communications? To ensure remote communication only To exchange data between devices To limit communication to local networks To facilitate […]

## Pages

- [GATE DA&AI](https://compgeek.co.in/gate-daai/)
- [My account](https://compgeek.co.in/my-account/)
- [Checkout](https://compgeek.co.in/checkout/)
- [Cart](https://compgeek.co.in/cart/)
- [Shop](https://compgeek.co.in/shop/)
- [Computer Network GATE Questions](https://compgeek.co.in/computer-network-gate-questions/): Design & Analysis of Algorithm GATE Ques & Ans Part 1 NEXT Menu -> GATE Q/A Part 1 -> GATE Q/A Part 2 [qsm quiz=1] Q1 – Which one of the following sequences when stored in an array at locations A[1], . . . , A[10] forms a max-heap? (GATE 2023) 1. 23, 17, 10, 6, 13, 14, 1, 5, 7, 12 2. 23, 17, 14, 7, 13, 10, 1, 5, 6, 12 3. 23, 17, 14, 6, 13, 10, 1, 5, 7, 15 4. 23, 14, 17, 1, 10, 13, 16, 12, 7, 5 Answer Ans – (2) Explanation […]
- [Compiler Design Books](https://compgeek.co.in/compiler-design-books/): Compiler Design Books PREV Next Menu COMPUTER SCIENCE ————————————- ->Algorithm ->Computer Network ->Data Structure ->Digital Circuits & Design ->Computer Orgn. & Arch. ->Theory of Computation ->Compiler Design ->DBMS ->Operating System In compiler design, you can have only one book that is Compilers: Principles Techniques and Tool By Aho, Ullman and Sethi published by Pearson  I have read only Aho, Ulman and Sethi and have not read any other texts. So I would suggest only that book. But the other book has an Indian author, read by my friend. If any other book you find, very simple and placement-driven, please mail […]
- [Theory of Computation Book](https://compgeek.co.in/theory-of-computation-books/): Theory of Computation Book PREV Next Menu COMPUTER SCIENCE ————————————- ->Algorithm ->Computer Network ->Data Structure ->Digital Circuits & Design ->Computer Org. & Arch. ->Theory of Computation ->Compiler Design ->DBMS ->Operating System GATE DA&AI My Honest Experience When I first opened a Theory of Computation book, I didn’t understand half the terms. “My respected Mentor (Professor at USICT, GGSIPU) smiled and said, ‘Start with Peter Linz.’” So, I did. The Peter Linz book made me feel seen — simple English, friendly flow, but yes, the automata terms were still complex enough to make my brain say “Try again tomorrow.” Still, it was the […]
- [Data Structure Books](https://compgeek.co.in/data-structure-books/): Data Structure Books Prev Next Menu COMPUTER SCIENCE ————————————- ->Algorithm ->Computer Network ->Data Structure ->Digital Circuits & Design ->Computer Orgn. & Arch. ->Theory of Computation ->Compiler Design ->DBMS ->Operating System GATE DA&AI When someone says data structure books, students usually imagine endless trees, confusing pointers, and stacks that feel taller than a hostel water tank. But don’t worry—data structures aren’t as scary as they look. With the right book, you can actually enjoy the subject (yes, really). I’ve been through these books myself—sometimes just to pass exams, other times to prepare for GATE and NET, and once even to impress […]
- [Test](https://compgeek.co.in/test/): Loading…
- [Design and Analysis of Algorithms Book](https://compgeek.co.in/design-and-analysis-of-algorithm-books/): Algorithm Books Algorithm Notes Next Menu COMPUTER SCIENCE ————————————- ->Algorithm ->Computer Network ->Data Structure ->Digital Circuits & Design ->Computer Orgn. & Arch. ->Theory of Computation ->Compiler Design ->DBMS ->Operating System GATE DA&AI When someone says design and analysis of algorithms book, most students imagine a monster-sized book that can double up as a pillow in the library. And yes—you’re not wrong. But the truth is, once you know where to start, algorithms aren’t as scary as they look. I’ve read T. H. Cormen three times—yes, cover to cover—and I can tell you it still feels like wrestling with Shakespeare written […]
- [Design & Analysis of Algorithm Study Material](https://compgeek.co.in/design-and-analysis-of-algorithm-study-material/): Design & Analysis of Algorithm Study Material Books Notes in English Notes in Hindi Assignments Previous Year Papers Subjective Questions (Like Quantum, Aakash) MCQs GATE NET
- [Objective Type Questions (MCQs)](https://compgeek.co.in/objective-type-questions-mcqs/): Objective-Type Questions (MCQs)
- [Motivate Yourself](https://compgeek.co.in/motivate-yourself/): This page and you are under construction. I will work on both ♥
- [Terms & Conditions](https://compgeek.co.in/terms-conditions/): Terms & Conditions PREV NEXT Menu About Us About Me Privacy Policy Terms & Conditions Contact Welcome to Computer Geek These terms of service outline the rules and regulations for the use of Computer Geek’s Website. Computer Geek is located at: Vishwas Nagar Delhi110032 – East delhi , India By accessing this website we assume you accept these terms of service in full. Do not continue to use Computer Geek’s website if you do not accept all of the terms of service stated on this page. The following terminology applies to these Terms of Service, Privacy Statement and Disclaimer Notice […]
- [About Me](https://compgeek.co.in/about-me/): Professor Tarun Aggarwal About Me PREV NEXT Menu About Us About Me Privacy Policy Terms & Conditions Contact Tarun Agarwal is an accomplished educator, researcher, and content creator in the field of Computer Science and Engineering. He is the Founder of Computer Geek (compgeek.co.in), an educational platform that provides simple and high-quality resources on subjects like Design and Analysis of Algorithms, Data Science, Artificial Intelligence, Theory of Computation, Operating Systems, DBMS and many more. Tarun has strong skills in programming and problem-solving, with expertise in languages such as C, C++, Python, and Java, which he also uses to create algorithm-based […]
- [Privacy Policy](https://compgeek.co.in/privacy-policy/): Privacy Policy PREV NEXT Menu About Us About Me Privacy Policy Terms & Conditions Contact Effective Date: 13-07-2022 Your privacy is important to us Computer Geek is located at: Computer GeekVishwas Nagar Delhi110032 East delhi , India It is Computer Geek’s policy to respect your privacy regarding any information we may collect while operating our website. This Privacy Policy applies to www.compgeek.co.in (hereinafter, “us”, “we”, or “www.compgeek.co.in”). We respect your privacy and are committed to protecting personally identifiable information you may provide us through the Website. We have adopted this privacy policy (“Privacy Policy”) to explain what information may be collected on […]
- [Contact](https://compgeek.co.in/contact/): Contact Us PREV NEXT Menu About Us About Me Privacy Policy Terms & Conditions Contact Keep in Touch Facebook Youtube Quora Linkedin Instagram If you have any suggestions, questions, or maybe you find the wrong question, answer, or anything else, contact us on this email. We will be happy to see your comments. admin@compgeek.co.in Have Questions, Suggestions, or Comments? PREV NEXT
- [About Us](https://compgeek.co.in/about-us-2/): About Us PREV NEXT Menu About Us About Me Privacy Policy Terms & Conditions Contact The primary goal of starting this website, “Computer Geek,” is to improve education for all students who are not receiving it for any reason, whether it be because they live far from prestigious universities, lack the time to attend classes with knowledgeable teachers, or lack the necessary funds. As all books are written in English, language is a barrier to learning for many students because it might be difficult to understand what is being said. In Japan, China, the United States, and Britain, they use […]
- [Computer Geek](https://compgeek.co.in/): Simple and to-the-point education opens up the mind. Computer Science Notes (Hindi + English) Subjective Questions Objective Questions (MCQs) Previous Year Papers GATE (General Aptitude Test) NET (National Entrance Test) Questions Tricky Questions are all available. Quizess are also available – Click here Top Categories Standard Books Foreign & Indian Author books related to syllabus University Exams PYPs, Assignments, Semester Exams, Mock Tests CSE Notes English MCQs ISRO, KVS, NVS, DSSSB, NIELIT, UPPCL, AE, AAI, DMRC & More CSE Notes Hindi GATE Computer Science,Data Science & Artificial Intelligence Test Series If you want to be Rich & Smart, Then Practice Hard […]


[comment]: # (Generated by Hostinger Tools Plugin)