computer science notes, Summaries of Computer Science

computer science notes of nust

Typology: Summaries

2024/2025

Available from 06/30/2026

saad-53
saad-53 🇵🇰

4 documents

1 / 45

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d

Partial preview of the text

Download computer science notes and more Summaries Computer Science in PDF only on Docsity!

COMPUTER SCIENCE STUDY NOTEBOOK for NUST University 111d O1o1o] Reop heareing, heep building! COMPUTER SCIENCE « CS ja the ainmdy oF coerpuhatice, problem, sohing + Computer Syeten = Hardeare + Soefture + Dote + Peapic - Cheracteristes ~ Sapaaad ~ Adcuracy ~ Aitoeract wae - Storage - Where lls bag = 27 HUMBER 2 TateM> & 4 CONVERSIONS Common Betey: 2, 8, 10, 16 » Binary (bare 2): 0,1 + Octal Chete S&S): O-7 + Deciesal (hee EO}: O-4 = Heendecinal (Chane Ib): 0-9, A-F Cearition Facmple - C25 ).. Faia 25 | Le gee rs ee de 3 i 4 BOOLEAN ALGEBRA « Becloon woluca: © (Fotsc), | {Trac} = Beesic Lewes: i. A. O = A Ast=A Z. A» { = A Aa:-2 =06 3% At A © A AcA= A a. At Ae Ll a- A @ O « De Mergan’s Lina 1 fA») = A. oe : ee oe A= MOT A| 6. DIGITAL CIRCUITS " Digthal carewits operate on discrete veloes (0 or 1), ® Ballt using loqec gates, Hal? Aaddler A |xoo Sue B AND Carey Full Adder = 2 HalF Adders + 1 OR gabe 7. CPU ARCHITECTURE 8 CPU = Costrel Unit + ALY + Ragislern. | haiastors | Fetch <= Decode == Esacute —= Store 9. OPERATING SYSTEMS * 08 oan ievterfece between: user anal Iherd.sare «= Responsbalities | - Preceat Management ~ Memory Management = Fil Ploraaemcrt ~ Dewee Monogement — Security Examples: Windows, Linus, macs, Fired ras 1. PROCESSES 3 THREADS i 2. CPU SCHEDULING aLGoriTHms | « PCFS (Ferst Come First Serve) : SIF (Shortest Job Ferat) + Priecity Scheduleng = Routd Robin OTiewe hina} * Multilewel Ghose AR Exomple (q = ime) Pineeates ° Bits) 8 6PefS). Patt) | Gantt Chart: Oo) Pi | Pz | PS | Pe PPS | Pe PS o 68 + ¢ 8S KH WF & 1k. DATA STRUCTURES OVERVIEW + DS ergornice ond dtere dota for officiant ooces., Type: = (lone: Array, LenBed Lest, Steck. lenin * Man-linene! Troe, Graph. 4 1S. STACKS & QUEUES 6 Stack {LIFO Pusht} Pap) Queue (FIFO) nial Maar | [we] ao] a0 | li. TREES 7 voON 8) é iy . D OE i Tepes Frall, Complete, Perfect , Bolonced, BST Inecder (LAR), Preetder (MLA), Posterder (CLIN) IR, ALGORITHMS & Compiexity = |? * Algeecthes; Shap-by-etep sehetinen, * Analyee tiny Tine Eo Space. Common Coonplesitian : on) Consbacit — Ofleq ) Lagerithmrie Ole) Linear Ofna tog at Linnarithesic Ata") Gund ratic oOf2*4 Enponeetial Fad 4. OOF CONCEPTS » Close & eject Encapaulatiors » Abobroctlion lekeritance 20